Data Structures and Algorithms Quiz

What is a characteristic of algorithms?

• They are always linear.

• They can be analyzed for space and time complexity.

• They do not require input.

• They are only used in programming.

Which of the following is a type of time complexity?

• Quadratic

• Cubic

• All of the above

• Exponential

What does Big O notation represent?

• The best case scenario of an algorithm.

• The average case scenario of an algorithm.

• The lower bound of an algorithm's time complexity.

• The upper bound of an algorithm's time complexity.

Which algorithm design strategy divides the problem into smaller subproblems?

• Brute force

• Greedy strategy

• Dynamic programming

• Divide and Conquer

What is a primary application of stacks?

• Function calls and recursion

• Scheduling tasks

• Data sorting

• Graph traversal

Which of the following is NOT a type of queue?

• Priority Queue

• Circular Queue

• Stack Queue

• Deque

What is the main purpose of a sparse matrix?

• To sort data.

• To perform quick searches.

• To represent data with many zero values.

• To store large amounts of data efficiently.

What does recursion involve?

• Using loops to repeat actions.

• A function calling itself.

• Storing data in arrays.

• Iterating through a list.

Which of the following is a characteristic of a Deque?

• It only allows FIFO operations.

• Elements can only be added at one end.

• Elements can be added or removed from both ends.

• It is a type of stack.

What is the purpose of Polish notation?

• To evaluate expressions without parentheses.

• To convert infix expressions to postfix.

• To sort data.

• To simplify mathematical expressions.