• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE CS 1999

Question 41

Zero has two representations in: a) Sign magnitude b) 1\'s complement c) 2\'s complement d) None of the above
  • Only a
  • a and b
  • a and c
  • a, b and c

Question 42

RAID configurations of disks are used to provide
  • Fault-tolerance
  • High speed
  • High data density
  • None of the above

Question 43

Arrange the following configurations for CPU in decreasing order of operating speeds; Hardwired Control, vertical microprogramming, horizontal microprogramming

  • Hardwired control, Vertical microprogramming, Horizontal microprogramming.

  • Hardwired control, Horizontal microprogramming, Vertical microprogramming.

  • Horizontal microprogramming, Vertical microprogramming, Hardwired control.

  • Vertical microprogramming, Horizontal microprogramming, Hardwired control.

Question 44

The minimum number of record movements required to merge five files A (with 10 records), B (with 20 records), C (with 15 records), D (with 5 records) and E (with 25 records) is:
  • 165
  • 90
  • 75
  • 65

Question 45

If T1 = O(1), give the correct matching for the following pairs:
(M) Tn=Tn−1+n           (U) Tn=O(n)
(N) Tn=Tn/2 +n          (V) Tn=O(nlogn)
(O) Tn=Tn/2 +nlogn      (W) T=O(n^2)
(P) Tn=Tn−1 +logn       (X) Tn=O(log^2n) 
  • M-W N-V O-U P-X
  • M-W N-U O-X P-V
  • M-V N-W O-X P-U
  • M-W N-U O-V P-X

Question 46

The main difference(s) between a CISC and a RISC processor is/are that a USC processor typically: a) has fewer instructions b) has fewer addressing modes c) has more registers d) is easier to implement using hardwired control logic
  • a and b
  • b and c
  • a and d
  • a, b, c and d

Question 47

A certain processor supports only the immediate and the direct addressing modes. Which of the following programming language features cannot be implemented on this processor? a) Pointers b) Arrays c) Records d) Recursive procedures with local variables
  • Only a
  • a and b
  • c and d
  • a, b, c and d

Question 48

Consider the following C function definition.
int Trial (int a, int b, int c)
{
    if ((a >= b) && (c < b) return b;
    else if (a>=b) return Trial(a, c, b);
    else return Trial(b, a, c);
}

The function Trial:
  • finds the maximum of a, b and c
  • finds the minimum of a, b and c
  • finds the middle number of a, b and c
  • None of the above

Question 49

Which of the following is/are correct?
  • An SQL query automatically eliminates the duplicates
  • An SQL query will not work if there are no indexes on the relations
  • SQL permits attribute names to be repeated in the same relation
  • None of the above

Question 50

[5 Marks question]
  1. Mr. X claims the following: If a relation R is both symmetric and transitive, then R is reflexive. For this, Mr. X offers the following proof- "From xRy, using symmetry we get yRy. Now because R is transitive, xRy and yRy together imply xRx. Therefore, R is reflexive." Briefly point out the flaw in Mr. X\'s proof.
  2. Give an example of relation R which is symmetric and transitive but not reflexive.

    There are 70 questions to complete.

    Last Updated :
    Take a part in the ongoing discussion