Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Multiple Choice Questions
Q1261: Which type of algorithm design technique involves breaking down a problem into smaller sub-problems?
- A: Divide and Conquer
- B: Brute Force
- C: Heuristic
- D: Randomized
View Answer
A
Q1262: What is a "recursive algorithm"?
- A: An algorithm that calls itself
- B: An algorithm that runs in a loop
- C: An algorithm that has no end
- D: An algorithm that uses random inputs
View Answer
A
Q1263: Which of the following is an example of a recursive algorithm?
- A: Binary Search
- B: Linear Search
- C: Quick Sort
- D: Bubble Sort
View Answer
C
Q1264: What does it mean for an algorithm to have "optimality"?
- A: It produces the best possible solution
- B: It runs the fastest
- C: It uses the least memory
- D: It is the easiest to understand
View Answer
A
Q1265: An algorithm that always produces the correct result is considered to be __________.
- A: Efficient
- B: Accurate
- C: Correct
- D: Optimal
View Answer
C
Q1266: Which of these is a basic type of operation in an algorithm?
- A: Comparison
- B: Printing
- C: Looping
- D: All of the above
View Answer
D
Q1267: In a sorting algorithm, what is typically being compared?
- A: Algorithms
- B: Time complexity
- C: Data elements
- D: Code lines
View Answer
C
Q1268: A "brute force" algorithm design technique typically __________.
- A: Finds the most optimal solution
- B: Tries all possible solutions
- C: Uses the least amount of time
- D: Ignores incorrect solutions
View Answer
B
Q1269: Which of the following is an example of a brute force algorithm?
- A: Traveling Salesman Problem
- B: Binary Search
- C: Depth-First Search
- D: Fibonacci Series
View Answer
A
Q1270: An algorithm that uses a "greedy approach" typically __________.
- A: Finds the most optimal solution
- B: Chooses the best option at each step
- C: Ignores the overall solution
- D: Randomly selects options
View Answer
B