NEW: For a prettier blog interface, see the Wordpress version!

Notes
2004.07.19: Grids
2004.07.12: Graphs
2004.06.30: Discussion of problems
2004.06.28: Mini-contest: Data structures
2004.06.21: Mini-contest: Data structures
2004.06.16: Data structures
2004.06.14: The first day of classes

## Notes

### 2004.07.19: Grids

 Rank Name Solved Score 1 Miguel Arguelles 1 26 2 Joshua Agarrado 1 27 3 Mark Punzalan 1 44 4 team20 ?? 1 92 5 Michael Gonzales 1 115 6 Jino Noel 1 116 7 Jason Salvador 1 124 8 Allan Espinosa 1 135

### 2004.07.12: Graphs

 Rank Name Solved Score 1 Mark Punzalan 3 125 2 Miguel Arguelles 3 185 3 Josh Agarrado 3 199 4 Allan Espinosa 2 69 5 Erik Troy Uy 2 115 6 Michael Gonzales 3 134

### 2004.06.30: Discussion of problems

REMINDER: We will have classes on 2004.06.30.

### 2004.06.28: Mini-contest: Data structures

Standings:

RankTeamNameSolvedScore
11Mark Punzalan3158
216Russell Santos2107
38Miguel Arguelles2194
410Allan Espinosa2284
53Mike Gonzalez119
64Christopher Rigor148
811Neill Wilbert Li1112
912Peter dela Cruz1129

Keep up the great work! To everyone else: don't be discouraged. Practice greatly helps. =)

Check this site tomorrow afternoon for problems to practice on.

### 2004.06.21: Mini-contest: Data structures

We had our first mini-contest today, with problems 262 and 330 from http://acm.uva.es/problemset/ . It took us half an hour to set up PC^2, which I configured for Java use. Mark Punzalan successfully solved problem 262 (Transferable Voting) after a few runs that had problems with spoiled ballots. A number of other people attempted a few submissions, but no one else succeeded.

If you study the sample solutions, you can see:

• How input/output is generally handled
• A particular (but not necessarily the best) algorithm for solving the problem
• How ugly code can get when written under time pressure ;)

The sample solution may not address all test cases. Oh well. =)

### 2004.06.16: Data structures

• Stacks
• Queues
• Dictionaries
• Priority Queues
• Sets

**Assignment**

Work on the following problems for practice. Try to solve at least three before Monday. You don't have to solve them in order. Read through the problems to find the ones you think you can solve. Solve them, then move on to more difficult problems.

• Student Grants (144)
• Josephus Problem (130)
• The Skyline Problem (105)
• Jolly Jumpers (10038)
• Poker hands (10315)
• Stack 'em Up (10205)
• Contest scoreboard (10258)
• Accordian patience (127)
• Transaction processing (187)
• Telephone Tangles (139)
• Eeny Meeny (180)
• Clock Patience (170)
• Beggar My Neighbor (162)

Please put CS139 in the subject of your e-mail, if you're sending it to me. Outline the input, output, data and processing needed, and ask specific questions. =)

### 2004.06.14: The first day of classes

I'd love to hear about any questions, comments, suggestions or links that you might have. Your comments will not be posted on this website immediately, but will be e-mailed to me first. You can use this form to get in touch with me, or e-mail me at [email protected] .

Page: C S 139.3.2004Sem 1
Updated: 2004-11-21
NOTE: ANTI-SPAM MEASURE NOW IN PLACE. Please answer the following question with the right number in order to send me your comment.
What is two minus one? (hint: one ;) )
Name:
E-mail:
URL: