Courses / Computer Science XI (HSSC-I) – FBISE Complete SLO-Based Course
Unit 2 Review, SLO Checklist and Unit Test
Unit 2 – Computational Thinking and Algorithms · 45 min read · 15 MCQs to check yourself
Unit 2: Computational Thinking and Algorithms – review
This unit carries about 10% of the marks in the FBISE model paper (Table of Specifications).
SLO checklist – tick each one you can do
| SLO | Students should be able to… | Lesson(s) |
|---|---|---|
| CS-11-B-01 | Plan, develop, test and refine computational artifacts such as pseudocode and flowcharts | 2.1 |
| CS-11-B-02 | Apply common search and sort algorithms | 2.2, 2.3 |
Unit test
CS XI Unit 2 Test – Computational Thinking and Algorithms – 12 MCQs online (15 min). Full paper:
| Section | Questions | Marks |
|---|---|---|
| A – MCQs (online here) | 12 × 1 | 12 |
| B – Short questions | 4 × 3 | 12 |
| C – Long questions | 1 × 6 | 6 |
| Total | 30 |
Practise these before the test
Long questions
- Explain how an algorithm is systematically tested and refined. Trace the "sum of even numbers 2 to N" algorithm for N = 7 and N = 1 and comment on its correctness.
- Sort the following numbers in ascending order using the bubble sort algorithm, showing every pass: 10, 9, 26, 4, 1, 8, 37, 5
- Explain binary search with an algorithm/Python code and a worked example. Why is it more efficient than linear search and when can it not be used?
Short questions
- Given the following pseudocode, modify it to print the product of odd numbers from 1 to 30.
- What is an algorithm? Write any four characteristics of a good algorithm.
- Draw flowchart symbols for terminal, process, input/output and decision, and state their use.
- Trace the following algorithm for N = 5 and give the output: sum ← 0, i ← 1; WHILE i <= N: sum ← sum + i*i, i ← i + 2; OUTPUT sum.
- What is meant by evaluating an algorithm for efficiency, correctness and clarity?
- Categorise the scenarios by identifying whether linear or binary search is the more appropriate choice, with a reason: (a) bounded data ranges (b) small data sets (c) large, sorted data sets.
- Differentiate between linear search and binary search.
- Show the steps of binary search to find 38 in [3, 8, 12, 17, 23, 31, 38, 45, 52, 60].
Model answers are listed under each lesson of this unit. The quiz below mixes questions from the whole unit.
This lesson ends with a quiz of 15 MCQs. Open the lesson on PrepOasis to take it and save your progress.
Previous: 2.3 Sorting Algorithms: Bubble Sort and Insertion Sort · Next: 3.1 Why Programming Matters: Programs, IPO and Real-World Solutions
All lessons in Computer Science XI (HSSC-I) – FBISE Complete SLO-Based Course