Tag Archives: GATE-GATE-CS-2000

GATE | GATE-CS-2000 | Question 49

Which function does NOT implement the Karnaugh map given below? (A) a (B) b (C) c (D) d Answer: (D) Explanation: As we know option… Read More »

GATE | GATE-CS-2000 | Question 33

The simultaneous equations on the Boolean variables x, y, z and w, have the following solution for x, y, z and w, respectively. (A) 0… Read More »

GATE | GATE-CS-2000 | Question 32

Consider the following decision problems: (P1) Does a given finite state machine accept a given string (P2) Does a given context free grammar generate an… Read More »

GATE | GATE-CS-2000 | Question 31

What can be said about a regular language L over {a} whose minimal finite state automaton has two states? (A) L must be {an| n… Read More »

GATE | GATE-CS-2000 | Question 30

Let a, b, c, d be propositions. Assume that the equivalences a ↔ (b V-b) and b ↔ c hold. Then the truth value of… Read More »

GATE | GATE-CS-2000 | Question 29

Let P(S) denotes the power set of set S. Which of the following is always true? (A) a (B) b (C) c (D) d Answer:… Read More »

GATE | GATE-CS-2000 | Question 49

A relation R is defined on the set of integers as xRy if f(x + y) is even. Which of the following state­ments is true?… Read More »

GATE | GATE-CS-2000 | Question 49

A polynomial p(x) satisfies the following: p(1) = p(3) = p(5) = 1 p(2) = p(4) = -1 The minimum degree of such a polynomial… Read More »

GATE | GATE-CS-2000 | Question 27

Which of the following statements is true? (A) S > T (B) S = T (C) S T (D) 2S <= T Answer: (A) Explanation:… Read More »

GATE | GATE-CS-2000 | Question 25

E1 and E2 are events in a probability space satisfying the following constraints: Pr(E1) = Pr(E2) Pr(EI U E2) = 1 E1 and E2 are… Read More »

GATE | GATE-CS-2000 | Question 24

X, Y and Z are closed intervals of unit length on the real line. The overlap of X and Y is half a unit. The… Read More »

GATE | GATE-CS-2000 | Question 23

Given the relations employee (name, salary, deptno) and department (deptno, deptname, address) Which of the following queries cannot be expressed using the basic relational algebra… Read More »

GATE | GATE-CS-2000 | Question 22

B+ -trees are preferred to binary trees in databases because (A) Disk capacities are greater than memory capacities (B) Disk access is much slower than… Read More »

GATE | GATE-CS-2000 | Question 49

Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes. Suppose each process P[i] executes the following: wait (m[i]); wait(m[(i+1) mode 4]); ——… Read More »

GATE | GATE-CS-2000 | Question 20

Which of the following need not necessarily be saved on a context switch between processes? (A) General purpose registers (B) Translation look aside buffer (C)… Read More »