## GATE | GATE CS 1996 | Question 30

Newton-Raphson iteration formula for finding 3√c, where c > 0 is               . (A) a (B) b (C) c… Read More »

## GATE | GATE CS 1996 | Question 29

Which one of the following is false? (A) The set of all bijective functions on a finite set forms a group under function composition. (B)… Read More »

## GATE | GATE CS 1996 | Question 28

Which of the following is false? Read ∧ as AND, ∨ as OR, ∼ as NOT, → as one way implication and ↔ as two… Read More »

## GATE | GATE CS 1996 | Question 27

Let R be a non-empty relation on a collection of sets defined by A R B if and only if A ∩ B = φ.… Read More »

## GATE | GATE CS 1996 | Question 26

Let R denote the set of real numbers. Let f:R×R→R×R be a bijective function defined by f(x,y)= (x+y,x−y). The inverse function of f is given… Read More »

## GATE | GATE CS 1996 | Question 25

Consider the following floating point number representation       The exponent is in 2’s complement representation and mantissa is in the sign magnitude representation.… Read More »

## GATE | GATE CS 1996 | Question 24

For the daisy chain scheme of connecting I/O devices, which of the following statement is true? (A) It gives non-uniform priority to various devices (B)… Read More »

## GATE | GATE CS 1996 | Question 23

Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is (A) 101010 ………1010 (B) 100000 ………0001 (C) 111111 ………1111 (D) 011111 ………1110… Read More »

## GATE | GATE CS 1996 | Question 22

Number of machine cycles required for RET instruction in 8085 microprocessor is (A) 1 (B) 2 (C) 3 (D) 5 Answer: (C) Explanation: Quiz of… Read More »

## GATE | GATE CS 1996 | Question 21

A ROM is used to store the table for multiplication of two 8-bit unsigned integers. The size of ROM required is   (A) 256 x… Read More »

## GATE | GATE CS 1996 | Question 20

Which of the following is an example of a spooled device? (A) a line printer used to print the output of a number of jobs… Read More »

## GATE | GATE CS 1996 | Question 20

A critical section is a program segment (A) which should run in a certain specified amount of time (B) which avoids deadlocks (C) where shared… Read More »

## GATE | GATE CS 1996 | Question 19

A critical section is a program segment (A) which should run in a certain specified amount of time (B) which avoids deadlocks (C) where shared… Read More »

## GATE | GATE CS 1996 | Question 18

The process state transition diagram in below figure is representative of                 (A) a batch operating system (B)… Read More »

## GATE | GATE CS 1996 | Question 17

The pass number for each of the following activities i. object code generation ii. literals added to literal table iii. listing printed iv. address resolution… Read More »