10 Computer Science Chapter 2: Computational Thinking & Algorithms MCQs with Answers
10th Class Computer Science · Federal Board (FBISE)
60 multiple choice questions (MCQs) for Federal Board 10 Computer Science Chapter 2 (Unit 2), Computational Thinking & Algorithms (10th Class Computer Science), with the correct answer and an explanation for each.
Here are 30 of them. Take the online test to practise the full set against the clock.
MCQs with answers
30 of 60- Q1
A computing problem in computer science is best described as one that is solved through what process?
Show answer
Correct answer: B. Step-by-step computation
Computing problems are solved step-by-step through computation, with well-defined inputs and outputs.
- Q2
"Given a number n, is n even?" is an example of which type of computing problem?
Show answer
Correct answer: C. Decision problem
Decision problems typically require a yes-or-no answer, such as checking if a number is even.
- Q3
Finding a route from Islamabad to Lahore on a map is an example of which type of computing problem?
Show answer
Correct answer: B. Search problem
Search problems involve finding a solution, such as a route, that satisfies certain criteria.
- Q4
If there are two roads (G.T. Road and Motorway) from Islamabad to Lahore, finding how many possible routes exist is an example of which type of problem?
Show answer
Correct answer: C. Counting problem
Counting problems ask for the number of possible solutions to a search problem.
- Q5
Which structural approach is most effective for solving Counting Principle problems?
Show answer
Correct answer: B. Tree-based
Tree-based structures represent available options as branches, making counting problems easier to understand.
- Q6
In a tree representation of a counting problem, what do the branches of the tree represent?
Show answer
Correct answer: B. Available options/choices
Each branch in the tree represents an available option or choice at a given step.
- Q7
What is the foundation of solving counting problems?
Show answer
Correct answer: B. Considering all available options for a selection
Counting problems are solved by systematically considering the options available for a selection.
- Q8
Counting Principle Problems could easily be understood by the use of
Show answer
Correct answer: B. Tree representation
Tree representation visually breaks each choice into branches, making counting easier to understand.
- Q9
A student can choose from 3 desktop computers or 4 laptop computers. How many total computer options does he have, using the addition principle?
Show answer
Correct answer: B. 7
Since the choices are mutually exclusive, total options = 3 + 4 = 7.
- Q10
The addition principle of counting is used when events are:
Show answer
Correct answer: B. Mutually exclusive
The addition principle applies to mutually exclusive events that cannot occur simultaneously.
- Q11
The multiplication principle of counting is applied when:
Show answer
Correct answer: A. We choose one option from each of several events
The multiplication principle is used when we select one option from each of multiple events.
- Q12
Bilal has 3 apples, 3 bananas, and 3 bunches of cherries. Using the multiplication principle, how many different fruit baskets (one of each kind) can he make?
Show answer
Correct answer: B. 27
Total ways = 3 × 3 × 3 = 27, using the multiplication principle.
- Q13
Arranging items in a specific order, where order matters, is called:
Show answer
Correct answer: B. Permutation
A permutation is a way of arranging items where the order matters.
- Q14
Four paintings are to be arranged in 3 positions on a wall. How many permutations are possible?
Show answer
Correct answer: B. 24
Using 4 × 3 × 2 = 24, there are 24 ways to arrange 3 of the 4 paintings.
- Q15
When selecting items from a group where the order does not matter, this is called:
Show answer
Correct answer: B. Combination
Combination counting is used when the order of selection is irrelevant.
- Q16
If there are 10 pigeons and only 9 pigeonholes, what does the Pigeonhole Principle guarantee?
Show answer
Correct answer: B. At least one pigeonhole has more than one pigeon
Since there are more pigeons than holes, at least one pigeonhole must contain more than one pigeon.
- Q17
In how many ways can you choose 2 out of 5 different books to take on a trip? (Order does not matter)
Show answer
Correct answer: A. 10
Combinations of 5 choose 2 = 10, since order does not matter.
- Q18
A committee of 3 members is to be selected from a group of 8 people. How many different committees can be formed?
Show answer
Correct answer: A. 56
Combinations of 8 choose 3 = 56.
- Q19
You have 5 different shirts and 4 different pants. How many different outfits can you make by choosing one shirt and one pair of pants?
Show answer
Correct answer: B. 20
Using the multiplication principle, 5 × 4 = 20 outfits.
- Q20
In how many ways can you select 3 different fruits from a basket of 7 different fruits? (Order does not matter)
Show answer
Correct answer: A. 35
Combinations of 7 choose 3 = 35.
- Q21
The Pigeonhole Principle states that if more items are placed into containers than the number of containers, then:
Show answer
Correct answer: B. At least one container must hold more than one item
This is the exact statement of the Pigeonhole Principle.
- Q22
In a set of 50 students, 30 have completed a math project, 25 have completed a science project, and 15 have completed both. How many students have completed at least one project?
Show answer
Correct answer: B. 40
Using inclusion-exclusion: 30 + 25 − 15 = 40.
- Q23
An algorithm is best defined as:
Show answer
Correct answer: B. A well-defined, step-by-step procedure to solve a problem
An algorithm is a well-defined, step-by-step procedure or set of rules for solving a problem.
- Q24
Which property of an algorithm ensures that every step is clearly and accurately stated?
Show answer
Correct answer: B. Definiteness
Definiteness requires every algorithmic step to be clearly and precisely stated.
- Q25
Which property ensures an algorithm can be used for a group of related problems, not just one?
Show answer
Correct answer: A. Generality
Generality means an algorithm should provide a broad solution for several related problems.
- Q26
Which of the following is NOT one of the properties of an algorithm?
Show answer
Correct answer: C. Infiniteness
Algorithms must have Finiteness (a limited number of steps), not Infiniteness.
- Q27
Algorithms can be expressed in all of the following ways EXCEPT:
Show answer
Correct answer: D. Random noise
Algorithms are expressed through computer languages, flowcharts, pseudocode, and natural language — not random noise.
- Q28
Identify the activity that is based on personal preferences rather than algorithmic logic.
Show answer
Correct answer: B. Deciding what to eat for dinner
Deciding what to eat is based on personal preference, not a defined step-by-step algorithmic process.
- Q29
Which property of an algorithm ensures that it produces at least one output after the calculations?
Show answer
Correct answer: B. Output
The Output property guarantees that an algorithm produces at least one result.
- Q30
Which property ensures that an algorithm will eventually end after a finite number of steps?
Show answer
Correct answer: B. Finiteness
Finiteness ensures the algorithm always terminates after a limited number of steps.
MCQs by topic
2.1 Computing Problems
4 MCQs
2.2 Basics of Counting Problems
4 MCQs
2.3 Basic Counting Principles
14 MCQs
2.4 Algorithms and their Characteristics
8 MCQs
2.5 Logical Reasoning
5 MCQs
2.6 Standard Algorithms
5 MCQs
2.7 Steps in Algorithms / Core Computational Thinking Concepts
4 MCQs
2.8 Abstraction
4 MCQs
2.9 Creating Generalized Solutions
3 MCQs
2.10 Modular Design
3 MCQs
2.11 Algorithm Dry Run
4 MCQs
2.12 Errors
2 MCQs
More for this chapter
All 10 Computer Science chapters – MCQs
10 Computer Science MCQsFrequently asked questions
How many MCQs are in 10 Computer Science Chapter 2?
IlmiDunya has 60 published MCQs for Chapter 2, Computational Thinking & Algorithms, each with the correct answer.