# CS402 Current Finalterm Papers Fall 2020-2021 and Past Solved Papers

CS402 Current Finalterm Papers Fall 2020-2021 and Past Solved Papers

CS402 Current Finalterm Papers Fall 2020-2021 and Past Solved Papers

On This Page, I Have** Current Final Term Past Papers**. Mostly 50% Or Above Papers Comes From **Current Past Papers**. We Provide You All Books Past Papers. We Are Working On The Website Day By Day To Provide You Better Solution Files For Your Exams. Current Past Papers Page See Below!

Download And Share **Current Past Papers** From Here.

Points To Be Noted! These Papers Have Been Solved By Students Up To Their Best Knowledge, But If You Find Any Mistake In The Solution Please Contact Us. Your Instructions Can Help Us To Improve Solution Files. Never Shy To Contact Us. We Provide You A Link Through You Can Contact With Us.

CS402 Current Finalterm Papers Fall 2020-2021 and Past Solved Papers#CS402 Current Finalterm Papers Fall 2020-2021 and Past Solved Papers#CS402 Current Finalterm Papers Fall 2020-2021 and Past Solved Papers#CS402 Current Finalterm Papers Fall 2020-2021 and Past Solved Papers#CS402 Current Finalterm Papers Fall 2020-2021 and Past Solved Papers#CS402 Current Finalterm Papers Fall 2020-2021 and Past Solved Papers

### CS402 Current Finalterm Papers Fall 2020-2021 and Past Solved Papers

**Cs 402 time 2 30 pm**What are joints on push down automation PDA? 3

Define decideable problem with example? 3

Write string aabaab from the given scienrio

S–> XY

X–> ax/ yb / ^

Y –> yb/ ^ 3

From given string aabaababbb draw GTG ? 3

If sigma = ( a,b) then solve following strings

S–> x a| X b | a

X –> y b | Yb | b

Y –> Yb | ^ 3

If there are two languages L 1 L 2

Draw TG from the following

L 1 starting with ( a, b) ending with aa

L 2 stating with (a,b) ending with bb. 5

Draw string aaabbbbaaaa by using CFG. 5

Write all steps of FA that corresponding to the intersection of two FAs. 5

CS402 Current Finalterm Papers Fall 2020-2021 and Past Solved Papers

**CS402Time: 7 30MCQS. All Past Ppr**Subjective:

Diff. Btwen Decidable and Decisions procedure with example 3 Marks

Aik PDA diagram thi us ki… Kuch maloom krni thi yaad nhi 5 marks

Us k bad RE diagram thi. Us me total number maloom krny thy state se less hon aisay e thaw 5 marks

Aik string di hoi thi £={0,1} is ki 6 strings maloom krni thi aisa kuch thaww.. 3 marks

Baki yaad nahi

Overall easy thaw

Or Lab Updated thi.. Hp ka Computer cor i7 pc saray outclasss Lab thi

**CS402 Current Finalterm Papers Fall 2020 | 27-02-2021**Today paper of cs402

Pda ki applications

Regular languages or non regular

Complement of fa graph

Mcqs from past paper mostly

**CS402 Current Finalterm Papers Fall 2020 | 28-02-2021 | 11:30 AM**Cs402 today 11:30am

MCQ’s mostly from past papers

Long question were totally conceptually

2 from past papers.

Over all average paper

**CS402 VU Current Final Term Papers Spring 2020 **

CS402 Current paper,

Which one of the following languages is a non-regular language?

Which of the following are called as Halt states in PDA?

Identify the TRUE statement about following CFG:

S -> SB|AB

A -> CC

B -> b

C -> a

Which of the following cannot be represented by a regular expression?

Set of all palindromes over {a,b} is:

The CFG S–> aSa | bSb | a | b | ^ represents language.

The strings or words which do not belong to a language are called of that language.

The locations into which we put the input letters on “Input Tape” are called.

Identify the FALSE statement about following CFG:

S -> SB|AB

A -> CC

B -> b

C -> a

In a CFG, the non-terminals are denoted by.

Before the CFG corresponding to the given PDA is determined, the PDA is converted into the standard form which is called.

Set of all palindromes over {a,b} is:

Between the two consecutive joints on a path

For a machine with N number of states, the total number of strings to be tested, defined over an alphabet of m letters, is.

Ok wait aaik quiz kar rahaa hun phir karta hun

conversion form of PDA, there is

Which of the following is not a true theorem?

A is the one for which every input string has a unique path through the machine.

Identify the TRUE statement about following CFG:

S -> SB|AB

A -> CC

B -> b

C -> a

Prime is a language.

“The product of two regular languages is.”

A problem that has decision procedure is called problem.

In the null production N –> ^, N is a.

Null production is a.

In a STACK:

The language of all strings not beginning with ‘b’ partitions ∑* into distinct classes.

If R is regular language and Q is any language (regular/ non-regular), then Pref is regular.

Even-Even language partitions ∑* into distinct classes.

If a CFG has a null production, then it is.** =====Subjective=====**Mealy machine ka 5 no ka sawal tha?

Regular Experation to CFG(context free gramer)

PDA graph draw karna tha

CFD dia huwa tha uska regular exprastion finde karna tha

2 long graph waly thy unki output btani thi.

Last m Explain the PDF daigram state and symbols

Pseudo Theorem whether it has a proof or not.

Write three condition of PDA to conversion form.

Suppose two inputs are provided to a NAND gate. What will be the value of inputs such that there NAND output would be zero? (2)

Aik PDA diagram given thi .. what language will it accept? (5)

**Cs402 Paper**All MCQs from Sonu solved files

Subjective are.

truth table

non regular

mealy machine

PDA condition

statement given and find out false.

**Cs402 today paper**Listin malik shahzaib Lectures on youtube.. Most of the mcqs and subjective question easily solveable after Listin the lectures.

Today paper 3 subjective from CFG and 5 mcqs from CFG topic.

One mealy moree machine question.

One union uestion

One question from concatination of NFA