data structures1

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

• a) Deque

• b) Header

• c) Queue

• d) Circular Queue

Process of inserting an element in stack is called ____________

• Create

• Push

• Evaluation

• Pop

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

• A collection of stacks is sortable

• Stack entries may be compared with the ‘<‘ operation

• The entries are stored in a linked list

• There is a Sequential entry that is one by one

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

• 1

• 14

• 74

• -18

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

• a) Stack

• b) Queue

• c) Array

• d) Tree

Circular Queue is also known as ________

• a) Ring Buffer

• b) Square Buffer

• c) Rectangle Buffer

• d) Curve Buffer

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?

• a) ABCD

• b) DCBA

• c) DCAB

• d) ABDC

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

}

• a) Prints all nodes of linked lists

• b) Prints all nodes of linked list in reverse order

• c) Prints alternate nodes of Linked List

• d) Prints alternate nodes in reverse order

Linked list data structure offers considerable saving in _____________

• a) Computational Time

• b) Space Utilization

• c) Space Utilization and Computational Time

• d) Speed Utilization

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

• Dequeue

• Priority

• Tree

• Graph