We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

# CS402 Online Quiz No 04 will be launched on March 2, 2015

Dear students,

Please note that Quiz-4 will be launched on March 2, 2015 and will include lectures No. 35 to 41.

QUIZ will last for 48 hours only and no alternate/offline will be provided once it is missed.

For any query, feel free to email at cs402@vu.edu.pk

Best Of Luck ....!!

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

Views: 1907

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

### Replies to This Discussion

Identify the FALSE statement about following CFG: S -> SB|AB A -> CC B -> b C -> a
just 1 mint remainig
CFG generates NULL string
CFG is not in CNF
CFG has 8 Nonterminals
All of the given options

Between the two consecutive joints on a path

One character can be pushed and one character can be popped
Any no. of characters can be pushed and one character can be popped
One character can be pushed and any no. of characters can be popped
Any no. of characters can be pushed and any no. of characters can be popped

In new format of FA (discussed in lecture 37), This state is like initial state of an FA

ACCEPT
REJECT
START

Consider the following CFG: (NOTE: ^ means NULL) S->a|Xb|aYa X->Y|^ Y->b|X Which Nonterminals are nullable

S and X
X and Y
Y and S
S,X and Y

which path sequence follows the rules of "conversion form" of "PDA"

POP -> POP -> POP

READ -> POP -> PUSH a

In the null production N --> ^, N is a

Terminal
Non terminal
Word
Semi word

Consider the Following CFG: (NOTE: ^ means NULL) S->Xa X->aX|bX|^ above given CFG can be represented by RE
A*B*
a*b*a
(a+b)*a
a(a+b)*a

Before the CFG corresponding to the given PDA is determined, the PDA is converted into the standard form which is called.
Finite Automaton
Chomsky Normal Form (CNF)
Conversion form
none of given

Tape and Stack alphabets
are same
may be different

must be different
must be same

Attachments:

thank you nayab sis

S

CFG no 2 only

4th

2nd

## Latest Activity

Misbii Khan updated their profile
2 hours ago
4 hours ago
4 hours ago
Bilal joined +M.Tariq Malik's group

### MTH303 Mathematical Methods

6 hours ago
stylo updated their profile
7 hours ago
9 hours ago
Amylah joined +M.Tariq Malik's group

### CS401 Computer Architecture and Assembly Language Programming

9 hours ago
9 hours ago
M. Umair Shahid replied to ElusoryOwl's discussion DosBox Error
10 hours ago
ShAah ZaaDi joined +M.Tariq Malik's group

### MTH302 Business Mathematics & Statistics

10 hours ago
ShAah ZaaDi and + Ḱẚảḿḯ are now friends
10 hours ago

1

2

3