ALGORITHMS EXAMINATION QUESTIONS AND CORRECT
ANSWER WITH EXPLANATION GRADED A+ STUDY GUIDE
SOUTHERN NEW HAMPSHIRE UNIVERSITY
1. An algorithm is:
A. Step-by-step procedure to solve a problem
B. Hardware device
C. Programming language
D. Operating system
Answer: A
Rationale: Algorithms are logical solution steps.
2. The main goal of an algorithm is to:
A. Solve a problem efficiently
B. Increase file size
C. Design hardware
D. Store images
Answer: A
Rationale: It defines problem-solving steps.
3. An algorithm must be:
A. Finite
B. Infinite
C. Random
D. Ambiguous
Answer: A
Rationale: It must terminate.
4. A good algorithm should be:
A. Efficient
B. Confusing
C. Infinite
D. Hardware-based
Answer: A
Rationale: Efficiency is key.
5. Algorithm correctness means:
A. Produces correct output
, B. Runs fast only
C. Uses memory only
D. Has many steps
Answer: A
Rationale: Produces expected result.
6. Time complexity measures:
A. Execution time growth
B. File size
C. Screen size
D. Color usage
Answer: A
Rationale: Performance analysis.
7. Space complexity measures:
A. Memory usage
B. Speed
C. Internet usage
D. Screen resolution
Answer: A
Rationale: Memory requirement.
8. Big O notation describes:
A. Worst-case complexity
B. File type
C. Screen size
D. Hardware design
Answer: A
Rationale: Asymptotic behavior.
9. O(1) complexity means:
A. Constant time
B. Linear time
C. Exponential time
D. Logarithmic time
Answer: A
Rationale: Independent of input size.
10. O(n) complexity means:
A. Linear time
, B. Constant time
C. Logarithmic time
D. Random time
Answer: A
Rationale: Increases with input size.
11. O(log n) complexity means:
A. Logarithmic time
B. Linear time
C. Constant time
D. Quadratic time
Answer: A
Rationale: Divide and conquer behavior.
12. O(n²) complexity means:
A. Quadratic time
B. Linear time
C. Constant time
D. Logarithmic time
Answer: A
Rationale: Nested loops growth.
13. Best case complexity refers to:
A. Minimum time required
B. Maximum time required
C. Average memory
D. Worst output
Answer: A
Rationale: Optimal scenario.
14. Worst case complexity refers to:
A. Maximum time required
B. Minimum time
C. No execution
D. Random output
Answer: A
Rationale: Worst scenario performance.
15. Average case complexity is:
A. Expected performance
ANSWER WITH EXPLANATION GRADED A+ STUDY GUIDE
SOUTHERN NEW HAMPSHIRE UNIVERSITY
1. An algorithm is:
A. Step-by-step procedure to solve a problem
B. Hardware device
C. Programming language
D. Operating system
Answer: A
Rationale: Algorithms are logical solution steps.
2. The main goal of an algorithm is to:
A. Solve a problem efficiently
B. Increase file size
C. Design hardware
D. Store images
Answer: A
Rationale: It defines problem-solving steps.
3. An algorithm must be:
A. Finite
B. Infinite
C. Random
D. Ambiguous
Answer: A
Rationale: It must terminate.
4. A good algorithm should be:
A. Efficient
B. Confusing
C. Infinite
D. Hardware-based
Answer: A
Rationale: Efficiency is key.
5. Algorithm correctness means:
A. Produces correct output
, B. Runs fast only
C. Uses memory only
D. Has many steps
Answer: A
Rationale: Produces expected result.
6. Time complexity measures:
A. Execution time growth
B. File size
C. Screen size
D. Color usage
Answer: A
Rationale: Performance analysis.
7. Space complexity measures:
A. Memory usage
B. Speed
C. Internet usage
D. Screen resolution
Answer: A
Rationale: Memory requirement.
8. Big O notation describes:
A. Worst-case complexity
B. File type
C. Screen size
D. Hardware design
Answer: A
Rationale: Asymptotic behavior.
9. O(1) complexity means:
A. Constant time
B. Linear time
C. Exponential time
D. Logarithmic time
Answer: A
Rationale: Independent of input size.
10. O(n) complexity means:
A. Linear time
, B. Constant time
C. Logarithmic time
D. Random time
Answer: A
Rationale: Increases with input size.
11. O(log n) complexity means:
A. Logarithmic time
B. Linear time
C. Constant time
D. Quadratic time
Answer: A
Rationale: Divide and conquer behavior.
12. O(n²) complexity means:
A. Quadratic time
B. Linear time
C. Constant time
D. Logarithmic time
Answer: A
Rationale: Nested loops growth.
13. Best case complexity refers to:
A. Minimum time required
B. Maximum time required
C. Average memory
D. Worst output
Answer: A
Rationale: Optimal scenario.
14. Worst case complexity refers to:
A. Maximum time required
B. Minimum time
C. No execution
D. Random output
Answer: A
Rationale: Worst scenario performance.
15. Average case complexity is:
A. Expected performance
