CS402 Midterm Past Paper

You have come here while searching for CS402 midterm past papers. But before going to download the CS402 midterm past paper. I have a better option for you. That is, that you can attempt the online quiz of CS402.

Practice Quiz from CS402 Midterm Past Paper

This quiz will evaluate your preparation for the CS402 midterm examination and it is based on the past papers of CS402 . The purpose of this quiz is to evaluate your performance in this subject. If you can pass this quiz, then there is a great chance that you can secure good marks in your exams.

0 votes, 0 avg

Your Time starts now

Times Up

Created on January 17, 2022 By

faisal_faisi

CS402

CS402 Midterm Past Papers Practice Quiz

Welcome to CS402 Midterm Online Practice Quiz.

You can check your preparation of CS402 for your Exams here.

Questions Will be different every time you will attempt.

1 / 30

Category: Cs402-mid

TG can more then one initial state

a. Depend on alphabets

b. False

c. None of given

d. True

2 / 30

Category: Cs402-mid

In TG there may exist no paths for certain string

a. True

b. False

3 / 30

Category: Cs402-mid

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

a. None of these

b. True

c. Can’t be assumed

d. False

4 / 30

Category: Cs402-mid

Using tree structure final state represent by

a. double circle

b. *

c. -

d. None of given

5 / 30

Category: Cs402-mid

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

a. Complementing

b. Incrementing

c. None of the given

d. Decrementing

6 / 30

Category: Cs402-mid

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

a. 4

b. 1

c. 2

d. 3

7 / 30

Category: Cs402-mid

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

a. NFA with null string

b. Will not remain NFA

c. NFA with

d. Either "NFA with null string" OR "NFA with "

8 / 30

Category: Cs402-mid

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

a. TG

b. FA

c. None of these

d. G and FA

9 / 30

Category: Cs402-mid

In FA final state represent by _________sign

a. -

b. *

c. /

d. +

10 / 30

Category: Cs402-mid

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

a. None of the given

b. Depends on NFA

c. False

d. True

11 / 30

Category: Cs402-mid

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

a. Can’t be decided

b. regular

c. Another Language which is not listed here

d. Regular

12 / 30

Category: Cs402-mid

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

a. None of these

b. False

c. Such a language is not regular

d. True

13 / 30

Category: Cs402-mid

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

a. (n)+(m)

b. (m)(n) OR (n)(m)

c. (m)-(n)

d. None of the given options

14 / 30

Category: Cs402-mid

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

a. abba

b. aabbbaa

c. bbaab

d. Λ

15 / 30

Category: Cs402-mid

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

a. False

b. None of the above

c. True

d. Depends on language

16 / 30

Category: Cs402-mid

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

a. Null

b. None of given

c. aa

d. bb

17 / 30

Category: Cs402-mid

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

a. Finite Automaton

b. GTG

c. TG

18 / 30

Category: Cs402-mid

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

a. Waste Baskets

b. Dead States

c. Davey John Lockers

d. All of these

19 / 30

Category: Cs402-mid

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

a. (r1)*

b. (r1 + r2)

c. (r2)*

d. (r1)(r2)

20 / 30

Category: Cs402-mid

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

a. None of these

b. True

c. Such a language is not regular

d. False

21 / 30

Category: Cs402-mid

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

a. bbaaabb

b. bbbaabaabb

c. baabbab

d. baba

22 / 30

Category: Cs402-mid

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

a. (n)(m)

b. n+m

c. n^m

d. m^n

23 / 30

Category: Cs402-mid

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

a. False

b. None of these

c. Can’t be assumed

d. True

24 / 30

Category: Cs402-mid

One language can represents more than one RE.

a. True

b. Falss

c. Non of given

d. Can’t be assumed

25 / 30

Category: Cs402-mid

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

a. True

b. False

c. None of these

d. Depends on language

26 / 30

Category: Cs402-mid

Languages generated by kleene star are always ______________.

a. Finite

b. None of the these

c. Sometimes finite & sometimes infinite

d. Infinite

27 / 30

Category: Cs402-mid

GTG can have _______________ final state.

a. 0

b. More than 1

c. All of the given

d. 1

28 / 30

Category: Cs402-mid

Auto Meta mean

a. Manual work

b. Automatic work

29 / 30

Category: Cs402-mid

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

a. True

b. None of these

c. False

d. Can’t be assumed

30 / 30

Category: Cs402-mid

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

a. May be both

b. FA1

c. None of the given

d. FA2

Your score is

The average score is 70%

Exit

Note before downloading CS402 midterm past paper

One thing to note dear fellows that you must don’t rely on these papers only. They can be a source of help but not an ultimate solution. If you want to get good marks in your exams you are advised to go through all of your handouts and must watch all of the video lectures.

Golden rules for good marks in VU Exams.

As per my experience, I have developed some golden rules for getting good marks in Virtual University Exams based on experience. I got 3.96 CGPA by following these rules. So here they are:

Never miss your Quiz, Assignment, or GDB.
Always try to do your Assignment on your own.
Try your best to finish your video lectures 10 days before exams.
Try your best to read your handouts twice before exams.
Read forward attempt backward.
Never schedule more than one paper on the same day.
Your most difficult paper should have a gap of 1 or more days.
Toughest paper must be scheduled first.
Read questions forward and attempt backward.
Don’t waste your time during a paper on illegal activities.

You can also download the Latest VU Handouts

To download the CS402 midterm past paper click here.

CS402 Midterm Past Paper online Practice Quiz

CS402 Midterm Past Paper

Practice Quiz from CS402 Midterm Past Paper

Note before downloading CS402 midterm past paper

Golden rules for good marks in VU Exams.

Leave a Comment Cancel Reply