## GATE | GATE-CS-2002 | Question 35

Consider the following algorithm for searching for a given number x in an unsorted array A[1…..n] having n distinct values: 1. Choose an i uniformaly… Read More »

## GATE | GATE-CS-2002 | Question 34

The number of leaf nodes in a rooted tree of n nodes, with each node having 0 or 3 children is: (A) n/2 (B) (n… Read More »

## GATE | GATE-CS-2002 | Question 33

Consider the following declaration of a two dimensional array in C: filter_none edit close play_arrow link brightness_4 code char a; chevron_right filter_none Assuming that the… Read More »

## GATE | GATE-CS-2002 | Question 32

Horizontal microprogramming : (A) does not require use of signal decoders (B) results in larger sized microinstructions than vertical microprogramming (C) uses one bit for… Read More »

## GATE | GATE-CS-2002 | Question 31

The performance of a pipelined processor suffers if : (A) the pipeline stages have different delays (B) consecutive instructions are dependent on each other (C)… Read More »

## 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. Given that f1(dx, y, z) = ∑(0, 1, 3, 5), f2(dx, y,… 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 »