Process of inserting an element in stack is called ____________

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

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

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

Circular Queue is also known as ________

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?

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);

}

Linked list data structure offers considerable saving in _____________

To represent hierarchical relationship between elements, Which data structure is suitable?

Match the following.

a) Completeness i) How long does it take to find a solution

b) Time Complexity ii) How much memory need to perform the search.

c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.

___________ is neither an algorithm nor a program.

Efficiency of an algorithm is measured by

Data in the data structures are processed by operations like insertion, deletion, sorting, merging and

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

If for an algorithm time complexity is given by O(1) then complexityof it is:

If for an algorithm time complexity is given by O(n) then complexityof it is:

Can We Implement Stack Using Queue Data structure

Can We implement Queue data structure using stack data structure

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