Courses / Computer Science XI (HSSC-I) – FBISE Complete SLO-Based Course
Send-up Examination (Full Syllabus) – Revision Guide
Exams – Monthly Tests, Mid-Term, Send-up, Pre-Board and Final · 90 min read · 30 MCQs to check yourself
Send-up Examination (Full Syllabus) – revision guide
Online MCQ section: CS XI Send-up 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 cyber security? Explain any four types of cyber attacks and how to protect against each. Also describe a plan to analyse and prioritise cyber security risks.
- (Unit 4) Explain experimental design in data science. Describe the terms hypothesis, control group, treatment group and random assignment, and design a simple experiment for your college.
- (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 4) Explain linear models, K-means clustering and smoothing with one real-world application of each.
- (Unit 3) Explain different types of errors in Python and the methods used to debug a program, including testing functions, dry runs and breakpoints.
- (Unit 6) What is assistive technology? Describe assistive technologies for people with visual, hearing and physical disabilities and for elderly people, and explain how they improve equal access to information.
- (Unit 4) Explain the steps of analysing a pre-existing data set to communicate findings: collecting, cleaning, summarising and visualising. Use the marks 42, 48, 51, 55, 58, 60, 62, 65, 68, 70, 74, 79, 95 to calculate the five-number summary and identify outliers.
- (Unit 3) What is a function? Explain the advantages of functions, types of functions, parameters, return values and scope of variables with examples.
- (Unit 3) Explain operators in Python: arithmetic, comparison, logical and assignment, with examples and precedence.
- (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?
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: Mid-Term Examination (Units 1–4) – Revision Guide · Next: Pre-Board Examination (Full Syllabus) – Revision Guide
All lessons in Computer Science XI (HSSC-I) – FBISE Complete SLO-Based Course