Applications of Algorithms
Fall 2010
CS 198
2 Unit(s)
PermalinkHuman friendly URL (OBSOLETE)
Share:
About the Course:
This is a lab based course that accompanies CS 170. While CS 170 explores the concepts and basic techniques in the design and analysis of algorithms, the class gives practical experience related to each technique. The class will closely follow the course material taught in CS 170, and will be a 2 hour lab session. The first half an hour will be a discussion of the week's topic in relation to practical considerations during implementation, as well as application of the algorithms to different real life problems.The remainder of the class will be devoted to solving 3-5 problems of varying difficulty. There will be three types of questions: Interview Questions, CS 170 HW questions, and Competition Questions (from the likes of Google CodeJam and TopCoder). The last 15 minutes will be a discussion of the ideas needed to solve the problem. In the last two classes students will work on a project either involving applying multiple algorithm techniques in an open source setting or solving an NP-hard problem approximately (such as TopCoder Marathon Questions).
How to Enroll:
First come, first served.
Course Contact: swap25 AT berkeley.edu
Website: http://www-inst.eecs.berkeley.edu/~swapnil/decal.html
Faculty Sponsor: Christos Papadimitriou
Time & Location:
| Section | Facilitators | Size | Location | Time | Starts | Status | CCNs |
|---|---|---|---|---|---|---|---|
| Section 1 | Swapnil Ralhan | 40 | 275 Soda | W 6p-8p | 9/08 | started | — |
Uploaded Files:
| Name | Date | Size | Type | Actions |
|---|---|---|---|---|
| There are no files uploaded. | ||||
Course info last modified September 3, 2010. This page has been viewed 1158 times.
