Introduction to Computing MCQs with Answers
Practice important Introduction to Computing MCQs with answers and explanations.
Multiple Choice Questions
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
View Answer
B
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)
View Answer
A
Q1273: Which of the following is NOT a common sorting algorithm?
- A: Quick Sort
- B: Merge Sort
- C: Bubble Sort
- D: Hash Sort
View Answer
D
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
View Answer
A
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
View Answer
B
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
View Answer
C
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
View Answer
B
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
View Answer
C
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
View Answer
B
Q1280: Which term do computer scientists use to capture the concept of an algorithm being executable?
- A: Finite
- B: Effective
- C: Efficient
- D: Ambiguous
View Answer
B