Skip to content

Category Archives: GATE

Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On a demand paged virtual memory system running on… Read More
A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect block address and 1 doubly indirect block… Read More
Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by… Read More
A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this… Read More
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4… Read More
How many onto (or surjective) functions are there from an n-element (n >= 2) set to a 2-element set? (A) 2n (B) 2n – 1… Read More
Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted. Program main; Var ... Procedure A1; Var ...… Read More
Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation… Read More
A n Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: 245.248.128.0/20. The ISP wants to give half of… Read More
Suppose a fair six-sided die is rolled once. If the value on the die is 1, 2, or 3, the die is rolled a second time.… Read More
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location X, increments it by the value i, and returns the old value… Read More
Consider the 3 processes, P1, P2 and P3 shown in the table. Process Arrival time Time Units Required P1 0 5 P2 1 7 P3… Read More
Let G be a weighted graph with edge weights greater than one and G’be the graph constructed by squaring the weights of edges in G.… Read More
The bisection method is applied to compute a zero of the function f(x) = x4 – x3 – x2 – 4 in the interval [1,9].… Read More
Consider the following transactions with data items P and Q initialized to zero: T1: read (P) ; read (Q) ; if P = 0 then… Read More

Start Your Coding Journey Now!