|
Jul 05, 2025
|
|
|
|
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.
Prerequisite: CSCI 1200 and CSCI 2200 ; and (MATH 1010 , MATH 1020 , MATH 1500 , or MATH 2010 ). CSCI 1200 requires students pass with a C- or higher.
When Offered: OFFERED YEARLY
Graded: GRADED
Credit Hours: 4
Contact, Lecture or Lab Hours: 6
Add to Portfolio (opens a new window)
|
|