Practice 50 exam-oriented MCQs based on the FBISE HSSC-II Computer Science assessment framework. The questions cover algorithm efficiency, clarity and correctness, time and space complexity, arrays, lists, stacks, queues, trees, tree traversal, binary search, and evaluation of computational solutions.
1. What is an algorithm?
2. Which property means an algorithm must eventually stop?
3. What does correctness of an algorithm mean?
4. What does algorithm efficiency mainly describe?
5. Time complexity describes:
6. Space complexity describes:
7. Big-O notation is commonly used to describe:
8. Which complexity generally grows more slowly as input size increases?
9. What is the time complexity of accessing an element by index in a typical array?
10. A linear search through n unsorted elements has worst-case time complexity:
11. Binary search on a sorted array has worst-case time complexity:
12. Binary search requires the data to be:
13. In binary search, the search interval is repeatedly:
14. For a sorted list of 16 elements, binary search needs at most approximately how many comparisons to reduce the search interval to one element?
15. What is a trade-off between time and space?
16. What does clarity of an algorithm refer to?
17. Which feature improves algorithm clarity?
18. Why is pseudocode useful?
19. A correct algorithm should give correct results for:
20. One way to help prove an algorithm correct is to:
21. What is a data structure?
22. An array is generally:
23. A list is useful for:
24. A stack follows which principle?
25. A queue follows which principle?
26. Which operation adds an item to the top of a stack?
27. Which operation removes the top item from a stack?
28. Which operation adds an item to a queue?
29. Which operation removes an item from the front of a queue?
30. A tree data structure is best described as:
31. The top node of a tree is called the:
32. A node with no children is called a:
33. A node directly connected below another node is its:
34. Two nodes with the same parent are called:
35. In a binary tree, each node can have at most:
36. A binary search tree has the property that values in the left subtree are generally:
37. In-order traversal of a binary tree visits nodes in which order?
38. Pre-order traversal visits nodes in which order?
39. Post-order traversal visits nodes in which order?
40. For a binary search tree, in-order traversal produces values in:
41. Consider a tree with root 8, left child 4, and right child 12. Its in-order traversal is:
42. For the same tree, its pre-order traversal is:
43. For the same tree, its post-order traversal is:
44. Which data structure is naturally suited to representing hierarchical relationships?
45. What is the main advantage of binary search over linear search on a suitable sorted collection?
46. If the target value is smaller than the middle value during binary search, the next search is made in the:
47. If the target value is larger than the middle value during binary search, the next search is made in the:
48. Why does binary search become inefficient or invalid on an unsorted list?
49. Which algorithmic property is concerned with whether the steps are understandable and unambiguous?
50. Which measure can be used to compare algorithm efficiency independently of a particular machine?
Explore More Class 12 Computer Science MCQs
Chapter 1 – Computer Systems
Chapter 2 – Computational Thinking & Algorithms
Chapter 3 – Programming Fundamentals
Chapter 4 – Data and Analysis
Chapter 5 – Applications of Computer Science
Chapter 6 – Impacts of Computing
Chapter 7 – Digital Literacy
Chapter 8 – Entrepreneurship in Digital Age
Chapter 2 – Computational Thinking & Algorithms
Chapter 3 – Programming Fundamentals
Chapter 4 – Data and Analysis
Chapter 5 – Applications of Computer Science
Chapter 6 – Impacts of Computing
Chapter 7 – Digital Literacy
Chapter 8 – Entrepreneurship in Digital Age
Class 12 Computer Science Main Hub
Class 12 Computer Science MCQs – FBISE Subject Hub
Class 12 All Subjects Main Hub
Syllabus & SLO Alignment
This chapter is prepared with reference to the FBISE HSSC-II Computer Science Assessment Framework and the National Curriculum of Pakistan. It covers SLO CS-12-B-01 on evaluating computational solutions in terms of efficiency, clarity, and correctness, and SLO CS-12-B-02 on applying complex algorithms to data structures such as trees and binary search.