DAA -1

What is the primary purpose of asymptotic analysis?

• To describe the efficiency of an algorithm as input size approaches infinity
• To calculate the exact running time of an algorithm
• To compare different programming languages
• To analyze memory usage of algorithms

Which notation is used to describe the upper bound of an algorithm's running time?

• Big O notation
• Theta notation
• Omega notation
• Alpha notation

If an algorithm has a running time of O(n²), what happens as the input size increases significantly?

• The running time remains constant
• The running time increases quadratically
• The running time decreases
• The running time becomes linear

In the context of sorting algorithms, what does input size refer to?

• The number of algorithms used
• The number of steps in the algorithm
• The number of items to be sorted
• The time taken to sort

What is the worst-case running time for a sorting algorithm that operates in O(n log n) time complexity?

• O(n)
• O(log n)
• O(n²)
• O(n log n)

Which of the following is NOT a characteristic of a binary search tree?

• Each node has at most two children
• The left child is less than the parent node
• The right child is greater than the parent node
• All nodes are connected in a circular manner

What is the time complexity for searching an element in a balanced binary search tree?

• O(1)
• O(log n)
• O(n)
• O(n log n)

In the context of dynamic programming, what does overlapping subproblems mean?

• Subproblems that can be solved independently
• Subproblems that are solved multiple times
• Subproblems that do not share any common elements
• Subproblems that are larger than the original problem

What is the primary advantage of using dynamic programming?

• It guarantees the fastest solution
• It reduces the time complexity by storing solutions to subproblems
• It simplifies the code significantly
• It eliminates the need for recursion

Which of the following is a common technique for handling collisions in hash tables?

• Chaining
• Sorting
• Searching
• Recursion