Professional Documents
Culture Documents
BC0052-Theory of Computer Science-MQP PDF
BC0052-Theory of Computer Science-MQP PDF
Marks: 140
n(n 1)
2
n(n 1)
C)
D)
n(n 1)
3
n 2(n 1)
2
n(n 1)(2n 1)
4
n(n 1)(2n 1)
6
n(n 1)(2n 1)
5
n(n 1)(2n 1)
5
7. If there are more than one edge associated with a given pair of vertices, then these edges are
called
A) loop
B) Combined edges
C) lines
D) Parallel edges
11. An automaton system in which the output depends only on the present input is called a
.
A) Mealy machine
B) Moore machine
C) Dot machine
D) DF machine
12. The machine which has a finite number of states is called a ..
A) Finite automata
B) Finite control
C) Deterministic finite machine
D) finite graph
VT {0,1}
, V N {S }, ,S )
21. The language for the grammar G (
where the set of
productions : S11S, S0 is
A) L(G) = {0, 000, 11000, 1111110,..}
B) L(G) = {0, 110, 10000, 1111110,..}
C) L(G) = {0, 110, 11110, 1110000,..}
D) L(G) = {0, 110, 11110, 1111110,..}
22. A .. is an ordered tree in which each vertex is labeled with the left sides of a
production and in which the children of a vertex represents its corresponding right sides.
A) complete tree
B) derivation tree
C) ordered tree
D) binary tree
28. The lexical analysis phase of a computer is often based on the of a finite
automaton.
A) Simulation
B) Artification
C) Simplification
D) Addition
29. At regular intervals the automaton reads one symbol from the
A) Output tape
B) Input tape
C) Monitor
D) Initial tape
30. The is called the finite control.
A) White box
B) Black box
C) Yellow box
D) Red box
31. All the edges of the transition graph are labeled as
A) Input
B) Output
C) Input/Output
D) Input transition.
32. If Q is the set of states, then the number of set of subsets of Q is
A) 3Q
B) 2Q
C) 4Q
D) 5Q
33. The start state of MN is the start state of ..
A) NM
B) MP
C) MQ
D) MD
34. In the output (q(t), x(t)), here q(t) is the
A) present state
B) present input
C) Mealy state
D) Moore state
35. A .. can be accepted both by deterministic as well as nondeterministic
automata.
A) Irregular expression
B) Regular expression
C) Transit expression
D) Intransit expression
36. .. is a regular expression denoting empty language.
A)
B)
C)
D)
37. Let x, y , here x + y represents the set
A) {x, y}
B) {x, y, z}
C) {y, z}
D) {x, z}
38. A set which is represented using a regular expression is known as a
A) Irregular set
B) Regular set
C) Empty set
D) Finite set
39. If L1 and L2 are regular then L1 denotes
A) Language
B) Irregular language
C) Regular Language
D) Grammar
40. A =
A)
B) A
C) N
D)
A B {x / x A and x B }
ii.
A B {x / x A or x B }
A) (i) T
(ii) T
B) (i) F
(ii) F
C) (i) T
(ii) F
D) (i) F
(ii) T
A
(i) A {x / x A or x }
(ii) A {x / x A and x }
A) (i) T (ii) T
B) (i) F (ii) F
C) (i) T (ii) F
D) (i) F (ii) T
i 1
i
1
A)
12
23
B)
23
12
C)
10
23
D)
23
10
45. For any finite set A, the cardinality of the power set of A is
A) 2n
B) 2A
C) 2n(A)
D) 2
46. A binary tree is a tree in which no parent can have more than . children.
A) 0
B) 1
C) 3
D) 2
q,)
(
q
(i) (q , )
q ,w )
(ii) (q ,wa )
((
,a )
A) (i) F (ii) T
B) (i) T (ii) F
C) (i) T (ii) T
D) (i) F (ii) F
q,)
(
q
(i) (q , )
Aj
(ii) (q ,wa )
A) (i) T (ii) F
B) (i) F (ii) T
C) (i) T (ii) T
D) (i) F (ii) F
D) (i) F (ii) F
55. Consider the finite state automaton defined by the following table.
States a
q0
q0
q2
q1 q0
q3
q0
q2 q3
q2
q0
q1
q0
B) q0
C) q3
D) q2
q1
q3
A) q1
q1
B) (i) F (ii) F
C) (i) T (ii) F
D) (i) F (ii) T
1 0 0
A) 0 0 1
0 0 0
1 0 0
B) 0 1 1
0 0 0
1 0 0
C) 0 0 1
0 0 1
0 1 1
D) 0 0 1
0 0 0
64. The concatenation of 1110 and 0111 is .
A) 11100111
B) 11000111
C) 10000011
D) 11111001
65. A tree G with n vertices has .. edges.
A) 2n + 1
B) 2n 1
C) n 1
D) n + 1
n
2
70. Drawing the state diagram for the finite automation M Q, , q0 , , F where
q
0
q
0
q1
q1
q0
q2
q2
q2
q2
74. Let R be the relation from the set A = {1, 3, 4} on itself, if R is defined by
R = {(1,1), (1, 3), (3,3), (4,4)} then the relation matrix for R is
A) M R
1 1 0
0 1 0
0 0 1
B) M R
1 1 0
0 1 0
0 0 0
C) M R
1 1 0
1 1 0
0 0 1
D) M R
1 1 1
0 1 0
0 0 1
75. If f(x )
a n x n a n 1x n 1 .... a1x a 0 where a 0 ,a1,........, a n 1,a n are real numbers
then f(x) is
A) O(xn1)
B) O(xn2)
C) O(xn)
D) O(xn3)
Answer Keys
Part - A
Q. No.
Ans. Key
Part - B
Q. No.
Ans. Key
Q. No.
Ans. Key
Part - C
Q. No.
Ans. Key
21
41
61
22
42
62
23
43
63
24
44
64
25
45
65
26
46
66
27
47
67
28
48
68
29
49
69
10
30
50
70
11
31
51
71
12
32
52
72
13
33
53
73
14
34
54
74
15
35
55
75
16
36
56
17
37
57
18
38
58
19
39
59
20
40
60