Ontario Grade 11 Introduction to Computer Science (ICS3U) curriculum and lessons

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

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

53 of 57 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.

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

A program often needs to remember information while it works. It can give that information a name, such as temperature or…

A strategy is a plan for approaching a task. When a task changes, the most useful plan may change too. Organizing several event jobs…

A computer component is a part inside the computer that helps it work. Matching components to user needs means starting with the…

Computing has effects beyond what appears on a screen. Devices require materials and energy; their use can affect people’s comfort…

Computers store information as patterns of bits, each with a value of 0 or 1. A pattern can be read as a number, or interpreted as…

A problem is a situation that needs a solution. In computer science, that might mean figuring out why a program gives an unexpected…

A computer listing may advertise a processor with a stated clock speed, a certain amount of memory, and a particular storage…

Computing has benefits, but making, using, and disposing of devices can also have impacts. A laptop, for example, requires materials…

Represent data, write control flow and subprograms, and maintain correct code.

• A1.1 · Use variables and constants with appropriate data types (published written lesson)
• A1.2 · Explain binary, hexadecimal, and character encoding (published written lesson)
• A1.3 · Use arithmetic and string assignment statements (published written lesson)
• A1.4 · Use Boolean, comparison, and arithmetic operators correctly (published written lesson)
• A1.5 · Explain one-dimensional arrays, indexes, and bounds (published written lesson)
• A1.6 · Create and update one-dimensional arrays in a program (published written lesson)
• A2.1 · Write a program with input, processing, and output (published written lesson)
• A2.2 · Use sequence, selection, and repetition (published written lesson)
• A2.3 · Use nested structures for totals, extrema, and search (written lesson not published)
• A3.1 · Use existing subprograms appropriately (published written lesson)
• A3.2 · Write subprograms with parameters and appropriate scope (published written lesson)
• A4.1 · Find and correct syntax, logic, and run-time errors (published written lesson)
• A4.2 · Use clear names, indentation, and comments (published written lesson)
• A4.3 · Interpret programming-tool error messages (published written lesson)
• A4.4 · Trace program state to find errors (published written lesson)
• A4.5 · Validate a program with varied test cases (published written lesson)

Plan, diagram, test, and communicate software solutions.

• B1.1 · Choose problem-solving strategies for different tasks (published written lesson)
• B1.2 · Solve problems alone and in a team (published written lesson)
• B1.3 · Plan a solution using an input–process–output model (published written lesson)
• B2.1 · Adapt a program template to a specification (published written lesson)
• B2.2 · Explain alternative designs in words and diagrams (written lesson not published)
• B2.3 · Design reusable program parts (published written lesson)
• B2.4 · Model program structure with flowcharts and pseudocode (written lesson not published)
• B2.5 · Design a usable software interface (published written lesson)
• B3.1 · Design simple array algorithms to a specification (published written lesson)
• B3.2 · Apply mathematical formulas in algorithms (published written lesson)
• B3.3 · Plan for invalid input and exceptional cases (written lesson not published)
• B4.1 · Describe development phases, milestones, and products (published written lesson)
• B4.2 · Clarify a program specification with stakeholders (published written lesson)
• B4.3 · Show project tasks and milestones (published written lesson)
• B4.4 · Compare expected and actual results in a test plan (published written lesson)
• B4.5 · Debug using traces and variable-state output (published written lesson)
• B4.6 · Communicate project status clearly (published written lesson)

Match hardware to needs, protect files, and understand development tools.

• C1.1 · Match internal computer components to user needs (published written lesson)
• C1.2 · Interpret processor, memory, and storage specifications (published written lesson)
• C1.3 · Select peripherals for a user task (published written lesson)
• C1.4 · Relate programming operations to hardware components (published written lesson)
• C2.1 · Organize programs and files logically (published written lesson)
• C2.2 · Plan protection against malware and data loss (published written lesson)
• C2.3 · Back up and archive user files (published written lesson)
• C3.1 · Identify the parts of a development environment (published written lesson)
• C3.2 · Use documentation to build a working program (published written lesson)
• C3.3 · Distinguish source code from machine code (published written lesson)
• C3.4 · Compare an interpreter and a compiler (published written lesson)
• C3.5 · Distinguish applications, languages, and operating systems (published written lesson)

Consider sustainability, emerging research, and study and career paths.

• D1.1 · Describe environmental and health impacts of computing (published written lesson)
• D1.2 · Identify practices that reduce computing impacts (published written lesson)
• D1.3 · Explain how computing can support conservation (published written lesson)
• D1.4 · Find community resources for responsible computer use (published written lesson)
• D2.1 · Explain an emerging computer science research area (published written lesson)
• D2.2 · Connect computer science with another discipline (published written lesson)
• D2.3 · Report on computer science research accurately (published written lesson)
• D3.1 · Research computer science careers and trends (published written lesson)
• D3.2 · Find experiential learning opportunities (published written lesson)
• D3.3 · Compare postsecondary computing programs (published written lesson)
• D3.4 · Identify support for non-traditional computing pathways (published written lesson)
• D3.5 · Describe work habits used in computer studies (published written lesson)

For scores = [4, 7, 2], what are scores[1] and the total?

Worked method: Using Python’s zero-based indexes, scores[1] is 7 and 4 + 7 + 2 = 13. A labelled index row makes the access visible.

If score is 8, what does “if score >= 10: pass; else: practise” choose?

Worked method: Eight is below ten, so the false branch leads to “practise”. A flowchart must label both branch outcomes.

For items = [9, 3, 5], what is items[0] in Python?

Name one input and one output for a program that computes a rectangle’s area.