Course information
DP1 · 2026–27

Schedule & homework

The teaching sequence, week by week. School dates follow the published CISK calendar; future lessons and assessment dates are proposals.

Course plan updated 6 Oct 2026. Last recorded teaching progress: 22 Sept 2026. Activities are listed in teaching order rather than assigned to specific weekdays. A normal week has five 55-minute lessons; shortened weeks depend on the actual timetable. Assigned homework and its due dates are listed below.

Homework instructions ↓Open lesson libraryDownload school calendar (.ics)School dates for the full year ↓
Current preparation

Study for Friday’s summative

Friday, October 16, 2026 · 08:30–10:20 China time

Review your class notes and completed practice. Use the existing lessons, algorithms handout, and practice resources to revisit questions you found difficult.

This is a study reminder. No new upload is required.

Practice & resources →Review class lessons →Algorithms handout (PDF)

Semester 1 agenda

Week 01
17 Aug 2026Course launch & computational thinking3 school days available · First day of the academic yearRecorded

Opening partial week begins Wednesday 19 August.

Learning sequence

  1. Course introduction and diagnostic.
  2. Python setup, variables and input/output.
  3. Decompose a school equipment-loan problem.

Practice

Small input/output programs; explain the inputs, decisions and outputs of a familiar system.

Unit goals & materials →
Week 02
24 Aug 2026Selection, flowcharts & tracing5 school days availableRecorded

Flowcharts and trace tables added to the teaching sequence on 28 August.

Learning sequence

  1. Variables, comparisons and Boolean expressions.
  2. Selection and validation in Python.
  3. Flowchart symbols and decision paths.
  4. Trace tables and boundary cases.

Practice

Practise decision systems and trace code before running it.

Unit goals & materials →
Week 03
31 Aug 2026Strings, iteration & functions5 school days availableRecorded

Topics covered during this part of the course; the weekly grouping is approximate.

Learning sequence

  1. String indexing, slicing and input cleaning.
  2. Iteration over strings and collections.
  3. Functions, parameters and return values.
  4. Exception handling and debugging.

Practice

Short Python tasks; trace changing state and explain each correction.

Unit goals & materials →
Week 04
7 Sept 2026Data structures & programming review5 school days availableRecorded

B1 through B2.2.4 covered, including stacks and queues, before starting B2.4.

Learning sequence

  1. Lists and traversal.
  2. Stack operations and LIFO.
  3. Queue operations and FIFO.
  4. Programming review using functions, validation and tests.

Practice

Use the stacks and queues handout to review operations, trace state and justify structure choices.

Unit goals & materials →
Week 05
14 Sept 2026Linear search → Big O → binary search5 school days availableIn progress

As of 17 September: linear search and Big O are covered. Read pages 358–361 before the next lesson on binary search.

Learning sequence

  1. Retrieve stack and queue behaviour.
  2. Design, trace and implement linear search.
  3. Completed 17 September: Big O notation using the class handout.
  4. Next lesson: binary search; trace low, mid and high.
  5. Compare algorithms using successful, absent and boundary targets.
17 Sept 2026 · Big O notation Covered
Read pages 358–361: Big O notation

Due 18 Sept 2026 · 4 pages · Assigned

Practice

Big O review reading: pages 358–361, due 18 September. Weekend homework for Monday 21 September: complete handout Problems 1 and 2 and read the binary-search section on pages 363–365.

Unit goals & materials →
Week 06
21 Sept 2026Search consolidation before the break3 school days available · Parent Open Day / Mid-Autumn FestivalProposed

Short school week: Parent Open Day on Wednesday; no classes from Thursday.

Learning sequence

  1. Complete binary-search implementation and tests.
  2. Compare linear and binary search; explain the sorted-data prerequisite.
  3. Short retrieval check; review misconceptions before the holiday.
Weekend homework: Problems 1 and 2 + reading

Due 21 Sept 2026 · Problems 1 and 2 + reading · Assigned

Practice

Holiday homework: finish questions 3–7 of the B2.4 Algorithms student handout. Questions 1 and 2 are already complete. Due Monday 12 October.

Unit goals & materials →
Week 07
28 Sept 2026National Day holiday0 school days available · National Day holidaySchool break

No classes all week.

Practice

Holiday homework: finish any unfinished parts of questions 3–7 in the B2.4 Algorithms student handout. Due Monday 12 October, one week after the first class back.

