CS 310Data Struct & Algorithms

Catalog

An intermediate course in data structures covering the design, implementation, and properties of basic and advanced data structures, including lists, stacks, queues, hash tables, trees, heaps, and graphs. Design and asymptotic time-space analysis of basic and advanced algorithms, including insertion, removal, and search; efficient sorting including quicksort, merge sort, heap sort, and linear sorting; hash table collision resolution; recursion and tail-recursion optimization; self-balancing trees such as AVL and Red-Black trees; and graph representations and algorithms for traversal, shortest paths, minimum spanning trees, and more. Multiple significant programming projects in C++, including (i) at least one team project, and (ii) at least one project that uses generative AI tools to experimentally investigate the advanced behavior of data structures and algorithms. Students develop C++ programming skills, mostly by programming independently, without AI. Additional topics include C++ templates; the Standard Template Library (STL); operator overloading; stream I/O; separate compilation and project development using Makefiles and Linux-based debugging tools such as gdb, valgrind, and lint; and dynamic memory management. Prerequisites: CS 120 and CS 210 and either MATH 227 or MATH 230 (the math course may be taken concurrently). All prerequisites must have a grade of C- or better. Offered every semester. 4 credits.