In this computer science course students will continue their exploration of data structures and algorithms, focusing on real-world applications of algorithms in graph theory, memory management, and data transfer. Topics include undirected and directed graphs, minimum spanning trees, shortest paths, tries, regular expressions, reductions, and computational intractability. Emphasis is placed on analyzing algorithmic efficiency, memory interaction, and practical applications in networking and data processing.
Prerequisites
Completion of IT-CS 265 with a grade of 2.0 or higher; AND admission to the Bachelor of Science Computer Science Degree; OR permission from a Computer Science program advisor.