Which of the following correctly matches a data structure with a common operation?

Options

  • A. Stack - Push and Pop
  • B. Queue - Enqueue and Dequeue
  • C. Array - Indexed Access
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

D. More than one of the above

Detailed Explanation

All three matches are correct. A stack commonly uses push to insert and pop to remove an element, following the LIFO principle. A queue uses enqueue for insertion and dequeue for removal, following FIFO. An array provides indexed access, normally in O(1) time. Therefore, more than one of the listed statements is correct, making option D the appropriate answer under the given BPSC-style options.
← Previous Next →

Attempt Quiz Now:

BPSC TRE 4 DSA Practice set 1

Feature Posts