Question 1 |
Which of the following predicate calculus statements is/are valid?
(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x)) | |
(\exists (x)) P(x) \wedge (\exists (x))Q(x) \implies (\exists (x)) (P(x) \wedge Q(x)) | |
(\forall (x)) (P(x) \vee Q(x)) \implies (\forall (x)) P(x) \vee (\forall (x)) Q(x) | |
(\exists (x)) (P(x) \vee Q(x)) \implies \sim (\forall (x)) P(x) \vee (\exists (x)) Q(x) |
Question 1 Explanation:
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:
The operation which is commutative but not associative is:
AND | |
OR | |
EX-OR | |
NAND |
Question 2 Explanation:
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
All digital circuits can be realized using only
Ex-OR gates | |
Multiplexers | |
Half adders | |
OR gates |
Question 3 Explanation:
Question 4 |
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
Bit-slice processors
Bit-slice processors
can be cascaded to get any desired word length processor | |
speed of operation is independent of the word length configured | |
do not contain anything equivalent of program counter in a 'normal' microprocessor | |
Contain only the data path of a 'normal' CPU |
Question 4 Explanation:
It's Out of Syllabus now.
Click here for detail solution by gateoverflow
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.
if ... then ... else ... construct | |
while .. construct | |
case .. construct | |
call ... construct |
Question 5 Explanation:
There are 5 questions to complete.