CSCI 2300 - Introduction to Algorithms

Data structures and algorithms, and the mathematical techniques necessary to design and analyze them. Basic data structures: lists, associative structures, trees. Mathematical techniques for designing algorithms and analyzing worst-case and expected-case algorithm efficiency. Advanced data structures: balanced trees, tries, heaps, priority queues, graphs. Searching, sorting. Algorithm design techniques: dynamic programming, greedy algorithms, divide-and-conquer, backtracking. Example graph, string, geometric, and numeric algorithms.

Prerequisites/Corequisites: Prerequisites: CSCI 1200, MATH 1010, and CSCI 2200.

When Offered: Fall and spring terms annually.

Credit Hours: 4

Contact, Lecture or Lab Hours: 6