Question 1
Question 2
Question 3
If d < 0, then d = 4x + 6 and x = x + 1
Question 4
Question 5
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is <5, 10, 3, 12, 5> is
Question 6
Consider the following AO graph:
Which is the best node to expand next by AO* algorithm?
Question 7
A t-error correcting q-nary linear code must satisfy:
Where M is the number of code words and X is
qn
qt
q-n
q-t
Question 8
S1 is correct and S2 is not correct.
S1 is not correct and S2 is correct.
Both S1 and S2 are correct.
Both S1 and S2 are incorrect.
Question 9
Question 10
In how many ways can the string A ∩ B – A ∩ B – A be fully parenthesized to yield an infix expression?
15
14
13
12
There are 39 questions to complete.