Recently Viewed: Home > Data Structures
Data Structures

Matching Types

Designed by Bill McClung, Jeff Forbes, Ziping Liu, Monisha Pulimood, and Andrew Greene.

This KLA is transcribed from the SIGCSE 2005 Workshop on KLAs.

Overview To KLA

Summary: To be added

Learning Goals: At the end of this exercise, students will understand...
if there is an algorithm that uses constant space.
the difference between a pointer and a pointee.

Course And Level: CS2

Class Size: Small.

Preparation Time: 5 minutes

Execution Time: depends on number of students

Planning For KLA

Sticks/rulers to be "pointer".
People as nodes.
Different colored sticks for temporary pointers.
Colored hat for distinguished node.

Preparation: To be added.

As always, read this description carefully and practice the KLA before using it in class!

Execution Of KLA

Start with a circular list.
Each student "points" with stick to next student to form a circle.
Give them 2 "pointers" (Students who are merely pointers).

When students get that, vary the links to form cycles.

A "node" can have a basket and hold data, one hand pointing to another node.
Temporary pointers have no baskets.

Variants And Extra Topics:
Introduction to linked lists.
Demonstrate usual algorithms.
Pointers to different types.

Constraints On KLA

Would your KLA work if your students had the following constraints:
Limited Vision:
Limited Hearing: Not if more than a few were constrained.
Limited Mobility:
Trouble Speaking:
Touch Aversion:

Pitfalls Of KLA
Managing the pointers.
Students need to be given the algorithm, so use this to test a couple of algorithms.

Feedback And Use Notes

Feedback: To be added

Use Notes: add your use notes here!

Related Resources

Powered by QwikiWiki v1.5.1 -