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

## GATE | GATE-CS-2015 (Set 3) | Question 50

Let G be connected undirected graph of 100 vertices and 300 edges. The weight of a minimum spanning tree of G is 500. When the… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 49

Consider the following recursive C function. If get(6) function is being called in main() then how many times will the get() function be invoked before… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 48

In the network 200.10.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 47

Suppose Xi for i = 1, 2, 3 are independent and identically distributed random variables whose probability mass functions are Pr[Xi = 0] = Pr[Xi… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 46

Since it is a network that uses switch, every packet goes through two links, one from source to switch and other from switch to destination.… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 45

Consider the equation (43)x = (y3)8 where x and y are unknown. The number of possible solutions is ________. (A) 3 (B) 4 (C) 5… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 65

For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time? Process Arrival Time Processing… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 43

If the following system has non-trivial solution, px + qy + rz = 0 qx + ry + pz = 0 rx + py +… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 42

Which of the following languages are context-free? L1 = {ambnanbm ⎪ m, n ≥ 1} L2 = {ambnambn ⎪ m, n ≥ 1} L3 =… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 41

Consider the following grammar G. S → F ⎪ H F → p ⎪ c H → d ⎪ c Where S, F and H… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 40

Consider the following two C code segments. Y and X are one and two dimensional arrays of size n and n × n respectively, where… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 40

Consider the following partial Schedule S involving two transactions T1 and T2. Only the read and the write operations have been shown. The read operation… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 65

Consider a network connecting two systems located 8000 kilometers apart. The bandwidth of the network is 500 × 106 bits per second. The propagation speed… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 37

Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates… Read More »

## GATE | GATE-CS-2015 (Set 3) | Question 65

Consider the following C program. filter_none edit close play_arrow link brightness_4 code # include  int main( ) {   static int a[] = {10, 20, 30,… Read More »