Which of these data structures is LIFO?

int nums[ ] =

{2, 3, 5, 8, 9, 11};

How would you access the fourth element in nums

A FIFO structure implemented as a ring where the front and rear pointers can wrap around the end of the start of the array.

It use pointer to link nodes.

LIFO stands for

Act of adding values into a stack is called

If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, in what order will they be removed?

Consider the following operation performed on a stack of size 5.

Push(1);

Pop();

Push(2);

Push(3);

Pop();

Push(4);

Pop();

Pop();

Push(5);

After the completion of all operation, get the total number of element present in stack is

int is __________ data type.

Array is ___________ data type.

In ____________ data structure, the data items are arranged in a linear sequence.

In ___________ data structure data items are not in sequence.

Full form of LIFO is ____________

Every stack has a variable _________ associated with it.

_________ operation removes the element from the top of the stack.

A function calls itself is called ___________.

The elements in a queue are added at one end called ________.

A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called

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

In the __________traversal we process all of a vertex’s descendents before we move to an adjacent vertex.

A graph is a collection of nodes, called __________ And line segments called arcs or__________ that connect pair of nodes.

A tree sort is also known as__________ sort.

A terminal node in a binary tree is called __________

Other name for directed graph is _________

In a graph if E=(u,v) means _____________

How many leaf are there in the tree?

What are the 3 depth traversals for a tree data structure?

The hash function is

H1(k) = k % 50.

In the case of collision, the hash function used is

H(k) = (H1(k) + M x H2(k)) % 50

where H1(k) = k % 50 and H2(k) = k % 20.

M is initialized to 0 and is incremented by 1 each time a collision occurs.

This could be categorized under which of the following collision detection technique

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

Complexity of Binary Search for an array of n numbers is

Example of non linear data structure

What is the data structure used to perform recursion?

The prefix form of A-B/ (C * D ^ E) is?

Which of the following data structures can be used for parentheses matching?

The examples of Linear Data Structures are