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 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:
Show Hint
Solution and Explanation
Each vertex \( i \) has directed edges to \( i+1 \) and \( i+2 \), if they exist.
The adjacency list is sorted in decreasing order, meaning DFS explores the highest-numbered neighbor first.
Step 2: DFS traversal starting from vertex 0.
DFS starts at 0 and always visits the highest-numbered connected vertex first.
This results in the traversal order: 0, 2, 4, ..., reaching 100 first.
After backtracking, vertices in the range \( 1, 3, 5, \dots \) get visited.
Step 3: Counting vertices discovered after vertex 50.
Since DFS reaches 100 before backtracking, all vertices from 51 to 100 are discovered after 50.
The number of such vertices is \( 100 - 25 = 75 \).
Thus, the number of vertices discovered after vertex 50 is: \[ 75. \]
Top Questions on Data Structures
- 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 sumThe value of \( sum \) output by a program executing the above pseudocode is:- GATE DA - 2025
- Computer Science
- Data Structures
- 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:
- GATE DA - 2025
- Computer Science
- Data Structures
- 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.
- CUET (UG) - 2023
- Computer Science
- Data Structures
- A loop within a loop (nested loop) have time complexity ______.
- CUET (UG) - 2023
- Computer Science
- Data Structures
- 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 :- CUET (UG) - 2023
- Computer Science
- Data Structures
Questions Asked in GATE DA exam
- Consider the following Python code snippet.
def f(a, b): if (a == 0): return b if (a % 2 == 1): return 2 * f((a - 1) / 2, b) return b + f(a - 1, b) print(f(15, 10))The value printed by the code snippet is 160 (Answer in integer).- GATE DA - 2025
- Recursion
Consider the following tables, Loan and Borrower, of a bank.
Query: \[ \pi_{\text{branch\_name}, \text{customer\_name}} (\text{Loan} \bowtie \text{Borrower}) \div \pi_{\text{branch\_name}}(\text{Loan}) \] where \( \bowtie \) denotes natural join. The number of tuples returned by the above relational algebra query is 1 (Answer in integer).- GATE DA - 2025
- Relational Algebra
- Let \( D = \{ x^{(1)}, x^{(2)}, \dots, x^{(n)} \} \) be a dataset of \( n \) observations where each \( x^{(i)} \in \mathbb{R}^{100} \). It is given that
\[ \sum_{i=1}^{n} x^{(i)} = 0. \] The covariance matrix computed from \( D \) has eigenvalues \( \lambda_i = 100^2 - i \), for \( 1 \leq i \leq 100 \). Let \( u \in \mathbb{R}^{100} \) be the direction of maximum variance with \( u^T u = 1 \). The value of
\[ \frac{1}{n} \sum_{i=1}^{n} \left( u^T x^{(i)} \right)^2 = \underline{\hspace{2cm}} \quad \text{(Answer in integer)} \]- GATE DA - 2025
- Matrix algebra
Let \( G \) be a simple, unweighted, and undirected graph. A subset of the vertices and edges of \( G \) are shown below.
It is given that \( a - b - c - d \) is a shortest path between \( a \) and \( d \); \( e - f - g - h \) is a shortest path between \( e \) and \( h \); \( a - f - c - h \) is a shortest path between \( a \) and \( h \). Which of the following is/are NOT the edges of \( G \)?- GATE DA - 2025
- Graph Theory
- Consider a database relation \( R \) with attributes \( A, B, C, D, E, F, G \), and having the following functional dependencies: \[ A \rightarrow BCEF \quad E \rightarrow DG \quad BC \rightarrow A \] Which of the following statements is/are correct?
- GATE DA - 2025
- Database Management Systems