DS Final Review

Recursion is a method in which the solution of a problem depends on __________.

• Larger instances of different problems

• Larger instances of the same problem

• Smaller instances of different problems

• Smaller instances of the same problem

What will happen when the code snippet is executed?

• The code will run for some time and stop when the stack overflows

• The code will be executed successfully and random output will be generated

• The code will show a compile time error

• The code will be executed successfully and no output will be generated

What does the following recursive code do?

• Prints the numbers from 10 to 1

• Prints the numbers from 10 to 0

• Prints the numbers from 0 to 10

• Prints the numbers from 1 to 10

Most Efficient Time Complexity of Topological Sorting is?

• O(V)

• O(V+E)

• O(E)

• O(V*E)

Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time?

• Insertion at the front of the linked list

• Insertion at the end of the linked list

• Deletion of the front node of the linked list

• Deletion of the last node of the linked list

In most of the cases, topological sort starts from a node which has

• Maximum Degree

• Minimum Degree

• Any degree

• Zero Degree

Which of the following is the most commonly used data structure for implementing Dijkstra's Algorithm?

• Min priority queue

• Stack

• Circular queue

• Max priority queue

What is the time complexity of balancing parentheses algorithm?

• O(N log N)

• O(log N)

• O(N)

• O(N^2)

What is the average running time of a quick sort algorithm?

• O(N^2)

• O(N)

• O(N log N)

• O(log N)

What is the average case running time of an insertion sort algorithm?

• O(N)

• O(N log N)

• O(log N)

• O(N^2)