CSC 216/s08/clever imaginings: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
mNo edit summary |
||
| Line 1: | Line 1: | ||
== | ==Finite State Machines and the State Pattern== | ||
Give the title of your exercise, which may include the name of the topic you are covering, or some other catchy title. | Give the title of your exercise, which may include the name of the topic you are covering, or some other catchy title. | ||
| Line 8: | Line 5: | ||
===The problem=== | ===The problem=== | ||
Finite state machines are abstract models of systems that | Finite state machines are abstract models of systems that have a set number of states, inputs, and rules for transitioning from one state to another. Understanding all the parts of a FSM can be difficult, especially in systems that feature a large number of states and transitions. | ||
===Participants and props=== | ===Participants and props=== | ||
| Line 17: | Line 14: | ||
Describe how to do your exercise. | Describe how to do your exercise. | ||
===Formatting Resources=== | |||
[http://meta.wikimedia.org/wiki/Help:Wikitext_examples Formatting Help Guide from MetaWiki] | |||
Revision as of 22:34, 15 April 2008
Finite State Machines and the State Pattern
Give the title of your exercise, which may include the name of the topic you are covering, or some other catchy title.
The problem
Finite state machines are abstract models of systems that have a set number of states, inputs, and rules for transitioning from one state to another. Understanding all the parts of a FSM can be difficult, especially in systems that feature a large number of states and transitions.
Participants and props
How many students will participate? What else do you need (e.g., old tennis ball, Powerpoint slides, software).
The script
Describe how to do your exercise.