Home ► My courses ► ICT_B2_CT ► General ► Computational Theory Final Examination

Started on Monday, 29 May 2023, 2:00 PM

State Finished
Completed on Monday, 29 May 2023, 2:12 PM
Time taken 12 mins 31 secs

Question 1

Complete

Marked out of 1.00

What is the representation of the Mealy machine above?

Select one:
a.

9’s Complement
b.

2’s Complement
c.

10’s Complement
d.

1’s Complement

Your answer is correct.

Question 2 The output alphabet can be represented as:
Complete
Select one:
Marked out of 1.00
a. ∆

b. ∑

c. None of the mentioned

d. δ

Your answer is correct.

Question 3

Complete

Marked out of 1.00

The function of this turing machine is:

Select one:
a. Delete a symbol

b. Copies a string

c. Insert a symbol

d. None of the listed methods

Your answer is correct.

Question 4 Transition function maps is?
Complete

Marked out of 1.00

Select one:
a. Q * Σ -> Q

b. Σ * Q -> Σ

c. Σ * Σ -> Q

d. Q * Q -> Σ

Your answer is correct.

Question 5 Given: ∑= {a, b}

Complete L= {xϵ∑*|x is a string combination}
∑4 represents which among the following?
Marked out of 1.00

Select one:
a. a) {aa, ab, ba, bb}

b. {aaa, aab, aba, bbb}

c. All of the mentioned

d. {aaaa, abab, ε, abaa, aabb}

Your answer is incorrect.

Question 6

Complete Consider the nondeterministic finite

automata below, what set can be
Marked out of 1.00

recognized?

Select one:
a.

(0+1) *(00+11) (0+1)

b.

(0+1) *(00+11) *(0+1) *

c.

(0+1) (00+11) (0+1) *

d.

(0+1) *(00+11) (0+1) *

Your answer is correct.

Question 7 Complement of (1 + 0)* will be
Complete
Select one:
Marked out of 1.00
a. null

b. phi
c. 0

d. 1

Your answer is incorrect.

Question 8

Complete Consider the Mealy machine below,

what is its output?
Marked out of 1.00

Select one:
a.

2’s Complement
b.

9’s Complement
c.

10’s Complement
d.

1’s Complement

Your answer is correct.

Question 9

Complete

Marked out of 1.00

Consider nondeterministic automata

above, what language can be
recognized?

Select one:
a.

L = {x ϵ {0,1} * |x ends in 1 and does

not contain substring 00}
b.

L = {x ϵ {0,1} * |x ends in 1 and does

not contain substring 11}
c.

L = {x ϵ {0,1} |x ends in 1 and does

not contain substring 00}
d.

L = {x ϵ {0, 1} * | x ends in 1 and

does not contain substring 01}
 Your answer is correct.

Question 10
Consider a transition function f(state(q),read(x))=(state(r),write(y),move(D)) where
Complete move cannot be:
Marked out of 1.00

Select one:
a. Left
b. None of the listed methods

c. Right

d. Terminal state

Your answer is correct.

Question 11

Complete

Marked out of 1.00

Consider NFA above, find the union

of all possible combinations at state
7,8 and 9?

Select one:
a.

{aba, ac, cc, ca, cb, bc, bab, ca}

b.

{cc, ca, cb, aba, bab, ac}

c.

{bab, bc, ac, aba, ca, aac, ccb}

d. {aba, ac, cc, ca, cb, bc, bab, caa}

Your answer is correct.