Objective Questions(31-40)

31. Set of all string start with 110
a. (110+0)*(1+0)*
b. 110*(1+0)
c. 110(1+0)* d. none of the above

32. .........is the one of the Flynn's taxonomy of computer
1. SISD
2.mimd
3.MISd
4. All of these

33. In c++ , we can perform .............. Operators on pointers
1.Addition and multiplication
2.Subtraction and division
3.Multiplication and division
4. Subtraction and addition

34. ________ is the only component oriented language availaible today?
a.c++
b.Java
c.C# d.Perl

35. Object is....... ?
a. A concept
b. Abstraction
c. Thing
d. All of above

36. Regular expression used in
a. Lexical analyzer
b. Syntax analyzer
c. Semantic Analyzer
d. None of the above

37. Syntax tree is validated by:
a. Lexical Analyzer
b. Syntax Analyzer
c. Semantic Analyzer d. All of the above

38. Set of all string where 0 are odd:
a. (00+1)*0
b. 0(1+00)*
c. both a and b
d. None of the above

39. Pigeonhole principle applied with
a. Finite state automata b. automata with infinite state
c. Both
d. None of the above

40. Regular expression is closely related to
a. DFA
b. NDFA
c. both a and b d. None of the above