Syllabus: | syllabus.pdf | ||
Class Example: | Example for divide and conquer.pdf | Example for activity section problem | |
Homeworks: | hw1.pdf | hw2.pdf | hw3.pdf |
Programming Assignments: | prog1.pdf | prog2.pdf | prog3.pdf |
Instructor: Jyh-haw Yeh
Office: CCP 247 Phone: (208) 426-3034 email: jhyeh@boisestate.edu
Class Time: MoTueWe 4:00 - 5:50 PM Location: Remote via Zoom
Office Hours:
MoTueWe 1:00-1:30 PM & 3:30 - 4:00 PM & 5:50 - 6:30 PM |
Teaching Assistant:
TA | Office Hours | Location |
Joshua Holmes (joshholmes@u.boisestate.edu) | Tu 1:30-3:30 PM; Th & Fr 3:00-4:30 PM | Remote via Zoom |
Course Objectives: At the end of the course, students will be
Catalog Description:
Asymptotic analysis, recurrences, and amortized analysis. Divide-and-conquer, dynamic programming, greedy algorithms and graph algorithms. Primality and other number-theoretic algorithms. Tractability and NP-Completeness.
Prerequisites:
Course Outline Topics:
Topics | Weeks |
---|---|
Asymptotic Notations and Common Functions (Chapter 3) | Week 1 |
Divide-and-conquer & recurrences (Chapter 4) | Week 1 & 2 |
Dynamic Programming (Chapter 15) | Week 2 & 3 |
Mid-term Exam 1 & Review | Week 3 |
Greedy Algorithms (Chapter 16) | Week 4 |
Amortized Analysis (Chapter 17) | Week 4 |
Graph Algorithms (Chapter 22, 24) | Week 5 |
Mid-term Exam 2 & Review | Week 5 and/or 6 |
Graph Algorithms (Chapter 25) | Week 6 |
Number-theoretic Algorithms (Chapter 31) | Week 6 or 7 |
NP-Completeness (Chapter 34) | Week 7 |
Final Exam & Review | Week 7 |
Programming Assignments Discussion | When assigned |
Design and Analysis:
Grading:
Final Grade: You are guaranteed to receive at least the grade as follows (I reserve the right to lower the cutoffs if I feel it is appropriate).
Grading Policy:
Academic Honesty: