Course Overview
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.
ITS 110 and MAT 140; or permission of the instructor.
Program: Information Technology
Credit: 3
Other Courses
Credits 1-3
Credits 1-3
Credits 1-5
Credits 3
Contact
- Information Technology
- Hall Memorial Building | N318
- raja.kushalnagar@gallaudet.edu
- (202) 651-5000
- 202-750-2458