Data Structures – Previous Year Questions
11 questions from past HTET PGT Computer Science papers, each with the correct answer. Open any question for its explanation.
- Toll Plaza simulation is an application of ..........
- A .......... is a container that implements Last-In-First-Out (LIFO) protocol.
- TOLL Plaza simulation is an application of ............. .
- Sum of degrees of all nodes for a graph G(V, E) can be given by ...... .
- In directed graph G(V, E) where V = {P, Q, R, S, T} and E = {PQ, RS, TP, PS, QR, PT, ST, QP, RQ, TS}, the vertex with maximum in- degree is .......... and vertex with maximum out-degree is ......... .
- Which of the following recurrence relation is related to worst case time complexity of quick sort ?
- A queue follows ……….. .
- Process of inserting an element in stack is called :
- If the elements 'A', 'B', 'C' and 'D' are placed in a queue and are deleted one at a time, in what order will these elements be removed ?
- In a stack, if a user tries to remove an element from an empty stack, it is called :
- A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear), is known as :