GATE-CS-2002

Question 11

In serial data transmission, every byte of data is padded with a ‘0’ in the beginning and one or two ‘I’ s at the end of byte because

• Receiver is to be synchronized for byte reception
• Receiver recovers lost ‘0’ and ‘1’s from these padded bits
• Padded bits are useful in parity computation
• None of these

Question 12

Minimum sum of product expression for f(w, x, y, z) shown in Karnaugh-map below is  

yz\\wx	00	01	11	10
00	0	1	1	0
01	x	0	0	1
11	x	0	0	1
10	0	1	1	x

• xz + y\'z

• xz\' + zx\'

• x\'y + zx\'

• None of these

Question 13

Which of the following is not a form of memory?

• instruction cache
• instruction register
• instruction opcode
• translation lookaside buffer

Question 14

The decimal value 0.25

• is equivalent to the binary value 0.1
• is equivalent to the binary value 0.01
• is equivalent to the binary value 0.00111....
• cannot be represented precisely in binary

Question 15

The 2\' s complement representation of the decimal value - 15 is

• 1111
• 11111
• 111111
• 10001

Question 16

Sign extension is a step in

• floating point multiplication
• signed 16 bit integer addition
• arithmetic left shift
• converting a signed integer from one size to another

Question 17

In the C language

• At most one activation record exists between the current activation record and the activation record for the main
• The number of activation records between the current activation record and the activation record for the main depends on the actual function calling sequence.
• The visibility of global variables depends on the actual function calling sequence.
• Recursion requires the activation record for the recursive function to be saved on a different stack before the recursive function can be called.

Question 18

The results returned by functions under value-result and reference parameter passing conventions

• Do not differ
• Differ in the presence of loops
• Differ in all cases
• May differ in the presence of exceptions

Question 19

Relation R with an associated set of functional dependencies, F is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set relations is.

• Zero
• More than zero but less than that of an equivalent 3NF decomposition
• Proportional to the size of F+
• Indeterminate

Question 20

With regard to the expressive power of the formal relational query languages, which of the following statements is true?

• Relational algebra is more powerful than relational calculus
• Relational algebra has the same power as relational calculus
• Relational algebra has the same power as safe relational calculus
• None of the above