Scribd
Upload
33 views

Fall cs636

This document outlines Assignment No. 01 for the CS636 – Formal Methods course, due on November 08, 2024, with a total of 15 marks. It includes strict instructions against cheating and specifies that late submissions or corrupt files will not be accepted. The assignment involves analyzing a vending machine scenario, requiring students to define states, input alphabets, and create a Deterministic Finite Automata diagram.

Uploaded by

Hamza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
33 views

Fall cs636

This document outlines Assignment No. 01 for the CS636 – Formal Methods course, due on November 08, 2024, with a total of 15 marks. It includes strict instructions against cheating and specifies that late submissions or corrupt files will not be accepted. The assignment involves analyzing a vending machine scenario, requiring students to define states, input alphabets, and create a Deterministic Finite Automata diagram.

Uploaded by

Hamza
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment No.

01

Semester Fall 2024

CS636 – Formal Methods


Marks: 15
Due Date: November 08, 2024

It is expected that students will solve the assignments themselves. Following rules will apply
during the evaluation of assignment.

Instructions to Solve Assignments


 Cheating from any source will result in zero marks in the assignment.

 In case of cheating, both solutions (i.e. solution of the cheating student and the one whose
solution was cheated) will be awarded with zero marks.

 No marks will be awarded in case if the file is corrupt or does not open for any reason.

 Solutions after due date will not be accepted in any case.


Do Question: [Marks (5+5+5=15)]
Consider the Vending machine example given in Week 3 module, however, now the
requirements are as follows:
 The machine accepts $1 and $0.5 per soda
 Once the machine receives $2.0, it allows the user to select soda
 Self-loop represents ignored input
 Soda will not be dispensed until $2.0 is deposited
 The machine will not accept more money, once $2.0 is deposited
Perform the following tasks:
 Show the complete set of states
 Show the complete set of input alphabets
 Draw the Deterministic Finite Automata diagram of the above scenario.

You might also like