## GATE | GATE CS 1996 | Question 16

Relative mode of addressing is most relevant to writing (A) co-routines (B) position-independent code (C) shareable code (D) interrupt handerls Answer: (B) Explanation: Quiz of… Read More »

## GATE | GATE CS 1996 | Question 15

Which of the following sequences denotes the post order traversal sequence of the given tree? a / \ b e / \ / c d… Read More »

## GATE | GATE CS 1996 | Question 14

In the balanced binary tree in the below figure, how many nodes will become unbalanced when a node is inserted as a child of the… Read More »

## GATE | GATE CS 1996 | Question 13

An advantage of chained hash table (external hashing) over the open addressing scheme is (A) Worst case complexity of search operations is less (B) Space… Read More »

## GATE | GATE CS 1996 | Question 12

Consider the following statements: i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than… Read More »

## GATE | GATE CS 1996 | Question 11

Which of the following is false?               (A) a (B) b (C) c (D) d Answer: (B) Explanation: Quiz… Read More »

## GATE | GATE CS 1996 | Question 10

Let L ⊆ ∑* where ∑ = {a, b}. Which of the following is true? a). L= { x | x has an equal number of a‘s and… Read More »

## GATE | GATE CS 1996 | Question 9

Which of the following statements is false? (A) The Halting Problem of Turing machines is undecidable (B) Determining whether a context-free grammar is ambiguous is… Read More »

## GATE | GATE CS 1996 | Question 8

Which two of the following four regular expressions are equivalent? (ε is the empty string). (i). (00)*(ε+0) (ii). (00)* (iii). 0* (iv). 0(00)* (A) (i)… Read More »

## GATE | GATE CS 1996 | Question 7

Let Ax=b be a system of linear equations where A is an m×n matrix and b is a m×1 column vector and X is an… Read More »

## GATE | GATE CS 1996 | Question 6

The formula used to compute an approximation for the second derivative of a function f at a point X0 is          … Read More »

## GATE | GATE CS 1996 | Question 5

Two dice are thrown simultaneously. The probability  that at least one of them will have 6 facing up is (A) 1/36 (B) 1/3 (C) 25/36… Read More »

## GATE | GATE CS 1996 | Question 4

Which of the following statement is false? (A) The set of rational numbers is an abelian group under addition (B) The set of integers in… Read More »

## GATE | GATE CS 1996 | Question 3

Suppose X and Y are sets and |X| and |Y| are their respective cardinalities. It is given that there are exactly 97 functions from X… Read More »

## GATE | GATE CS 1996 | Question 2

Let X= {2, 3, 6, 12, 24}, Let ≤ be the partial order defined by X ≤ Y if x divides y. Number of edges… Read More »