Well, the first time I took the class I didn't pass the intro quiz so I dropped it. The first class was pretty similar to the last time: The questions of what is computer science, what is an algorithm and dijkstra's algorithm. We didn't finish the proof so I guess we'll continue wed after the quiz. Now I'm focusing on trying to pass the quiz by reading the first few chapters of the book (Algorithm Design by Kleinberg/Tardos) and the other book I've been studying over the summer (Discrete algorithmic mathematics)-- that book is a bit lower level but more detailed.
In the Kleinberg/Tardos book:
- overview: of the chapters' topics. possible paths through the book.
- chapter 1: stable matching algorithm (Gale-Shapley). 5 representative problems: (1) Interval scheduling, (2) Weighted interval scheduling, (3) Bipartite matching, (4) Independent set, and (5) Competitive facility location. The difference between finding solution and checking it. NP complete problems and PSPACE problems.
-chapter 2:
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment