1. CSC 225: Design and Analysis of Algorithms
Dr. Wendy Myrvold, ECS 552,
Cartoon from:

2. Announcements Assignment #1 is posted: Due Wed. Sept. 23.
Lab 1 is posted: print the code and test it on your computer before lab Sept. 14.
Reading List linked to course page includes Chapter 1-4 contents (so far). Please read indicated sections of Chapter 1.
Please make sure you sign the attendance sheet every class to get credit for attending.
Bring your schedule to class next week to help me in choosing office hours.
Powerpoint slides will be posted.

3. Outline for Lecture 1 Who is the instructor? My research interests
Logistics for CSC 225- the critical points are included on the course outline
Brief overview of course content- don’t worry about taking notes today

4. About me: M.Sc. : Computer Science, McGill University, 1983
M.Math. : Combinatorics and Optimization, University of Waterloo, 1984
Ph.D. in Computer Science: Waterloo, 1988
University of Victoria: started in 1988, currently a full professor
by Mark A. Hicks, illustrator.
From: Gurl Guide to programming.

5. Jennifer
Sean

7. My Research: Large Combinatorial Searches
Independent Set:
Set of vertices which are pairwise non-adjacent

8. Fullerenes: Working with Patrick Fowler (chemist) Graphite Diamond

9. Topological Graph Theory:
Algorithms and Obstructions

10. Latin Squares
Please come talk to me if you are looking for Honours project research topics or for an NSERC undergraduate research project.

11. COMBINATORIAL ALGORITHMS GROUP University of Victoria
Our research interests include:
Graph Theory and Graph Algorithms
Combinatorics
Combinatorial Algorithms
Computational Geometry
Randomized Algorithms
Computational Complexity
Network Reliability
Topological Graph Theory
Computational Biology
Cryptography
Design Theory
Join our listserv to get information about conferences and research talks.
Undergrads are welcome to all events.
Combinatorial Potlatch, SFU, Nov. 21, 2009.
Upcoming talks:
Thurs. Sept. 17, 3:30pm, Ruth Hass, Cor A 221
The Center for Women in Mathematics at Smith College
Tues. Sept. 22, 11:00am, Holger H. Hoos, ECS 660
Taming the complexity monster

12. CSC 225 Logistics
Course Website:
Instructor: Dr. Wendy Myrvold
Office: ECS 552 Phone Number: (use for a faster response) Office Hours: See course web page. This week: MWR 3:30-4:30 or by apt. I answer all student s. If you do not get a response in a reasonable time frame please find out why the did not work. Lecture Schedule: MWR 2:30 - 3:20 p.m. ECS 125
Lab Schedule: (attend both if you feel you need extra help)
(B01) M 12: :50 p.m. CLE A 201
(B02) M 1:00 - 1:50 p.m. ELL 062
Labs start the week of Sept 14, 2009.

13. Course Textbook
“This book has been taken out of print by W. H. Freeman. You are welcome to use it if you like. We believed in 1992 it was the way to introduce theory in Computer Science, and we believe that today.”
- Al Aho and Jeff Ullman

14. Not all of the text will be covered- a reading list will be provided to tell you the relevant sections (see course web page)
Text examples are in C, in class we will mostly use Java, and for assignments, you may program them in C, C++ or Java.
To make the class easier: choose the language you are the most comfortable in using.
For a challenge: try the language which is harder for you.
Start assignments early so you can get help if you need it.

15. CSC 225 Grading ITEM REQUIRED FOR FINAL MAX POINTS Assignments (5-6)
You collect points from assignments, the midterm and participation:
ITEM
REQUIRED
FOR FINAL
MAX POINTS
Assignments
(5-6)
10/20 = 50% 20
Midterm
Wed. Oct. 21
10/25 = 40% 25
Participation
2.5/5 = 50% 5

16. Computation of Final Grade
If you get less than 50% on the assignments 40% on the midterm or 50% of the participation marks, you cannot write the final- your grade is N.
Otherwise:
You have Q points where 22.5 ≤ Q ≤ 50.
Your final numeric grade is:
Q plus your score on the final exam
weighted so that it is out of (100 - Q).

17. How to get an A+ in CSC 225: With 23 points: With 50 points: A+ 87B B B C C D
With 50 points: A A A B B B C C D

18. Important Announcements from Jane Guy
If you do not have the prereqs you should drop the class now to avoid paying for it.
If you have already taken this class twice you must get permission from the chair and dean to register. Do it now to avoid fees.

19. Keys to Success Attend all classes and labs. Do all your homework.
Come see me (early and often) if you need help. I love working with students. Ask questions in class as well.
Join a study group but prepare your final submissions independently.
Work old midterms and final exams as practice for your midterm and final.
Don’t be afraid of generating incorrect solutions- real mathematicians make many mistakes in the process of creating new mathematics.

20. Students with a disability
Please let me know as soon as possible how I can accommodate your disability.
It’s often possible to go beyond what is first offered by the disability center.

21. H1N1 Prevention To decrease spread of infection:
Wash your hands regularly and well with soap and water and/or an alcohol-based hand gel.
Avoid touching your eyes, nose or mouth.
Space yourself away from as many others as possible and avoid contact with people who are ill.
Cough or sneeze with care – into a tissue or your sleeve.
If you develop a fever and cough, stay home and limit contact with others.
Do not attend class when ill with flu-like illness.
If you are unable to visit a health professional due to the acute or infectious nature of your illness, call or health services (250) and report details of your health situation. This will provide a log of your illness in the event that you require an academic concession.

22. Accommodation for H1N1:
If you have the flu, assignments may be submitted by , by paper mail (postmark will indicate date submitted) or put it in a sealed envelope with your signature along the seal and ask a friend to hand it in.
You can easily miss one assignment and/or several classes and make an A+ in the class according to our grading scheme. Plan ahead, attend classes, and excel at assignments at the beginning of the term so that you are not in a bad situation if you miss things at the end of the term.
If you fail to hand in an assignment on time, it can still be marked for feedback (but not credit) if handed in late.

23. CSC 225:

24. Max Sort beats Merge Sort for small problem sizes.

25. But for bigger problems, Merge Sort is a lot faster.
We will learn paper and pencil techniques for predicting this type of behaviour.

26. Data Structures revisited:
Queue
Stack
Images from:

27. Other data structures:
Linked list
Circular doubly linked list:

28. Heaps: Ordered binary trees: http://scienceblogs.com/goodmath/2008/04/
implementing_compact_binary_he.php

29. Graphs, and minimum weight spanning trees

30. Depth first search: Breadth first search:

31. CSC 225:
The goal is to provide you with the tools to make informed decisions of algorithms and data structures for solving a problem.