GATE CSE 1998


Q1.

Which of the following addressing modes permits relocation without any change whatsoever in the code?
GateOverflow

Q2.

Let A be a two dimensional array declared as follows: A: array [1 ... 10] [1 ... 15] of integer; Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location 100, what is the address of the element A[i][j]?
GateOverflow

Q3.

How many sub strings of different lengths (non-zero) can be formed from a character string of length n?
GateOverflow

Q4.

Which of the following statements is false?
GateOverflow

Q5.

A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?
GateOverflow

Q6.

Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?
GateOverflow

Q7.

Consider the function y=|x| in the interval [-1, 1]. In this interval, the function is
GateOverflow

Q8.

The number of functions from an m element set to an n element set is
GateOverflow

Q9.

In a room containing 28 people, there are 18 people who speak English, 15, people who speak Hindi and 22 people who speak Kannada. 9 persons speak both English and Hindi, 11 persons speak both Hindi and Kannada whereas 13 persons speak both Kannada and English. How many speak all three languages?
GateOverflow

Q10.

A multiplexer with a 4-bit data select input is a
GateOverflow