Mr. Neary's CMSC341 Homepage

Section 03: Tuesday & Thursday, 2:30pm – 3:45pm, Sherman 013

Section 04: Monday & Wednesday, 1:00pm – 2:15pm, Sondheim 103

Section 05: Monday & Wednesday, 2:30pm – 3:45pm, Sondheim 103


Office Hours

I will have office hours in ITE 374 at the following times:
Tuesday 1:00pm – 2:00pm
Wednesday 4:00pm – 5:00pm

Slides

Lecture Slides Notes/Misc.
Lecture 1 - Introduction
Lecture 2 - Machines & Memory
Lecture 3 - Asymptotic Analysis induction proof
Lecture 4 - Lists
Lecture 5 - Stacks & Queues
Lecture 6 - STL & Templating
Lecture 7 - Trees Intro. tree induction
Lecture 8 - Binary Search Trees
Lecture 9 - AVL Trees Slightly better notes.
Lecture 10 - B Trees
Lecture 11 - Red-Black Trees
Lecture 12 - Heaps
Lecture 13 - Leftist Heaps
Lecture 14 & Lecture 15 Hashing 1 and 2
Lecture 16 - Graphs
Lecture 17 - Max Flow
Lecture 18 - Disjoint Sets

Follow this link for useful visualizations.

Grading

Your grade is based on attendance, 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
Quizzes .5 6 3
Total: 100 + 3

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).