DSA Outro Quiz

In a recursive function, what is the importance of a base case?

• It specifies the main operation of the recursion.

• It prevents the recursive function from making more than ten calls.

• It provides a condition under which the recursion will stop.

• It increases the speed of recursion.

Consider a recursive function that computes the sum of all numbers from 1 to n. What would likely happen if the function lacks a proper base case?

• The function would return incorrect results.

• The recursion would terminate immediately.

• The function would execute indefinitely or until a stack overflow occurs.

• The function would be optimized automatically by the compiler.

Which data structure would be most appropriate for implementing undo functionality in a text editor?

• Stack

• Queue

• Array

• Linked list

What does O(1) time complexity indicate about an algorithm?

• The execution time increases linearly with the input size.

• The execution time decreases as the input size increases.

• The execution time remains constant regardless of the input size.

• The execution time increases exponentially with the input size.

Which scenario best illustrates the use of a queue?

• Managing tasks for a printer.

• Accessing the most recently added network logs.

• Backtracking paths in a maze.

• Calculating factorial of a number.

What is the primary difference between linear search and binary search algorithms?

• Linear search can be used on sorted and unsorted lists, while binary search requires a sorted list

• Linear search is faster than binary search on large datasets

• Binary search can be implemented in a recursive or iterative manner, while linear search can only be implemented iteratively

• Binary search uses more memory than linear search