stack

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?

• ABCD

• DCBA

• DCAB

• ABDC

In linked list implementation of a queue, the important condition for a queue to be empty is?

• FRONT is null

• REAR is null

• LINK is empty

• None of the mentioned

Are stacks FIFO or FILO?

• FILO
• FIFO
• LIFO
• LILO

How many stacks are needed to implement a queue. Consider the situation where no other data structure like arrays, linked list is available to you.

• 1

• 2

• 3

• 4

How many queues are needed to implement a stack. Consider the situation where no other data structure like arrays, linked list is available to you.

• 1

• 2

• 3

• 4

Which of the following is true about linked list implementation of queue?

• In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end.

• In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.

• Both of the above

• None of the above

Following is C like pseudo code of a function that takes a number as an argument, and uses a stack S to do processing.

What does the above function do in general?

• Prints binary representation of n in reverse order

• Prints binary representation of n

• Prints the value of Logn

• Prints the value of Logn in reverse order