Description
Advanced data structures and fundamental computer science algorithms using various techniques. Introduces algorithm complexity analysis and asymptotic notation. Emphasizes the design, analysis and comparison of various algorithmic solutions for a problem through the use of advanced data structures using the Java programming language.
Grading Basis
Graded
Prerequisites
CSC& 142 with a "C" (2.0) or better
Course Learning Outcomes
Core Topics
- Advances linked lists—singly, doubly, circularly linked
- Binary Search Trees
- Algorithm analysis: Big O
- Review of Collection Classes
- Priority Queues (Heaps)
- Hashing
- Sorting Algorithms
- Graph algorithms
- Complexity classes and NP if time allows