Fund of Computing II

Catalog description

This course formally presents abstract date types (ADT's), including stacks, queues, lists, and trees. Object-oriented programming concepts will be covered and implemented, as well as modular program design techniques, including class design, data structures and algorithms. Simple sorting and searching techniques, along with their efficiencies will be studied. Other topics covered include recursion, sets, maps, and exception handling. Prerequisite: CSC 111.