CS402 Midterm Online Quiz

0%

CS402-Midterm

1 / 50

Languages generated by kleene star are always ______________.

2 / 50

In TG there may exist no paths for certain string.

3 / 50

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

4 / 50

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

5 / 50

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

6 / 50

“Every finite language can be expressed by FA”. This statement is __________.

7 / 50

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

8 / 50

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

9 / 50

If L1 and L2 are expressed by regular expressions r1 and r2, respectively then the language expressed by r1 + r2 will be _________

10 / 50

In FA final state represent by _________sign

11 / 50

Then initial state of FA3 will consist of

12 / 50

FA1 corresponds to r*, then FA1 must accept _______________ string.

13 / 50

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

14 / 50

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

15 / 50

In TG there may exist no paths for certain string.

16 / 50

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

17 / 50

If in an NFA, ^ is allowed to be a label of an edge then that NFA is called _________.

18 / 50

TG can more then one initial state

19 / 50

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

20 / 50

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

21 / 50

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

22 / 50

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

23 / 50

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

24 / 50

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

25 / 50

S={a,bb,bab,baabb} set of strings then S* will not have

26 / 50

“Every Infinite language is regular” this statement is

27 / 50

Which of the following is not a word of language EQUAL?

28 / 50

In TG there may exist no paths for certain string.

29 / 50

Which statement is true?

30 / 50

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

31 / 50

Length of strings, generated by infinite language is_______

32 / 50

TG can have more than one initial state.

33 / 50

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

34 / 50

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

35 / 50

According to 3rd part of the Kleene’s theorem, If a language can be accepted by an RE then it can be accepted by a _________ as well

36 / 50

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

37 / 50

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

38 / 50

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

39 / 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

40 / 50

FA1 and FA2 are two FA’s representing two languages. Then FA3, which is sum of FA1 and FA2, will accept the strings which are

41 / 50

In drawing FA3 (which is equal to FA1 + FA2), a state will be declared final if

42 / 50

The clouser FA*(star on an FA ) always accept ______string

43 / 50

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

44 / 50

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

45 / 50

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

46 / 50

Languages generated by kleene star are always ______________.

47 / 50

If a language can be expressed through FA, then it can also be expressed through TG.

48 / 50

Every FA should be __________

49 / 50

In GTG’s there may exist no path for a certain string.

50 / 50

GTG can have _______________ final state.

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