Time Left - 15:00 mins

GATE 2018 Exam Quiz: DBMS & Compiler

Attempt now to get your rank among 1500 students!

Question 1

Match the following lists
List-I
A). Common sub expression elimination
B). Constant folding.
C). Strength reduction.
D). Induction variable.
List-II
I. x=2+3;
II. x=x*2;
III. for (i=0;i<10;i=i+2);
IV. x=(x+2)*(x+2);

Question 2

How many tokens are generated by the lexical analyzer, if the following program has no lexical error?
main()
{
int x,y;
fl/* gate oat z; */
/*x=exam*/10;
y=20;
}

Question 3

Consider the grammar:
S→aA | b
A→Ab| ε
The above grammar is

Question 4

Which of the following parameter is not included in the activation record of recursive function call.

Question 5

Consider the following grammar with corresponding synthesized attributes.
F

.L {F. val=L. val}
L

LB {L.len= L₁ .len+1, L. val= L₁. val + 2^-L.len

B.val}
L

B {L. len=1, L. val=B. val/2}
B

0 {B. val =0}
B

1 {B. val =1}
If “F.val” gives the value of the binary fraction generated by F in the above grammar then that will be the value of F.val on input .101?

Question 6

Which of the following cannot be a triggering event for a trigger

Question 7

In context with Relational Algebra, which of the following are unary operations.
I. SELECT
II. PROJECT
III. UNION
IV. PRODUCT

Question 8

External sorting is used to sort large files of records. It uses a sort-merge strategy that splits large files into smaller blocks and sorts them and merges the sorted runs. Consider a file of 2048 blocks that is to be sorted with a buffer space of 32 blocks in the main memory. The total number of block access is?

Question 9

If P and Q are predicates and e is the relational algebra expression, then which of the following equivalence are valid?