CS402 Assignment No. 02 Solution Fall 2016

CS402 Assignment No. 02 Fall 2016

Here is the Complete CS402 Theory of Automata Assignment No. 2 and its Solution for Fall 2016 Due Date: Dec 05/2016. You can download Solution files from the links given at the end of this Assignment.

Also Read: Mth301 midterm Solved past papers

CS402 Assignment No. 02

Semester Fall 2016
CS402- Theory of Automata.
CS402 AssignmentTotal Marks: 20
CS402 Assignment Due Date: 05/12/2016

Also Read: financial accounting MGT101 Solved Papers

CS402 Assignment Instructions

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.

Also Read: CS 201 all past solved midterm papers 2015

CS402 Assignment 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

Also Read: CS101 Latest Solved MCQs

CS402 Assignment Objective

The objective of this assignment is:

• To give knowledge and understanding of Nondeterministic Finite Automat (NFA).
• To be able to draw NFA and NFA to Finite Automata (FA).

Also Read: CS201 Solved Final Term Past Papers Collection

CS402 Assignment Note:

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

Also Read: CS201 Latest Solved MCQs For Final Term Papers

Lectures Covered in CS402 Assignment

This assignment covers Lecture # 14 -17

CS402 Assignment Question No.01:

Construct Nondeterministic Finite Automaton (NFA) for the following regular expression:

a) (Y + Z)Y*( YZ + ZY )

b) (Y + Z)(YZ)*(Y)

CS402 Assignment Question No.02:

Convert the following NFA to an FA with the help of a transition table.

CS402 ASSIGNMENT 2 SOLUTION FALL 2016

Here You can Download CS402 Assignment Solution for Fall 2016 from the links below:

• CS402 2nd assignment solution.docx, 78 KB
• CS402.docx, 78 KB