## Aptitude | GATE CS 1998 | Question 44

Formatting of a floppy disk refers to (A) arranging the data on the disk in contiguous fashion (B) writing the directory (C) erasing the system… Read More »

## Aptitude | GATE CS 1998 | Question 43

Which of the following operation is commutative but not associative (A) AND (B) OR (C) NAND (D) EXOR Answer: (C) Explanation: Quiz of this Question… Read More »

## Aptitude | GATE CS 1998 | Question 42

The function represented by the Karnaugh map given below is: a.  A.B b.  AB+BC+CA c.  (B⊕C)’ d.  A.BC (A) a (B) b (C) c (D)… Read More »

## Aptitude | GATE CS 1998 | Question 41

Which of the following statement is false? (A) Every finite subset of a non-regular set is regular (B) Every subset of a regular set is… Read More »

## Aptitude | GATE CS 1998 | Question 40

Let L be the set of all binary strings whose last two symbols are same. The number of states in the minimal state deterministic finite-state… Read More »

## Aptitude | GATE CS 1998 | Question 39

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… Read More »

## Aptitude | GATE CS 1998 | Question 38

The binary relation  R= { (1, 1), (2, 1), (2, 2), (2, 3), (2, 4), (3, 1), (3, 2), (3, 3), (3, 4) } on… Read More »

## Aptitude | GATE CS 1998 | Question 37

Consider the following determinant Which of the following is a factor of Δ ? (A) a+b (B) a-b (C) a+b+c (D) abc Answer: (B) Explanation: (a-b)… Read More »

## Aptitude | GATE CS 1998 | Question 36

The rank of the matrix given below is: 1 4 8 7 0 0 3 0 4 2 3 1 3 12 24 21 (A)… Read More »

Uncategorized

## Aptitude | GATE CS 1998 | Question 35

There are 5 records in a database. Name Age Occupation Category Rama 27 CON A Abdul 22 ENG A Jeniffer 28 DOC B Maya 32… Read More »

## Aptitude | GATE CS 1998 | Question 34

Which normal form is considered adequate for normal relational database design? (A) 2NF (B) 5NF (C) 4NF (D) 3NF Answer: (D) Explanation: 3NF is sufficient… Read More »

## Aptitude | GATE CS 1998 | Question 33

Given two union compatible relations R1(A,B) and R2(C,D). What is the result of the operation R1⋈A=C∧ B=D R2    A. R1 ∪ R2 B. R1 Χ… Read More »

## Aptitude | GATE CS 1998 | Question 32

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… Read More »

## Aptitude | GATE CS 1998 | Question 31

A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4 V (signal) operations were completed on this semaphore. The resulting value… Read More »

## Aptitude | GATE CS 1998 | Question 30

When the result of a computation depends on the speed of the processes involved, there is said to be (A) cycle stealing (B) race condition… Read More »