Week 08
5 Oct 2026Sorting: bubble & selection5 school days availableCurrent plan

Current plan: practise sorting after the break. The assigned homework covers bubble sort only; selection-sort activities are available for comparison. This plan does not record lessons as completed.

Learning sequence

  1. Retrieve search algorithms after the break.
  2. Trace bubble sort by pass.
  3. Implement bubble sort and test an already sorted list.
  4. Trace and implement selection sort.
  5. Compare swaps, comparisons and stopping conditions.
Bubble sort: Q9(a) and the bubble-sort part of Q10

Due 7 Oct 2026 · Q9(a) + Q10 (bubble sort only) · Assigned

Practice

Assigned: Q9(a) and the bubble-sort part of Q10, due 7 October. Record passes, comparisons and swaps. Holiday questions 3–7 remain due 12 October.

Unit goals & materials →
Week 09
12 Oct 2026Sorting, efficiency & explanation5 school days availableProposed

Check understanding through an individual explanation, not speed alone.

Learning sequence

  1. Consolidate bubble and selection sort.
  2. Optional extension: trace and implement insertion sort.
  3. Compare O(1), O(log n), O(n) and O(n²) growth.
  4. Distinguish time from auxiliary space (extra working memory, excluding the supplied input); state whether input memory is included.
  5. Explain algorithm choice for a concrete problem.
Holiday homework: finish questions 3–7

Due 12 Oct 2026 · Questions 3–7 · Assigned

Practice

Count comparisons and justify a suitable algorithm; use small test datasets.

Unit goals & materials →
Week 10
19 Oct 2026Programming checkpoint & feedback5 school days availableProposed

Proposed checkpoint: 23 October. Confirm assigned timing in Toddle.

Learning sequence

  1. Retrieve loops, functions and data structures.
  2. Practise handwritten searches and sorts.
  3. Review debugging and boundary tests.
  4. Complete the proposed programming checkpoint.
  5. Use errors to set individual practice targets.

Practice

Targeted corrections with a short explanation of the cause and fix.

Unit goals & materials →
Week 11
26 Oct 2026Feedback & data representation4 school days available · Mid-term progress reports / Parent–teacher conferencesProposed

Reports on 28 October; no classes on Friday 30 October (PTC).

Learning sequence

  1. Revisit weak areas from the checkpoint.
  2. Binary place value and conversions.
  3. Hexadecimal and compact representations.
  4. Connect numeric representation to Python values.

Practice

Short conversion practice and one programming retrieval task.

Unit goals & materials →
Week 12
2 Nov 2026Data representation & logic5 school days availableProposed

Check reasoning and working, not just final answers.

Learning sequence

  1. Binary arithmetic and representation limits.
  2. Represent text, images and sound.
  3. Build truth tables.
  4. Translate Boolean expressions into logic circuits.
  5. Explain a representation trade-off.

Practice

Conversions, truth tables and a short written explanation.

Unit goals & materials →
Week 13
9 Nov 2026Logic circuits & computer architecture5 school days availableProposed

Oral explanation of how components cooperate.

Learning sequence

  1. Combine logic gates.
  2. Trace a circuit from input to output.
  3. Introduce CPU components and registers.
  4. Model the fetch–decode–execute cycle.
  5. Maintain Python fluency with an algorithm task.

Practice

Label and explain a CPU-cycle diagram; trace one Boolean expression.

Unit goals & materials →
Week 14
16 Nov 2026Memory, storage & performance5 school days availableProposed

Short theory check plus an independent programming task.

Learning sequence

  1. Compare memory types.
  2. Explain cache and the memory hierarchy.
  3. Compare storage technologies.
  4. Examine factors affecting CPU performance.
  5. Apply concepts to system-selection scenarios.

Practice

Scenario questions with justified choices and explicit trade-offs.

Unit goals & materials →
Week 15
23 Nov 2026Operating systems & system software5 school days availableProposed

Use precise command terms and developed explanations.

Learning sequence

  1. Explain operating-system responsibilities.
  2. Model process scheduling.
  3. Explore memory and resource management.
  4. Compare translation approaches.
  5. Maintain search/sort fluency.

Practice

Explain how an OS manages competing tasks; complete one code trace.

Unit goals & materials →
Week 16
30 Nov 2026Control systems & computing services5 school days availableProposed

