Mr. Park's CMSC341 Sections Homepage
Section 01: Tuesday & Thursday, 10:00am – 11:15am, ITE 233
Section 02: Tuesday & Thursday, 1:00pm – 2:15pm, Fine Arts 014
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 calendar below. Please plan your schedules accordingly. Makeup exams will be given only under the most dire circumstances (almost never).
Reading Schedule
| Date | Topic | Reading | Lecture Notes |
|---|---|---|---|
| Tue 01/30 | Introduction | L01-Intro-topics-JP.pdf | |
| Thu 02/01 | Memory & Processes | Chap 1 & 2 | L02-Dynamic Memory and Pointers-JP.pdf |
| Tue 02/06 | Project 1, Circular Queues | 3.4 | |
| Thu 02/08 | Linked Lists vs Arrays | 3.1 - 3.2 | L04-Lists -Gibson-JP.pdf |
| Tue 02/13 | Running Times | Chapter 4 | L05-Asymptotic Analysis.pdf |
| Thu 02/15 | STL Stacks & Queues | Chapter 5, 6 | L06-STL-Stacks-Queues.pdf |
| Tue 02/20 | more Stacks & Queues, Pointers | ||
| Thu 02/22 | Trees | Chapter 7 | L09-Trees-Intro.pdf |
| Tue 02/27 | Binary Search Trees, Project 2 | 10.1 | L10-Binary-Search-Trees.pdf |
| Thu 03/01 | more BSTs | ||
| Tue 03/06 | AVL Trees | 10.2 | L11-AVLTrees.pdf |
| Thu 03/08 | AVL Trees, Splay Trees | 10.3 | L12-SplayTrees.pdf |
| Tue 03/13 | Midterm 1 Review | Midterm topic list | |
| Thu 03/15 | Midterm Exam 1 | ||
| Tue 03/20 | Spring Break | ||
| Thu 03/22 | Spring Break | ||
| Tue 03/27 | Project 3 out | ||
| Thu 03/29 | Splay Trees, Red-Black Trees | 10.5 | L13-RedBlackTrees.pdf |
| Tue 04/03 | Red-Black Trees | ||
| Thu 04/05 | Heaps | Chapter 8 | L14-Priority Queues and Heaps-JP.pdf |
| Tue 04/10 | More Heaps | L15-Leftist-Heaps-JP.pdf | |
| Thu 04/12 | Project 4 | ||
| Tue 04/17 | Hash Tables | 9.1-9.2 | L16-Hashes-all-JP.pdf |
| Thu 04/19 | Hash Tables | ||
| Tue 04/24 | Midterm 2 Review | Midterm 2 topic list | |
| Thu 04/26 | Exam 2 | ||
| Tue 05/01 | Project 5 | ||
| Thu 05/03 | Sorting | 11.1-11.3 | L18a-MergeSort.pdf L18b-DivideAndConquer.pdf L18c-QuickSort.pdf |
| Tue 05/08 | More Sorting, Average Running Time | L19a-SortingLowerBound.pdf L19b-RadixSort.pdf | |
| Thu 05/10 | Disjoint Sets | 11.4 | L20-Disjoint-Sets.pdf |
| Tue 05/15 | Final Exam Review | Final Exam topic list |