CSC 216 F09/Sorting - Revision history

Rwang9: /* Props */

2009-11-18T18:23:23Z

Props

← Older revision		Revision as of 18:23, 18 November 2009
Line 11:		Line 11:
	===Props===		===Props===

	This can be accomplished by two blocks cut out with slots: the “ARRAY” block has five slots numbered 0 to 4, and the “HOLD” block has one slot. They also need five cards with numbers on them. Refer to the [[http://courses.ncsu.edu/csc216/lec/001/video/t1/Sorting.doc Figure 1]].		This can be accomplished by two blocks cut out with slots: the “ARRAY” block has five slots numbered 0 to 4, and the “HOLD” block has one slot. They also need five cards with numbers on them. Refer to the [http://courses.ncsu.edu/csc216/lec/001/video/t1/Sorting.doc Figure 1].

	===Procedure===		===Procedure===

2009-11-18T18:22:56Z

Props

← Older revision		Revision as of 18:22, 18 November 2009
Line 11:		Line 11:
	===Props===		===Props===

	This can be accomplished by two blocks cut out with slots: the “ARRAY” block has five slots numbered 0 to 4, and the “HOLD” block has one slot. They also need five cards with numbers on them. Refer to the Figure 1.		This can be accomplished by two blocks cut out with slots: the “ARRAY” block has five slots numbered 0 to 4, and the “HOLD” block has one slot. They also need five cards with numbers on them. Refer to the [[http://courses.ncsu.edu/csc216/lec/001/video/t1/Sorting.doc Figure 1]].

	===Procedure===		===Procedure===

2009-11-17T21:29:58Z

The script

@@ Line 13: / Line 13: @@
 This can be accomplished by two blocks cut out with slots:  the “ARRAY” block has five slots numbered 0 to  4, and the “HOLD” block has one slot.  They also need five cards with numbers on them.  Refer to the Figure 1.
-===The script===
+===Procedure===
-Describe how to do your exercise.
+  Have the students fill the ARRAY block with the five card and have them sort them with these rules:

2009-11-17T21:28:11Z

Participants and props

← Older revision		Revision as of 21:28, 17 November 2009
Line 9:		Line 9:
	Too often, we teach beginning programming students how to sort. It is better if they discover how to sort on their own. We should encourage them to try sorting methods with cards and blocks and then have them develop written procedures..		Too often, we teach beginning programming students how to sort. It is better if they discover how to sort on their own. We should encourage them to try sorting methods with cards and blocks and then have them develop written procedures..

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

	~~How many students will participate?~~ ~~What else do you~~ need (e.~~g., old tennis ball, Powerpoint slides, software)~~.		This can be accomplished by two blocks cut out with slots: the “ARRAY” block has five slots numbered 0 to 4, and the “HOLD” block has one slot. They also need five cards with numbers on them. Refer to the Figure 1.

	===The script===		===The script===

	Describe how to do your exercise.		Describe how to do your exercise.

2009-11-17T21:25:42Z

Place Title of Exercise Here

← Older revision		Revision as of 21:25, 17 November 2009
Line 2:		Line 2:
	[http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216_F09/Sorting]		[http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216_F09/Sorting]

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

	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.

2009-11-17T21:25:01Z

← Older revision	Revision as of 21:25, 17 November 2009
(No difference)

2009-11-17T21:21:23Z

Too Often

← Older revision		Revision as of 21:21, 17 November 2009
Line 6:		Line 6:
	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.

	===~~Too Often~~===		===Discovering A Sorting Procedure===
			Too often, we teach beginning programming students how to sort. It is better if they discover how to sort on their own. We should encourage them to try sorting methods with cards and blocks and then have them develop written procedures..
	~~Describe what you are attempting to~~ teach students ~~by this exercise~~.

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

2009-11-17T21:19:58Z

Place Title of Exercise Here

← Older revision		Revision as of 21:19, 17 November 2009
Line 6:		Line 6:
	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.

	===~~The problem~~===		===Too Often===

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

2009-11-17T21:16:16Z

Formatting Resources

← Older revision		Revision as of 21:16, 17 November 2009
Line 1:		Line 1:
	===~~Formatting Resources~~===		===Sorting===
	[http://~~meta~~.~~wikimedia~~.~~org~~/~~wiki~~/~~Help:Wikitext_examples Formatting Help Guide from MetaWiki~~]		[http://pg-server.csc.ncsu.edu/mediawiki/index.php/CSC_216_F09/Sorting]

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

2009-11-12T14:40:45Z

← Older revision		Revision as of 14:40, 12 November 2009
Line 17:		Line 17:

	Describe how to do your exercise.		Describe how to do your exercise.

	~~<source lang="Java">~~
	~~public class Student {~~

	~~private Point location;~~
	~~private int age;~~

	~~public Student clone() {~~
	~~Student newStudent = new Student();~~
	~~newStudent.location = this.location;~~
	~~newStudent.age = this.age;~~
	}
	}
	~~</source>~~