πŸ“Š Data Structure (DS)
Q. Which data structure is used in breadth first search of a graph to hold nodes?
  • (A) stack
  • (B) queue
  • (C) tree
  • (D) array
πŸ’¬ Discuss
βœ… Correct Answer: (B) queue
πŸ“Š Data Structure (DS)
Q. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
  • (A) input restricted dequeue
  • (B) output restricted qequeue
  • (C) priority queues
  • (D) stack
πŸ’¬ Discuss
βœ… Correct Answer: (A) input restricted dequeue
πŸ“Š Data Structure (DS)
Q. Which of the following data structure is non linear type?
  • (A) strings
  • (B) lists
  • (C) stacks
  • (D) graph
πŸ’¬ Discuss
βœ… Correct Answer: (D) graph
πŸ“Š Data Structure (DS)
Q. To represent hierarchical relationship between elements, Which data structure is suitable?
  • (A) dequeue
  • (B) priority
  • (C) tree
  • (D) graph
πŸ’¬ Discuss
βœ… Correct Answer: (C) tree
πŸ“Š Data Structure (DS)
Q. A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
  • (A) weakly connected
  • (B) strongly connected
  • (C) tightly connected
  • (D) linearly connected
πŸ’¬ Discuss
βœ… Correct Answer: (B) strongly connected
πŸ“Š Data Structure (DS)
Q. In the …………….. traversal we process all of a vertex’s descendants before we move to an adjacent vertex.
  • (A) depth first
  • (B) breadth first
  • (C) with first
  • (D) depth limited
πŸ’¬ Discuss
βœ… Correct Answer: (A) depth first
πŸ“Š Data Structure (DS)
Q. The number of comparisons done by sequential search is ………………
  • (A) (n/2)+1
  • (B) (n+1)/2
  • (C) (n-1)/2
  • (D) (n+2)/2
πŸ’¬ Discuss
βœ… Correct Answer: (B) (n+1)/2

Jump to