This is a course to continue the development of discipline in program design, in style and expression. It includes methods of dynamic memory management and recursion. It introduces data structures and abstract data types (ADT) for arrays, strings, lists, stacks, queues, trees and graphs. These ADTs are presented in both static and dynamic memory implementations. The course also covers the design and implementation of algorithms such as sorting and searching, hashing functions, priority queues, heaps, and graph algorithms. Other topics (recursion, lists, events, inheritance) in object-oriented programming will be covered as time permits. Three hours lecture and two hours laboratory per week.
Credit Hours: 4
Semesters Offered: Fall/Spring
Pre-requisites:
CSC 145
Close
