Match List I with List II List I List II A Page replacement Policy I Circular wait B Deadlock II Page fault C Scheduling III Shortest job first D Dijakstra is banking algorithm IV Deadlock avoidance

The correct option is(B): A-II, B-I, C-III, D-IV

Match List I with List II LIST I A. Page replacement Policy B. Deadlock C. Scheduling D. Dijakstra is banking algorithm-Circular wait II. Page fault III. Shortest job first IV Deadlock avoidance

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:

View Solution

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:

View Solution

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:

View Solution

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.

View Solution

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

View Solution

Match List I with List II
List I List II
A Page replacement Policy I Circular wait
B Deadlock II Page fault
C Scheduling III Shortest job first
D Dijakstra is banking algorithm IV Deadlock avoidance

The Correct Option is B

Solution and Explanation

Top Questions on Data Structures

Questions Asked in CUET PG exam

	List I		List II
A	Page replacement Policy	I	Circular wait
B	Deadlock	II	Page fault
C	Scheduling	III	Shortest job first
D	Dijakstra is banking algorithm	IV	Deadlock avoidance

Match List I with List II List I List IIA Page replacement Policy ICircular waitBDeadlockIIPage fault CSchedulingIIIShortest job first DDijakstra is banking algorithmIVDeadlock avoidance

The Correct Option is B

Solution and Explanation

Top Questions on Data Structures

Questions Asked in CUET PG exam

Match List I with List II
List I List II
A Page replacement Policy I Circular wait
B Deadlock II Page fault
C Scheduling III Shortest job first
D Dijakstra is banking algorithm IV Deadlock avoidance