GK

1. Print Server uses ….. which is a buffer that holds data before it is send to the printer
   (A) Queue
   (B) Stack
   (C) Spool
   (D) None of the above
   
   Answer

   (C) Spool
2. …… is a balanced binary search tree in which the difference between the height of any node’s left and right sub tree is at most one.
   (A) AVL Tree
   (B) Red-Black Tree
   (C) 2-3-4 Tree
   (D) None of the above
   
   Answer

   (A) AVL Tree
3. Enqueue means to insert an item into the ……. of the Queue
   (A) front
   (B) rear
   (C) middle
   (D) None of the above
   
   Answer

   (B) rear
4. The process of deleting an element from the top of stack is called ….. operation
   (A) POP
   (B) PUSH
   (C) Both (A) & (B)
   (D) None of the above
   
   Answer

   (A) POP
5. Merge Sort is based on ……..
   (A) Greedy approach
   (B) Backtracking algorithm
   (C) Divide and Conquer method
   (D) None of the above
   
   Answer

   (C) Divide and Conquer method
6. Post order traversal is also known as……
   (A) depth-first order
   (B) end order
   (C) symmetric order
   (D) None of the above
   
   Answer

   (B) end order
7. A queue is a ……. data structure
   (A) Last In First Out (LIFO)
   (B) Linear Array
   (C) First In First Out (FIFO)
   (D) None of the above
   
   Answer

   (C) First In First Out (FIFO)
8. Which of the following data structure stores homogeneous data elements?
   (A) Record
   (B) Pointer
   (C) Linear Array
   (D) None of the above
   
   Answer

   (C) Linear Array
9. An algorithm that calls itself directly or indirectly is called ……
   (A) Iteration
   (B) Recursion
   (C) Traversal
   (D) None of the above
   
   Answer

   (B) Recursion
10. Which of the following is used to find the location of an element with a given value?
    (A) Search
    (B) Iteration
    (C) Traversal
    (D) None of the above
    
    Answer

    (A) Search