Data Structures Quiz Online

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

___________ is a collection of elements of used to store the same type of data.

Dynamic Array is –

Which data structure is required to convert the infix to prefix notation?

Which of the following is not the correct statement for a stack data structure?

The minimum number of stacks required to implement a stack is –

Which of the following principle does Queue use?

Value of the postfix expression 6324+–* is –

On which element we perform insertion and deletion operation is stacks –

#define SIZE 11
struct STACK
{
int arr[SIZE];
int top=-1;
}
What would be the maximum value of the top that does not cause the overflow of the stack?

Process of removing an element from the stack is known as –

Another name of Circular Queue –

The postfix form of the following expression A*B+C/D ?

Breadth First Search uses which of the following data structure –

The operation of processing each element in the list is known as –

The memory address of the first element of an array is called –

First Index of Array is –

Asymptotic time complexity to find an element in the linked list is

Which data structure is the best for implementing a priority queue?

Time complexity of Quick Sort is –