CS6234: Advanced Algorithms
Info on Mid-Term (Spring 2009)
Here are some general information on the Mid-Term (for your reference).
About the Mid-Term
-
Date:
Wednesday, 11-March-2009; 4:00--6:00pm; Venue: SR5 (COM1-201)
- The Mid-Term is CLOSED BOOK / CLOSED NOTES.
- It is 2 hours, done in class, and starts at 4:00pm SHARP.
- The mid-term will consist of about 4 questions.
- ANSWER ALL QUESTIONS -- in the question book itself.
Topics Covered:
- Topics covered in Lectures 1-6 (before the semester break);
- Matchings in Bipartite Graph (excludes Matching in General Graphs)
- Linear Programming, Simplex Algorithm, Primal and Dual LP,
- Approximation Algorithms
- Randomized Algorithms
- Reference book [PS82] Ch. 1.1--1.5, 2.1--2.6, 2.8, 3.1--3.2, 3.4; Ch 10.1--10.3;
- Reference book [KT06] Ch. 11.1--11.4, 11.8, 13.1--13.4, 13.6;
Some Review Questions:
Since this course is new, we do not have any previous examinations
to show you.
Instead, we will provide some sample question for your reference.
We recommend working on some of the exercises in relevant
chapters of the two reference texts [PS82] and [KT06].
- Review Questions for CS6234 Mid-Term ---
| Part 1 |
| Part 2 |
CS6234: Advanced Algorithms, (Spring 2009), LeongHW and Karras