# Tag Archives: GATE-GATE-CS-2001

## GATE | GATE-CS-2001 | Question 35

The 2’s complement representation of (−539)10 in hexadecimal is (A) ABE (B) DBC (C) DE5 (D) 9E7 Answer: (C) Explanation: -53910 = 1 010 0001… Read More »

## GATE | GATE-CS-2001 | Question 34

Which is the most appropriate match for the items in the first column with the items in the second column X. Indirect Addressing I. Array… Read More »

## GATE | GATE-CS-2001 | Question 33

Consider the following circuit with initial state Q0 = Q1 = 0. The D Flip-flops are positive edged triggered and have set up times 20… Read More »

## GATE | GATE-CS-2001 | Question 32

Consider the following problem X. Given a Turing machine M over the input alphabet Σ, any state q of M And a word w∈Σ*, does… Read More »

## GATE | GATE-CS-2001 | Question 31

Consider the following languages Which of the languages are regular? (A) Only L1 and L2 (B) Only L2, L3 and L4 (C) Only L3 and… Read More »

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

Consider a DFA over ∑ = {a, b} accepting all strings which have number of a’s divisible by 6 and number of b’s divisible by… Read More »

## GATE | GATE-CS-2001 | Question 29

Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day? (A) 1/77 (B) 1/76 (C)… Read More »

## GATE | GATE-CS-2001 | Question 28

Let f: A→B be a function, and let E and F be subsets of A. Consider the following statements about images. S1: f (E ∪… Read More »

## GATE | GATE-CS-2001 | Question 27

Consider the following statements: S1: There exists infinite sets A, B, C such that A ∩ (B ∪ C) is finite. S2: There exists two… Read More »

## GATE | GATE-CS-2001 | Question 26

How many 4-digit even numbers have all 4 digits distinct? (A) 2240 (B) 2296 (C) 2620 (D) 4536 Answer: (B) Explanation: This is a basic… Read More »

## GATE | GATE-CS-2001 | Question 25

Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. then the… Read More »

## GATE | GATE-CS-2001 | Question 24

Suppose the adjacency relation of vertices in a graph is represented in a table Adj(X,Y). Which of the following queries cannot be expressed by a… Read More »

## GATE | GATE-CS-2001 | Question 23

Consider a schema R(A,B,C,D) and functional dependencies A->B and C->D. Then the decomposition of R into R1(AB) and R2(CD) is (A) dependency preserving and lossless… Read More »

## GATE | GATE-CS-2001 | Question 22

Which of the following requires a device driver? (A) Register (B) Cache (C) Main memory (D) Disk Answer: (D) Explanation: A disk driver is software… Read More »

## GATE | GATE-CS-2001 | Question 21

Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory… Read More »