CS 412
Algorithm Analysis
Lec 001 selected
A formal algorithmic language. Measures of complexity for time and space. Worst-case, average-case, and best-case analysis. Lower and upper bounds of algorithms (techniques include comparison trees, adversary arguments, and reduction). P and NP classes. NP-hardness and NP- completeness. Introduction to parallel computational models and algorithms. ***
Sections
Lecture
Lec 001
Wed 19:00-21:45
Syllabus
Have the syllabus for CS 412? Share it and everyone gets the grading, textbooks and rules.