Connect technical details to the needs of the scenario.

Learning sequence

  1. Model input, processing, output and feedback.
  2. Investigate a sensor-based control example.
  3. Compare local and cloud computing.
  4. Evaluate system trade-offs.
  5. Complete a mixed theory/programming practice.

Practice

Draw a control-system model and justify one design decision.

Unit goals & materials →
Week 17
7 Dec 2026Files & an integrated Python task5 school days availableProposed

Formative programming task; this is not IA work.

Learning sequence

  1. Read and write text data.
  2. Validate records and handle errors.
  3. Combine functions, lists and search.
  4. Design a test table before implementation.
  5. Explain code and test outcomes independently.

Practice

Build a small record-processing program; include normal, boundary and invalid data.

Unit goals & materials →
Week 18
14 Dec 2026Consolidation before winter break5 school days available · Winter breakProposed

Winter break begins Saturday 19 December.

Learning sequence

  1. Review programming and computer fundamentals.
  2. Complete timed theory questions.
  3. Trace unfamiliar code on paper.
  4. Correct recurring mistakes.
  5. Agree focused revision priorities.

Practice

A compact revision checklist based on individual errors.

Unit goals & materials →
Week 19
21 Dec 2026Winter break0 school days available · Winter breakSchool break

No classes all week.

Practice

No new teaching; optional retrieval from the revision checklist.

Week 20
28 Dec 2026Winter & New Year break0 school days available · Winter break / New Year holidaySchool break

Classes resume Monday 4 January.

Practice

No new teaching.

Week 21
4 Jan 2027Semester 1 assessment window5 school days availableProposed

Proposed assessment target: 8 January. This is not a confirmed school exam date.

Learning sequence

  1. Retrieve key concepts after the break.
  2. Complete proposed programming and theory assessment sittings.
  3. Review solutions and markscheme expectations.
  4. Identify misconceptions requiring follow-up.

Practice

Prepare using the published topic checklist; exact assessment sittings remain to be confirmed.

Unit goals & materials →
Week 22
11 Jan 2027Feedback & bridge to networks5 school days available · Last day of Semester 1Proposed

Semester 1 ends Friday 15 January.

Learning sequence

  1. Review assessment evidence.
  2. Complete targeted corrections.
  3. Consolidate weak programming skills.
  4. Introduce how computers exchange information.
  5. Preview the Semester 2 pathway.

Practice

Individual corrections and one short networking observation task.

Unit goals & materials →

Homework instructions

Assignments are listed by due date, newest first. Previous tasks stay here for reference; check the date before starting.

Semester 2

School dates are listed below. Teaching windows for networks, databases, OOP and introductory machine learning are on the course map; detailed weekly lessons will be set after the Semester 1 review.

CISK school dates

2026–27 · subject to school changes
DateEventClasses
19 Aug 2026First day of the academic yearNo closure indicated
23 Sept 2026Parent Open DayNo closure indicated
24 Sept 2026 – 27 Sept 2026Mid-Autumn FestivalNo classes
28 Sept 2026 – 4 Oct 2026National Day holidayNo classes
28 Oct 2026Mid-term progress reportsNo closure indicated
30 Oct 2026Parent–teacher conferencesNo classes
19 Dec 2026 – 31 Dec 2026Winter breakNo classes
1 Jan 2027 – 3 Jan 2027New Year holidayNo classes
15 Jan 2027Last day of Semester 1No closure indicated
18 Jan 2027Professional developmentNo classes
19 Jan 2027First day of Semester 2No closure indicated
27 Jan 2027Semester 1 reportsNo closure indicated
1 Feb 2027 – 14 Feb 2027Spring Festival breakNo classes
19 Mar 2027Professional developmentNo classes
5 Apr 2027Qingming FestivalNo classes
7 Apr 2027Mid-term progress reportsNo closure indicated
9 Apr 2027Parent–teacher conferencesNo classes
1 May 2027 – 4 May 2027Labour Day holidayNo classes
9 Jun 2027Dragon Boat FestivalNo classes
14 Jun 2027Semester 2 reportsNo closure indicated
17 Jun 2027Last day of the academic yearNo closure indicated

Calendar download contains school events only; proposed teaching checkpoints are excluded. Dates are all-day school-local dates. Importing creates a snapshot, not a live subscription.