CS 201 Fundamentals of Computer Science II

This course introduces advanced object-oriented constructs such as abstraction, virtual methods, and generic classes. Advanced data structures including arrays, linked lists, queues, stacks, trees, heaps, and hash tables will be discussed both natively, as well as, through standard template libraries. Fundamental sorting and searching algorithms will be introduced. Techniques for concurrency and parallelism; such as threads, will be introduced. Basic analytical and proof techniques will be used to characterize the data structures and algorithms discussed. The course will focus on implementing applications from computer science and engineering using languages such as C++/C#/Java. Prerequisite: CS101 with a grade of 2.0 or higher.

3 credit hours