ITS 410 Data Structures and Algorithms
In this course, students will be introduced to algorithms, the analysis of algorithms, foundational data structures, and various problem-solving paradigms. Topics covered include: arrays, linked lists, trees, hash tables, divide and conquer, greedy method, dynamic programming, backtracking, and branch and bound technique.
Prerequisite
ITS 110 and MAT 140; or permission of the instructor.
Distribution
Undergraduate