CSC 2824 creditsPrereq: CSC 172 and CSC 173
CSC 282: Design and Analysis of Efficient Algorithms
34 ratings across the web · no written reviews yet
Planning Spring 2027? Save classes to your plan.
From 34 ratings across the web
Mostly positive ratings. It's demanding, and good grades are within reach.
No written reviews yet. Yours would be the first.
Took CSC 282? How hard was it?
1 is easy, 5 is hard. Anonymous, no account.
Difficulty
What we know
- From the catalog
- Algorithm design techniques including greedy algorithms, dynamic programming, graph algorithms, and NP-completeness theory.
- Ratings across the web
- 3.4 out of 5 stars3.4from 34 ratings
- Department
- Computer Science
What students say
Be the first to review CSC 282
Six short steps, about two minutes. Anonymous, no account, no email.
Questions students ask
Classes next to CSC 282
CSC courses at U of R with the closest numbers
- CSC 276Computer Architecture and SecurityNo ratings yet
- CSC 280Computer Models and Limitations2.6 out of 5 stars2.6· difficulty 61/100· 39 ratings
- CSC 281Introduction to Cryptography3.5 out of 5 stars3.5· difficulty 60/100· 7 ratings
- CSC 282Design and Analysis of Efficient AlgorithmsThis class
- CSC 284Advanced Algorithms4.3 out of 5 stars4.3· difficulty 87/100· 3 ratings
- CSC 289Algorithmic Game Theory4.7 out of 5 stars4.7· difficulty 60/100· 3 ratings
- CSC 295Quantum ComputingNo ratings yet