## GATE | GATE-CS-2007 | Question 40

Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty,… Read More »

## GATE | GATE-CS-2007 | Question 39

The inorder and preorder traversal of a binary tree are d b e a f c g and a b d e c f g,… Read More »

## GATE | GATE-CS-2007 | Question 38

The following postfix expression with single digit operands is evaluated using a stack: 8 2 3 ^ / 2 3 * + 5 1 *… Read More »

## GATE | GATE-CS-2007 | Question 37

Consider a pipelined processor with the following four stages: IF: Instruction Fetch ID: Instruction Decode and Operand Fetch EX: Execute WB: Write Back The IF,… Read More »

## GATE | GATE-CS-2007 | Question 85

The control signal functions of a 4-bit binary counter are given below (where X is “don’t care”) The counter is connected as follows: The counter… Read More »

## GATE | GATE-CS-2007 | Question 85

In a look-ahead carry generator, the carry generate function Gi and the carry propagate function Pi for inputs Ai and Bi are given by: Pi… Read More »

## GATE | GATE-CS-2007 | Question 85

Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of n variables. What is the minimum size… Read More »

## GATE | GATE-CS-2007 | Question 85

Define the connective * for the Boolean variables X and Y as: X * Y = XY + X’ Y’. Let Z = X *… Read More »

## GATE | GATE-CS-2007 | Question 85

Let f(w, x, y, z) = ∑(0, 4, 5, 7, 8, 9, 13, 15). Which of the following expressions are NOT equivalent to f? (A)… Read More »

## GATE | GATE-CS-2007 | Question 31

Which of the following languages is regular? (A) A (B) B (C) C (D) D Answer: (C) Explanation: (C) Strings which are the part of… Read More »

## GATE | GATE-CS-2007 | Question 30

The language L= {0i21i | i≥0 } over the alphabet {0,1, 2} is: (A) not recursive (B) is recursive and is a deterministic CFL. (C)… Read More »

## GATE | GATE-CS-2007 | Question 29

A minimum state deterministic finite automaton accepting the language L={w | w ε {0,1} *, number of 0s and 1s in w are divisible by… Read More »

## GATE | GATE-CS-2007 | Question 28

Consider the series Xn+1 = Xn/2 + 9/(8 Xn), X0 = 0.5 obtained from the Newton-Raphson method. The series converges to (A) 1.5 (B) sqrt(2)… Read More »

## GATE | GATE-CS-2007 | Question 27

(A) A (B) B (C) C (D) D Answer: (A) Explanation: To be basis of subspace x, 2 conditions are to be fulfilled 1) They… Read More »

## GATE | GATE-CS-2007 | Question 26

(A) A (B) B (C) C (D) D Answer: (C) Explanation: A partition is said to refine another partition if it splits the sets in… Read More »