Courses / Computer Science XI (HSSC-I) – FBISE Complete SLO-Based Course
Pre-Board Examination (Full Syllabus) – Revision Guide
Exams – Monthly Tests, Mid-Term, Send-up, Pre-Board and Final · 90 min read · 30 MCQs to check yourself
Pre-Board Examination (Full Syllabus) – revision guide
Online MCQ section: CS XI Pre-Board Examination (Full Syllabus) – 17 MCQs, 25 minutes.
Paper pattern
| Section | Questions | Marks | Time |
|---|---|---|---|
| A – MCQs (compulsory, online here) | 17 × 1 | 17 | 25 min |
| B – Short questions | 13 × 3 (each with an OR choice) | 39 | 2 h 35 min for B + C |
| C – Long questions | 4 × 6 (each with an OR choice) | 24 | |
| Total (theory) | 80 | 3 hours |
Syllabus covered
| Unit | Title | SLOs |
|---|---|---|
| 1 | Computer Systems | CS-11-A-01, CS-11-A-02, CS-11-A-03, CS-11-A-04 |
| 2 | Computational Thinking and Algorithms | CS-11-B-01, CS-11-B-02 |
| 3 | Programming Fundamentals | CS-11-C-01, CS-11-C-02, CS-11-C-03, CS-11-C-04, CS-11-C-05, CS-11-C-06, CS-11-C-07 |
| 4 | Data and Analysis | CS-11-D-01, CS-11-D-02, CS-11-D-03 |
| 5 | Application of Computer Science | CS-11-E-01, CS-11-E-02 |
| 6 | Impacts of Computing | CS-11-F-01, CS-11-F-02 |
| 7 | Digital Literacy | CS-11-G-01 |
| 8 | Entrepreneurship in the Digital Age | EN-11-H-01 |
Practise these long questions (not in this paper – good for revision)
- (Unit 1) What is encryption? Compare symmetric and asymmetric encryption with respect to efficiency, security, ease of implementation, key length and large data handling. (1 + 5)
- (Unit 3) Write a Python program that inputs the marks of a student out of 100 and prints the grade (A+ ≥ 80, A ≥ 70, B ≥ 60, C ≥ 50, F otherwise). The program should reject invalid marks and keep asking until valid marks are entered. Explain the control structures used.
- (Unit 4) What are data collection methods? Contrast any two data collection methods with respect to strength, weakness, reliability, cost and validity. (1 + 5)
- (Unit 1) Compare the Waterfall and Agile models. Which would you choose for developing a mobile app for an online shop and why?
- (Unit 3) Write a Python turtle program that draws a compound shape (a house with a square base, triangular roof and a door). Explain the turtle and screen methods used.
- (Unit 1) Simplify the Boolean function F using a Karnaugh map and construct a logic circuit for the simplified expression: F = A'B'C' + A'BC' + AB'C' + AB'C + ABC' + ABC (3 + 3)
- (Unit 1) Explain the phases of the SDLC with the main activities and output of each phase. Relate each phase to a case study of a "College Library Management System".
- (Unit 2) 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?
- (Unit 2) 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.
- (Unit 1) Simplify F = A'B + AB + AB' using Boolean algebra and a K-map, and draw both the original and simplified circuits.
Exam technique
- Attempt Section A in the first 25 minutes; read every option before choosing.
- In Sections B and C choose the OR part you know best, but attempt every question.
- Draw diagrams and tables: truth tables, K-maps, circuits, topologies, flowcharts, SDLC, comparison tables.
- For programs: correct indentation, meaningful variable names, show the expected output.
- For calculations (availability, statistics, regression, sorting passes) show every step.
- Match marks to length: 3-mark answers ≈ 3 points; 6-mark answers = definition + explanation + example/diagram.
This lesson ends with a quiz of 30 MCQs. Open the lesson on PrepOasis to take it and save your progress.
Previous: Send-up Examination (Full Syllabus) – Revision Guide · Next: Final Examination – FBISE Model Paper Pattern and Last-Minute Revision
All lessons in Computer Science XI (HSSC-I) – FBISE Complete SLO-Based Course