CMSC 341 Data Structures
Spring 2002
Sections 0201 and 0301
Mr. Mitch Edelman
Tu -Th 5:30 - 6:45 PM (room SS103)
Tu - Th 7:00 - 8:15 PM (room SS203

Exam Grades

Please check here for your final exam score, project 5 score, and course grade.

Course Description

Data Structures are the paramount concern of this course. The principle objective of the course is to help you learn how to design and analyze a wide range of data structures.

The course covers data structures and associated algorithms. Relationships among data structures, their utility in various situations, and factors affecting their performance in algorithms will be considered. You will learn to analyze the demands of algorithms, how to choose appropriate data structures, and how to integrate data structures into algorithms.


Required: Data Structures and Algorithm Analysis in C++, 2nd Edition, by Mark Alan Weiss, Addison-Wesley


You should be very familiar with the language, and when you find things that you are not as familiar with as you would like, consult your C++ reference.

Announcements and Special Notices

Please check here for announcements and special notices applicable to Mr. Edelman's sections. This is where you'll find postings of your grades, supplementary readings, etc. Course Announcements


We will assume that you have mastered the material from CMSC 201 , CMSC 202 , and CMSC 203 , including mastery of the C++ language. We will not review material that has been covered in the prerequisite courses. We do cover a few of the data structures from CMSC 202, but from a deeper point-of-view. A few advanced C++ topics such as templates and exceptions will be reviewed. 


Your grade for this course will be based upon 5 projects, 2 in-class exams and the final exam. The projects are worth 50% of your grade, each project weighted equally. Each in-class exam is worth 15 percentage points; the final is worth 20 points. Note that the due dates for the projects and the dates of the exams are already set (q.v., the syllabus and project policy handout). Please plan your schedules accordingly. Makeup exams will be given only under the most dire circumstances (almost never).

Your final letter grade is based on the standard formula:

0 <= F < 60, 60 <= D < 70, 70 <= C < 80, 80 <= B < 90, 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.

Attendance and Readings

This is an advanced course; you are responsible for the materials in lectures and in the readings. It's up to you whether you attend lectures or read the text, but if I were in this class, I'd plan on being at all the lectures, and preferably to be awake in them. You are responsible for all material covered in the lecture, even if it is not in the textbook. You should keep up with the assigned readings during the semester. Some reading material will distributed through the course web page. You are responsible for the material in the readings, even if it is not covered during lecture. If it appears that a majority of students have taken to missing lectures or not keeping up, I reserve the right to schedule an impromptu quiz or two.

You must study to do well in this course. It will not be enough to attend lectures and do the homework. As advanced undergraduates, you will be responsible for learning material that is not necessarily covered in lectures. A prime learning requirement is that you contribute to class discussions and raise questions about the course material.

A word on coding

If the only code you do in this class is the assigned homework, you can still get a preferred grade; however, the grade you should expect is a C. The way you learn the content in here is to experiment with it; that almost always reduces to writing code to see how the things work.

In other words, play around with the materials!

Help Sessions

Help sessions are held throughout the semester at 8:30 PM  every Thursday and 11:00 AM every Friday in room ACIV 014.  Help session topics include Unix, makefiles, compiling with g++, good coding practices and C++  topics such as working with templates, exceptions and class design.  Projects  and exam review questions will also be discussed.  Students  are encouraged to suggest help session topics.

Contacting Me or the TAs

Please feel free to visit me or the TAs during our office hours. If you can't make it during the regular hours, please ask for an appointment. We will do everything we can to be available to provide help with this course. Office hours, phone numbers and other contact information is available on-line. If you need to contact any of the course staff outside of lecture and office hours, email is much better than the telephone. You should, however, observe the following etiquette:

Academic Integrity

Cheating in any form will not be tolerated. Any and all Instances of cheating will be reported to the UMBC Academic Conduct Committee. These reports are filed by the Committee and can be used for disciplinary action such as a permanent record on your transcript. Academic honesty is absolutely required of you. You are expected to be honest yourself and to report any cases of dishonesty you see among other students in this class. Reports of dishonest behavior will be kept anonymous.
Further details on honesty in doing projects for this course are on-line at the Project Policy link.

Students are welcome and encouraged to study together for exams, but examinations are to be your own work -- not your neighbor's and not your notes. All exams are closed-book, closed-notes. Only pencils (or pens, and not red pens, please) and erasers are permitted in the exam room unless otherwise indicated. Scratch paper is provided to you, as needed. Having any other materials (except food and drink) in your possession during a n exam will be taken as evidence of cheating and dealt with accordingly. I doubt that any of the math will require a calculator, especially if you already know how to compute powers of 2.  



Mon 28 Jan
Project 1 Assigned

Tues 29 Jan
Introduction and C++ 
Thur  31 Jan C++ and OOP
3 Tues 05 Feb Asymptotic Analysis MAW 2
4 Thurs 07 Feb List ADT and Implementations MAW 3
5 Tues 12 Feb List Implementations MAW 3

Wed 13 Feb
Project 1 Due
Project 2 Assigned

6 Thurs 14 Feb Stacks, Queues and Deques MAW 3
7 Tues 19 Feb
Stacks, Queues and Deques MAW 3
8 Thurs 21  Feb Binary Search Trees MAW 4
9 Tues 26 Feb Binary Search Trees MAW 4

Wed 27 Feb
Project 2 Due

10 Thurs 28 Feb Balanced Search Trees
11 Tues 05 Mar
Exam 1
Classes 1 thru 9
12 Wed 06 Mar
Project 3 Assigned

Thurs 07 Mar Balanced Search Trees
13 Tues 12 Mar Balances Search Trees MAW 4
14 Thurs 14 Mar Balanced Search Trees MAW 4
15 Tues 19 Mar Hashing MAW 5

Wed 20 Mar
Project 3 Due

Thurs 21 Mar Hashing

Tues 26 Mar
Spring Break

Thurs 28 Mar
Spring Break

17 Tues 02 Apr Priority Queues and Heaps MAW  6
18 Thurs 04 Apr Priority Queues and Heaps MAW 6
Tues 09 Apr
Exam 2
Classes 12 - 18

Wed 10 Apr
Project 4 Assigned

20 Thurs 11 Apr Skip Lists MAW 10 + Notes
21 Tues 16 Apr Skip Lists MAW 10 + notes
22 Thurs 18 Apr Graphs MAW 9
23 Tues 23 Apr Graphs MAW 9

Wed 24 Apr
Project 4 Due
Project 5 Assigned

24 Thurs 25 Apr Graphs
25 Tues 30 Apr Disjoint Sets MAW 8
26 Thurs 02 May Disjoint Sets MAW 8
27 Tues 07 May B - Trees MAW 4 + notes

Wed 08 May
Project 5 Due

28 Thurs 09 May B - Trees MAW 4 + notes
Tues 13 May
Advanced Topic

Final Exam

Course Web Page

A few handouts will be provided in paper form at the first class. After that, all handouts will be provided only on the web. The course web page URL is
Please check the web page frequently. Any changes to the page will be mentioned in the "What's New" link. 
Last modified on Sunday, Jan 27, 2002 by Mitch Edelman

Back up to Spring 2002 CMSC-341 Homepage