| |
Apr 23, 2024
|
|
|
|
|
ITCS 2215 - Design and Analysis of Algorithms
Introduction to the design and analysis of algorithms. Design techniques: divide-and-conquer, greedy approach, dynamic programming. Algorithm analysis: asymptotic notation, recurrence relation, time space complexity and tradeoffs. Study of sorting, searching, hashing, and graph algorithms.
Credit Hours: (3)
Prerequisite(s): MATH 1120 or MATH 1241 ; ITSC 2175 or MATH 1165 ; and ITSC 2214 .
Most Recently Offered (Day): Fall 2017, Spring 2017, Fall 2016
Most Recently Offered (Evening): Fall 2016, Spring 2015
Schedule of Classes
Add to Catalog Bookmarks (opens a new window)
|
|
