GATE CSE 1992


Question 1
Which of the following predicate calculus statements is/are valid?
A
(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))
B
(\exists (x)) P(x) \wedge (\exists (x))Q(x) \implies (\exists (x)) (P(x) \wedge Q(x))
C
(\forall (x)) (P(x) \vee Q(x)) \implies (\forall (x)) P(x) \vee (\forall (x)) Q(x)
D
(\exists (x)) (P(x) \vee Q(x)) \implies \sim (\forall (x)) P(x) \vee (\exists (x)) Q(x)
Discrete Mathematics   Propositional Logic
Question 2
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
The operation which is commutative but not associative is:
A
AND
B
OR
C
EX-OR
D
NAND
Digital Logic   Boolean Algebra


Question 3
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
All digital circuits can be realized using only
A
Ex-OR gates
B
Multiplexers
C
Half adders
D
OR gates
Digital Logic   Boolean Algebra
Question 4
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
Bit-slice processors
A
can be cascaded to get any desired word length processor
B
speed of operation is independent of the word length configured
C
do not contain anything equivalent of program counter in a 'normal' microprocessor
D
Contain only the data path of a 'normal' CPU
Computer Organization   
Question 4 Explanation: 
It's Out of Syllabus now.
Click here for detail solution by gateoverflow
Question 5
PCHL is an instruction in 8085 which transfers the contents of the register pair HL to PC. This is not a very commonly used instruction as it changes the flow of control in rather 'unstructured' fashion. This instruction can be useful in implementing.
A
if ... then ... else ... construct
B
while .. construct
C
case .. construct
D
call ... construct
Computer Organization   


There are 5 questions to complete.

Leave a Comment