Expertiza_Wiki - User contributions [en]

CSC 216/s08/trees and grass

2008-04-10T19:51:44Z

Ajklaus: /* 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-04-10T19:49:52Z

Ajklaus: /* 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-04-10T19:49:30Z

Ajklaus: /* 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-04-10T19:48:30Z

Ajklaus: /* The problem */

==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-04-10T19:45:28Z

Ajklaus: /* 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
* Aggregation
* Correlation

===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-04-10T19:44:56Z

Ajklaus: /* 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
* Aggregation
* Correlation

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