CSCI301

Design and implement programs that separate the interface from the implementation and use generic components (templates) as a mechanism for re-using code.

Design and implement applications that use linear data structures such as linked list, stacks, queues and priority queues.

Design and implement applications that use nonlinear data structures such as binary and binary search trees, 2/3 trees, directed and undirected graphs

Apply recursive definitions and their relation to the development of algorithms in trees and graphs and perform time complexity analysis of these algorithms

Write programs that use complicated sorting techniques.

Generate documents that adequately and accurately explain the design, testing, and use of moderately complicated programs.

Maintain a record of time allocation and productivity throughout the development and completion of programming projects. Design, carry out, and document tests for programs of moderate complexity.