I M.Sc.

, COMPUTER SCIENCE [2013 2015]

SEMESTER I
Core : Theory of Computing 155E
MULTIPLE CHOICE QUESTIONS
1. Research is a _____
a. art of scientific investigation.
b. art of mathematical investigation.
c. art of logical investigation.
d. art of research investigation.
Answer: A
2. Research is a ________ activity and such the term should be used in _______ sense.
a. activity ,technical.
b. academic ,technical.
c. activity, logical.
d. academic, logical.
Answer: B
3. _______ is based on measurement of quantity.
a. Qualitative research.
b. Quantitative research.
c. Analytical research.
d. Applied research.
Answer: B
4. The study which involves to portrait accurately the characteristics of a particular
individual situation or group is called ________
a. qualitative research.
b. quantitative research.
c. analytical research.
d. descriptive research.
Answer: A
5. A layout of report should contain __________
a. preliminary pages.
b. main text.
c. end matter.
d. all the above.
Answer: D
6. In what type of research the researcher has to use the facts already available?
a. qualitative research.
b. quantitative research.
c. analytical research.
d. descriptive research.
Answer: C

1
7.________ is the arrangement of conditions for collection and analysis of data.
a. Research studies.
b. Research report.
c. Research result.
d. Research design.
Answer: D
8. In research process the first and foremost step is _______
a. selecting and identifying a research problem.
b. selecting and identifying a research design.
c. selecting and identifying a research requirements.
d. selecting and identifying a research report.
Answer: A
9.________ aims at finding a solution for a immediate problem.
a. Formulative research.
b. Descriptive research.
c. Applied research.
d. Historical research.
Answer: C
10._________ is used by philosophers and thinkers to develop new concepts or to
re-interrupt the existing.
a. Emperical research.
b. Laboratory research.
c. Conceptual research.
d. Decision oriented research.
Answer: C
11.The __________ stands for advance planning of methods to be adopted for collecting
the relevant data.
a. report.
b. design.
c. scientific Method.
d. research.
Answer: B
12. The ________ research involves on experience or observation.
a. conceptual.
b. emperical.
c. simulation.
d. longitudinal.
Answer: B
13. The negation symbol is denoted by______
a. .
b. .
c. .
d. v.
Answer: A

2
14. PP is a _____
a. contradiction.
b. tautology.
c. conditional.
d. biconditional.
Answer: B
15. If there are n distinct components in a statement then there is_________
combinations of values in the truth table .
a. n+1.
b. n2.
c. 2n.
d. n+2.
Answer: C
16. If p then Q is called _________ statement
a. conjunction.
b. disjunction.
c. conditional.
d. bi-conditional.
Answer: C
17. (pq)(^q) is __________
a. tautology .
b. contradiction .
c. WFF.
d. not a WFF.
Answer: D
18. A relation R in a set X is symmetric if ________
a. yRx.
b. xRy, yRx.
c. xRy, yRz => xRz.
d. xRy => yRx.
Answer: D
19. If a relation is reflexive, then all the diagonal entries must be ________
a. 0.
b. 1.
c. 2.
d. -1.
Answer: B
20. If R is reflexive, symmetric and transitive then a relation is said to be ________
a. binary relation.
b. compatibility relation.
c. equivalence relation.
d. partial order relation.
Answer: C

3
21. Surjective function is also called ________
a. one-one.
b. one to one.
c. into.
d. onto.
Answer: D
22. One to one onto function is also called __________
a. bijective.
b. injective.
c. surjective.
d. composition function.
Answer: A
23. (gof)-1 =________
a. g-1 .
b. f-1 .
c. g-1 o f-1.
d. f-1 o g-1.
Answer: D
24. The composition of function is associative but not _______
a. idempotent.
b. commutative.
c. distributive.
d. demorgans.
Answer: B
25. A mapping x into itself is called __________
a. relation.
b. equivalence relation.
c. reflexive.
d. transformation.
Answer: C
26. If f(x) = 2x+1, g(x) = x2-2 then fog ________
a. 4x2+4x+1.
b. 2x-3.
c. 2x2-3.
d. 2x2+3.
Answer: C
27. Which one of the following is Idempotent law?
a. PVF
P.
b. P^T
P.
c. P^P
P.
d. P^F
F.
Answer: C

4
 28. The duality law of (P^Q)vT is ________
