|
Nov 09, 2024
|
|
|
|
CSCI 270 Introduction to Algorithms and Theory of Computing Units: 4 Terms Offered: FaSpSm 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 former CSCI 303 Instruction Mode: Lecture, Discussion, Quiz Grading Option: Letter
|
|
You must be logged in to post a comment.