FDS Quiz 1

A queue follows _________:

• a. LIFO principle

• b. FIFO principle

• c. Linear tree

• d. Ordered array

2. The time complexity used for inserting a node in a priority queue on the basis of key is:

• a. O(n)

• b. O(n2)

• c. O(nlogn)

• d. O(logn)

3. Which of these is a postfix expression?

• a. a+b-c

• b. +ab

• c. abc*+de-+

• d. a*b(c+d)

4. Which data structure do we use for testing a palindrome?

• a. Heap

• b. Tree

• c. Priority queue

• d. Stack

5.The time complexity of quicksort is ……..

• A. O(n)

• B. O(logn)

• C. O(n2)

• D. O(n logn)

6. Quick sort is also known as ……..

• A. merge sort

• B. tree sort

• C. shell sort

• D. partition and exchange sort

7……… form of access is used to add and remove nodes from a queue.

• A. LIFO, Last In First Out

• B. FIFO, First In First Out

• C. Both a and b

• D. None of these

8.The term push and pop is related to

• A. Array

• B. Lists

• C. Stacks

• D. Trees

9.Which of the following is an application of stack?

• A. finding factorial

• B. tower of Hanoi

• C. infix to postfix

• D. all of the above

10.The situation when in a linked list START=NULL is ….

• A. Underflow

• B. Overflow

• C. Houseful

• D. Saturated