a. (P^Q)^T.
b. (PvQ)^T .
c. (PvQ)vF .
d. (PvQ)^F.
Answer: D
29. A product of the variables and their negations in a formula is called _________
a. elementary product.
b. elementary sum.
c. DNF.
d. CNF.
Answer: A
30. A premise may be introduced at any point in the derivation is called ________
a. rule CP.
b. rule T .
c. rule P.
d. both rule P&T.
Answer: C
31. S aAB, ABbB, Bb, AaB satisfies ___________ type of grammar
a. 0.
b. 1.
c. 0,1.
d. 3.
Answer: C
32. If there are more than 2 LMD for a word then it is said to be ___________
a. language.
b. not ambiguous.
c. ambiguous.
d. finite state automata.
Answer: C
33. A finite non-empty set of symbols is called _________
a. letter.
b. word.
c. language.
d. alphabet.
Answer: D
34. The specification of proper construction of a sentence is called ______
a. grammar.
b. semantics.
c. syntax.
d. language.
Answer: C

5
35. Context free grammar is also known as _______
a. type 0.
b. type 1.
c. type 2.
d. type 3.
Answer: C
36. A class of machine which accepts a ________ language is called finite state
automata.
a. type 0.
b. type 1.
c. type 2.
d. type 3.
Answer: D
37. Accepting states are denoted by ________
a. arrow mark.
b. double arrow mark.
c. double circle.
d. straight line.
Answer: C
38. For converting NDFA to DFA we should __________ all the states which have no
incoming.
a. add.
b. multiply.
c. start.
d. delete.
Answer: D
39. The set of all finite words over E is denoted by ________
a. E.
b. E+.
c. E*.
d. .
Answer: B
40. If there are ________ distinct components in a statement then there is2n combinations
of values in the truth table.
a. n+1.
b. n.
c. 2n.
d. n+2.
Answer: B
41. PV P is a _____
a. contradiction.
b. tautology.
c. conditional.
d. biconditional.
Answer: A

6
42. Any vertex having degree one is called _______
a. simple vertex.
b. pendant vertex.
c. regular vertex.
d. complete vertex.
Answer: B
43. A graph that has neither self loops nor parallel edges is called_____
a. regular graph.
b. complete graph.
c. isolated graph.
d. simple graph.
Answer: D
44. A graph in which every vertex has same degree is called _________
a. regular graph.
b. complete graph.
c. isolated graph.
d. simple graph.
Answer: A
45. Kn denotes _______
a. regular graph.
b. complete graph.
c. isolated graph.
d. simple graph.
Answer: B
46. The number of vertices of odd degree in a graph is always________
a. odd.
b. even.
c. zero.
d. one.
Answer: B
47. A path of a graph is said to be ______, if it contains all the edges of the graph.
a. Eulerian.
b. Hamiltonian.
c. tournament.
d. planar.
Answer: A
48. Travelling salesman problem is example for_______
a. Euler graph.
b. Hamiltonian graph.
c. tournament.
d. planar graph.
Answer: B

7
49. If a node v is reachable from node u then the path of minimum length u to v is
called_____
a. reachability.
b. node base.
c. geodesic.
d. accessibility.
Answer: C
50. The eccentricity of a center in a tree is defined as ______ of the tree.
a. radius.
b. diameter.
c. length.
d. path.
Answer: A
51. Research refers to the systematic method consisting of ________
a. enunciating the problem.
b. formulating a hypothesis.
c. collecting & analyzing the facts.
d. all the above.
Answer: D
52. What type of research is used to portray accurately the characteristics of a particular
individual or a group?
a. Exploratory.
b. Diagnostic.
c. Descriptive.
d. Hypothesis testing.
Answer: C
53. In social and business research the term Expost facto research is used for ________
research studies.
a. analytical.
b. descriptive.
c. applied.
d. fundamental.
Answer: B
54. ________ research is mainly concerned with generalizations and formulation of
theory.
a. Applied.
b. Fundamental.
c. Qualitative.
d. Analytical.
Answer: B
55. Attitude or opinion research is also called __________ research.
a. quantitative.
b. qualitative.
c. conceptual.
d. empirical.

8
 Answer: B

56. __________ research is related to abstract ideas or theory.

