UTpaper

Free mock tests & test series

Question 87Asked in BPSC TRE 3.0 (2024) Computer Science Class 11-12

Which data structure is used for efficient searching, insertion, and deletion of elements?

  1. AStack
  2. BQueue
  3. CHash Table
  4. DMore than one of the above
  5. ENone of the above
Show answerHide answer

Correct answer: (C) Hash Table

Explanation

A hash table supports search, insertion and deletion in O(1) average time. A stack or queue only gives access at its ends.

From BPSC TRE 3.0 (2024) Computer Science Class 11-12 — Previous Year Paper

This is question 87 of BPSC TRE 3.0 (2024) Computer Science Class 11-12 — Previous Year Paper. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.