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

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

a. aabbbb

b. bbaabbbb

c. aaabbb

d. aabbaa

2 / 30

Category: Cs402-mid

GTG can have _______________ final state.

a. 1

b. More than 1

c. 0

d. All of the given

3 / 30

Category: Cs402-mid

Length of null string is

a. All are true

b. It has variable length

c. Always equal to 0

d. Always not equal to 0

4 / 30

Category: Cs402-mid

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

a. None of these

b. Can’t be assumed

c. False

d. True

5 / 30

Category: Cs402-mid

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

a. 3

b. 1

c. 4

d. 2

6 / 30

Category: Cs402-mid

“Every Infinite language is regular” this statement is

a. False

b. True

7 / 30

Category: Cs402-mid

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

a. None of these

b. False

c. Can’t show transition for string

d. True

8 / 30

Category: Cs402-mid

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

a. True

b. Such a language is not regular

c. False

d. None of these

9 / 30

Category: Cs402-mid

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

a. FA2

b. None of the given

c. May be both

d. FA1

10 / 30

Category: Cs402-mid

GTG can have _____________ initial state

a. Zero

b. One

c. More than One

d. One OR more than One

11 / 30

Category: Cs402-mid

Every FA should be __________

a. Deterministic

b. Non- Deterministic

c. None of these

d. Deterministic & Non- Deterministic

12 / 30

Category: Cs402-mid

TG is always deterministic

a. False

b. True

13 / 30

Category: Cs402-mid

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

a. At least one state is final

b. Depends on language

c. None of the given

d. States of both FA’s are final

14 / 30

Category: Cs402-mid

Length of strings, generated by infinite language is_______

a. inite

b. infinite

c. none of these

15 / 30

Category: Cs402-mid

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

a. Four

b. Three

c. One

d. Two

16 / 30

Category: Cs402-mid

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

a. 7

b. 6

c. 5

d. 4

17 / 30

Category: Cs402-mid

Auto Meta mean

a. Manual work

b. Automatic work

18 / 30

Category: Cs402-mid

Using tree structure final state represent by

a. double circle

b. None of given

c. -

d. *

19 / 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. All of these

b. Dead States

c. Waste Baskets

d. Davey John Lockers

20 / 30

Category: Cs402-mid

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

a. False

b. True

c. None of these

d. Can’t be assumed

21 / 30

Category: Cs402-mid

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

a. Waste Baskets

b. Dead States

c. Davey John Lockers

d. All of above

22 / 30

Category: Cs402-mid

In TG there may exist no paths for certain string.

a. None of these

b. True

c. False

d. Depends on the language

23 / 30

Category: Cs402-mid

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

a. None of the given

b. *

c. -

d. +

24 / 30

Category: Cs402-mid

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

a. r1*

b. r1 – r2

c. r1 = r2

d. r1r2

25 / 30

Category: Cs402-mid

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

a. None of these

b. (a+b)*

c. a(a+b)*

d. (a+b)*a

26 / 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. False

b. None of these

c. True

d. Such a language is not regular

27 / 30

Category: Cs402-mid

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

a. baabbab

b. bbaaabb

c. bbbaabaabb

d. baba

28 / 30

Category: Cs402-mid

TG can more then one initial state

a. True

b. Depend on alphabets

c. False

d. None of given

29 / 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. G and FA

c. FA

d. None of these

30 / 30

Category: Cs402-mid

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

a. bbaab

b. abba

c. aabbbaa

d. Λ

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