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 Assignment No 01 Solution & Discussion Due Date:16-11-2016

CS402 Assignment No 01 Solution & Discussion Due Date:16-11-2016

Instructions

It should be clear that your assignment will not get any credit  if:

• The assignment is submitted after due date.
• The submitted assignment does not open or file corrupt.
• The assignment is full or partially copied from (other student or ditto copy from handouts or internet).
• Student ID is not mentioned in the assignment File or name of file is other than student ID.
• The assignment is not submitted in .doc or .docx format.

`Your submission must include:`

• Assignment should be in .doc or .docx format.

Assignment submission through email is NOT acceptable

## Objective

The objective of this assignment is

• To give knowledge and understanding of Regular Expression.
• To be able to understand and draw the Finite Automata (FA).

Note:

•  Font style: “Times New Roman”
•  Font color: “Black”
•  Font size: “12”
•  Font in Italic is not allowed at all.
•  No formatting or bullets are allowed to use.
• Your answer should be precise and to the point, avoid irrelevant detail.

Lectures Covered: This assignment covers Lecture # 01 - 09

Question No: 01 (Marks:  05 + 05)

(a)    Write a regular expression for the language over an alphabet Σ = {u, v} in which all strings do not end with uu.

(b)   Write a regular expression for the language over an alphabet Σ = {m, n} in which all strings have number of m’s divisible by 2.

Question No. 02 (Marks:  10)

Draw (Build) the FA for the language described in question no. 1 part (a).

=====================================Ended=======================================

+ 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: 4528

.

+ 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

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions.

Q1 part 9(a).

the Regular expression for the language having all strings do not ending with uu is :
empty + u +v+(u+v)*(uv+vu+vv)

Q No 1 part b:

alphabet Σ = {m, n} in which all strings have number of m’s divisible by 2.

Expression is:

n*(nm* nm*)*

Q2 comming soon

yahan ap ny n*(nm*nm*)* likha h jb k neechy assignment file me n*(mn*mn*)* likha h kia ye dono e thk h?

Dear Students Don’t wait for solution post your problems here and discuss ... after discussion a perfect solution will come in a result. So, Start it now, replies here give your comments according to your knowledge and understandings....

cs402 assignmnt solution

Attachments:

Thanks for the efforts...

alos ch this link for cs402 in word file

Attachments:

Mjhe kuch b smjh ni arhe koi mere help ker dy :(

na book ki na assignment ki

mujh ye q2 ka FA diagram samj ni aaya

ye q2 f FA wala diagram samjh ni aya koi bta sakta ha?????

konsa FA wla???

me too

## Latest Activity

Munna Bhai MBBS posted discussions
48 minutes ago
Munna Bhai MBBS posted a status
54 minutes ago
1 hour ago
1 hour ago
1 hour ago
1 hour ago
Shanzay replied to Shanzay's discussion Nahii Karta...
2 hours ago
2 hours ago
2 hours ago
2 hours ago
+ıllıllı ᎶᏋᏁᎥᏬᏕ ᏰᎥᏒᎴ ıllıllı+ liked Shanzay's discussion Nahii Karta...
2 hours ago
Rabnawaz joined +M.Tariq Malik's group

3 hours ago

1

2

3