← Back to questions

Source capture index

49 question slots · 58 question-only PNGs. Native text and worked practice answers are in the review site. Best Row is reconstructed from the recorded starter contracts. Missing source content remains labelled.

Download screenshots ↓   Download index ↓

ICP · Assignment Test 2 2026-10-19

QuestionSource coverageScreenshots / recording timestamp
01. Replace an ElementCapturedPart 1 · 00:34:38
Part 2 · 00:35:04
Part 3 · 00:35:12
Part 4 · 00:39:06
02. Best RowReconstructedPart 1 · 00:12:08
03. Triple-Step SequenceCapturedPart 1 · 00:42:20
Part 2 · 00:42:28
Part 3 · 00:43:36
Part 4 · 00:46:50
04. Wave Print (Column Wise)CapturedPart 1 · 00:47:32
Part 2 · 00:47:48
Part 3 · 00:51:00

ICP · End Term 2026-10-19

QuestionSource coverageScreenshots / recording timestamp
01. MCQ-1A
The options are visible, but the question stem is blank in the recording.
PartialPart 1 · 01:24:08
02. MCQ-2A
The options are visible, but the question stem is blank in the recording.
PartialPart 1 · 01:24:58
03. MCQ-3A
The options are visible, but the question stem/code is blank in the recording.
PartialPart 1 · 01:25:06
04. FillUp-1A
Only the title and an answer field are recorded. The question text is blank.
UnavailablePart 1 · 02:35:56
05. FillUp-2A
Only the title and an answer field are recorded. The question text is blank.
UnavailablePart 1 · 02:40:14
06. Count Negative Entries
Only the title is visible in the question panel. The programming editor is excluded.
UnavailablePart 1 · 01:25:22
07. First Decimal Digit Sum
Only the title is visible in the question panel. The programming editor is excluded.
UnavailablePart 1 · 01:29:58
08. DNA Sequence Mutation Audit
Only the title is visible in the question panel. The programming editor is excluded.
UnavailablePart 1 · 01:33:00
09. Hollow Triangle Pattern
Only the title is visible in the question panel. The programming editor is excluded.
UnavailablePart 1 · 01:46:54
10. Password Audit
Only the title is visible in the question panel. The programming editor is excluded.
UnavailablePart 1 · 01:56:04

Maths for Programming · Assignment Test 2 2026-10-20

QuestionSource coverageScreenshots / recording timestamp
01. Mathematical Induction – 1CapturedPart 1 · 00:12:14
02. Recursive Trees – 2CapturedPart 1 · 00:12:32
03. CS Applications Q1CapturedPart 1 · 00:13:12
04. Path Counting Q1CapturedPart 1 · 00:13:38
05. Graph Theory I – Representations (Adjacency List and Matrix) – Q2CapturedPart 1 · 00:13:46
06. Graph Theory II – DFS – Q1CapturedPart 1 · 00:14:36
07. Graph Algorithms – Shortest Path Problem – Q2CapturedPart 1 · 00:14:44
08. Inclusion-Exclusion and Counting – Positive Integer Solutions – Q2CapturedPart 1 · 00:14:52
09. BFS Q4 – MCQCapturedPart 1 · 00:15:02
10. Big-O Notation Q1 – IntegerCapturedPart 1 · 00:24:28

Maths for Programming · End Term 2026-10-20

QuestionSource coverageScreenshots / recording timestamp
01. Two set inclusion exclusionCapturedPart 1 · 00:42:10
02. Negative moduloCapturedPart 1 · 00:42:36
03. Tree depth and heightCapturedPart 1 · 00:42:52
04. Elementary permutationsCapturedPart 1 · 00:43:26
05. Number representations and arithmeticCapturedPart 1 · 00:44:00
06. Logical equivalenceCapturedPart 1 · 00:44:58
07. Graph types and directed degreeCapturedPart 1 · 00:45:40
08. Exact counts and growth classesCapturedPart 1 · 00:46:20
09. Modulo addition subtraction and multiplicationCapturedPart 1 · 00:47:02
10. Recursion and repeated callsCapturedPart 1 · 00:47:44
11. Three set inclusion exclusionCapturedPart 1 · 00:49:56
12. Strong pigeonhole principleCapturedPart 1 · 00:52:26
13. Binary subtraction and complementsCapturedPart 1 · 00:53:58
14. Sets and multiset codeCapturedPart 1 · 00:57:00
15. BFS and ordered adjacency listsCapturedPart 1 · 00:59:48
16. Components and adjacency matricesCapturedPart 1 · 01:00:38
17. Dijkstra and PrimCapturedPart 1 · 01:02:00
18. Loop complexity and asymptotic notationCapturedPart 1 · 01:05:46
19. Restricted committee selectionCapturedPart 1 · 01:08:24
20. Stars and bars with two upper boundsCapturedPart 1 · 01:12:58
21. BFS DFS and tree path countingCapturedPart 1 · 01:15:12
22. Signed overflow through two operationsCapturedPart 1 · 01:25:20
23. Strong induction and proof validityCapturedPart 1 · 01:36:52
24. Dijkstra with a negative edgeCapturedPart 1 · 01:41:28
25. AP GP and harmonic loop countsCapturedPart 1 · 01:49:14
Part 2 · 01:51:18