1
GATE CSE 1992
Subjective
+2
-0
Assume that the last element of the set is used as partition element in Quicksort. If n distinct elements from the set [1…n] are to be sorted, give an input for which Quicksort takes maximum time.
2
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
Consider the SLR(1) and LALR (1) parsing tables for a context-free grammar. Which of the following statements is/are true?
A
The goto part of both tables may be different.
B
The shift entries are identical in both the tables.
C
The reduce entries in the tables may be different.
D
The error entries in the tables may be different.
3
GATE CSE 1992
MCQ (Single Correct Answer)
+1
-0.3
Start and stop bits do not contain 'information' but these are used in serial communication for
A
Error detection
B
Error correction
C
Synchronization
D
Slowing down the communication
4
GATE CSE 1992
MCQ (Single Correct Answer)
+1
-0.3
Which of the following predicate calculus statements is/are valid?
A
$$\left( {\forall \,x} \right){\rm P}\left( x \right) \vee \left( {\forall \,x} \right)Q\left( x \right) \to \left( {\forall \,x} \right)$$
$$\left\{ {{\rm P}\left( x \right) \vee Q\left( x \right)} \right\}$$
B
$$\left( {\exists \,x} \right){\rm P}\left( x \right) \wedge \left( {\exists \,x} \right)Q\left( x \right) \to \left( {\exists \,x} \right)$$
$$\left\{ {{\rm P}\left( x \right) \wedge Q\left( x \right)} \right\}$$
C
$$\left( {\forall \,x} \right)\,\left\{ {{\rm P}\left( x \right) \vee Q\left( x \right)} \right\} \to \left( {\forall \,x} \right)\,\,$$
$${\rm P}\left( x \right) \vee \left( {\forall \,x} \right)\,\,Q\left( x \right)$$
D
$$\left( {\exists \,x} \right)\,\,\left\{ {{\rm P}\left( x \right) \vee Q\left( x \right)} \right\} \to \sim \left( {\forall \,x} \right)\,\,$$
$$\,{\rm P}\left( x \right) \vee \left( {\exists \,x} \right)Q\left( x \right)$$