Sail E0 Webinar

MCQs

Total Questions : 50 | Page 2 of 5 pages
Question 11. Which of the following is not a technique to avoid a collision?
  1.    Make the hash function appear random
  2.    Use the chaining method
  3.    Use uniform hashing
  4.    Increasing hash table size
 Discuss Question
Answer: Option D. -> Increasing hash table size
Question 12. Stack is also called as
  1.    Last in first out
  2.    First in last out
  3.    Last in last out
  4.    First in first out
 Discuss Question
Answer: Option A. -> Last in first out
Question 13. Which among the below specified condition is applicable if the Queue is non - empty?
  1.    rear > front
  2.    rear < front
  3.    rear = front
  4.    Unpredictable
 Discuss Question
Answer: Option A. -> rear > front
Question 14. A FIFO structure implemented as a ring where the front and rear pointers can wrap around the end of the start of the array
  1.    Linear Queue
  2.    Circular Queue
  3.    Priority Queue
  4.    none of the above
 Discuss Question
Answer: Option B. -> Circular Queue
Question 15. Storage for data defined in terms of set of operations to be performed on the data
  1.    Arrays
  2.    Variables
  3.    Abstract Data Types
  4.    Algorithms
 Discuss Question
Answer: Option C. -> Abstract Data Types
Question 16. Consider the following operation performed on a stack of size 5
  1.    1
  2.    2
  3.    3
  4.    4
 Discuss Question
Answer: Option A. -> 1
Question 17. A complete binary tree with 5 levels has how many nodes? (Root is Level 1)
  1.    Op 1: 15
  2.    Op 2: 25
  3.    Op 3: 63
  4.    Op 4: 31
 Discuss Question
Answer: Option D. -> Op 4: 31
Question 18. Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first partitioning with the array looking like this:2 5 1 7 9 12 11 10Identify the correct statement?
  1.    Neither the 7 nor the 9 is the pivot.
  2.    The pivot could be either the 7 or the 9.
  3.    The pivot is not the 7, but it could be the 9.
  4.    The pivot could be the 7, but it is not the 9.
 Discuss Question
Answer: Option B. -> The pivot could be either the 7 or the 9.
Question 19. A tree is composed of ____ connected by edges or lines
  1.    Fruit 
  2.    Leaf Node
  3.    Root Node
  4.    Nodes
 Discuss Question
Answer: Option D. -> Nodes
Question 20. Insertion in Queue is done at_____ end , and deletion is at _______ end
  1.    start, last
  2.    front, rear
  3.    rear, front
  4.    begin, stop
 Discuss Question
Answer: Option C. -> rear, front

Latest Videos

Latest Test Papers