10 PYQ related to Data Structures

on

PYQ related to Data Structures for UGC NET, SET, GATE, ASSISTANT PROFESSOR COMPUTER SCIENCE

  1. GATE CS 2020
    Which of the following data structures is best suited for implementing a priority queue?
    A) Stack
    B) Queue
    C) Heap
    D) Linked List
    Answer: C) Heap
    Explanation: A heap allows efficient insertions and deletion of the highest priority element in O(log n) time.

  2. UGC NET 2021
    Which data structure uses the concept of LIFO (Last In, First Out)?
    A) Queue
    B) Stack
    C) Linked List
    D) Tree
    Answer: B) Stack
    Explanation: A stack follows the LIFO principle, where the last element inserted is the first to be removed.

  3. ISRO Scientist 2018
    Which traversal technique in a binary tree uses a queue data structure?
    A) In-order Traversal
    B) Pre-order Traversal
    C) Post-order Traversal
    D) Level-order Traversal
    Answer: D) Level-order Traversal
    Explanation: Level-order traversal of a binary tree uses a queue to process nodes level by level.

  4. GATE CS 2019
    Which of the following data structures is not suitable for binary search?
    A) Sorted Array
    B) Linked List
    C) Balanced Binary Search Tree (BST)
    D) Skip List
    Answer: B) Linked List
    Explanation: A linked list does not provide direct access to the middle element, making binary search inefficient.

  5. NIELIT Scientist B 2020
    Which data structure efficiently supports insertions and deletions from both ends?
    A) Stack
    B) Queue
    C) Deque
    D) Priority Queue
    Answer: C) Deque
    Explanation: A deque (double-ended queue) allows insertion and deletion from both ends efficiently.

  6. GATE CS 2017
    Which data structure is used in the implementation of DFS (Depth First Search)?
    A) Queue
    B) Stack
    C) Priority Queue
    D) Hash Table
    Answer: B) Stack
    Explanation: DFS uses a stack (either explicitly or through recursion) to explore nodes.

  7. UGC NET 2020
    Which of the following operations is most efficiently performed by a hash table?
    A) Sorting
    B) Searching
    C) Traversing
    D) Merging
    Answer: B) Searching
    Explanation: Hash tables provide O(1) time complexity for searching in the average case.

  8. GATE CS 2018
    Which data structure is most suitable for evaluating arithmetic expressions in postfix notation?
    A) Queue
    B) Stack
    C) Linked List
    D) Tree
    Answer: B) Stack
    Explanation: Postfix expressions are evaluated using a stack, where operands are pushed, and operators are applied to the top elements.

  9. NIELIT Scientist B 2021
    Which of the following data structures allows efficient merging of two sorted lists?
    A) Array
    B) Linked List
    C) Binary Search Tree
    D) AVL Tree
    Answer: B) Linked List
    Explanation: Two sorted linked lists can be merged efficiently in O(n + m) time by adjusting pointers.

  10. GATE CS 2021
    Which of the following is the most suitable data structure for implementing Dijkstra’s shortest path algorithm?
    A) Stack
    B) Queue
    C) Priority Queue
    D) Deque
    Answer: C) Priority Queue
    Explanation: Dijkstra’s algorithm uses a priority queue to pick the vertex with the minimum distance efficiently.


Comments

Post a Comment