Chapter 4: Algorithmic Strategies — Online MCQ Test
COMPUTER SCIENCE · CLASS 12th · Tamil Nadu State Board
Practice Chapter 4: Algorithmic Strategies with a free chapter-wise online MCQ test.
This chapter covers: Exploring problem-solving techniques this chapter introduces algorithm design complexity analysis and asymptotic notations. It demonstrates searching algorithms like linear and bin....
AI-generated questions from basic to board-exam level, with instant results and explanations.
Chapter 4: Algorithmic Strategies — Important Questions & Answers
Which search technique checks each element one by one until the target is found?
- A. Binary search
- B. Linear search
- C. Insertion sort
- D. Selection sort
Answer: B. Linear search
Linear search compares the target with each element sequentially. It stops when the item is found or the list ends.
Linear search compares the target with each element sequentially. It stops when the item is found or the list ends.
In binary search, the list must be ________.
- A. randomly arranged
- B. sorted
- C. reversed only
- D. containing only distinct values
Answer: B. sorted
Binary search works only on a sorted list because it repeatedly halves the search space based on order.
Binary search works only on a sorted list because it repeatedly halves the search space based on order.
The main idea of algorithmic complexity analysis is to study the ________ of an algorithm.
- A. color output
- B. growth in resource usage
- C. programming language used
- D. number of variables declared
Answer: B. growth in resource usage
Complexity analysis measures how time or space usage increases with input size.
Complexity analysis measures how time or space usage increases with input size.
For searching an item in a sorted list of 1024 elements, which algorithm is generally more efficient?
- A. Linear search because it always checks fewer elements
- B. Binary search because it halves the search space each step
- C. Bubble sort because it rearranges data faster
- D. Insertion sort because it searches and sorts together
Answer: B. Binary search because it halves the search space each step
Binary search is more efficient on sorted data because it reduces the remaining search space by half each time.
Binary search is more efficient on sorted data because it reduces the remaining search space by half each time.
For a list of n elements, which algorithmic complexity pair is most appropriate for the best case of insertion sort and binary search respectively?
- A. O(n) and O(log n)
- B. O(log n) and O(n)
- C. O(n^2) and O(1)
- D. O(1) and O(n^2)
Answer: A. O(n) and O(log n)
Insertion sort can be O(n) in the best case when the list is already sorted, while binary search runs in O(log n) time.
Insertion sort can be O(n) in the best case when the list is already sorted, while binary search runs in O(log n) time.