Professor |
David Bremner |

Office |
GWC115 |

Phone |
447-3300 |

Instructor Email |
bremner ATSIGN unb.ca |

Tutorial |
14:00, Thursdays, GC112 |

## Course Work

This course consists of individual work solving programming problems (mainly from the uva collection.

Problems will be assigned by the instructor and posted on this web page

Problem correctness will be as judged by the online judging system, or in cases where that is not possible, and/or the instructor.

In case of dispute, the instructor will decide whether a given solution is correct.

## Evaluation

This course is Credit/No-Credit.

To receive credit, you *must* have completed, and have the
instructor sign off on

- 2 problems by October 3 2013
- 5 problems by Oct 24, 2013
- 9 problems by November 28, 2013
- 12 problems by December 18, 2013
- 1 "makeup problem" for those that missed the fall contest, by December 18.

The final three (four) problems will count as a "Take home final", and are hence due at the end of exam period.

Participation in the Fall Programming contest on Saturday September 28
is mandatory. You can count up to 2 contest problems towards your
totals *only* if you solve them during the contest.

## Problems assigned

Note that you don't have to do every problem, only the required number (see above). Roughly in order of difficulty.

- UVA 10137 The Trip sample data sample output
UVA 11035 Poker Hands

UVA 1202 Finding Nemo.

UVA 10954 Add All. As a hint, consider the tree of additions. Notice that you pay for given number once for every time it occurs in the tree.

UVA 681 Convex Hull

UVA 12304 Geometric Primitives

UVA 11280 Flying to Fredericton

UVA 1262 Password

UVA 413 Up and Down

UVA 12421 Lexical Analyzer

UVA 11085 Back to the 8 Queens

## Extra Problems

You can also do these problems, although they may be harder, or just require more background.

UVA 1205 Color a tree. This problem is really a well known scheduling problem in disguise. The solution can be found in section 2 of Horn 1972. Sample data: 1205.sample-in 1205.sample-out

UVA 1201 Taxi Scheme

UVA 11989 Cutting Cake This needs some geometry (intersecting lines and line segments), as well as a basic sorted list structure.

UVA 11998 Wario Land This needs a graph data structure.

Extra test data can be found at uva (csmall.in for Cutting Cake, lsmall.in for Wario Land)