Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Chapter: 85
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
Correct Answer:
A
Chapter: 85
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
Correct Answer:
A
Chapter: 85
Q1263:
Which of the following is an example of a recursive algorithm?
A. Binary Search
B. Linear Search
C. Quick Sort
D. Bubble Sort
Correct Answer:
C
Chapter: 85
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
Correct Answer:
A
Chapter: 85
Q1265:
An algorithm that always produces the correct result is considered to be __________.
A. Efficient
B. Accurate
C. Correct
D. Optimal
Correct Answer:
C
Chapter: 85
Q1266:
Which of these is a basic type of operation in an algorithm?
A. Comparison
B. Printing
C. Looping
D. All of the above
Correct Answer:
D
Chapter: 85
Q1267:
In a sorting algorithm, what is typically being compared?
A. Algorithms
B. Time complexity
C. Data elements
D. Code lines
Correct Answer:
C
Chapter: 85
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
Correct Answer:
B
Chapter: 85
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
Correct Answer:
A
Chapter: 85
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
Correct Answer:
B
Chapter: 85
Q1271:
The term "space complexity" refers to __________.
A. The time taken by an algorithm to run
B. The amount of memory an algorithm uses
C. The size of the code
D. The complexity of the problem
Correct Answer:
B
Chapter: 85
Q1272:
In Big O notation, which of the following represents the best possible time complexity?
A. O(1)
B. O(n)
C. O(n^2)
D. O(log n)
Correct Answer:
A
Chapter: 85
Q1273:
Which of the following is NOT a common sorting algorithm?
A. Quick Sort
B. Merge Sort
C. Bubble Sort
D. Hash Sort
Correct Answer:
D
Chapter: 85
Q1274:
An algorithm that improves the performance of another by reducing redundant calculations is called __________.
A. Dynamic Programming
B. Divide and Conquer
C. Brute Force
D. Heuristic
Correct Answer:
A
Chapter: 85
Q1275:
What is a major drawback of the brute force algorithm design technique?
A. It is difficult to understand
B. It is inefficient for large inputs
C. It does not produce accurate results
D. It is too complex
Correct Answer:
B
Chapter: 86
Q1276:
What is a formal definition of an algorithm?
A. A program
B. A sequence of random steps
C. An ordered set of unambiguous, executable steps
D. A piece of hardware
Correct Answer:
C
Chapter: 86
Q1277:
What does it mean for an algorithm to be "ordered"?
A. It has a random structure
B. It follows a specific order of execution
C. It can run in any sequence
D. It is unordered like in parallel processing
Correct Answer:
B
Chapter: 86
Q1278:
Which of the following is NOT true about the order of algorithm execution?
A. It must have a well-established structure
B. It cannot be a sequence in parallel processing
C. It is the same as sequence
D. It ensures the steps are executed in a logical order
Correct Answer:
C
Chapter: 86
Q1279:
What does "executable" mean in the context of an algorithm?
A. It can be written in any programming language
B. It can be effectively performed
C. It only applies to hardware
D. It cannot be implemented
Correct Answer:
B
Chapter: 86
Q1280:
Which term do computer scientists use to capture the concept of an algorithm being executable?
A. Finite
B. Effective
C. Efficient
D. Ambiguous
Correct Answer:
B