¸£Àû±ÆÕ¾

¸£Àû±ÆÕ¾ Catalog 2025-2026

Search Results

CSC 505 Design and Analysis Of Algorithms

°ä³§°äÌý505ÌýÌýDesign and Analysis Of AlgorithmsÌýÌý(3 credit hours)ÌýÌý

Algorithm design techniques: use of data structures, divide and conquer, dynamic programming, greedy techniques, local and global search. Complexity and analysis of algorithms: asymptotic analysis, worst case and average case, recurrences, lower bounds, NP-completeness. Algorithms for classical problems including sorting, searching and graph problems (connectivity, shortest paths, minimum spanning trees).

Typically offered in Fall, Spring, and Summer