Skip to main content
Side panel
Courses
Programs
Help
Getting Started
Discussion Forums
Help Center & FAQ
Log in or Sign up
CS303: Algorithms
Home
Courses
Archived Courses
CS303: Algorithms
Sections
Unit 8: NP-Completeness
Unit 8 Learning Outcomes
Back to 'Unit 8: NP-Completeness'
Log in or Sign up
to track your course progress, gain access to final exams, and get a free certificate of completion!
Unit 8 Learning Outcomes
Upon successful completion of this unit, the student will be able to:
Explain the classification of difficult computer science problems as belonging to P, NP, and NP-hard classes.
Last modified: Wednesday, April 27, 2016, 1:24 PM
◄ Greedy Algorithms Assignment
Jump to...
Jump to...
Course Syllabus
Course Terms of Use
Unit 1 Learning Outcomes
Massachusetts Institute of Technology: Dr. Charles E. Leiserson's "Merge Sort"
Indian Institute of Technology, Bombay: Dr. Abhiram Ranade's "Framework for Algorithm Analysis"
Topcoder: "Importance of Algorithms"
<em>Algorithms</em>: "Introduction"
Introduction to Algorithms Assignment
Unit 2 Learning Outcomes
Massachusetts Institute of Technology: Dr. Erik Demaine's "Introduction to Algorithms"
University of California, Berkeley: Dr. Jonathan Shewchuk's "Asymptotic Analysis"
University of California, Berkeley: S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani's "Algorithms: Prologue"
Wikipedia: "Master Theorem"
Introduction to Analysis of Algorithms Assignment
Unit 3 Learning Outcomes
University of California, Berkeley: S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani's "Divide-and-Conquer Algorithms"
Massachusetts Institute of Technology: Dr. Erik Demaine's "Introduction to Algorithms"
Wikipedia: "Recursion"
Divide and Conquer Assignment
Unit 4 Learning Outcomes
Knight School: "Algorithmic Thinking"
"Google Interview with Barack Obama"
Massachusetts Institute of Technology: Dr. Charles E. Leiserson's "Quicksort, Randomized Algorithms"
Massachusetts Institute of Technology: Dr. Erik Demaine's "Introduction to Algorithms"
Wikipedia: "Sorting Algorithms"
Sorting Assignment
Unit 5 Learning Outcomes
University of California, Berkeley: S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani's "Dynamic Programming"
Massachusetts Institute of Technology: Dr. Charles E. Leiserson's "Dynamic Programming, Longest Common Subsequence"
James Bedford's "Dynamic Programming - The Knapsack Problem"
Wikipedia: "Dynamic Programming"
Dynamic Programming Assignment
Unit 6 Learning Outcomes
University of California, San Diego: Edward A. Bender and S. G. Williamson's "Basic Concepts in Graph Theory"
University of California, Berkeley: S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani's "Paths in Graphs"
PatrickJMT: "Graph Theory - An Introduction"
Massachusetts Institute of Technology: Dr. Charles E. Leiserson's "Greedy Algorithms, Minimum Spanning Trees"
Massachusetts Institute of Technology: Dr. Charles E. Leiserson's "Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search"
Graph Theory and Graph Algorithms Assignment
Unit 7 Learning Outcomes
University of California, Berkeley: S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani's "Greedy Algorithms"
Indian Institute of Technology, Bombay: Dr. Sunder Viswanathan's "Greedy Algorithms - I"
Indian Institute of Technology, Bombay: Dr. Sunder Viswanathan's "Greedy Algorithms - II"
Indian Institute of Technology, Bombay: Dr. Sunder Viswanathan's "Greedy Algorithms - III"
Wikipedia: "Recursion"
Greedy Algorithms Assignment
University of California, Berkeley: S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani's "NP-Complete Problems"
Indian Institute of Technology, Bombay: Dr. Sunder Viswanathan's "NP-Completeness - Part I"
Indian Institute of Technology, Bombay: Dr. Sunder Viswanathan's "NP-Completeness - Part II"
Indian Institute of Technology, Bombay: Dr. Sunder Viswanathan's "NP-Completeness - Part III"
Indian Institute of Technology, Bombay: Dr. Sunder Viswanathan's "NP-Completeness - Part IV"
Indian Institute of Technology, Bombay: Dr. Sunder Viswanathan's "NP-Completeness - Part V"
NP-Completeness Assignment
Optional Course Evaluation Suvey
CS303: Final Exam
CS303: Proctored Final Exam
University of California, Berkeley: S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani's "NP-Complete Problems" ►
Courses
Programs
Help
Getting Started
Discussion Forums
Help Center & FAQ
CS303: Algorithms
Sections
Course Introduction
Unit 1: Introduction to Algorithms
Unit 2: Introduction to Analysis of Algorithms
Unit 3: Divide and Conquer Method
Unit 4: Sorting Algorithms
Unit 5: Dynamic Programming
Unit 6: Graph Theory and Graph Algorithms
Unit 7: Greedy Algorithms
Unit 8: NP-Completeness
Optional Course Evaluation Suvey
Final Exam
Resources
Activities
Quizzes
Blog