Expertiza_Wiki - User contributions [en]

CSC 216/s08/gracefully claim

2008-04-13T20:10:56Z

Jrhardin: Initial Writeup

=Selection Sorting=



==The problem==


Uses students and a deck of cards to help teach how the selection sort technique works.

==Participants and props==


This exercise will work best with 7 to 15 students, although it can be done with any number of them. It will also require a deck of playing cards. Any set of objects with inherent value can be used in place of the cards (e.g. the students name's, letters, money, etc.) In addition, a tennis ball (not old or dirty) will be needed to pass between the students.

==The script==


Select the students that are participating in the exercise and have them come to the front of the classroom and stand in a line. Shuffle the deck of cards and deal one card out to each student.

The first student is handed the tennis ball. Each person down the line compares the value of their card with the value of the ball holder's card. If a student has a card lower in value than the ball holder's, the ball holder should toss the ball to them. Once the end of the list is reached, the student holding the ball trades places with the first person in the line. That student should stand slightly away from the rest of the "list" and will not participate in the remainder of the sorting process. This student should pass the ball to the next person in line.

Repeat this process, starting with the first unsorted person in the list. Each iteration, the person with the lowest value trades with the first unsorted person on the list. The exercise ends when the entire list has been sorted.

CSC 216/s08/trees and grass

2008-04-10T20:29:43Z

Jrhardin: /* The script */ Extending the content some

=Memory=
A novel twist on a classic children's game.

==The problem==

This exercise will help illustrate the different relationships that classes can have with each other.

The game is played much like the classic game Memory, that requires the participants to remember the location of two related cards.
Unlike a traditional memory game, the cards will not be identical, but will rather be two related classes. These classes can be related in several ways:

* Inheritance
* Interfacing
* Inner Class
* Aggregation
* Association

==Participants and props==



This exercise is designed to involve the entire class. It will require several index cards, some tape. The cards should be labeled before class begins, and the students should not know their contents. Some example cards are given below, but the exercise is not restricted to these examples.

===The Cards===

An example of some cards that could be used in this exercise are listed below. They are divided into the different relationships demonstrated between the cards.

'''Association'''
* Car - Driver
* Course - Instructor

'''Aggregation'''
* Cell - Grid

'''Inheritance'''
* Plant - Flower
* Animal - Bee

'''Interfacing'''
* Comparable - Double
* Flushable - Toilet

'''Inner Class'''
* Linked List - Iterator

==The script==



'''Setup:'''
The cards are scrambled, and then taped on the board in a grid. If the class is large, you may consider having the students break into teams of two or three. In addition, the different relationships that any two cards may have should be listed next to the cards.

'''Gameplay:'''
Each student, in turn, is given the chance to select two cards to be flipped over. If the student believes that the two cards are a match, then they must identify the manner in which the two cards are related. If the student is correct, these cards are removed from the board and handed to that student. If the student is incorrect, their turn is over and the next student is given the same opportunity. This is repeated until the grid is entirely removed.
The game ends when there are no more unmatched cards. The student/group with the most cards is the winner.

CSC 216/s08/trees and grass

2008-04-10T20:24:33Z

Jrhardin: /* Participants and props */ Adding some content

=Memory=
A novel twist on a classic children's game.

==The problem==

This exercise will help illustrate the different relationships that classes can have with each other.

The game is played much like the classic game Memory, that requires the participants to remember the location of two related cards.
Unlike a traditional memory game, the cards will not be identical, but will rather be two related classes. These classes can be related in several ways:

* Inheritance
* Interfacing
* Inner Class
* Aggregation
* Association

==Participants and props==



This exercise is designed to involve the entire class. It will require several index cards, some tape. The cards should be labeled before class begins, and the students should not know their contents. Some example cards are given below, but the exercise is not restricted to these examples.

===The Cards===

An example of some cards that could be used in this exercise are listed below. They are divided into the different relationships demonstrated between the cards.

'''Association'''
* Car - Driver
* Course - Instructor

'''Aggregation'''
* Cell - Grid

'''Inheritance'''
* Plant - Flower
* Animal - Bee

'''Interfacing'''
* Comparable - Double
* Flushable - Toilet

'''Inner Class'''
* Linked List - Iterator

==The script==



'''Setup:'''
The cards are scrambled, and then taped on the board in a grid. If the class is large, you may consider having the students break into teams of two or three.

'''Gameplay:'''
Each student, in turn, is given the chance to select two cards to be flipped over. If the student believes that the two cards are a match, then they must identify the manner in which the two cards are related. If the student is correct, these cards are removed from the board and handed to that student. This is repeated until the grid is entirely removed. The person with the most cards wins.

CSC 216/s08/trees and grass

2008-04-10T20:19:08Z

Jrhardin: Just formatting

=Memory=
A novel twist on a classic children's game.

==The problem==

This exercise will help illustrate the different relationships that classes can have with each other.

The game is played much like the classic game Memory, that requires the participants to remember the location of two related cards.
Unlike a traditional memory game, the cards will not be identical, but will rather be two related classes. These classes can be related in several ways:

* Inheritance
* Interfacing
* Inner Class
* Aggregation
* Association

==Participants and props==



This exercise is designed to involve the entire class. It will require several index cards, some tape.

===The Cards===

An example of some cards that could be used in this exercise are listed below. They are divided into the different relationships demonstrated between the cards.

'''Association'''
* Car - Driver
* Course - Instructor

'''Aggregation'''
* Cell - Grid

'''Inheritance'''
* Plant - Flower
* Animal - Bee

'''Interfacing'''
* Comparable - Double
* Flushable - Toilet

'''Inner Class'''
* Linked List - Iterator

==The script==



'''Setup:'''
The cards are scrambled, and then taped on the board in a grid. If the class is large, you may consider having the students break into teams of two or three.

'''Gameplay:'''
Each student, in turn, is given the chance to select two cards to be flipped over. If the student believes that the two cards are a match, then they must identify the manner in which the two cards are related. If the student is correct, these cards are removed from the board and handed to that student. This is repeated until the grid is entirely removed. The person with the most cards wins.

CSC 216/s08/trees and grass

2008-04-10T20:18:06Z

Jrhardin:

=Memory=
A novel twist on a classic children's game.

==The problem==

This exercise will help illustrate the different relationships that classes can have with each other.

The game is played much like the classic game Memory, that requires the participants to remember the location of two related cards.
Unlike a traditional memory game, the cards will not be identical, but will rather be two related classes. These classes can be related in several ways:

* Inheritance
* Interfacing
* Inner Class
* Aggregation
* Association

===Participants and props===



This exercise is designed to involve the entire class. It will require several index cards, some tape.

====The Cards====

An example of some cards that could be used in this exercise are listed below. They are divided into the different relationships demonstrated between the cards.

'''Association'''
* Car - Driver
* Course - Instructor

'''Aggregation'''
* Cell - Grid

'''Inheritance'''
* Plant - Flower
* Animal - Bee

'''Interfacing'''
* Comparable - Double
* Flushable - Toilet

'''Inner Class'''
* Linked List - Iterator

===The script===



'''Setup:'''
The cards are scrambled, and then taped on the board in a grid. If the class is large, you may consider having the students break into teams of two or three.

'''Gameplay:'''
Each student, in turn, is given the chance to select two cards to be flipped over. If the student believes that the two cards are a match, then they must identify the manner in which the two cards are related. If the student is correct, these cards are removed from the board and handed to that student. This is repeated until the grid is entirely removed. The person with the most cards wins.

CSC 216/s08/trees and grass

2008-04-10T20:17:30Z

Jrhardin: /* The Cards */

==Memory==
A novel twist on a classic children's game.

===The problem===

This exercise will help illustrate the different relationships that classes can have with each other.

The game is played much like the classic game Memory, that requires the participants to remember the location of two related cards.
Unlike a traditional memory game, the cards will not be identical, but will rather be two related classes. These classes can be related in several ways:

* Inheritance
* Interfacing
* Inner Class
* Aggregation
* Association

===Participants and props===



This exercise is designed to involve the entire class. It will require several index cards, some tape.

====The Cards====

An example of some cards that could be used in this exercise are listed below. They are divided into the different relationships demonstrated between the cards.

'''Association'''
* Car - Driver
* Course - Instructor

'''Aggregation'''
* Cell - Grid

'''Inheritance'''
* Plant - Flower
* Animal - Bee

'''Interfacing'''
* Comparable - Double
* Flushable - Toilet

'''Inner Class'''
* Linked List - Iterator

===The script===



'''Setup:'''
The cards are scrambled, and then taped on the board in a grid. If the class is large, you may consider having the students break into teams of two or three.

'''Gameplay:'''
Each student, in turn, is given the chance to select two cards to be flipped over. If the student believes that the two cards are a match, then they must identify the manner in which the two cards are related. If the student is correct, these cards are removed from the board and handed to that student. This is repeated until the grid is entirely removed. The person with the most cards wins.

CSC 216/s08/trees and grass

2008-04-10T19:52:05Z

Jrhardin: /* Participants and props */

==Memory==
A novel twist on a classic children's game.

===The problem===

This exercise will help illustrate the different relationships that classes can have with each other.

The game is played much like the classic game Memory, that requires the participants to remember the location of two related cards.
Unlike a traditional memory game, the cards will not be identical, but will rather be two related classes. These classes can be related in several ways:

* Inheritance
* Interfacing
* Inner Class
* Aggregation
* Association

===Participants and props===



This exercise is designed to involve the entire class. It will require several index cards, some tape.

====The Cards====

'''Association'''
* Car - Driver
* Course - Instructor

'''Aggregation'''
* Cell - Grid

'''Inheritance'''
* Plant - Flower
* Animal - Bee

'''Interfacing'''
* Comparable - Double
* Flushable - Toilet

'''Inner Class'''
* Linked List - Iterator

===The script===



'''Setup:'''
The cards are scrambled, and then taped on the board in a grid. If the class is large, you may consider having the students break into teams of two or three.

'''Gameplay:'''
Each student, in turn, is given the chance to select two cards to be flipped over. If the student believes that the two cards are a match, then they must identify the manner in which the two cards are related. If the student is correct, these cards are removed from the board and handed to that student. This is repeated until the grid is entirely removed. The person with the most cards wins.

CSC 216/s08/trees and grass

2008-03-26T02:17:24Z

Jrhardin: Formatting

==Memory==
A novel twist on a classic children's game.

===The problem===

This exercise will help illustrate the different relationships that classes can have with each other.

The game is played much like the classic game Memory, that requires the participants to remember the location of two related cards.
Unlike a traditional memory game, the cards will not be identical, but will rather be two related classes. These classes can be related in several ways:

* Inheritance
* Interfacing
* Aggregation
* Correlation

===Participants and props===



This exercise is designed to involve the entire class. It will require several index cards, some tape.

===The script===



'''Setup:'''
The cards are scrambled, and then taped on the board in a grid. If the class is large, you may consider having the students break into teams of two or three.

'''Gameplay:'''
Each student, in turn, is given the chance to select two cards to be flipped over. If the student believes that the two cards are a match, then they must identify the manner in which the two cards are related. If the student is correct, these cards are removed from the board and handed to that student. This is repeated until the grid is entirely removed. The person with the most cards wins.

CSC 216/s08/trees and grass

2008-03-26T02:16:03Z

Jrhardin: Initial Design

==Memory==
A novel twist on a classic children's game.

===The problem===

This exercise will help illustrate the different relationships that classes can have with each other.

The game is played much like the classic game Memory, that requires the participants to remember the location of two related cards.
Unlike a traditional memory game, the cards will not be identical, but will rather be two related classes. These classes can be related in several ways:

* Inheritance
* Interfacing
* Aggregation
* Correlation

===Participants and props===



This exercise is designed to involve the entire class. It will require several index cards, some tape.

===The script===



Setup:
The cards are scrambled, and then taped on the board in a grid. If the class is large, you may consider having the students break into teams of two or three.

Gameplay:
Each student, in turn, is given the chance to select two cards to be flipped over. If the student believes that the two cards are a match, then they must identify the manner in which the two cards are related. If the student is correct, these cards are removed from the board and handed to that student. This is repeated until the grid is entirely removed. The person with the most cards wins.