# Tag Archives: GATE-GATE-CS-2015 (Set 1)

Consider a uniprocessor system executing three tasks T1, T2 and T3, each of which is composed of an infinite sequence of jobs (or instances) whichâ€¦ Read More
The least number of temporary variables required to create a three-address code in static single assignment form for the expression q + r/3 + sâ€¦ Read More
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edgesâ€¦ Read More
Suppose that the stop-and-wait protocol is used on a link with a bit rate of 64 kilobits per second and 20 milliseconds propagation delay. Assumeâ€¦ Read More
Consider the DFAs M and N given above. The number of states in a minimal DFA that accepts the language L(M) âˆ© L(N) is __________.â€¦ Read More
Consider the NPDA âŒ©Q = {q0, q1, q2}, Î£ = {0, 1}, Î“ = {0, 1, âŠ¥}, Î´, q0, âŠ¥, F = {q2}âŒª, where (asâ€¦ Read More
A variable x is said to be live at a statement Si in a program if the following three conditions hold simultaneously: 1. There existsâ€¦ Read More
Let an represent the number of bit strings of length n containing two consecutive 1s. What is the recurrence relation for an? (A) anâ€“2 +â€¦ Read More
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute (RPM). It has 600 sectors perâ€¦ Read More
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9,â€¦ Read More
Let G = (V, E) be a simple undirected graph, and s be a particular vertex in it called the source. For x âˆˆ V,â€¦ Read More
(A) 0 (B) -1 (C) 1 (D) infinite Answer: (B) Explanation: Let f(x) be the given function. We assume that $\frac{1}{x} = z$ Differentiating bothâ€¦ Read More
The graph shown below 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A,â€¦ Read More
Consider the following C program segment. while (first <= last) {    if (array [middle] < search)       first = middle +1;    else if (array [middle] ==â€¦ Read More
Consider an Entity-Relationship (ER) model in which entity sets E1 and E2 are connected by an m : n relationship R12, E1 and E3 areâ€¦ Read More