1. CPSC 465: Design and Analysis of Algorithms
12 Week, Spring, 2009
Offices: C-111

2. NOTE: My Schedule MWF- 11-12:20 (C-106) cpsc 375
Before (If I know the night before) and after class are good times to meet.

3. Administrative Details
25% ---Test 1
25% ---Test 2- during finals time
50% ---Homework exercises, programming exercises, or assigned readings presented or discussed in class.
There will be a homework set due every Friday during the semester.

4. Types of Homework Problems
R- reinforcement exercises
Stress basic concepts
C- creativity exercises
May not be easy (although some are)
These are more challenging
P- projects
These require programming

5. Homework Policies
All homework should be written neatly in dark pencil or ink on lined paper or typed.
Your name should be in the upper right corner followed by the week number of the assignment.
Be sure to number each problem. Leave plenty of white space for me to make comments and, most importantly, write so I can read your paper!
Not all problems will be graded, but you will not know in advance which ones will be and which ones will not.
I am most interested in you attempting all of the problems.

6. Homework Policies
You should do as many of the problems as you can on your own or by asking for help from me in class or privately in person or via . Clarifications will be shared in the Faq.doc file.
IF you are terribly stuck, you may discuss the problem with a classmate. But, be very careful you follow these rules:
1. Both of you must identify on both of your papers that you shared ideas on a specific problem.
2. You both should agree upon a percentage that each of you contributed to the solution and provide that on both of your papers.
3. Each of you must independently write up the solution to the problem.
4. Be aware that I may ask anyone who shared ideas to explain to me the problem solution, so be sure they understand it.

7. Homework Policies Late handins will be penalized 5% per day.
You are better off handing something in and saying you don't understand it, then not handing in anything.
If you don't understand something, I will assume that you have set up an appointment to talk to me about the problem or you have asked questions in class or you have worked with a class mate.

8. Homework The goal of homework is to master the material.
This can be accomplished best by working through problems by yourself.
However, if you are truly stuck, working with someone else might help.
If you do work with someone else, you owe it to yourself and to that person to spend time trying to solve the problem prior to meeting.
You must write up solutions by yourself without assistance, this includes any code you may write unless I specify a group program.
You must identify collaborators on all assignments. If “none”, state so at the beginning.
If you obtain a solution through research, provide a citation of your source.
Absolutely no collaboration is allowed on exams. Plagiarism and other anti-intellectual behavior will not be tolerated.

9. TEXTBOOK AND RESOURCES
Text: Goodrich, Michael T. and Roberto Tamassia, "Algorithm Design: Foundations, Analysis, and Internet Examples", Wiley, 2002 At
Includes many resources such as
the authors' slides (I will use or modify some of these)
animations (that often illustrate how an algorithm performs)
hint servers for some problems (be sure to use these)
errata

10. Goals of Course
To be able to analyze time- and space-complexity of algorithms
To be able to prove theorems about algorithms
To understand the design and strengths/weaknesses of various advanced data structures
To be able to recognize various algorithm design techniques
To understand the tradeoffs involved in selecting from various data structures and algorithms when solving specific problems

11. Some Things to Note
The textbook claims it is a junior/senior/graduate text.
Don’t panic!! Graduate courses would require more homework exercises that are in the C class than I will.
The textbook provides a mathematical “review” which in most of your cases will be an introduction to the material.
Don’t panic!!

12. Which Chapters Will We Cover
I am not sure yet.
As many as possible during the term.
Most of Chapter 2 is a review of CPSC 201 so I will look at only a few things in that chapter.
Note the text works in a pseudocode, but there are Java examples.