Ontario Grade 12 Computer Science (ICS4U) curriculum and lessons

The course map includes Programming Concepts and Skills, Software Development, Designing Modular Programs, and 1 other section. Follow the complete section list above for the full study path.

درس علوم رایانه پایه دوازدهم انتاریو (ICS4U) چه مباحثی دارد؟ از جمله مباحث این درس مفاهیم و مهارت‌های برنامه‌نویسی، توسعه نرم‌افزار، طراحی برنامه‌های پیمانه‌ای است. فهرست کامل بخش‌ها در بالای صفحه قرار دارد.

23 of 47 written lessons are currently published and free to read. Open a linked lesson in the section map above. Check the official Ontario curriculum for exact requirements.

درس‌ها و برنامهٔ درسی علوم رایانه پایه دوازدهم انتاریو را از کجا پیدا کنم؟ اکنون 23 درس از 47 درس نوشتاری منتشر شده و خواندن آن‌ها رایگان است. درس‌های دارای پیوند را در نقشهٔ بخش‌های بالا باز کنید. برای شرایط دقیق به برنامهٔ درسی رسمی انتاریو مراجعه کنید.

Trace searches, sorts, recursion and two-dimensional arrays; check preconditions and expected outputs.

Plan reusable classes and modules, then compare algorithm work with explicit example counts.

Define scope, milestones, tests, version control and a clear handoff.

Evaluate ethics, environmental stewardship, emerging technology and career paths using evidence.

This lesson focuses only on integer division and remainders. You have likely already divided whole numbers and worked with Python…

Before a team begins building software, it needs a shared picture of what it intends to complete and how it will organize the work.…

A program treats text, whole numbers, decimal numbers and true-or-false values differently. For example, adding two numbers finds a…

In ICS3U, you have experience creating programs and dividing a larger task into manageable steps. This lesson focuses on coordinating…

In ICS3U, you may have compared numbers with operators such as less than and equal to. A program can also compare non-numeric data…

In ICS3U, you practised writing and tracing programs. In this lesson, you connect those skills to the work of making a product ready…

Computers store information using patterns of bits, each of which has one of two values: 0 or 1. Because a computer value uses a…

A project plan is useful only if the team checks it as work proceeds. In ICS3U, you may have divided a programming project into…

Use data types, modules, algorithms, tests and documentation.

• A1.1 · Use integer division and remainders (published written lesson)
• A1.2 · Convert data types explicitly and safely (published written lesson)
• A1.3 · Compare non-numeric data (published written lesson)
• A1.4 · Explain finite precision and representation limits (published written lesson)
• A1.5 · Use one-dimensional arrays of compound data (published written lesson)
• A2.1 · Organize a modular program across files (published written lesson)
• A2.2 · Apply encapsulation, inheritance and polymorphism (written lesson not published)
• A2.3 · Extend an existing program module (published written lesson)
• A3.1 · Read and write an external file (published written lesson)
• A3.2 · Write linear and binary search (published written lesson)
• A3.3 · Insert and delete array elements (published written lesson)
• A3.4 · Write an array sorting algorithm (published written lesson)
• A3.5 · Process a two-dimensional array (published written lesson)
• A3.6 · Design a terminating recursive algorithm (published written lesson)
• A4.1 · Use support documentation to resolve syntax issues (written lesson not published)
• A4.2 · Build a formal software test plan (written lesson not published)
• A4.3 · Document program code to a clear standard (written lesson not published)
• A4.4 · Write maintainable user documentation (published written lesson)

Plan, deliver and review a team software project.

• B1.1 · Define scope, tasks, deliverables and schedule (published written lesson)
• B1.2 · Develop a product against its project plan (published written lesson)
• B1.3 · Code, test, deploy and document a product (published written lesson)
• B1.4 · Track a project with a schedule or Gantt chart (published written lesson)
• B1.5 · Confirm requirements and plan ongoing support (published written lesson)
• B1.6 · Compare planned and actual project progress (published written lesson)
• B1.7 · Manage shared source code and versions safely (published written lesson)
• B2.1 · Contribute to a team software project (written lesson not published)
• B2.2 · Manage personal work to meet team deadlines (published written lesson)
• B2.3 · Reflect on individual and team progress (published written lesson)

Decompose software and analyse algorithm efficiency.

• C1.1 · Model modules, classes and abstract data types (written lesson not published)
• C1.2 · Use encapsulation in program design (written lesson not published)
• C1.3 · Decompose a task into subprograms (written lesson not published)
• C1.4 · Design reusable modules and methods (written lesson not published)
• C2.1 · State algorithm preconditions and postconditions (written lesson not published)
• C2.2 · Compare linear and binary search costs (written lesson not published)
• C2.3 · Compare sorting algorithm costs (written lesson not published)
• C2.4 · Recognize non-termination and repeated recursive work (written lesson not published)

Assess sustainability, ethics, emerging technologies and careers.

• D1.1 · Assess ways to reduce computing impacts (written lesson not published)
• D1.2 · Investigate sustainability initiatives (written lesson not published)
• D2.1 · Analyse an ethical computing issue (written lesson not published)
• D2.2 · Explain why programmers need a code of ethics (written lesson not published)
• D2.3 · Promote ethical computing practices (written lesson not published)
• D3.1 · Explain impacts of emerging technology (written lesson not published)
• D3.2 · Research an emerging technology (written lesson not published)
• D4.1 · Report on interdisciplinary computer-science research (written lesson not published)
• D4.2 · Investigate a theoretical computer-science topic (written lesson not published)
• D4.3 · Research computer-science careers and education (written lesson not published)
• D4.4 · Evaluate computing skills and work habits (written lesson not published)

Find 23 in the sorted list [3, 8, 12, 17, 23, 31, 42, 56]. How do linear and binary search differ?

Worked method: Linear search checks 3, 8, 12, 17 and 23: five comparisons. Binary search checks middle values 17, 31 and 23: three comparisons. Binary search requires sorted input.

Trace factorial(3) when factorial(0) = 1 and factorial(n) = n × factorial(n − 1).

Worked method: The calls are factorial(3), factorial(2), factorial(1), factorial(0); the base case returns 1, then the calls return 1, 2 and 6.

What condition must hold before binary search?

What stops factorial recursion?