CSCI-C 455 Analysis of Algorithms
3-4 credits
- Prerequisite(s): CSCI-C 310, CSCI-C 343, or CSCI 36200
- Delivery: On-Campus
Description
Learning Outcomes
- Analyze the correctness of algorithms using inductive proofs and loop invariants. CS 1
- Analyze the worst-case running times of algorithms using asymptotic analysis. CS 1
- Analyze the average-case running times of algorithms with probabilistic running times. CS 1
- Explain the basic properties of randomized algorithms and methods for analyzing them. CS 1
- Identify when an algorithm design situation requires a divide and conquer, dynamic programming, or greedy strategy and implement it. CS 1
- Implement the major algorithms for sorting. CS 1
- Explain the data structures used to implement dynamic sets and analyze the operations performed on them. CS 1
Policies and Procedures
Please be aware of the following linked policies and procedures. Note that in individual courses instructors will have stipulations specific to their course.