Data Structures Level-2

Front

Identify the correct statement: Stack is FIFO and Queue is LIFO, Stack is LIFO and Queue is FIFO, Stack and Queue are both LIFO, Stack and Queue are both FIFO

Back

Stack is LIFO and Queue is FIFO

Front

The data structure required to check whether an expression contains balanced parenthesis is?

Back

Stack

Front

In a stack, if a user tries to remove an element from an empty stack it is called _________

Back

Underflow

Front

If the insertion and deletion happens from both the ends then the queue is called a ______ Queue.

Back

Deque

Front

Linked list is considered as an example of ___________ type of memory allocation.

Back

Dynamic

Front

A variant of linked list in which last node of the list points to the first node of the list is?

Back

Circular linked list

Front

A two-dimensional list, which can be thought of as an array of arrays, is called ___

Back

a matrix

Front

Almost all programming languages start arrays at ___

Back

index 0

Front

The data structure required to check whether an expression contains balanced parenthesis is?

Back

Stack

Front

To measure Time complexity of an algorithm Big O notation is used which:

Back

all of the mentioned