CSC 216 F09/ - Revision history

Djallred at 02:51, 18 November 2009

2009-11-18T02:51:18Z

← Older revision	Revision as of 02:51, 18 November 2009
Line 1:	Line 1:
		==Background==
		This is a simple exercise for finding recursive equations and writing them as Java code.


		===Props===
		1. Whiteboard

		2. Access to a Java editor

		===Procedure===

		1) Give each row a sequence of numbers.

		Ex:

		a) 2, 6, 10, 14,...

		b) 0, 1, 0, 1...

		c) 2, 6, 12, 20...

		d) 1, 4, 9, 16...


		2) Then have each row work together to find the recursive definition for the sequences.

		Ex:

		a) 4n-2

		b) 1+(-1)^n

		c) n(n + 1)

		d) n^2


		3) Lastly, each group should write Java code to implement the recursive equation and submit via Google Docs.

		Ex:

		a)

		public int recursion( int n ){
		int a = 0;
		if(n == 1) a = 2;
		else a = recursion( n - 1 ) + 4;
		return a;
		}

		By: David Duran & Dereck Allred

Jdwilker: CSC 216 F09/StateMachinePass moved to CSC 216 F09/

2009-11-17T02:39:41Z

CSC 216 F09/StateMachinePass moved to CSC 216 F09/

← Older revision	Revision as of 02:39, 17 November 2009
(No difference)

Jdwilker at 02:38, 17 November 2009

2009-11-17T02:38:39Z

← Older revision		Revision as of 02:38, 17 November 2009
Line 1:		Line 1:

	~~==State Machine Pass==~~

	~~===The problem===~~

	~~Trying to teach how finite state machines work.~~

	~~===Participants and props===~~

	~~Everybody in the class plays the game. The only prop needed is a ball. A diagram of the state machine is drawn on the board.~~
	~~The state machine will have two paths it can go down to reach the final state.~~

	~~===The script===~~

	The ball is thrown to a student in the class. They will be at state 0. They will be presented a condition to move to the next state. If they answer right they toss the ball to another student. If they get it wrong they keep the ball and take another turn. This continues until the final state is reached.

	~~===Acknowledgments===~~

	~~Created by Josh Wilkerson and Tony McCarthy~~

Jdwilker: CSC 216 F09/ moved to CSC 216 F09/StateMachinePass

2009-11-17T02:37:05Z

CSC 216 F09/ moved to CSC 216 F09/StateMachinePass

← Older revision	Revision as of 02:37, 17 November 2009
(No difference)

Jdwilker at 02:35, 17 November 2009

2009-11-17T02:35:04Z

← Older revision		Revision as of 02:35, 17 November 2009
Line 1:		Line 1:


	==State Machine Pass==		==State Machine Pass==
Line 10:		Line 9:

	Everybody in the class plays the game. The only prop needed is a ball. A diagram of the state machine is drawn on the board.		Everybody in the class plays the game. The only prop needed is a ball. A diagram of the state machine is drawn on the board.

	~~1 3 4 6~~
	~~0 9~~
	~~2 5 7 8~~
	The state machine will have two paths it can go down to reach the final state.		The state machine will have two paths it can go down to reach the final state.

Jdwilker at 02:34, 17 November 2009

2009-11-17T02:34:31Z

← Older revision	Revision as of 02:34, 17 November 2009
Line 1:	Line 1:


		==State Machine Pass==

		===The problem===

		Trying to teach how finite state machines work.

		===Participants and props===

		Everybody in the class plays the game. The only prop needed is a ball. A diagram of the state machine is drawn on the board.

		1 3 4 6
		0 9
		2 5 7 8
		The state machine will have two paths it can go down to reach the final state.

		===The script===

		The ball is thrown to a student in the class. They will be at state 0. They will be presented a condition to move to the next state. If they answer right they toss the ball to another student. If they get it wrong they keep the ball and take another turn. This continues until the final state is reached.

		===Acknowledgments===

		Created by Josh Wilkerson and Tony McCarthy

Thnguye2 at 20:37, 15 November 2009

2009-11-15T20:37:34Z

← Older revision		Revision as of 20:37, 15 November 2009
Line 1:		Line 1:
	~~#REDIRECT [[What Wants to Be a Millionaire?]]~~

Thnguye2 at 20:36, 15 November 2009

2009-11-15T20:36:25Z

← Older revision	Revision as of 20:36, 15 November 2009
Line 1:	Line 1:
		#REDIRECT [[What Wants to Be a Millionaire?]]

Thnguye2 at 20:35, 15 November 2009

2009-11-15T20:35:07Z

← Older revision		Revision as of 20:35, 15 November 2009
Line 1:		Line 1:
	~~===Formatting Resources===~~
	~~[http://meta.wikimedia.org/wiki/Help:Wikitext_examples Formatting Help Guide from MetaWiki]~~

	~~==Place Title of Exercise Here==~~

	~~Give the title of your exercise, which may include the name of the topic you are covering, or some other catchy title.~~

	~~===The problem===~~

	~~Describe what you are attempting to teach students by this exercise.~~

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

Thnguye2 at 20:34, 15 November 2009

2009-11-15T20:34:21Z

New page

===Formatting Resources===
[http://meta.wikimedia.org/wiki/Help:Wikitext_examples Formatting Help Guide from MetaWiki]

==Place Title of Exercise Here==

Give the title of your exercise, which may include the name of the topic you are covering, or some other catchy title.

===The problem===

Describe what you are attempting to teach students by this exercise.

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