CS402 Midterm Online Quiz

0%

CS402-Midterm

1 / 50

Let S = {aa, bb} be a set of strings then s* will have

2 / 50

If r1 = (aa + bb) and r2 = ( a + b) then the language (aa + bb)* will be generated by

3 / 50

If S = {ab, bb}, then S* will not contain

4 / 50

The _______ machine helps in building a machine that can perform the addition of binary numbers.

5 / 50

If S = {aa, bb}, then S* will not contain..

6 / 50

RE for the language defined over Σ={a,b} having words starting with a is____

7 / 50

In TG there may exist no paths for certain string.

8 / 50

TG is always deterministic.

9 / 50

Every FA should be __________

10 / 50

In FA final state represent by _________sign

11 / 50

If r1 and r2 are regular expressions then which of the following is not regular expression.

12 / 50

Which statement is true?

13 / 50

In which of the following language Rev(s)=s

14 / 50

GTG can have _______________ final state.

15 / 50

If FA1 accepts no string and FA2 accepts many strings, then FA1 + FA2 will be equal to

16 / 50

In TG there may exist no paths for certain string.

17 / 50

In FA, if one enters in a specific state but there is no way to leave it, then that specific state is called

18 / 50

In FA one enter in specific stat but there is no way to leave it then state is called

19 / 50

(a + b)* a is RE for the language defined over S={a,b} having words not ending in b

20 / 50

Languages generated by kleene star are always ______________.

21 / 50

a*b* = (ab)* this expression is __________

22 / 50

If an alphabet has n number of letter, then number of strings of length m will be

23 / 50

Using tree structure final state represent by

24 / 50

a(a+b)*a+b(a+b)*b is RE for the language defined over S={a,b} having words beginning and ending with same letters

25 / 50

The length of output string in case of _________ is one more than the length of corresponding input string.

26 / 50

S= {a,bc,cc} has the latters

27 / 50

(a+b)*a(a+b)*b(a+b)* is the RE of language defined over S={a,b} having at least one a and one b

28 / 50

“One language can be expressed by more than one NFA”. This statement is ______________.

29 / 50

(a + b)*b is RE for the language defined over S={a,b} having words not ending in a

30 / 50

TG can have more than one initial state.

31 / 50

In TG there may exist no paths for certain string.

32 / 50

Σ={a,Aa,Abb}, then string aAaAbbAa has ________ length.

33 / 50

S = {baa, ab}, then S* will not contain

34 / 50

One language can be represented by more than one RE” this statement is____

35 / 50

One FA has 3 states and 2 letters in the alphabet. Then FA will have ___________ number of transitions in the diagram

36 / 50

In NFA, there may be more than one transition for certain letters and there may not be any transition for certain letters. This statement is ______________.

37 / 50

One FA has n states and m letters in the alphabet. Then FA will have _____ number of transitions in the diagram.

38 / 50

Length of strings, generated by infinite language is_______

39 / 50

In GTG, if a state has more than one incoming transitions from a state. Then all those incoming transitions can be reduced to one transition using _____________ sign

40 / 50

Two machines are said to be equivalent if they print the same output string when the different input string is run on them

41 / 50

If a language is expressed through TG, then that language will have its RE.

42 / 50

One language can be represented by more than one RE” this statement is____

43 / 50

If an alphabet has n number of letter, then number of strings of length m will be

44 / 50

Alphabet S = {a,bc,cc} has _______ number of letters.

45 / 50

If a language has RE, then that language can be expressed through TG.

46 / 50

TG can more then one initial state

47 / 50

a (a + b)* is the RE of language defined over S = {a, b} having at least one a

48 / 50

PALINDROME can be defined by more than one regular language

49 / 50

Alphabet S = {a,bc,cc} has _______ number of letters.

50 / 50

Then initial state of FA3 will consist of

Your score is

The average score is 54%

0%

Qunoot e Nazilah
Dua e Hajat
4 Qul
6 Kalma
Dua-e-Akasha
Darood Akbar
Surah Fatiha
Dua-e-Ganj Ul Arsh
Dua-e-Jamilah
Ayat-ul-Kursi