Suppose your nearest movie theater is showing two movies - Gangs of Wasseypur(which costs 700 rupees per ticket) and The Avengers(which costs 500 rupees per ticket). Consider a kiosk which can dispense at most 3 tickets of same movie at a time. The kiosk follows the following procedure:

- Asks you to choose the movie.
- Asks you the number of tickets you want for the movie(Recall that max limit is 3).
- Asks you to insert the corresponding amount(It can only accept Rs. 100, Rs. 200 and Rs. 500 bills). If excess amount is inserted, the machine returns the excess.
- Stops accepting money as soon as it has the exact corresponding amount, and dispenses the tickets.

The given description is incomplete, and does not mention what are the states and what are the actions. Attempt to define it precisely, and design a finite state diagram to represent the kiosk. For each action, assign a capital letter of the Latin alphabet, and design a program which takes a string over that alphabet and returns the name of state the system reaches on execution of the sequence of the corresponding actions.

Can you construct a finite state diagram to represent a kiosk which can dispense any number of tickets at once? If yes, give the construction. Explain why not, otherwise.

Tessellate S.T.E.M.S (2019) - Computer Science - College - Set 2 - Subjective Problem 1

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

There are no comments in this discussion.