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

Looking For Something at vustudents.ning.com? Click Here to Search


+ Link For Assignments, GDBs & Online Quizzes Solution


+ 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

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

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


Please read the following instructions carefully before solving & submitting assignment:

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.

Uploading instructions

Your submission must include:


  • Assignment should be in .doc or .docx format.
  • Save your assignment with your ID (e.g. bx020200786.doc).

Assignment submission through email is NOT acceptable


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).



Your answer must follow the below given specifications.

  •  Font style: “Times New Roman”
  •  Font color: “Black”
  •  Font size: “12”
  •  Bold for heading only.
  •  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


Your assignment must be uploaded/submitted at or before 16/11/2016.






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).






+ How to Follow the New Added Discussions at Your Mail Address?

+ 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?

See Your Saved Posts Timeline

Views: 4488


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

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

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)

Replies to This Discussion

n*(nm* nm*)* kia ye thk hai mjy lgta n ka closure ni laina kindly correct me if i am wrong

CS401 Q.2 solution.

ye diagram mujh koi samja sakta ha?

kya ye thk h F.A?

men ne check ki h mje to thk lg rhi h. Ap se conform krna chah rha hn

Yah diagram corret h

zra samaj ni aa rhi mje to 

Mujhy bhi

koi to samjao is diagram ko


© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service