CS402 Midterm Online Quiz

0%

CS402-Midterm

1 / 50

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

2 / 50

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

3 / 50

Using tree structure final state represent by

4 / 50

GTG can have _______________ final state.

5 / 50

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

6 / 50

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

7 / 50

Every FA should be __________

8 / 50

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

9 / 50

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

10 / 50

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

11 / 50

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

12 / 50

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

13 / 50

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

14 / 50

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

15 / 50

Languages generated by kleene star are always ______________.

16 / 50

“Every Infinite language is regular” this statement is

17 / 50

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

18 / 50

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

19 / 50

In FA final state represent by _________sign

20 / 50

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

21 / 50

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

22 / 50

In TG, there may be a transition for null string.

23 / 50

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

24 / 50

TG can more then one initial state

25 / 50

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

26 / 50

One language can represents more than one RE.

27 / 50

Length of strings, generated by infinite language is_______

28 / 50

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

29 / 50

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

30 / 50

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

31 / 50

Languages generated by kleene star are always ______________.

32 / 50

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

33 / 50

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

34 / 50

Which statement is true?

35 / 50

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

36 / 50

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

37 / 50

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

38 / 50

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

39 / 50

GTG can have _______________ final state.

40 / 50

In FA final state represent by _________sign

41 / 50

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

42 / 50

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

43 / 50

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

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

45 / 50

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

46 / 50

TG is always deterministic.

47 / 50

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

48 / 50

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

49 / 50

In TG there may exist no paths for certain string.

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

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