Mr. Park's CMSC341 Sections Homepage
Section 04: Tuesday & Thursday, 10:00am – 11:15am, Performaing Arts & Humanities 234
Mr. Park's office hours: Tuesday 1:00pm – 2:00pm, Wednesday 4:00pm – 5:00pm, in ITE 325-K
Grading
Your grade is based on 6 programming projects, 6 homework assignments, 2 in-class exams and the final exam. The points are distributed as follows:
| points | # | Total | |
|---|---|---|---|
| Project 0 | 3 | 1 | 3 |
| Project 1-5 | 7 | 5 | 35 |
| Homework 1-6 | 2 | 6 | 12 |
| Exam 1 & 2 | 15 | 2 | 30 |
| Final Exam | 20 | 1 | 20 |
| Total: | 100 | ||
Your final letter grade is based on the standard formula:
0 ≤ F < 60 ≤ D < 70 ≤ C < 80 ≤= B < 90 ≤ A ≤ 100.
These levels may be adjusted slightly in your favor, but grades will not be “curved” in the conventional sense.
Your grade is given for timely work done during the semester; incomplete grades will only be given for medical illness or other such dire circumstances.
Schedule
Note that the due dates for the projects and the dates of the exams are already set. See the "Schedule" tab under the course-wide home page. Please plan your schedules accordingly. Makeup exams will be given only under the most dire circumstances (almost never).
Lecture Schedule
| Date | Topic | Reading | Lecture Notes |
|---|---|---|---|
| 1: Thu 08/30 | Introduction | L01-Intro-topics-JP.pdf | |
| 2: Tue 09/04 | Memory & Processes | Chap 1 & 2 | L02-Dynamic Memory and Pointers-JP.pdf |
| 3: Thu 09/06 | Linked Lists vs Arrays | 3.1 - 3.2 | L04-Lists -Gibson-JP.pdf |
| 4: Tue 09/11 | Project 1; Circular Queues | 3.4 | |
| 5: Thu 09/13 | Running Times | Chapter 4 | L05-Asymptotic Analysis.pdf |
| 6: Tue 09/18 | STL Stacks & Queues | Chapter 5, 6 | L06-STL-Stacks-Queues.pdf |
| 7: Thu 09/20 | more Stacks & Queues, Pointers | ||
| 8: Tue 09/25 | Project 2 | ||
| 9: Thu 09/27 | Trees | Chapter 7 | L09-Trees-Intro.pdf |
| 10: Tue 10/02 | Binary Search Trees | 10.1 | L10-Binary-Search-Trees.pdf |
| 11: Thu 10/04 | AVL Trees | 10.2 | L11-AVLTrees.pdf |
| 12: Tue 10/9 | Midterm 1 Review | Midterm topic list | |
| 13: Thu 10/11 | Midterm Exam 1 | ||
| 14: Tue 10/16 | Project 3 | ||
| 15: Thu 10/18 | AVL Trees, Splay Trees | 10.3 | L12-SplayTrees.pdf |
| 16: Tue 10/23 | Splay Trees, Red-Black Trees | 10.5 | L13-RedBlackTrees.pdf |
| 17: Thu 10/25 | Red-Black Trees | ||
| 18: Tue 10/30 | Project 4 | ||
| 19: Thu 11/01 | Heaps | Chapter 8 | L14-Priority Queues and Heaps-JP.pdf |
| 20: Tue 11/06 | More Heaps | L15-Leftist-Heaps-JP.pdf | |
| 21: Thu 11/08 | Hash Tables | 9.1-9.2 | L16-Hashes-all-JP.pdf |
| 22: Tue 11/13 | Hash Tables | ||
| 23: Thu 11/15 | Midterm 2 Review | Midterm 2 topic list | |
| 24: Tue 11/20 | Exam 2 | ||
| Thu 11/22 | Thanksgiving | ||
| 25: Tue 11/27 | Project 5 | ||
| 26: Thu 11/29 | Sorting | 11.1-11.3 | L18a-MergeSort.pdf L18b-DivideAndConquer.pdf L18c-QuickSort.pdf |
| 27: Tue 12/04 | More Sorting, Average Running Time |
L19a-SortingLowerBound.pdf L19b-RadixSort.pdf |
|
| 28: Thu 12/06 | Disjoint Sets | 11.4 | L20-Disjoint-Sets.pdf |
| 29: Tue 12/11 | Final Exam Review | Final Exam topic list MT1 solution MT2 solution |
|
| Thu 12/13 | Final Exam 3:30pm – @5:30pm |
Exam for Park's section will be held in SOND 101 |