Some possible exercises:

• Given problem; write complete solution
• Given program with several stub(s); write code for missing elements
• Given interface specification; one person/group implements class, another implements class client

Sample Laboratory Exercises

• Write solution to the Barbershop Problem with separate processes for various parties, given reasonably careful description and specification

• Given shell with three operations (iterative insertion, recursive search, printing) for using a binary search tree, fill in stubs for printing of leaves, counting nodes, iterative search
• Use of stubs allows focus on algorithms rather than dull menu-driven framework
• Subsequent lab expands more stubs

created May 4, 2003 last revised May 4, 2003

previous  next