# Tag Archives: GATE-CS-2001

## GATE | GATE-CS-2001 | Question 50

Consider a relation geq which represents “greater than or equal to”, that is, (x,y) ∈ geq only if y >= x. create table geq (… Read More »

## GATE | GATE-CS-2001 | Question 49

Which of the following relational calculus expressions is not safe? (A) A (B) B (C) C (D) D Answer: (C) Explanation: A tuple relational calculus… Read More »

## GATE | GATE-CS-2001 | Question 48

R(A,B,C,D) is a relation. Which of the following does not have a lossless join, dependency preserving BCNF decomposition? (A) A->B, B->CD (B) A->B, B->C, C->D… Read More »

## GATE | GATE-CS-2001 | Question 47

Consider Peterson’s algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. repeat flag [i] =… Read More »

## GATE | GATE-CS-2001 | Question 46

Consider a machine with 64 MB physical memory and a 32-bit virtual address space. If the page size is 4KB, what is the approximate size… Read More »

## GATE | GATE-CS-2001 | Question 45

Which of the following does not interrupt a running process? (A) A device (B) Timer (C) Scheduler process (D) Power failure Answer: (C) Explanation: Scheduler… Read More »

## GATE | GATE-CS-2001 | Question 44

Consider the following program filter_none edit close play_arrow link brightness_4 code Program P2      var n: int:       procedure W(var x: int)       begin           x=x+1;           print x;         end … Read More »

## GATE | GATE-CS-2001 | Question 43

Consider the following three C functions : filter_none edit close play_arrow link brightness_4 code [PI] int * g (void)  {    int x= 10;    return (&x); … Read More »

## GATE | GATE-CS-2001 | Question 42

What is printed by the print statements in the program P1 assuming call by reference parameter passing? Program P1() { x = 10; y =… Read More »

## GATE | GATE-CS-2001 | Question 41

What is the minimum number of stacks of size n required to implement a queue of size n? (A) One (B) Two (C) Three (D)… Read More »

## GATE | GATE-CS-2001 | Question 50

How many undirected graphs (not necessarily connected) can be constructed out of a given set V = {v1, v2, … vn} of n vertices? (A)… Read More »

## GATE | GATE-CS-2001 | Question 39

Consider an undirected unweighted graph G. Let a breadth-first traversal of G be done starting from a node r. Let d(r,u) and d(r,v) be the… Read More »

## GATE | GATE-CS-2001 | Question 38

Consider the following data path of a simple non-pilelined CPU. The registers A, B, A1, A2, MDR, the bus and the ALU are 8-bit wide.… Read More »

## GATE | GATE-CS-2001 | Question 50

Consider the circuit given below with initial state Q0 =1, Q1 = Q2 = 0. The state of the circuit is given by the value… Read More »

## GATE | GATE-CS-2001 | Question 37

Consider the circuit shown below. The output of a 2:1 Mux is given by the function (ac’ + bc). Which of the following is true?… Read More »