GATE | GATE-CS-2017 (Set 2) | Question 57

The next state table of a 2 bit saturating up-counter is given below. The counter is built as synchronous sequential circuit using T flip-flops. The… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 56

(A) θ(log log n) (B) θ(log n) (C) θ(sqrt(n)) (D) θ(n) Answer: (B) Explanation: T(n) = 2T(√n) + 1 Let n = 2m ==> T(2m)… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 55

Consider a binary code that consists only four valid codewords as given below. 00000, 01011, 10101, 11110 Let minimum Hamming distance of code be p… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 54

Consider a machine with byte addressable memory of 232 bytes divided into blocks of size 32 bytes. Assume a direct mapped cache having 512 cache… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 53

Consider the following program #include<stdio.h> #include<string.h> int main() { char * c = “GATECSIT2017”; char *p = c; printf(“%d”, (int)strlen(c+2[p]-6[p]-1)); return 0; } The Output… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 52

If the ordinary generating function of a sequence is: then a3-a0 is equal to: (A) 8 (B) 10 (C) 15 (D) 20 Answer: (C) Explanation:… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 51

P and Q are considering to apply for job. The probability that p applies for job is 1/4. The probability that P applies for job… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 50

Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Let L(M) be… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 49

Consider the following C function. int fun(int n) { int i, j; for (i = 1; i <= n ; i++) { for (j =… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 48

Consider the following languages. L1 = {ap | p is a prime number} L2 = {anbmc2m | n >= 0, m >= 0} L3 =… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 47

Consider the following snippet of a C program. Assume that swap(&x, &y) exchanges the contents of x and y. int main() { int array[] =… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 46

Consider the set of processes with arrival time(in milliseconds), CPU burst time (in milliseconds), and priority(0 is the highest priority) shown below. None of the… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 45

The pre-order traversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 44

If w, x, y, z are boolean variables, then which of the following in INCORRECT? (A) wx + w(x+y) + x(x+y) = x + wy… Read More »

GATE | GATE-CS-2017 (Set 2) | Question 43

Consider two hosts X and Y, connected by a single direct link of rate 106 bits/sec. The distance between the two hosts is 10,000 km… Read More »