This course studies common data structures and program structures. Topics include interfaces, arrays, stacks, queues, lists, graphs, binary searches, and tree traversal. Experience is provided in the development and implementation of these structures and algorithms using a modern programming language. Software performance, documentation, cyber susceptability/hardening, and maintainability are discussed.

Prerequisite(s): Grade of “C” or better in MAT 140 and ENGR 130
Grading Basis: Graded Repeatable: No Typical Periods Offered: Fall

Add to Portfolio (opens a new window)