Navigation

CS

- 301

Data Structures & Algorithms

(3 0 cr.) - Session(s): Fall | Course Every Year

Topics include the sequential and linked allocation of lists, stacks, queues, trees, and graphs. Students gain maturity by writing complex algorithms and through studying run time analysis and program integrity. Prerequisite: CS-212 with a grade of C or better.

Contact Information
141 Johnson Hall
(919) 760-8593 
registrar@meredith.edu