Course Description

• Procedures and data both primitive and compound.
• Iteraton and recursion.
• Abstraction of data and procedures.
• Sequences and trees.
• Manipulation of lists.
• Data-directed programming, dispatch on type, message passing.
• Object-oriented programming.
• Local state and environment diagrams.
• Streams.

Prerequisites

• Computer Science 101

Classes

3 lecture hours
3 semester hours