ITF+ Algorithm Design Concepts Quiz

1. Which data structure uses LIFO (Last-In-First-Out) principle?

Queue

Stack

Hash table

Linked list

2. True or False: A linear search algorithm examines every element sequentially until finding the target.

True

False

3. Which of the following best describes the purpose of algorithm analysis?

To write code faster

To understand scalability and efficiency

To eliminate all bugs

To reduce file size

Submit

5. True or False: A hash table provides O(1) average-case lookup time.

True

False

6. Which algorithm design paradigm builds a solution by selecting locally optimal choices?

Dynamic programming

Greedy algorithm

Backtracking

Brute force

Submit

8. What is space complexity in algorithm analysis?

The amount of memory an algorithm uses relative to input size

The physical size of the server

The number of functions called

The speed of data transfer

9. True or False: Depth-first search (DFS) uses a stack-based approach to traverse a graph.

True

False

Submit

11. What is the primary purpose of analyzing time complexity in algorithm design?

To determine how long code takes to write

To predict how execution time grows with input size

To measure memory usage only

To count the number of programming languages used

12. What does O(n²) complexity indicate for an algorithm?

Linear time growth

Quadratic time growth

Logarithmic time growth

Constant time growth

13. True or False: Breadth-first search (BFS) explores nodes in layers from the starting point.

True

False

Submit

15. Which sorting algorithm has an average time complexity of O(n log n)?

Bubble sort

Insertion sort

Merge sort

Selection sort

16. What is the time complexity of binary search on a sorted array?

O(1)

O(n)

O(log n)

O(n²)

17. True or False: A greedy algorithm always produces the globally optimal solution.

True

False

18. In dynamic programming, what technique avoids recalculating the same subproblems?

Memoization

Recursion

Linear search

Sorting

Submit

20. Which Big O notation represents an algorithm that performs operations proportional to the input size?

O(1)

O(n)

O(n²)

O(log n)

ITF+ Basic Algorithm Design Concepts Quiz

1. Which data structure uses LIFO (Last-In-First-Out) principle?

2.

What first name or nickname would you like us to use?

2. True or False: A linear search algorithm examines every element sequentially until finding the target.

3. Which of the following best describes the purpose of algorithm analysis?

4. What does the term ____ refer to the process of reducing a problem to a previously solved problem?

5. True or False: A hash table provides O(1) average-case lookup time.

6. Which algorithm design paradigm builds a solution by selecting locally optimal choices?

7. In a ____ tree, each node has at most two children, commonly used in searching and sorting.

8. What is space complexity in algorithm analysis?

9. True or False: Depth-first search (DFS) uses a stack-based approach to traverse a graph.

10. A ____ is a collection of nodes connected by edges, commonly used to represent networks and relationships.

11. What is the primary purpose of analyzing time complexity in algorithm design?

12. What does O(n²) complexity indicate for an algorithm?

13. True or False: Breadth-first search (BFS) explores nodes in layers from the starting point.

14. In graph theory, a ____ is a sequence of vertices where each adjacent pair is connected by an edge.

15. Which sorting algorithm has an average time complexity of O(n log n)?

16. What is the time complexity of binary search on a sorted array?

17. True or False: A greedy algorithm always produces the globally optimal solution.

18. In dynamic programming, what technique avoids recalculating the same subproblems?

19. A recursive algorithm divides a problem into smaller subproblems. This approach is called ____.

20. Which Big O notation represents an algorithm that performs operations proportional to the input size?