Data Structures and Algorithms Quiz No.1

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

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

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

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

Which of the following are themselves a collection of different data types?

• String

• Struct

• char

• all

Example of linear data structure except

• array

• tree

• queue

• stack

_________________ is a collection of elements used to store the same type of data.

• Array
• Switch
• Case
• Loop

Which of these data structures is LIFO?

• Stack

• Queue

• Binary Tree

• Double linked list