Jawaharlal Nehru Technological University Hyderabad 2002 B.Tech Computer Science and Engineering gate - Question Paper

interaction with Iisc alum ni in our online discussion forum s, and m ore. Registration begins 10
M ay, 2005. For m ore details,
th
visit
www
.
gateforum
.
com
Think GATE Think G ATE Forum

GATE CS - 2002 GATE Forum www.gateforum .com
Join discussion of this test paper at http://forum .gatem entor.com
1.20 With regard to the expressive power of the formal relational query languages,
which of the subsequent statements is true?
(a) Relational algebra is more powerful than relational calculus
(b) Relational algebra has the identical power as relational calculus.
(c) Relational algebra has the identical power as safe relational calculus.
(d) None of the above
1.21 In 2‘s complement addition, overflow
(a) is flagged whenever there is carry from sign bit addition
(b) cannot occur when a positive value is added to a negative value
(c) is flagged when the carries from sign bit and previous bit match
(d) None of the above
1.22 Which of the subsequent scheduling algorithms is non-preemptive?
(a) Round Robin (b) First-In First-Out
(c) Multilevel Queue Scheduling
(d) Multilevel Queue Scheduling with Feedback
1.23 The optimal page replacement algorithm will choose the page that
(a) Has not been used for the longest time in the past.
(b) Will not be used for the longest time in the future.
(c) Has been used lowest number of times.
(d) Has been used most number of times.
1.24 In the absolute addressing mode
(a) the operand is inside the instruction
(b) the address of the operand is inside the instruction
(c) the register containing the address of the operand is specified inside the
instruction
(d) the location of the operand is implicit
1.25 Maximum number of edges in a n-node undirected graph without self loops is
( )
( )( )
n n
-
1
n n
+
1
(c) n - one (d)
2
(a) n
(b)
2
2
This ques. consists of TWENTY-FIVE sub-questions (2.1 œ 2.25) of 2 marks
2.
each. For every of these sub-questions, 4 possible alternatives, A, B, C and D
are given. select the most improper option and darken its bubble on

Earning:   Approval pending.