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
  1. Q1

    A computing problem in computer science is best described as one that is solved through what process?

    1. ARandom guessing
    2. BStep-by-step computation
    3. CManual trial only
    4. DVisual inspection only
    Show answer

    Correct answer: B. Step-by-step computation

    Computing problems are solved step-by-step through computation, with well-defined inputs and outputs.

  2. Q2

    "Given a number n, is n even?" is an example of which type of computing problem?

    1. ASearch problem
    2. BCounting problem
    3. CDecision problem
    4. DSorting 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.

  3. Q3

    Finding a route from Islamabad to Lahore on a map is an example of which type of computing problem?

    1. ADecision problem
    2. BSearch problem
    3. CCounting problem
    4. DSorting problem
    Show answer

    Correct answer: B. Search problem

    Search problems involve finding a solution, such as a route, that satisfies certain criteria.

  4. 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?

    1. ADecision problem
    2. BSearch problem
    3. CCounting problem
    4. DSorting problem
    Show answer

    Correct answer: C. Counting problem

    Counting problems ask for the number of possible solutions to a search problem.

  5. Q5

    Which structural approach is most effective for solving Counting Principle problems?

    1. ATable-based
    2. BTree-based
    3. CGraph-based
    4. DList-based
    Show answer

    Correct answer: B. Tree-based

    Tree-based structures represent available options as branches, making counting problems easier to understand.

  6. Q6

    In a tree representation of a counting problem, what do the branches of the tree represent?

    1. AFinal answers
    2. BAvailable options/choices
    3. CErrors
    4. DVariables
    Show answer

    Correct answer: B. Available options/choices

    Each branch in the tree represents an available option or choice at a given step.

  7. Q7

    What is the foundation of solving counting problems?

    1. AGuessing outcomes
    2. BConsidering all available options for a selection
    3. CIgnoring repeated items
    4. DRandom sampling
    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.

  8. Q8

    Counting Principle Problems could easily be understood by the use of

    1. AGraph representation
    2. BTree representation
    3. CClock representation
    4. DMap representation
    Show answer

    Correct answer: B. Tree representation

    Tree representation visually breaks each choice into branches, making counting easier to understand.

  9. 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?

    1. A12
    2. B7
    3. C3
    4. D4
    Show answer

    Correct answer: B. 7

    Since the choices are mutually exclusive, total options = 3 + 4 = 7.

  10. Q10

    The addition principle of counting is used when events are:

    1. ADependent on each other
    2. BMutually exclusive
    3. CAlways equal
    4. DAlways sequential
    Show answer

    Correct answer: B. Mutually exclusive

    The addition principle applies to mutually exclusive events that cannot occur simultaneously.

  11. Q11

    The multiplication principle of counting is applied when:

    1. AWe choose one option from each of several events
    2. BOnly one event occurs
    3. CEvents are mutually exclusive
    4. DWe ignore order
    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.

  12. 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?

    1. A9
    2. B27
    3. C18
    4. D3
    Show answer

    Correct answer: B. 27

    Total ways = 3 × 3 × 3 = 27, using the multiplication principle.

  13. Q13

    Arranging items in a specific order, where order matters, is called:

    1. ACombination
    2. BPermutation
    3. CPigeonhole Principle
    4. DAbstraction
    Show answer

    Correct answer: B. Permutation

    A permutation is a way of arranging items where the order matters.

  14. Q14

    Four paintings are to be arranged in 3 positions on a wall. How many permutations are possible?

    1. A12
    2. B24
    3. C4
    4. D64
    Show answer

    Correct answer: B. 24

    Using 4 × 3 × 2 = 24, there are 24 ways to arrange 3 of the 4 paintings.

  15. Q15

    When selecting items from a group where the order does not matter, this is called:

    1. APermutation
    2. BCombination
    3. CPigeonhole Principle
    4. DDecomposition
    Show answer

    Correct answer: B. Combination

    Combination counting is used when the order of selection is irrelevant.

  16. Q16

    If there are 10 pigeons and only 9 pigeonholes, what does the Pigeonhole Principle guarantee?

    1. AAll pigeonholes remain empty
    2. BAt least one pigeonhole has more than one pigeon
    3. CEvery pigeon gets its own hole
    4. DNo pigeon enters any hole
    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.

  17. Q17

    In how many ways can you choose 2 out of 5 different books to take on a trip? (Order does not matter)

    1. A10
    2. B20
    3. C15
    4. D5
    Show answer

    Correct answer: A. 10

    Combinations of 5 choose 2 = 10, since order does not matter.

  18. Q18

    A committee of 3 members is to be selected from a group of 8 people. How many different committees can be formed?

    1. A56
    2. B84
    3. C28
    4. D120
    Show answer

    Correct answer: A. 56

    Combinations of 8 choose 3 = 56.

  19. 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?

    1. A9
    2. B20
    3. C15
    4. D10
    Show answer

    Correct answer: B. 20

    Using the multiplication principle, 5 × 4 = 20 outfits.

  20. Q20

    In how many ways can you select 3 different fruits from a basket of 7 different fruits? (Order does not matter)

    1. A35
    2. B21
    3. C56
    4. D84
    Show answer

    Correct answer: A. 35

    Combinations of 7 choose 3 = 35.

  21. Q21

    The Pigeonhole Principle states that if more items are placed into containers than the number of containers, then:

    1. ASome containers must be empty
    2. BAt least one container must hold more than one item
    3. CAll containers will be full
    4. DEach item will be placed in a different container
    Show answer

    Correct answer: B. At least one container must hold more than one item

    This is the exact statement of the Pigeonhole Principle.

  22. 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?

    1. A35
    2. B40
    3. C45
    4. D50
    Show answer

    Correct answer: B. 40

    Using inclusion-exclusion: 30 + 25 − 15 = 40.

  23. Q23

    An algorithm is best defined as:

    1. AA programming language
    2. BA well-defined, step-by-step procedure to solve a problem
    3. CA type of computer hardware
    4. DA random sequence of actions
    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.

  24. Q24

    Which property of an algorithm ensures that every step is clearly and accurately stated?

    1. AFiniteness
    2. BDefiniteness
    3. CGenerality
    4. DInput
    Show answer

    Correct answer: B. Definiteness

    Definiteness requires every algorithmic step to be clearly and precisely stated.

  25. Q25

    Which property ensures an algorithm can be used for a group of related problems, not just one?

    1. AGenerality
    2. BEffectiveness
    3. CFiniteness
    4. DOutput
    Show answer

    Correct answer: A. Generality

    Generality means an algorithm should provide a broad solution for several related problems.

  26. Q26

    Which of the following is NOT one of the properties of an algorithm?

    1. AInput
    2. BOutput
    3. CInfiniteness
    4. DDefiniteness
    Show answer

    Correct answer: C. Infiniteness

    Algorithms must have Finiteness (a limited number of steps), not Infiniteness.

  27. Q27

    Algorithms can be expressed in all of the following ways EXCEPT:

    1. AFlowcharts
    2. BPseudocode
    3. CNatural language
    4. DRandom noise
    Show answer

    Correct answer: D. Random noise

    Algorithms are expressed through computer languages, flowcharts, pseudocode, and natural language — not random noise.

  28. Q28

    Identify the activity that is based on personal preferences rather than algorithmic logic.

    1. ASorting numbers in a list
    2. BDeciding what to eat for dinner
    3. CDetermining if a number is a prime number
    4. DCalculating the square root of a number
    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.

  29. Q29

    Which property of an algorithm ensures that it produces at least one output after the calculations?

    1. AInput
    2. BOutput
    3. CDefiniteness
    4. DFiniteness
    Show answer

    Correct answer: B. Output

    The Output property guarantees that an algorithm produces at least one result.

  30. Q30

    Which property ensures that an algorithm will eventually end after a finite number of steps?

    1. AInput
    2. BFiniteness
    3. CEffectiveness
    4. DGenerality
    Show answer

    Correct answer: B. Finiteness

    Finiteness ensures the algorithm always terminates after a limited number of steps.

MCQs by topic

More for this chapter

All 10 Computer Science chapters – MCQs

10 Computer Science MCQs

Frequently 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.

A little trouble connecting

We could not reach IlmiDunya. Your connection may be slow or interrupted. Check your connection and try again.

If you were saving or submitting, check the result before trying again.

Account blocked

You are blocked from using IlmiDunya. Contact support to unblock your account.