Knowledge Knockout[Quiz Round](2nd-4th years)

Which data structure is mainly used for implementing the recursive algorithm?

• Queue

• Stack

• Binary Tree

• Linked List

Which of the following is the prefix form of A+B*C?

• A+(BC*)

• +AB*C

• ABC+*

• +A*BC

Which of the following principle does Queue use?

• LIFO

• Ordered Array

• Linear Tree

• FIFO

The time complexity of enqueue operation in Queue is :

• O(1)

• O(log n)

• O(n log n)

• O(n)

What will be the output of the following code snippet?

• Error

• <class 'list'>

• <class 'tuple'>

• Undefined

We use dynamic programming approach when?

• We need an optimal solution

• The solution has optimal substructure

• The given problem can be reduced to the 3-SAT problem

• It's faster than Greedy

Identify the best case time complexity of selection sort?

• O(n log n)

• O(n^2)

• O(1)

• O(n)

What is the technique called in which it does not require extra memory for carrying out the sorting procedure?

• Stable

• Unstable

• In-place

• In-partition

Minimum number of fields in each node of a doubly linked list is ____

• 1

• 2

• 3

• 4

………… is very useful in situation when data have to stored and then retrieved in reverse order.

• Stack

• Queue

• List

• Linked list