a. Conceptual.
b. Emperical.
c. Exploratory.
d. Diagnostic.
Answer: A
57. In scientific method _________ aids in formulating propositions explicitly and
accurately so that their possible alternatives become clear.
a. logic.
b. observation.
c. experimentation.
d. analyzing.
Answer: A
58. In scientific method ________ is done to test the hypothesis and to discover new
relationships.
a. experimentation.
b. surveys.
c. observation.
d. logic.
Answer: A
59. The first step in the research process is _________
a. research problem.
b. research design.
c. research report.
d. data collection.
Answer: A
60. ________ constitutes the blueprint for the collection, measurement & analysis of
data.
a. Research design.
b. Research report.
c. Research problem.
d. Analysis of data.
Answer: A
61. ________ design deals with the method of selecting items to be observed for the
given study.
a. Sampling.
b. Observational.
c. Statistical.
d. Operational.
Answer: A
62. ________ is the last step in a research study.
a. Report writing.
b. Research design.
c. Testing hypothesis.
d. Data analysis.

9
 Answer: A

63. ________ design deals with the technique by which the procedures specified can be
carried out.
a. Sampling.
b. Observational.
c. Statistical.
d. Operational.
Answer: D
64. _________ is the first step in writing report.
a. Preparation of rough draft.
b. Logical analysis of subject matter.
c. Preparation of outline.
d. Writing the report.
Answer: B
65. _________ development is based on a connection or sequence of time or occurrence.
a. Logical.
b. Chronological.
c. Observational.
d. Hypothetical.
Answer: B
66. In the following which is not in the layout of research report?
a. Preliminary pages.
b. Outline.
c. Main text.
d. End matter.
Answer: B
67. In the following which provides the complete outline of the research report along
with all the details?
a. Preliminary pages.
b. Main text.
c. End matter.
d. Outline.
Answer: B
68. In bibliography of report, the title of book should be in ________
a. underlined.
b. italics.
c. both underlined & italics.
d. bold.
Answer: C
69. In bibliography of report the final matter included in magazines & newspapers is ___
a. reference.
b. pagination.
c. date of issue.
d. volume.
Answer: B

10
70. In which research the researcher is free to pick up a problem?
a. Conclusion oriented research.
b. Decision oriented research.
c. Historical research.
d. One time research.
Answer: A
71. In ________ research philosophers we develop new concepts or reinterpret existing
ones.
a. conceptual.
b. empirical.
c. applied.
d. fundamental.
Answer: A
72. ________ is done to test the hypothesis and to discover new relationships.
a. Logical analysis.
b. Experimentation.
c. Observation.
d. Report writing.
Answer: B
73. The design which gives the _______is the best design.
a. smallest experimental error.
b. maximal information.
c. largest experimental error.
d. both a. & b.
Answer: D
74. ________ is an arrangement of conditions for collection and analysis of data in a
manner that aims to combine relevant to research purpose.
a. Research design.
b. Research report.
c. Research problem.
d. Empirical research.
Answer: A

75. _______ is the last step in writing report.

a. Writing the final bibliography.
b. Writing the final draft.
c. Writing the final outline.
d. Writing the final conclusion.
Answer: B
76. P Q , Q R ________
a. P R.
b. R P.
c. Q.
d. R.
Answer: A

11
77. In (x) P(x) Q(x) , P(x) is ________
a. free variable.
b. bound variable.
c. predicate.
d. quantifier.
Answer: B
78. The symbol which reads for all is _______
a. universal quantifier.
b. existential quantifier.
c. proportional quantifier.
d. logical quantifier.
Answer: A
79. Which of the following is a tautology?
a. (P Q) P.
b. P ( Q P).
c. P ( P Q).
d. P (Q P).
Answer: C
80. The formula P ( P Q) is _______
a. a tautology.
b. a contradiction.
c. logically equivalent to P Q.
d. logically equivalent to P Q.
Answer: C
81. (P P) ( P (Q Q)) is equivalent to _______
a. P Q.
b. P Q.
c. P Q.
d. Q P.
Answer: C
82. Given that (P Q) (P Q) is false , the truth values of P & Q are _______
a. both false.
b. both true.
c. P true & Q false.
d. P false & Q true.
Answer: A
83. If a normal form contains all minterms , then it is ________
a. a tautology.
b. a contradiction.
c. neither tautology nor contradiction.
d. both tautology & contradiction.
Answer: A

