CS210

CS210 introduces classical data structures and algorithms with emphasis on performance through asymptotic analysis and complexity classes. The course covers lists, stacks, queues, heaps, trees, graphs, searching, sorting, traversal, hashing, and implementation of data structures and algorithms in modern programming languages.

• Demonstrate knowledge of fundamental data structures and related algorithms, including lists, stacks, queues, trees, heaps, and graphs.
• Explain hash functions and hash tables for faster data storage and access.
• Analyze runtime for operations on data structures and related algorithms.
• Write programs that apply data structures and algorithms.
• Collaborate in designing and implementing efficient, sustainable data structures and algorithms.