Syllabus: | syllabus.pdf | |||
Classnotes: | notes.pdf | |||
Homeworks: | hw1.pdf | hw2.pdf | hw3.pdf | |
Programming Assignments: | prog1.pdf | prog2.pdf | prog3.pdf | prog4.pdf |
Instructor: Jyh-haw Yeh
Office: CCP 247 Phone: 426-3034 email: jhyeh@boisestate.edu
Class Time: MoTueWe 4:30 - 6:20 PM Location: CCP 243
Office Hours:
TuWe 1:00 - 2:15 PM | MoTuWe 4:10 - 4:30 PM |
Teaching Assistant:
TA and Tutor | Office Hours | Location |
Anil Acharya Jake Douglas Rena Tralini |
Check Tutoring Center Schedule |
Kount Tutoring Center (CCP 241) |
Textbook:
Course Objectives: At the end of the course, students will be
Catalog Description:
Sorting, searching, and order statistics. Further data structures: trees, priority queues, dictionaries,
balanced search trees, B-Trees, heaps, hash tables, and graphs.
Prerequisites:
Course Outline Topics:
Topics | Weeks |
---|---|
Getting Started (Chapter 2) and Introduction to Asymptotic Notations (Big-Oh, Theta, and Big-Omega) | Week 1 |
Sorting (Chapter 6, 7, 8) | Week 1 & 2 |
Mid-term Exam1 & Review | Week 3 |
Basic Data Structures (Chapter 10) | Week 3 |
Hash Tables (Chapter 11) | Week 3 & 4 |
Trees (Concept & Terminology, Expression Trees) | Week 4 |
Search Trees (Chapter 12 Binary Search Trees, AVL Trees, and Chapter 18 B-Trees) | Week 4 & 5 |
Mid-term Exam2 & Review | Week 5 or 6 |
Graph Algorithms (Chapter 22, 23) | Week 7 |
Final Exam & Review | Week 7 |
Programming Assignments Discussion | N/A |
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: