Data Structures

Front

If the insertion and deletion happens from both the ends then the queue is called a______Queue

Back

Deque

Front

Process of inserting an element in stack is called ____________

Back

Push

Front

Entries in a stack are “ordered”. What is the meaning of this statement?

Back

There is a Sequential entry that is one by one

Front

Which of the following applications may use a stack? a) A parentheses balancing program, b) Tracking of local variables at run time, c) Compiler Syntax Analyzer, d) Data Transfer between two asynchronous process

Back

Data Transfer between two asynchronous process

Front

What is the value of the postfix expression 6 3 2 4 + – *?

Back

-18

Front

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

Back

Stack

Front

Circular Queue is also known as ________

Back

Ring Buffer

Front

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

Back

ABCD

Front

What does the following function do for a given Linked List with first node as head?
void fun1(struct node* head)
{
if(head == NULL)
return;
fun1(head->next);
printf("%d ", head->data);
}

Back

Prints all nodes of linked list in reverse order

Front

Linked list data structure offers considerable saving in _____________

Back

Space Utilization and Computational Time