Prof. | Glenn Tesler, gptesler@math.ucsd.edu | ||||||||
Office hours | AP&M 5808, (858) 534-0997, M 3:30-5, F 10-11:30. | ||||||||
Home page | http://math.ucsd.edu/~gptesler/188 | ||||||||
Lecture A |
|
||||||||
Lecture B |
|
Textbook: Foundations of Algorithms Using C++ Pseudocode, Second Edition, by Richard Neapolitan and Kumarss Naimipour, 1998. Also see Prof. Bender's errata/notes for the book.
Goals: The objectives of this course are to study different methods for designing algorithms, and to compute or estimate the running times of algorithms, so that we may choose the fastest one for a particular problem.
Course requirements: Weekly homework, one midterm, and one final. Your composite grade will be homework 30%, midterm 30%, final 40%.
Homework: Homework will be assigned during lectures and is due in class on Wednesday. It will be returned to you in your Tuesday section the following week.
- Please write your name, assignment number, section number, and date at the top of the first page.
Show your work, and when relevant, circle your final answer.
Staple the pages together. If you turn in loose pages, fold pages together, tear and twist the corners, use paper clips, etc., your pages will probably be separated or snagged into someone else's assignment, and you will not receive full credit.- You may study with others, but the work you turn in should be your own; do not just copy someone else's answer.
- Late homeworks will not be accepted. If you will miss class Wednesday, send it with a friend or turn it in early to the professor or your T.A.
- Your lowest homework score (including 0 for not turning in an assignment) will be dropped.
Exams: There will be one midterm and one final; see the top of this syllabus for the date for your class. They will be comprehensive. Rules and material covered will be announced the week before.Academic integrity: Cheating will not be tolerated. See the "UCSD Policy on Integrity of Scholarship" published in the UCSD General Catalog.
You must take the exams with the class in which you are officially registered.
No make up exams will be given.
UPDATE 2/26/01: If you are enrolled in Lecture A but want to take the Lecture B final on Friday March 23, 11:30-2:30, you may do so by signing up with Prof. Tesler in class by March 9.
Math add/drop procedures: The Mathematics Department operates its own Add/Drop Center in AP&M 2420A, Jan. 8-12, 8:30-3:30, and Jan. 16-19, 10:00-2:00. Use it to change sections, add or drop math classes, check your waiting list status, etc.
Due Wed. | Homework due Wednesdays in class |
1. Jan. 17
Answers |
Chapter 1# 1, 13
Appendix A# 1, 3, 5, 6, 7, 11, 15, 17, 23, 24, 28-31 |
2. Jan. 24
Answers |
Chapter 1# 3, 8, 10(#3), 15, 16, 20(#1,2), 22, 24, 26, 31 |
3. Jan. 31
Answers |
Appendix A# 38, 39 Chapter 2# 1, 2, 6, 8, 9, 19; #9 is cancelled Handout problem# H-1 |
4. Feb. 7
Answers |
Appendix B# 1(g), 4, 12(ab), 15(bd), 23, 24 Chapter 2# 14, 15 |
5. Feb. 14
Answers |
Chapter 3# 2, 4, 14, 17, 19, 21 Handout problem# H-2 |
6. Feb. 21
Answers |
Chapter 3# 15 Chapter 4# 1, 24 Handout problem# H-3 |
7. Feb. 28
Answers |
Chapter 5# 3, and 30 with W=13 (book has typo) Chapter 6# 18 Handout problem# H-4 |
8. Mar. 7
Answers |
Chapter 7# 2, 3, 6, 9, 10;
problem 3 has a typo: A(n) = n(n+7)/4 - 2, not -1
Handout problems# H-5, H-6 |
9. Mar. 14
Answers Animation |
Chapter 7# 43
Handout problems# H-7, H-8 |
10. not collected
Answers |
Chapter 1# 34
Chapter 9# 4, 8(#9.5) |