List of top Computer Science Questions on Data Structures

Name any four operations on data structures.

Sequence the given process for checking whether a string is a palindrome or not, using a deque:
(A) Load the string into the deque.
(B) Continuously remove characters from both ends.
(C) Compare the characters.
(D) Determine if the string is a palindrome based on the comparisons.

STACK follows __________ principle, where insertion and deletion is from __________ end/ends only.

Given a scenario: Suppose there is a web-server hosting a website to declare results. This server can handle a maximum of 100 concurrent requests to view results. So, as to serve thousands of user requests, a __________ would be the most appropriate data structure to use.

Consider a hash table of size 10 with indices \( \{0, 1, \dots, 9\} \), with the hash function \[ h(x) = 3x \, (\text{mod} \, 10), \] where linear probing is used to handle collisions. The hash table is initially empty and then the following sequence of keys is inserted into the hash table: 1, 4, 5, 6, 14, 15. The indices where the keys 14 and 15 are stored are, respectively:

Consider the following pseudocode.

Create empty stack S
Set x = 0, flag = 0, sum = 0
Push x onto S
while (S is not empty){
    if (flag equals 0){
        Set x = x + 1
        Push x onto S
    }
    if (x equals 8):
        Set flag = 1
    if (flag equals 1){
        x = Pop(S)
        if (x is odd):
            Pop(S)
        Set sum = sum + x
    }
}
Output sum

The value of \( sum \) output by a program executing the above pseudocode is:

Consider a directed graph \( G = (V,E) \), where \( V = \{0,1,2,\dots,100\} \) and
\[ E = \{(i,j) : 0 < j - i \leq 2, \text{ for all } i,j \in V \}. \] Suppose the adjacency list of each vertex is in decreasing order of vertex number, and depth-first search (DFS) is performed at vertex 0. The number of vertices that will be discovered after vertex 50 is:

Consider the following pseudocode.

Create empty stack S
Set x = 0, flag = 0, sum = 0
Push x onto S
while (S is not empty){
    if (flag equals 0){
        Set x = x + 1
        Push x onto S
    }
    if (x equals 8):
        Set flag = 1
    if (flag equals 1){
        x = Pop(S)
        if (x is odd):
            Pop(S)
        Set sum = sum + x
    }
}
Output sum

The value of \( sum \) output by a program executing the above pseudocode is:

Consider a directed graph \( G = (V,E) \), where \( V = \{0,1,2,\dots,100\} \) and \[ E = \{(i,j) : 0<j - i \leq 2, \text{ for all } i,j \in V \}. \] Suppose the adjacency list of each vertex is in \textit{decreasing order of vertex number, and depth-first search (DFS) is performed at vertex 0. The number of vertices that will be discovered after vertex 50 is:}

What is the time complexity of a binary search algorithm on a sorted array?

Which data structure follows the Last-In-First-Out (LIFO) principle?

In the context of graph algorithms, what is the significance of Dijkstra’s algorithm?

Which sorting algorithm has the best average-case time complexity?

In a binary tree, what is the maximum number of nodes at level k?

Which of the following is/are correct about double ended queue ?
A. Insertion and deletion operation perform only at rear side
B. Insertion and deletion operation perform only at front end
C. Insertion and deletion operation performs at both front and rear end
D. Vehicles in a high-way toll tax booth are served following the principles of deque
E. To implementation of deque used list data type in python
Choose the correct answer from the options given below :

A loop within a loop (nested loop) have time complexity ______.

A class teacher wants to manage her class Result in her computer using Pandas. Help her to choose the data structure which is best suited for her to manage class result.

Which term is used to add an element into a stack?

Match List I with List II