Parsable fully only by a Turing machine

GATE-CS-2002

Last Updated :

Discuss

Comments

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

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

Question 2

To evaluate an expression without any embedded function calls :

A
As many stacks as the height of the expression tree are needed
B
One stack is enough
C
Two stacks are needed
D
A Turing machine is needed in the general case

Question 3

Dynamic linking can cause security concerns because:

A
Security is dynamic
B
The path for searching dynamic libraries is not known till runtime
C
Linking is insecure
D
Cryptographic procedures are not available for dynamic linking

Question 4

The optimal page replacement algorithm will select the page that

A
Has been used least number of times.
B
Will not be used for the longest time in the future.
C
Has not been used for the longest time in the past.
D
Has been used most number of times.

Question 5

Which of the following is not a form of memory?

A
instruction cache
B
instruction register
C
instruction opcode
D
translation lookaside buffer

Question 6

The C language is:

A
A context free language
B
A context sensitive language
C
A regular language
D
Parsable fully only by a Turing machine

Question 7

The solution to the recurrence equation T(2^k) = 3 T(2^k-1) + 1, T (1) = 1, is:

A
2^k
B
(3^{k + 1} - 1)/2
C
3^log2k
D
2^log3k

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.

A
Zero
B
More than zero but less than that of an equivalent 3NF decomposition
C
Proportional to the size of F+
D
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
A functionally determines B and B functionally determines C
B
A functionally determines B and B does not functionally determine C
C
B does not functionally determine C
D
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).

A
Dependency-preservation
B
Lossless-join
C
BCNF definition
D
3NF definition

Tags:

GATE

There are 50 questions to complete.

Take a part in the ongoing discussion