1
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE?

$$\,\,\,\,\,\,\,{\rm I}.\,\,\,\,\,\,\,$$ Quicksort runs in $$\Theta \left( {{n^2}} \right)$$ time
$$\,\,\,\,\,{\rm I}{\rm I}.\,\,\,\,\,\,\,$$ Bubblesort runs in $$\Theta \left( {{n^2}} \right)$$ time
$$\,\,\,{\rm I}{\rm I}{\rm I}.\,\,\,\,\,\,\,$$ Mergesort runs in $$\Theta \left( n \right)$$ time
$$\,\,\,{\rm I}V.\,\,\,\,\,\,\,$$ Insertion sort runs in $$\Theta \left( n \right)$$ time

A
$${\rm I}$$ and $${\rm II}$$ only
B
$${\rm I}$$ and $${\rm III}$$ only
C
$${\rm II}$$ and $${\rm IV}$$ only
D
$${\rm I}$$ and $${\rm IV}$$ only
2
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Match the following:

GROUP - 1 GROUP - 2
(P) Lexical analysis (i) Leftmost derivation
(Q) Top down parsing (ii) Type checking
(R) Semantic analysis (iii) Regular expressions
(S) Runtime environments (iv) Activation records

A
$$P \leftrightarrow i,\,\,Q \leftrightarrow ii,\,\,R \leftrightarrow iv,\,\,S \leftrightarrow iii$$
B
$$P \leftrightarrow iii,\,\,Q \leftrightarrow i,\,\,R \leftrightarrow ii,\,\,S \leftrightarrow iv$$
C
$$P \leftrightarrow ii,\,\,Q \leftrightarrow iii,\,\,R \leftrightarrow i,\,\,S \leftrightarrow iv$$
D
$$P \leftrightarrow iv,\,\,Q \leftrightarrow i,\,\,R \leftrightarrow ii,\,\,S \leftrightarrow iii$$
3
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following grammars is free from $$left$$ $$recursion$$?
A
$$\eqalign{ & S\,\, \to \,\,AB \cr & A\,\, \to \,\,Aa\,\,|\,\,b \cr & B \to c \cr} $$
B
$$\eqalign{ & S\,\, \to \,\,AB\,\,|\,\,Bb\,\,|\,\,c \cr & A\,\, \to \,\,Bd\,\,|\,\,\varepsilon \cr & B \to e \cr} $$
C
$$\eqalign{ & S\,\, \to \,\,Aa\,\,|\,\,B\,\,|\,\, \cr & A\,\, \to \,\,Bd\,\,|\,\,Sc\,\,|\,\,\varepsilon \cr & B \to d \cr} $$
D
$$\eqalign{ & S\,\, \to \,\,Aa\,\,|\,\,Bb\,\,|\,\,c \cr & A\,\, \to \,\,Bd\,\,|\,\,\varepsilon \cr & B \to Ae\,\,|\,\,\varepsilon \cr} $$
4
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+2
-0.6
A student wrote two context-free grammars G1 and G2 for generating a single $$C$$-like array declaration. The dimension of the array is at least one. For example, $$${\mathop{\rm int}} \,\,\,\,\,\,\,a[10]\,\,[3];$$$

The grammars use D as the start symbol, and use six terminal symbols int ; id [ ] num.

Grammar G1 Grammar G2
D → intL; D → intL;
L → id[E L → idE
E → num E → E[num]
E → num][E E → [num]

Which of the grammars correctly generate the declaration mentioned above?

A
Both G1 and G2
B
Only G1
C
Only G2
D
Neither G1 nor G2
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12