DSA TEST 3

1.Which of the following is a linear data structure?

• Binary Trees

• Array

• AVL Trees

• Graphs

2.When a pop() operation is called on an empty queue, what is the condition called?

• Overflow

• Underflow

• Syntax Error

• Garbage Value

3.PUSH Operation is ------ an item

• add

• delete

• update

• none

4. POP operation is ----- an item.

• add

• update

• delete

• none

5. Queue is also called as-----

• FIFO

• LIFO

• LILO

• None

6.Enqueue is also called as-----

• insertion

• deletion

• updation

• none

7.Dequeue is also called as-----.

• deletion

• updation

• insertion

• none

8.Infix Notation is ----

• a*b

• ^b

• c*

• None

9.Postfix Notation is -----

• =b

• a-b

• c-

• None

10.Prefix Notation is-----

• -c

• a+b

• d_

• None