An introductory course in data structures and algorithms, with an emphasis on abstraction, implementation and analysis. Advanced class concepts, including operator overloading. Linked lists, stacks, queues, trees and binary trees. Separate compilation and third-party libraries. Application of various data structures to problems selected from the spectrum of computer science topics. Prerequisite(s): CSCI121 with a grade of C or better and MATH111 (or equivalent math placement) with a grade of C or better.
(4,0) 4
(4,0) 4
- Faculty: Paul Bartus