10th Class Computer Chapter 2 Test2. Computational Thinking & Algorithms

Q1. Multiple choice questions (Attempt all · 10 × 1 = 10)

1. The process of breaking a complex problem into smaller, simpler sub-problems is called:
   1. Pattern Recognition
   2. Abstraction
   3. Decomposition
   4. Algorithm
2. Identify the activity that is based on personal preferences rather than algorithmic logic.
   1. Sorting numbers in a list
   2. Deciding what to eat for dinner
   3. Determinining if a number is a prime number
   4. Calculating the square root of a number
3. The Inclusion-Exclusion Principle is used to:
   1. Count unique ways
   2. Add duplicates
   3. Reduce numbers randomly
   4. Ignore overlapping
4. Combination principle is applied when:
   1. Order is important
   2. Order is irrelevant
   3. Objects are arranged
   4. Permutations are doubled
5. Modular design is focused on:
   1. Solving problems without division
   2. Breaking down a system into smaller parts
   3. Ignoring sub-problems
   4. Using one big solution only
6. In how many ways can you select 3 different fruits from a basket of 7 different fuits? (Order does not matter).
   1. 35
   2. 21
   3. 56
   4. 84
7. In simulate execution of dry run, we need to:
   1. Run code in compiler
   2. Manually perform each step using chosen inputs
   3. Ignore variable states
   4. Only calculate final result
8. Smartphone users recognize applications through:
   1. Source codes
   2. Icons (symbols)
   3. Binary numbers
   4. Algorithms
9. The Pigeonhole Principle states that if more items are placed into containers than the number of containers, then:
   1. Some containers must be empty
   2. At least one container must hold more than one item
   3. All containers will be full
   4. Each item will be placed in a different container
10. In the given sequence of shapes (Square, Triangle, Circle), the pattern repeats every:
    1. 2 shapes
    2. 3 shapes
    3. 4 shapes
    4. 5 shapes