## GATE | GATE-CS-2002 | Question 30

The Finite state machine described by the following state diagram with A as starting state, where an arc label is x / y and x… Read More »

## GATE | GATE-CS-2002 | Question 29

What are the states of the Auxiliary Carry (AC) and Carry Flag (dCY) after executing the following 8085 program? MVI L, 5DH MVI L, 6BH… Read More »

## GATE | GATE-CS-2002 | Question 28

Let f(A, B) = A’ + B. Simplified expression for function f(f(x + y, y)z) is : (A) x’ + z (B) xyz (C) xy’… Read More »

## GATE | GATE-CS-2002 | Question 27

Consider the following multiplexor where 10, 11, 12, 13 are four data input lines selected by two address line combinations A1A0 = 00, 01, 10,… Read More »

## GATE | GATE-CS-2002 | Question 50

Consider the following logic circuit whose inputs and function and output is f. f(dx, y, z) f1(dx, y, z) f2(dx, y, z) f3(dx, y, z)… Read More »

## GATE | GATE-CS-2002 | Question 25

Maximum number of edges in a n – node undirected graph without self loops is (A) n2 (B) n(n – 1)/2 (C) n – 1… Read More »

## GATE | GATE-CS-2002 | Question 24

In the absolute addressing mode (A) the operand is inside the instruction (B) the address of the operand is inside the instruction (C) the register… Read More »

## GATE | GATE-CS-2002 | Question 23

The optimal page replacement algorithm will select the page that (A) Has not been used for the longest time in the past. (B) Will not… Read More »

## GATE | GATE-CS-2002 | Question 22

Which of the following scheduling algorithms is non-preemptive? (A) Round Robin (B) First-In First-Out (C) Multilevel Queue Scheduling (D) Multilevel Queue Scheduling with Feedback Answer:… Read More »

## GATE | GATE-CS-2002 | Question 21

In 2′ s complement addition, overflow (A) is flagged whenever there is carry from sign bit addition (B) cannot occur when a positive value is… Read More »

## GATE | GATE-CS-2002 | Question 20

With regard to the expressive power of the formal relational query languages, which of the following statements is true? (A) Relational algebra is more powerful… Read More »

## GATE | GATE-CS-2002 | Question 23

Relation R with an associated set of functional dependencies, F is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set… Read More »

## GATE | GATE-CS-2002 | Question 18

The results returned by functions under value-result and reference parameter passing conventions (A) Do not differ (B) Differ in the presence of loops (C) Differ… Read More »

## GATE | GATE-CS-2002 | Question 17

In the C language (A) At most one activation record exists between the current activation record and the activation record for the main (B) The… Read More »

## GATE | GATE-CS-2002 | Question 16

Sign extension is a step in (A) floating point multiplication (B) signed 16 bit integer addition (C) arithmetic left shift (D) converting a signed integer… Read More »