- Tutorials
- Courses
- Tracks
GATE-CS-2002
Question 1
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 2
To evaluate an expression without any embedded function calls :
As many stacks as the height of the expression tree are needed
One stack is enough
Two stacks are needed
A Turing machine is needed in the general case
Question 3
Dynamic linking can cause security concerns because:
Security is dynamic
The path for searching dynamic libraries is not known till runtime
Linking is insecure
Cryptographic procedures are not available for dynamic linking
Question 4
The optimal page replacement algorithm will select the page that
Has been used least number of times.
Will not be used for the longest time in the future.
Has not been used for the longest time in the past.
Has been used most number of times.
Question 5
Which of the following is not a form of memory?
instruction cache
instruction register
instruction opcode
translation lookaside buffer
Question 6
The C language is:
A context free language
A context sensitive language
A regular language
Parsable fully only by a Turing machine
Question 7
The solution to the recurrence equation T(2k) = 3 T(2k-1) + 1, T (1) = 1, is:
2k
(3k + 1 - 1)/2
3log2k
2log3k
Question 8
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 9
From the following instance of a relation scheme R (A, B, C), we can conclude that :
| A | B | C |
| 1 | 1 | 1 |
| 1 | 1 | 0 |
| 2 | 3 | 2 |
| 2 | 3 | 2 |
A functionally determines B and B functionally determines C
A functionally determines B and B does not functionally determine C
B does not functionally determine C
A does not functionally determine B and B does not functionally determine C
Question 10
Relation R is decomposed using a set of functional dependencies, F and relation S is decomposed using another set of functional dependencies G. One decomposition is definitely BCNF, the other is definitely 3NF, but it is not known which is which. To make a guaranteed identification, which one of the following tests should be used on the decompositions? (Assume that the closures of F and G are available).
Dependency-preservation
Lossless-join
BCNF definition
3NF definition
There are 50 questions to complete.