Showing posts with label cs402. Show all posts
Showing posts with label cs402. Show all posts

CS402 Assignment no. 3 Solution Fall 2016

By: // No comments:

CS402 Assignment No. 03 Fall 2016

Here is the Complete CS402- Theory of Automata Assignment Solution and discussion. CS402 Assignment no. 3, Semester Fall 2016. Due Date: 16/ 01//2017. Total Marks of Assignment are 20. 

Also Read: CS601 Assignment no 3 Fall 2016

You Can Also Download CS402 Solved Final Term Papers, CS402 Short Notes, CS402 Assignment Solutions, Lecture Wise Questions Answers Files, Solved MCQs, Solved Quiz ,CS402 Solved Final Term Subjective Papers ,CS402 Solved Final Term Objective Papers from Virtual Study Solutions For Preparation of Final Term Papers.


Also Read: CS201 Assignment no 3 Fall 2016

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: ENG101 English Comprehension Short Questions Answers

CS402 Assignment Uploading instructions

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
Objective 

Also Read: MTH202 Discrete Mathematics Final Term Solved Papers

CS402 Assignment objective


  • To give knowledge and understanding of Mealy machines in terms of sequential circuit 
  • To be able to draw Transition Graph(TG). 

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

CS402 Assignment Lectures Covered

This assignment covers Lecture # 23 -26 

CS402 Assignment Deadline: 

Your assignment must be uploaded/submitted at or before 16th January ,2017

For any query about the assignment, contact at CS402@vu.edu.pk

Question No.01: 

(Marks 10)

Let us consider the following languages Lx and Ly:

Lx= Language of strings defined over Σ = {p, q}, ending with pp.

Ly = Language of strings defined over Σ = {p, q}, ending with qq.

You are required to draw a Transition Graph (TG) Corresponding to LxLy.

Question No.02: 

(Marks 10)

You are required to draw the corresponding Mealy Machine for the following table: consider q0 as initial state. 

CS402 Assignment no. 3 Solution Fall 2016
CS402 Assignment Question no 2

CS402 Assignment no. 3 Solution

CS402 Assignment Question No.02 Solution


CS402 Assignment no. 3 Solution Tutorial



If you want to Get the Solution Directly in Your Inbox. Subscribe us below and save your self Trouble of Searching Assignment Solution.

CS402 Assignment No. 02 Solution Fall 2016

By: // No comments:

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.

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

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.

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 Assignment No 01 Solution Fall 2016

By: // 1 comment:

CS402 Assignment No 01 Fall 2016

Here You can download VU Theory of Automata - CS402 Assignment with Solution. CS402 theory of automata Assignment No 01 Solution and Discussion Due Date:16-11-2016. 

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

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

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.

Lectures Covered: This assignment covers Lecture # 01 - 09

CS402 Assignment Deadline

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

CS402 Assignment Question No: 01 

(Assignment  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.

CS402 Assignment Question No. 02 

(Assignment Marks: 10)

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


You should Also Read:


CS402 Assignment No 01 Solution

CS402 Assignment Question No. 01 Solution:

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

Solution:
RE = L + u + v + (u + v ) * (uv + vu + vv)

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

Solution:

RE = n * ( mn * mn*) * OR ( n + mn * m) *

OR

( n * mn * m ) * n *

CS402 Assignment Question No. 02 Solution:

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

Solution:
CS402 Assignment Question No. 02 Solution:
Cs402 Assignment No. 1 Question no 2 Solution


Download CS402 Assignment Solution:

Cs402-Automata.pdf, 429 KB
Cs402 Automata idea solution.DOCX, 34 KB



You Can Also Download Solved Mid Term Papers, Short Notes, Assignment SolutionsLecture Wise Questions Answers Files, Solved MCQs, Solved Quiz , Solved Mid Term Subjective Papers , Solved Mid Term Objective Papers From This Discussion For Preparation Mid Term Papers of Fall 2015-16.