# Tag Archives: GATE IT 2006 (adsbygoogle = window.adsbygoogle || []).push({});

## GATE | GATE IT 2006 | Question 41

The data path shown in the figure computes the number of 1s in the 32-bit input word corresponding to an unsigned even integer stored in… Read More »

## GATE | GATE IT 2006 | Question 40

The memory locations 1000, 1001 and 1020 have data values 18, 1 and 16 respectively before the following program is executed.<br> MOVI      … Read More »

## GATE | GATE IT 2006 | Question 39

Which of the following statements about relative addressing mode is FALSE? (A) It enables reduced instruction size (B) It allows indexing of array elements with… Read More »

## GATE | GATE IT 2006 | Question 38

When multiplicand Y is multiplied by multiplier X = xn – 1xn-2 ….x0 using bit-pair recoding in Booth’s algorithm, partial products are generated according to… Read More »

## GATE | GATE IT 2006 | Question 37

For a state machine with the following state diagram the expression for the next state S+ in terms of the current state S and the… Read More »

## GATE | GATE IT 2006 | Question 36

The majority function is a Boolean function f(x, y, z) that takes the value 1 whenever a majority of the variables x, y, z and… Read More »

## GATE | GATE IT 2006 | Question 35

The boolean function for a combinational circuit with four inputs is represented by the following Karnaugh map. Which of the product terms given below is… Read More »

## GATE | GATE IT 2006 | Question 34

In the context-free grammar below, S is the start symbol, a and b are terminals, and ϵ denotes the empty string. S → aSAb |… Read More »

## GATE | GATE IT 2006 | Question 33

Consider the pushdown automaton (PDA) below which runs over the input alphabet (a, b, c). It has the stack alphabet {Z0, X} where Z0 is… Read More »

## GATE | GATE IT 2006 | Question 32

Let L be a context-free language and M a regular language. Then the language L ∩ M is (A) always regular (B) never regular (C)… Read More »

## GATE | GATE IT 2006 | Question 31

Which of the following languages is accepted by a non-deterministic pushdown automaton (PDA) but NOT by a deterministic PDA? (A) {anbncn ∣ n≥0} (B) {albmcn… Read More »

## GATE | GATE IT 2006 | Question 30

Which of the following statements about regular languages is NOT true? (A) Every language has a regular superset (B) Every language has a regular subset… Read More »

## GATE | GATE IT 2006 | Question 29

Consider the regular grammar below S → bS | aA | ϵ A → aS | bA The Myhill-Nerode equivalence classes for the language generated… Read More »

## GATE | GATE IT 2006 | Question 28

The following definite integral evaluates to (A) 1/2 (B) √10 (C) None Answer: (C) Explanation:   This solution is contributed by Anil Saikrishna Devarasetty.Quiz of… Read More »

## GATE | GATE IT 2006 | Question 27

Match the following iterative methods for solving algebraic equations and their orders of convergence. (A) I-R, II-S, III-P, IV-Q (B) I-S, II-R, III-Q, IV-P (C)… Read More »