05-07-2012

Daily 10 questions(05-07-2012)


(1)What is the complement of the language accepted by the NFA shown below

Answer: (B)


Given NFA does not accept epsilon, so complement should accept epsilon. We left out with two options (B) and (D). But NFA accepts 'a' so complement should not accept 'a'. that means (B) is the answer.



(2) The Truth table

X	Y	f(X,Y)
0	0	0
0	1	0
1	0	1
1	1	1

Represents the boolean function

(A) X        (B)  X+Y   (C)   X EX-OR Y   (D) Y

Answer(A)


f(x,y) and X are same

(3) What will be the output of the following C program segment?

char inChar='A';

switch( inChar ) {

case 'A' : printf ( "Choice A\n");

case 'B' :

case 'C' : printf (" Choice B");

case 'D' : 

case 'E' : 

default : printf (" No choice ");

}

(A) No choice

(B) Choice A

(C) Choice A

       Choice B  No Choice

(D) Program gives no output as it errorneous

Answer(C)


No break statement after case statements so it is nothing but sequential statement execution.

(4) Which of the following is TRUE

(A) Every relation in 3NF is also in BCNF

(B) A relation R is in 3NF  if every non-prime attribute of R is fully functionally dependent on every key of R

(C) Every Relation in BCNF is also in 3NF

(D) No Relation can be in both BCNF and 3NF

Answer: (C)

(5) Given the language L= {ab, aa, baa} which of the following strings are in L*?

1) abaabaaabaa     2) aaaabaaaa 

3) baaaaabaaaab   4) baaaaabaa

(A) 1,2 and 3  (B) 2,3 and 4

(C) 1,2 and 4  (D) 1,3 and 4

Answer(C)

(6)  What is the minimal form of the Karnaugh map shown below? Assume that X denotes a don't care term

Answer: (B)

(7) Which of the following graphs is isomorphic to 

Answer(B)


Compare degree sequences with the given graph

(8) Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros for example, 001110 and 011001 are in the language, but 100010 is not. All strings of less than three are also in the language. A partially  completed DFA that accepts this language is shown below.

Answer(D)

(9) How many onto(or surjective) functions are there from an n-element (n>=2) set to a 2-element set?

Answer(C)

(10) K4 and Q3 are graphs with the following structures

Which one of the following statements is TRUE in relation to these graphs?

(A) K4 is planar while Q3 is not (B) Both K4 and Q3 are planar

(C) Q3 is planar while K4 is not (D) Neither K4 not Q3 is planar

Answer(B)


*******************************************
Key will be published on 06-07-2012 ( Friday ) at 8:00 PM (IST)
*******************************************

Answer Key



1. B 
2. A
3. C
4. C
5. C
6. B
7. B
8. D
9. C
10.B


Let me know if anybody needs explanation.