CS211 — Fundamentals of Computer Science II
5 CR This course focuses on advanced concepts in algorithm efficiency, runtime analysis, and data structures. Topics include recursion, exceptions, search and sorting algorithms, stacks, queues, linked lists, trees, priority queues, and hashing. Students will implement efficient solutions using industry-standard APIs, analyze performance using Big-O notation, and develop a deeper understanding of algorithmic design and problem-solving techniques. Course
Prerequisites: CS210