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:
Question 6 |
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
Following algorithm(s) can be used to sort n in the range [1\ldots n^3] in O(n) time
Following algorithm(s) can be used to sort n in the range [1\ldots n^3] in O(n) time
Heap sort | |
Quick sort | |
Merge sort | |
Radix sort |
Question 6 Explanation:
Question 7 |
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
Start and stop bits do not contain any 'information' but are used in serial communication
Start and stop bits do not contain any 'information' but are used in serial communication
Error detection | |
Error correction | |
Synchronization | |
Slowing down the communications |
Question 7 Explanation:
Question 8 |
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
Which of the following problems is not NP-hard?
Which of the following problems is not NP-hard?
Hamiltonian circuit problem | |
The 0/1 Knapsack problem | |
Finding bi-connected components of a graph | |
The graph coloring problem |
Question 8 Explanation:
Question 9 |
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
A 2-3 tree is such that
a. All internal nodes have either 2 or 3 children
b. All paths from root to the leaves have the same length.
The number of internal nodes of a 2-3 tree having 9 leaves could be
A 2-3 tree is such that
a. All internal nodes have either 2 or 3 children
b. All paths from root to the leaves have the same length.
The number of internal nodes of a 2-3 tree having 9 leaves could be
4 | |
5 | |
6 | |
7 |
Question 9 Explanation:
Question 10 |
Choose the correct alternatives ( more than one may be correct) and write the corresponding letters only:
A non-planar graph with minimum number of vertices has
A non-planar graph with minimum number of vertices has
9 edges, 6 vertices | |
6 edges, 4 vertices | |
10 edges, 5 vertices | |
9 edges, 5 vertices |
Question 10 Explanation:
There are 10 questions to complete.
