1. A decision problem normally has a response of
Answer: B. yes or no
Computer Science Class 10 Unit 2: Computational Thinking & Algorithms MCQs
61 multiple choice questions with the correct answer for each. Tap an option to check yourself, or switch on "Show all answers". This is page 1 of 2.
Tap an option to check your answer.
2. "Is n even?" is an example of a
Answer: C. decision problem
3. In a counting problem, the answer is
Answer: A. the number of possible solutions to a search problem
4. If there are two roads from Islamabad to Lahore (G.T. Road and Motorway), the answer to the counting problem is
Answer: D. 2
5. The addition principle is used for events that are
Answer: A. mutually exclusive
6. A student chooses among 3 desktops and 4 laptops. Total options are
Answer: C. 7
7. Bilal has 3 apples, 3 bananas and 3 bunches of cherries. The number of ways to pick one of each kind is
Answer: D. 27
8. You have 5 shirts and 4 pants. The number of different outfits is
Answer: B. 20
9. A permutation is
Answer: D. an arrangement of items in a specific order
10. Number of ways to arrange 3 of 4 paintings on a wall is
Answer: A. 24
11. A combination is a selection of items where
Answer: C. the order does not matter
12. Number of ways to choose 3 of 4 paintings (order irrelevant) is
Answer: B. 4
13. Combinations equal the number of permutations divided by
Answer: B. the number of ways to order the chosen items
14. In how many ways can you choose 2 out of 5 different books?
Answer: A. 10
15. A committee of 3 is selected from 8 people. The number of committees is
Answer: C. 56
16. In how many ways can you select 3 different fruits from 7 fruits?
Answer: D. 35
17. The Pigeonhole Principle states that if n + 1 objects are placed into n boxes, then
Answer: D. at least one box contains two or more objects
18. If you have 13 apples and 12 baskets, then by the Pigeonhole Principle
Answer: C. at least one basket has more than one apple
19. Inclusion-Exclusion: n(A∪B) equals
Answer: A. n(A) + n(B) − n(A∩B)
20. In a class of 50 students, 30 did a math project, 25 a science project and 15 both. Students who did at least one are
Answer: B. 40
21. Binary strings of length 8 that begin with 1 can be filled in how many ways?
Answer: B. 128
22. Binary strings of length 8 that begin with 1 or end with 00 are
Answer: C. 160
23. An algorithm is
Answer: A. a well-defined step-by-step procedure for solving a problem
24. The property of an algorithm that it can take externally supplied values is
Answer: D. Input
25. Which property ensures an algorithm produces at least one result?
Answer: A. Output
26. The property that every step is clear and precise is
Answer: C. Definiteness
27. Finiteness means an algorithm
Answer: D. must end after a finite number of steps
28. Effectiveness means operations are
Answer: B. simple enough to be done by a person with paper and pencil
29. Generality means an algorithm should
Answer: D. solve a group of similar problems, not just one
30. Which is NOT a property of an algorithm?
Answer: B. Ambiguity
31. Which algorithm finds shortest paths in navigation applications?
Answer: A. Dijkstra
32. Quicksort, mergesort and binary search are used for
Answer: C. sorting and searching
33. Boolean logic evaluates expressions to one of
Answer: B. two values: true or false
34. A AND B is true only when
Answer: A. both A and B are true
35. A OR B is false only when
Answer: D. both A and B are false
36. In a repeating pattern Square, Triangle, Circle, the 9th shape is a
Answer: C. Circle
37. Bubble Sort repeatedly
Answer: C. compares adjacent elements and swaps them if in the wrong order
38. Selection Sort repeatedly
Answer: D. selects the smallest (or largest) element from the unsorted part
39. Merge Sort
Answer: B. divides the list into halves, sorts each and merges them
40. Insertion Sort builds the final sorted array
Answer: A. one element at a time
41. Linear search
Answer: D. checks each element sequentially until the target is found or the list ends
42. Binary search works on
Answer: C. sorted arrays
43. Binary search finds an element by
Answer: B. repeatedly dividing the search interval in half
44. Breaking a complex problem into smaller sub problems is called
Answer: A. decomposition
45. Finding similarities among problems is called
Answer: A. pattern recognition
46. Focusing on important information and ignoring irrelevant details is
Answer: D. abstraction
47. A map app showing roads and landmarks but hiding trees and houses is an example of
Answer: C. abstraction
48. Using variables instead of constants is an example of
Answer: B. abstraction in programming
49. Calling a built-in function by name without knowing its internals is
Answer: C. abstraction
50. A generalized solution can
Answer: D. handle similar problems, increasing reusability
About Computer Science Class 10 Unit 2 MCQs (Federal Board)
These 61 Computer Science MCQs cover Class 10 Unit 2: Computational Thinking & Algorithms of the Federal Board (FBISE) SSC-II (Class 10) syllabus. They are SLO-based MCQs as per the new pattern for FBISE exams. Each question has four options and the correct answer is shown, so you can practise for the annual examination and find the topics you still need to revise. The questions are split over 2 pages of 50. Download the Computational Thinking & Algorithms MCQs as a PDF using the button at the top of this page.