ClassS04CS141

Spring 2004, CS 141: Intermediate Data Structures and Algorithms

Basic algorithm analysis using asymptotic notations, summation and recurrence relations, algorithms, and data structures including trees, strings, and graphs. Algorithm design techniques including divide-and-conquer, the greedy method, and dynamic programming. Assignments integrate knowledge of data structures, algorithms, and programming.

---

Final is being graded...

assignments

• /Hw1, /Hwk2, /Hwk3, /Hwk4, /Hwk5, /Hwk6
• /Prog1, /Prog2, /Prog3, /Prog4, /Prog5, /Prog6

solutions

• /Hwk1Soln, /Hwk2Soln, /Hwk3Soln, /Hwk4Soln, /Hwk5Soln, /Hwk6Soln
• /Prog1Soln, /Prog2Soln, /Prog3Soln, /Prog4Soln, /Prog5Soln, /Prog6Soln
• /MidTermSoln, /FinalSolns

other

• /Review
• /Syllabus (topics by week), /Topics
• /Library - CS141 code library
• /GradeInfo

• Debugging
• CPlusPlusDocs - Is your c++ rusty? Here are links to c++ documentation.

• /BasicInfo - instructor, book, ta's, meetings, grades, course policies

• [Turn in a programming assignment.]
• Mailing list archives: [april], [may], [june]

Old Stuff

• /GettingStarted - each student should do these things right away (week 1)
• [Bulletin board for cs141 students]
• /AdvisoryBoard - the board meets with the instructor and TA's twice a month to give us advice on the course. You can join.
• /ChallengeProblems - optional exercises and contests with rewards.