CSCI 270 Introduction to Algorithms and Theory of Computing

Units: 4
Terms Offered: FaSp

Algorithm analysis. Greedy algorithms, divide and conquer, dynamic programming, graph algorithms. NP-completeness and basic recursion theory and undecidability. Sorting lower bounds. Number-theory based cryptography.
Prerequisite: CSCI 104L and CSCI 170.
Duplicates Credit in CSCI 303.
Instruction Mode: Lecture, Quiz
Grading Option: Letter