Programming Data Structure Online Test Series 1 | Online Quiz

In recursion, a procedure calls itself, either directly or by calling a procedure which in turn calls it.

Stack uses push() to insert an item in stack, and pop() to remove the top item from stack.

A linked-list is dynamic structure, it can shrink and expand as required by the program.

Among the given, only quick sort is not stable that is it may re-arrange the already sorted items.

By using both BFS and DFS, a path between two vertices of a connected graph can be determined.

There will be 3 swaps in first iteration and 1 swap in second iteration.

As queue is maintained by two separate pointers for queue and dequeue operations, the run time for both is Ο(1).

In a min heap, parent nodes store lesser values than child nodes. The minimum value of the entire heap is stored at root.

Both selection sort and insertion sort maintains two sublists and then checks unsorted list for next sorted element.

A stable sorting algorithm like bubble sort, does not change the sequence of appearance of similar element in the sorted list.

In a min heap, parent nodes store lesser values than child nodes. The minimum value of the entire heap is stored at root.

Stack is used for depth first traversal whereas queue is used for breadth first traversal

Floyd-Warshall’s All pair shortest path Algorithm uses dynamic programming approach. All other mentioned algorithms use greedy programming approach

Linear search scans sequentially to find the target value. The best case is Ο(1) and average and worst case is Ο(n). Worst case is when data is not in the list, and it has to scan all n elements.

Fibonacci Series generates subsequent number by adding two previous numbers.

BST does not care about complete binary tree properties.

Θ represents average case. Ο represents worst case and Ω represents base case.

If the root node is at height 0, then a binary tree can have at max 2^k+1 − 1 nodes.
For example: a binary tree of height 1, can have maximum 2¹⁺¹ − 1 = 3 nodes.

Stack uses push() to insert an item in stack, and pop() to remove the top item from stack.

Using Depth First Search, we traverse the whole graph i.e. visiting all Vertices and Edges.

Heap maintains itself to meet all the requirements of complete binary tree.

Greedy approach focuses only on localized optimum solution.

In a min heap, parents always have lesser or equal values than that of their childs.

Queue is used for breadth first traversal whereas stack is used for depth first traversal.

Except selection sort, all other soring algorithms are stable.

Without a base criteria and progressive approach, a recursion is just an infinite iteration.

Linear search, seaches the desired element in the target list in a sequential manner, without breaking it in any way.

Every problem which can be solved using recursion can also be solved using iterations.

In Post-order traversal method, the root node is visited last, hence the name.