Unformatted text preview: unoccupied cabin to sleep the night. How many sailors are expected to sleep in their own cabins? 4. Show that 2SAT is in P . 5. The following are some problems from the ACM Programming Competitions. They test your knowledge of material from the introductory algorithms course, especially your knowledge of basic algorithmic paradigms (divide-and-conquer, greedy algorithms, and dynamic programming) and data structures. (a) Robot Challenge Problem: http://www.cs.fiu.edu/ ˜ giri/teach/6936/S10/SER2009 RobotChallenge.pdf (b) Frequency Count Problem: http://cs05.informatik.uni-ulm.de/acm/Locals/2007/html/frequent.html (c) Proﬁts: http://www.cs.fiu.edu/ ˜ giri/teach/6936/S12/SER 2010 Profits.pdf (d) Family Fortune (see Problem H. from the problem set): http://www.cs.fiu.edu/ ˜ giri/teach/6936/S12/SER 2011 AllProblems.pdf 6. Listen to Cool MP3: http://www.cs.princeton.edu/ ˜ wayne/kleinberg-tardos/longest-path.mp3...
View Full Document
- Spring '12
- Algorithms, Greedy algorithm, introductory algorithms course, basic algorithmic paradigms, ACM Programming Competitions