Data Structure - Stack and Queue

A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

• Queue linked list

• Stacks linked list

• Both of them

• Neither of them

Identify the data structure which allows deletions at both ends of the list but insertion at only one en

• Input restricted dequeue

• Output restricted qequeue

• Priority queues

• Stack

Which of the following statement is true?

i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.

ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.

• i-only

• ii-only

• Both i and ii

• None of the above

A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.

• circular queue

• random of queue

• priority

• dequeue

What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?

• Stack

• Linked list

• Queue

• Trees

The process of accessing data stored in a serial access memory is similar to manipulating data on a

• heap

• queue

• stack

• binary tree

Which data structure is needed to convert infix notation to postfix notation?

• heap

• queue

• stack

• binary tree

__________is a linear data structure in which an element can be added or removed only at one end.

• heap

• queue

• stack

• binary tree

In stack terminology, the __________operations are known as push and pop operations respectively.

• Delete

• Insert

• Both (a) and (b)

• None of the above

An infix expression can be converted to a postfix expression using a .................

• heap

• queue

• stack

• binary tree