04_14_2008_Recitation_Guide

04_14_2008_Recitation_Guide - Recitation Guide for April...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Recitation Guide for April 14th, 2008 I. Housing Keeping a. Quiz 4 in class Friday April 18 th b. Homework 8 due Friday April 25 th c. Will try to have exam 2s graded this week. d. All homeworks HW1 HW5 should be graded. If not, talk to your grading TA. II. State Machines a. A state machine is composed of an initial or starting state, new states, transitions between states and some cases ending states. State machines are usually represented with state diagrams. General state diagram: The start state is indicated by an arrow that does not originate from a state. You cannot switch to a different state without a transition. It is a possible to have a transition back to the current state b. Consider the WolfDeerSimulation: i. Wolf states 1. HUNGRY The wolf is hungry and wants food 2. SATISFIED The wolf is not hungry 3. STARVED The wolf has starved and is now dead ii. Wolf Transitions 1. If in HUNGRY state and hungryTimer reaches 0, the wolf will become STARVED. 2.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/30/2010 for the course CS 1316 taught by Professor Staff during the Spring '08 term at Georgia Tech.

Page1 / 3

04_14_2008_Recitation_Guide - Recitation Guide for April...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online