CSSE 503 – Foundations, Structures, and Algorithms
Winter 2008
Engr 305, W 6:00-8:40pm
Instructor: Dr. Roshanak Roshandel
Office Phone: (206) 296-5512
Office: ENGR 507
Office Hours: Wednesdays 5:00-6:00 pm or by appointment
E-mail: roshanak@seattleu.edu
Required Text
· Introduction to the Design and Analysis of Algorithms (2nd Edition) – By Levitin
o ISBN-10: 0321358287, ISBN-13: 978-0321358288
Suggested Text
Course Description
Basic strategies of algorithm design: top-down design, divide and conquer, average and worst-case complexity, asymptotic costs, simple recurrence relations. Choice of appropriate data structures such as arrays, stacks, queues, trees, heaps, graphs, hash tables, etc. Applications to sorting and searching. Introduction to discrete optimization algorithm: dynamic programming, greedy algorithms.
Schedule (Subject to Change)
|
Date |
Topics |
|
Assignments |
|
W1 1/9/08 |
Introduction · Discrete Mathematics · Algorithms, Data structures, Efficiency analysis |
Handout Chapter 1 |
|
|
W2 1/16/08 |
Sort and Search · Brute force approaches |
Chapters 1, 2 |
Assignment 1 due |
|
W3 1/23/08 |
· Efficiency Analysis |
Chapters 1, 2 |
Assignment 2 due |
|
W4 1/30/08 |
Sort and Search · Brute force · Divide and Conquer Exam 1 review |
Chapter 3 and 4 |
Assignment 3 due |
|
W5 2/6/08 |
Exam 1 |
||
|
Sort and Search · Divide and Conquer · Decrease and conquer |
Chapter 4, 5 |
Programming Proj due (Friday 2/8 – midnight) |
|
|
W6 2/13/08 |
Sort and Search · Divide and Conquer · Decrease and conquer |
Chapter 4, 5 |
|
|
W7 2/20/08 |
Sort and Search · Transform and conquer |
Chapter 6 |
Assignment 4 due Programming Proj 2 due |
|
W8 2/27/08 |
Exam 2 |
||
|
· Transform and conquer · Heaps and Heapsort |
Chapter 6 |
|
|
|
W9 3/5/08 |
Space and time tradeoffs, Hashing Dynamic programming |
Chapter 7, 8 |
|
|
W10 3/12/08 |
Greedy algorithms Algorithm Limitations |
Chapter 9, 11 |
|
|
Wednesday 3/19/07 |
Final Exam 6:00 pm – Engr 305 |
||
Grading Policy
Attendance Policy
You are responsible for the materials covered in class, assignments announced and modified, etc. There will also be quizzes and in-class assignments.
All take-home assignments are due before the start of class on the due date. No late submission will be accepted.
Class Format
You are expected to read assigned materials in advance of the relevant class (handouts and textbook). There will be several programming and non-programming assignments, some take home assignments (not graded), a few in-class quizzes and assignments, a midterm, an in-class or take home final exam.
You are encouraged to participate in various class activities, ask questions, discuss and test your ideas. You are also highly encouraged to ask questions either during office hours or by email.
Academic Integrity
Plagiarism is the unacknowledged use of the work or intellectual property of other persons, published or unpublished, presented as one’s own work. All students are expected to work on all individual assignments independently. Collaboration on individual assignments is considered cheating and will be penalized accordingly. Other examples of behavior that is not tolerated in this class include copying all or part of someone else’s work and submitting it as your own, sharing your assignment solution with other students in the class, consulting with another student during an exam, and copying text from published literature without proper attribution. If you have questions about what is allowed, please discuss it with the instructor. All students are responsible for reading and following the Seattle University Academic Honesty Policy. Students who violate University standards of academic honesty are subject to disciplinary sanctions, including failure in the course and suspension from the University.