Apr 01, 2020  
2017-2018 Undergraduate Catalog 
2017-2018 Undergraduate Catalog [ARCHIVED CATALOG]

CSC 2710 - Analysis of Algorithms I

Credits: 4
Introduction to the basic principles and techniques for analyzing algorithms. A discussion of the asymptotic complexity of algorithms using standard measures in the best, average, and worst cases. Applications of the basic principles and techniques and study of upper and lower bounds of standard computer science problems including: searching, sorting, graph, string matching, polynomial, and matrix algorithms. Basic strategies for developing algorithmic solutions to problems using divide and conquer, dynamic programming, and greedy techniques will be covered. Introduction to NP-complete problems will also be discussed.
Prerequisite(s): CSC 2820  with a minimum passing grade of C or consent of instructor, MTH 1314, and MTH 1217.