CS 240 FINAL

Question 1

Q: What are the advantages of iterative solutions?

Answer 1

A: Use less memory, easier to write.

Question 2

Q: What are the advantages of recursive solutions?

Answer 2

A: More elegant, easier to define, saves programmer time.

Question 3

Q: What are the disadvantages of recursive solutions?

Answer 3

A: Use more resources, each call copies variables, less efficient.

Question 4

Q: Name three types of STL members and give an example of each.

Answer 4

A:

Container: vector, stack, queue, list

Algorithm: sort(), max_element()

Iterator: Used to traverse containers like a pointer.

Question 5

Q: What does Big-O measure?

Answer 5

A: The efficiency of an algorithm, focusing on time complexity as input grows.

Question 6

Q: What is a major advantage of Big-O notation?

Answer 6

A: Helps compare time complexities among algorithms.

Question 7

Q: What is a weakness of Big-O notation?

Answer 7

A: It’s not precise—doesn’t show actual performance or order-of-magnitude differences.

Question 8

Q: What data structure uses Last-In, First-Out (LIFO)?

Answer 8

A: Stack
Example: var.push(); var.pop();

Question 9

Q: What data structure uses First-In, First-Out (FIFO)?

Answer 9

A: Queue
Example: var.push(); var.pop();

Question 10

Q: What are key vector operations in C++?

Answer 10

A: push_back(), pop_back(), reserve(), capacity(), size()