12
84. PCNF is also called _______
a. sum of product canonical form.
b. product of sum canonical form.
c. sum canonical form.
d. product canonical form.
Answer: B
85. The binary relation S = on a set A = {1,2,3} is ___________
a. neither reflexive nor symmetric.
b. symmetric and reflexive.
c. transitive and reflexive.
d. transitive and symmetric.
Answer: D
86. The Subset relation on a set of sets is ________
a. a partial ordering.
b. an equivalence relation.
c. transitive and symmetric only.
d. transitive and anti-symmetric only.
Answer: A
87. A relation R is defined on the set of integers as xRy iff (x+y) is even. Which of the
following statement is TRUE?
a. R is not an equivalence relation.
b. R is an equivalence relation having one equivalence classes.
c. R is an equivalence relation having two equivalence classes.
d. R is an equivalence relation having three equivalence classes.
Answer: C
88. Let R1 & R2 be two equivalence relations on a set. Consider the following assertions:
(i) R1 R2 is an equivalence relation.
(ii) R1 R2 is an equivalence relation.
Which of the following is correct?
a. Both assertions are true.
b. Assertion (i) is true but assertion (ii) is not true.
c. Assertion (ii) is true but assertion (i) is not true.
d. Neither (i) nor (ii) is true.
Answer: C
89. If R = { (1,y), (1,z), (3,y) } then R-1 = ___________
a. { (1,a),(y,z)}.
b. { (y,z),(z,a.,(y,c.}.
c. { (y,a),(1,z),(3,y)}.
d. { (y,a),(z,a.,(3,y)}.
Answer: B
90. Let R ={ (a,b),(c,d),(b,b)}, S = {(d,b),(c,b),(a,d)} then R S = ___________
a. {(a,e),(c,b),(b,e)}.
b. {(d,b),(c,b),(a,d)}.
c. {(a,b),(b,b)}.
d. {(c,b)}.

13
 Answer: A

91. Let R and s be two relations on a set of positive integers I & R = {(a,3a+a./ a I},
S = {(a,a+a./ a I} then R R R = __________
a. {(a,3a+a./ a I}.
b. {(a,9a+a./ a I}.
c. {(a,27a+a./ a I}.
d. {(a,9a+c./ a I}.
Answer: C
92. The number of relations from A = {a,b,c} to B = {1,2} are __________
a. 6.
b. 23.
c. 25.
d. 26.
Answer: D
93. (A X B) (A X C) = ___________
a. A X (B C).
b. A X (B C).
c. A X B X C.
d. A (B X C).
Answer: B
94. The minimum number of edges in a connected graph with n vertices is ___________
a. n-1.
b. n.
c. n+1.
d. n2.
Answer: A
95. The number of distinct simple graphs with upto three nodes is _________
a. 7.
b. 9.
c. 10.
d. 15.
Answer: A
96. A graph is planar iff does not contain ________
a. subgraphs homeomorphic to k3 & k3,3.
b. subgraphs isomorphic to k5 or k3,3.
c. subgraphs isomorphic to k3 & k3,3.
d. subgraphs homeomorphic to k5 or k3,3.
Answer: D
97. Maximum number of edges in an n-node undirected graph without self loops is _____
a. n 2.
b. [n(n-a.]/2.
c. n-1.
d. [n(n+a.]/2.
Answer: B

14
98. In any undirected graph the sum of degrees of all the vertices ________
a. must be even.
b. is twice the number of edges.
c. must be odd.
d. can be even or odd.
Answer: D
99. The total number of edges in a complete graph of n vertices is _________
a. n.
b. n/2.
c. n2-1.
d. [n(n-a.]/2.
Answer: D
100. A directed complete graph of n vertices contains __________
a. one arrow between each pair of distinct vertices.
b. two arrows between each pair of distinct vertices.
c. n-1 arrows between each pair of distinct vertices.
d. path between every two distinct vertices.
Answer: A
101. A directed graph G = ( V,E) is said to be finite if its ________
a. set V of vertices is finite.
b. set V of vertices & set E of edges are finite.
c. set E of edges are finite.
d. no vertices & edges are repeated.
Answer: B
102. Which of the following traversal techniques lists the nodes of binary search in
ascending order?
a. preorder.
b. postorder.
c. inorder.
d. root order.
Answer: C
103. The grammar G ={{S},{0,1},P,S}} where P={S 0S1 , S S1} is a ________
a. recursively enumerable language.
b. regular language.
c. context sensitive language.
d. context free language.
Answer: D
104. Which of the following regular expressions identifiers are true?
a. (r*)* = r.
b. (r+s)* = r* +s*.
c. r*.s* = r* + s*.
d. (r.s)* = r*.s*.
Answer: A

15
105. In a grammar or language is used to denote _______
a. empty word.
b. entire set.
c. set of words.
d. set of letters.
Answer: A
106. The number of letters in a word is called ________
a. string.
b. length.
c. alphabet.
d. syntax.
Answer: B
107. If r is a regular expression then r* is a _______ expression.
a. irregular
b. regular.
c. homeomorphic.
d. isomorphic.
Answer: B
108. An example for regular grammar is ________
a. S Ab.
b. AB SAB.
c. S aB.
d. S aBB.
Answer: C
109. If all the productions have single non-terminal in the left hand side then the
grammar defined is ________
a. context free.
b.context sensitive.
c. regular.
d. right linear.
Answer: B
110. In Backus Naur Form the symbol: := is used instead of _______
a. { }.
b. .
c. < >.
d. .
Answer: B
111. Any subset L of A* is called ________ over A.
a. language.
b. grammar.
c. alphabet.
d. syntax.
Answer: A

16
112. If S be a start symbol and SaA, ABA, Aa, Bb be the productions in a
grammar then one of the string derived form the grammar is _____
a. baba.
b. bbaa.
c. abba.
d. aabb.
Answer: C
113. If S be a start symbol and SAB, AaB, Bb be a grammar then a string
generated by the grammar is _______
a. baa.
b. aba.
c. abb.
d. bab.
Answer: C
114. Two automatas M and M are said to be equal if _____
a. they have same final state.
b. they have equal number of states.
c. they accept exactly the same language.
d. they have same initial states.
Answer: D
115. Let R = {(3, c), (6, 6), (9, 9), (12, 1), (6, 1), (3, 9), (3, 1), (3, 6)} be a relation on
the set A = {3, 6, 9, 12} be a relation on the set A = {3, 6, 9, 12}. The relation is
__________
a. reflexive and transitive.
b. reflexive.
c. an equivalence relation.
d. reflexive and symmetric.
Answer: A
116. A state from which deterministic finite state automata can never come out is called
a ___________
a. transition table.
b. transition diagram.
c. trape state.
d. starting symbol.
Answer: C
117. If a compound statement is made up of three simple statements then the number of
rows in the truth table is ____
a. 2.
b. 4.
c. 6.
d. 8.
Answer: D

17
118. The number of rows in the truth table of ( P (Q )) is______
a. 2.
b. 4.
c. 6.
d. 8.
Answer: B
119. The conditional statement PQ is equivalent to _____
a. P Q.
b. P Q.
c. P Q .
d. P Q.
Answer: B
120. Let R={(1,b.,(3,d.,(2,b.} and S={(4,b.,(2,5),(3,a.} be a relation then RS=____
a. {(1,b),(3,d),(2,b)}.
b. {(1,5),(3,b),(2,5)}.
c. {(4,b),(2,5),(3,a)}.
d. {(1,d),(3,b),(2,c)}.
Answer: B
121. If R= {(x, 2x)/xI} and S= {(x, 4x)/ xI } then RS=____
a. {(x, 4x)/ xI }.
b. {(x, 2x)/ xI }.
c. {(x, 14x)/ xI}.
d. {(x, 10x)/ xI }.
Answer: C
122. A regular grammar contain rules of the form is _____
a. AAB.
b. ABa.
c. AaB.
d. ABCD.
Answer: C
123. A type-2 grammar contain the rules of the form is____
a. aAB.
b. AaBa.
c. AaB.
d. ABCD.
Answer: C
124. Which one of the following is a well formed formula?
a. P Q.
b. ( P Q).
c. (P Q ).
d. (P Q)) R Q).
Answer: B

18
125. Let R = {(1, c), (4, b), (2, d), (2, c), (3, a)} be a relation on the set A = {1, 2, 3, 4}.
The relation R is ________
a. a function.
b. reflexive
c. not symmetric.
d. transitive.
Answer: C
126. The statement p (q p) is equivalent to ________
a. p (p q).
b. p (p q).
c. p (p q).
d. p (p q).
Answer: B
127. Let R = {(3, c), (6, 6), (9, 9), (12, 1), (6, 1), (3, 9), (3, 1), (3, 6)} be a relation on
the set A = {3, 6, 9, 12} be a relation on the set A = {3, 6, 9, 12}.The relation is __
a. reflexive and transitive.
b. reflexive.
c. an equivalence relation.
d. reflexive and symmetric.
Answer: A
128. If a relation is reflexive then in the graph of a relation there must be a loop at _____
a. two nodes.
b. only one nodes.
c. three nodes.
d. each node.
Answer: D
129. If SaS, Sa be the productions in a grammar G, then the grammar is called____
a. context-sensitive grammar.
b. context-free grammar.
c. regular grammar.
d. phrase structure grammar.
Answer: A
130. The rank of the incidence matrix of any connected graph G with n vertices is ____
a. n+1.
b. n-1.
c. n.
d. n2.
Answer: B
131. The number of 1s in each row of an incidence matrix of a graph G is equal to ___
a. the degree of the corresponding vertices.
b. the sum of degrees of all vertices.
c. the degree of the initial vertex.
d. the degree of the terminal vertex.
Answer: A

19
132. Each column of an incidence matrix of a graph G has exactly _______
a. one 1s.
b. two1s.
c. one 2s.
d. two 2s.
Answer: B
133. An undirected graph is tripartite iff it has no circuits of _______ lengths.
a. odd.
b. even.
c. distinct.
d. equal.
Answer: A
134. A graph is bipartite iff its chromatic number is ________
a. 1.
b. 2.
c. even.
d. odd.
Answer: B
135. G is strongly connected implies _________
a. G is unilaterally connected.
b. G is bilaterally connected.
c. G is unilaterally connected.
d. G has more than one components.
Answer: A
136. The number of pendant vertices in a full binary tree with n vertices is ____
a. (n-a)/2.
b. n2/2.
c. (n+a)/2.
d. (n2+a)/2.
Answer: C
137. The number of vertices in a full binary tree is _______
a. single.
b. even.
c. odd.
d. odd or even.
Answer: C
138. A binary tree with 2k vertices of level k has atleast _______ vertices.
a. 2k.
b. 2k-1.
c. 2k-1 1.
d. 2k+1 1.
Answer: D
139. For a symmetric digraph ,the adjacency matrix is _________
a. symmetric.
b. asymmetric.

20
 c. antisymmetric.
d. symmetric or antisymmetric.
Answer: A
140. The diagonal entries of AAT where A is the adjacency matrix are the _______
a. outdegrees of the nodes.
b. indegrees of the nodes.
c. unit degree of the nodes.
d. in & out degrees of the nodes.
Answer: A
141. DFA and NFA represent the ________ language.
a. ambiguous.
b. unambiguous.
c. regular.
d. context sensitive.
Answer: C
142. If L is accepted by a turing machine with a two way infinite tape, then L is accepted
by turing machine with _________ tape.
a. one-way finite tape.
b. one-way infinite tape.
c. two-way finite tape.
d. two-way infinite tape.
Answer: B
143. If a language L is accepted by a multitape turing machine, it is accepted by
______ tape turing machine.
a. single.
b. multi.
c. finite.
d. infinite.
Answer: A
144. If L is accepted by a non-deterministic turing machine ,then L is accepted by ___.
Turing machine.
a. non-deterministic.
b. deterministic.
c. finite.
d. infinite.
Answer: B
145. If M is a finite state automata ,then a regular grammar can be constructed such that
______.
a. L(G) = T(M).
b. L(G) > T(M).
c. L(G) < T(M).
d. L(G) = T(M)2.
Answer: A

21
146. The chromatic number of the chess board is ______
a. 1.
b. 2.
c. 3.
d. 4.
Answer: B
147. The total number of degrees of an isolated node is _______
a. 0.
b. 1.
c. odd.
d. even.
Answer: A
148. If G is a connected planar graph then it has a vertex of degree _______
a. 3 or less.
b. 4 or less.
c. 5 or less.
d. 6 or less.
Answer: C
149. A product of the variable and their negation in a formula is called an _____
a. elementary sum.
b. elementary product.
c. well-formed formula.
d. equivalence of relation formula.
Answer: B
150. A sum of the variable and their negation in a formula is called an _____
a. elementary sum.
b. elementary product.
c. well-formed formula.
d. equivalence of relation formula.
Answer: A
151. The binary relation R = {(0, 0), (1, a.} on A = {0, 1, 2, 3, } is __________
a. reflexive, not symmetric, transitive.
b. not Reflexive, symmetric, transitive.
c. reflexive, symmetric, not transitive.
d. reflexive, not symmetric, not transitive.
Answer: B
152. The production S aB is of the type ____________
a. type 0 grammar.
b. type 1 grammar.
c. type 3 grammar.
d. all the above .
Answer: D
153. The production S A is of the type __________
a. type 0 grammar.
b. type 2 grammar.

22
 c. type 0 and type 2.
d. type 2.
Answer: A
154. If f(x)= 2x + 3 and g(x)= 4x then fog is ___________
a. 8x2 + 3.
b. 8x + 3.
c. 8x3 + 3.
d. 8x4 + 3.
Answer: B
155. A regular grammar contain rules of the form is _____
a. AAB.
b. ABa.
c. AaB.
d. ABCD.
Answer: C
156. If f(x) = 4x and g(x) = 2x then fog is ___________
a. 6x.
b. 9x .
c. 8x .
d.7x.
Answer: C
157. Let R = {<1,2>,<2,4>,<3,6>,<4,8>}, then RoR is ___________
a. {<1,4>,<2,8>}.
b. {<2,4>,<3,6>}.
c. {<1,2>,<4,8>}.
d. {<1,2>,<3,6>}.
Answer: A
158. Let m = Juan is a math major
c = Juan is a computer science major
g = Juans girlfriend is a literature major
h = Juans girlfriend has read Hamlet and
t = Juans girlfriend has read The Tempest
Which of the following expresses the statement Juan is a computer science major
and a math major, but his girlfriend is a literature major who hasnt read both The
Tempest and Hamlet?
a. c m (g (h t)).
b. c m g (h t).
c. c m g (h t).
d. c m (g (h t)).
Answer: C
159. The function ((p (r q)) (q r) is equal to the function ___________
a. q r.

23
 b. ((p r) q)) (p r).
c. (p q) (p r).
d. (p q) (p r).
Answer: A
160. The truth table for (p q) (p r) is the same as the truth table for ______________
a. (p q) (p r).
b. (p q) r.
c. (p q) (p r).
d. p q.
Answer: D
162. Consider the statement, either 2 x 1 or 1 x 2 the negation of this
statement is __________
a. x < 2 or 2 < x or 1 < x < 1.
b. x < 2 or 2 < x.
c. 1 < x < 1.
d. 2 < x < 2.
Answer: A
163. Which of the following statements is FALSE? ____________
a. (P Q) (P Q) (P Q) is equal to Q P .
b. (P Q) (P Q) (P Q) is equal to Q P .
c. (P Q) (P Q) (P Q) is equal to Q (P Q) .
d. (P Q) (P Q) (P Q) is equal to [(P P) Q] (P Q) .
Answer: A
164. Each loop counting as _________ edges .
a.1.
b.2.
c.3.
d. 4.
Answer: B
165. Which of the following statements is TRUE?
a. For all sets A, B and C, A (B C) = (A B) C.
b. For all sets A, B and C, (A B) (C B) = (A C) B.
c. For all sets A, B and C, (A B) (C B) = A (B U C).
d. For all sets A, B and C, if A C = B C then A = B.
Answer: B
166. Let R= { <1,2> <3,4> <2,2>}, S= { <4,2> <2,5> <3,1> <1,3>} then RoS is
________
a. { <1,5> <3,2> <2,5>} .
b.{ <4,2> <2,2> <1,2>} .
c.{ <3,4> <3,1> <1,3> }.
d.{ <2,2> <2,5> <4,2>}.
Answer: A

24
167. Composition of relation is ___________
a. not associative.
b. not commutative.
c. not transitive.
d. not reflexive.
Answer: B
168. If f: R R is defined by f(x) = x2 x , then ____________
a. f is a function and is not one-one.
b. f is a function and is not onto but is one-to-one.
c. f is a function and is not onto and not one-to-one.
d. f is a function and is onto but not one-to-one.
Answer: A
169. If A = {1,2,3,4}, B = {2,5,6,7} then AB is _____________
a. {3}.
b. {4}.
c. {2}.
d. {1}.
Answer: C
170. Let f: X Y and g: Y Z. Let h = g f: X Z. Suppose g is one-to-one and
onto. Which of the following is FALSE?
a. If f is one-to-one then h is one-to-one and onto.
b. If f is not onto then h is not onto.
c. If f is not one-to-one then h is not one-to-one.
d. If f is one-to-one then h is one-to-one.
Answer: A
171. If A = {1,2,4} and B = {3,5,7} then A U B is ____________
a. {1,2,3,4,5,7}.
b. {1,2,4,5,7}.
c. { 1,2,3,5,7}.
d. { }.
Answer: A
172. If A = {1,2,3,4}, B = {6,7,8,9} then AB___________
a. { }.
b. {5}.
c. {1}.
d. {9}.
Answer: A
173. Simple statements are also called ___________
a. molecular statements.
b. compound statements.
c. atomic statements.
d. complex statements.
Answer: C

25
174. The statements formed from atomic statements are called _____________
a. molecular statements.
b. primary statements.
c.primitive statements.
d. simple statements.
Answer: A
175. The negation of the statement is formed by introducing ___________
a. OR.
b. NOT.
c. AND.
d. IF.
Answer: B
176. If a statement is P: I went to my class yesterday, then P is ___________
a. i did not go to my class yesterday.
b. i was absent to my class yesterday.
c. it is not the case that I went to my class yesterday.
d. any one of the above.
Answer: D
177 .If the truth value of P is false then the truth value of negation P is ____________
a. true.
b. false.
c. true or false.
d. true and false.
Answer: A
178. The conjunction of the statement is formed by introducing _______________
a. OR.
b. NOT.
c. AND.
d. IF.
Answer: C
179. If the statements are given by P:It is raining today, Q: There are 20 tables in this
room. Then P Q is ______________
a. if it is raining today then there are 20 tables in this room.
b. it is raining today and there are 20 tables in this room.
c. it is raining today or there are 20 tables in this room.
d. it is raining today but there are 20 tables in this room.
Answer: B
180. If the statements are given by P: It is raining today, Q:London is a city . Then PQ
is ____________
a. it is raining today and London is a city.
b. it is raining today but London is not a city.
c. it is raining today and London is not a city.
d. if it is raining today then London is not a city.
Answer: C

26
181. If the statement P has the truth value T and Q has the truth value F then PQ is
____________
a. T.
b. F.
c. T and F.
d. none.
Answer: A
182. If the statements P has the truth value T and Q has the truth value F then PQ is
____________
a. T.
b. F.
c. T and F.
d. none.
Answer: B
183. The negation of (P Q) R is __________
a. (P Q) R.
b. (P Q) R.
c. (P Q)R.
d. (P Q) R.
Answer: C
184. The negation of (PQ)(QR) is ___________
a. (PQ)(QR).
b. (PQ)(QR).
c. (PQ)(QR).
d. (PQ)(QR).
Answer: A
185. For every possible truth values of P, the truth value of PP is ___________
a. T.
b. F.
c. T and F.
d. none.
Answer: B
186. Which of the following statement is tautology?
a. (P Q) Q.
c. (P Q) P.
d.(P Q)P.
Answer: D
187. The symbolic form for the statement, Mark is poor or he is both rich and unhappy is
___________
a. R(RH).
b. R(RH).
c. R (RH).
d. R (RH).
Answer: A

27
188. The conditional statement is formed by introducing __________
a. P and Q.
b. P or Q.
c. P iff Q.
d. If P then Q.
Answer: D
189. The Bi-conditional statement is formed by introducing ____________
a. P and Q.
b. P or Q.
c. P iff Q.
d. If P then Q.
Answer: C
190. If P has the truth value t and q has truth value F then PQ is _____________
a. T.
b. F.
c. T or F.
d. T and F.
Answer: B
191. Which one of the following statement is example of PQ?
a. The sun is shining today but 2+7>4.
b. If the sun is shining today, then 2+7>4.
c. The sun is shining today and 2+7>4.
d. The sun is shines today iff 2+7>4.
Answer: B
192. Which one of the following is the example of PQ?
a. The sun is shining today but 2+7>4.
b. If the sun is shining today, then 2+7>4.
c. The sun is shining today and 2+7>4.
d. The sun is shines today iff 2+7>4.
Answer: D
193. P is equivalent to __________
a. P.
b. PP.
c. PP.
d. Both (a ) and (b).
Answer: D
194. (PP)P is equivalent to ______________
a. P.
b. Q.
c. P.
d. Q.
Answer: B
195. PP is equivalent to ____________
a. PP.
b. PP.

28
 c. QQ.
d. QQ.
Answer: C
196. Which one of the following is well formed formula?
a..(PQ) (Q).
b..(PQ)Q.
c..(PQ)Q).
d..((PQ)Q).
Answer: D
197. A statement formula which is true regardless of the truth vale of the statements
which replaces the variable in it is called ___________
a. universally valid formula.
b. tautology.
c. logical truth.
d. all the above.
Answer: D
198. A statement formula which is false regardless of the truth vale of the statements
which replaces the variable in it is called ___________
a. tautology.
b. contradiction.
c. logical truth.
d. universally valid formula.
Answer: B
199. The statement PP is _______________
a. tautology.
b. contradiction.
c. identically false.
d. none.
Answer: A
200. The dual of (PQ)(PR) is ____________
a. (PQ) (PR).
b. (PQ)(PR).
c. (PQ) (PR).
d. (PQ) (PR).
Answer: C

Staff Name: K.Praveena

29
30