CMSC 341 Data Structures
Fall 2004 Section 0301
Tues/Thurs 5:30 - 6:45
Room SS207
Mr. Mitch Edelman


Course Description

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.

In addition, we will prove a number of theorems to deepen your understandign of computer science.


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



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 40% of your grade, each project weighted equally. Each in-class exam is worth 20 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

You are expected to attend all lectures. 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 be distributed through the course web page. You are responsible for the material in the readings, even if it is not covered during lecture.

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.

BlackBoard Discussion Board

A BlackBoard site has been created for this course. This site is used primarily to support discussion boards, but announcements are also posted there. A discussion board will be established for each programming project. Students are encouraged to post general project questions, answer questions posted by other students or just browse the discussion board to find answers to project questions. Your instructors and TAs will also be posting questions and answers. Your questions may be posted anonymously. Other discussion boards for topics such as general C++ questions will also be established. The course BlackBoard is accessed by logging on to and clicking on the BlackBoard tab at the top of the page.

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. 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.
A quick guide for academic integrity as it applies to projects: if, at any time, you have another student's code in your posession, for any reason at all, in any form at all, then you and the person whose code you have are violating the course guidelines. If you have access to another student's account, and that account has source code for this class, then you are in violation of the course guidelines. In other words, giving code to someone else, for any reason whatsoever, is cheating. Accepting code from someone else is cheating.

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 erasers are permitted in the exam room unless otherwise indicated. Scratch paper is provided to you, as needed. Having any other materials in your possession during an exam will be taken as evidence of cheating and dealt with accordingly. 


Thu Sep 2
Introduction and C++ 
Tue Sep 7 C++ and OOP
3 Thu Sep 9 Asymptotic Analysis MAW 2

Mon Sep 13
Project 1 Assigned

4 Tue Sep 14 Asymptotic Analysis MAW 3
5 Thu Sep 16 List ADT and Implementations MAW 3
6 Tue Sep 21 List Implementations MAW 3
7 Thu Sep 23 Stacks, Queue, Dequeue ADT MAW 3

Sun Sep 26
Project 1 Due at 11:59pm

8 Tue Sep 28 Stacks, Queue, Dequeue ADT MAW 3
9 Thu Sep 30 Recursion class notes
Tue Oct 5
Exam 1
Classes 1 - 8

Wed Oct 6
Project 2 Assigned

Thu Oct 7 Binary Search trees MAW 4
12 Tue Oct 12 Binary Search Trees MAW 4
13 Thu Oct 14 Balanced Search Trees MAW 4
14 Tue Oct 19 Balanced Search Trees MAW 4

Tue Oct 19
Project 2 Due at 11:59pm

Wed Oct 20
Project 3 Assigned

Thu Oct 21 Balanced Search Trees MAW 4
16 Tue Oct 26 Balanced Search Trees MAW 4 & 12
17 Thu Oct 28 Balanced Search Trees MAW 4 & 12

Tue Nov 2
Project 3 Due at 11:59pm

18 Tue Nov 2 Hashing
Thu Nov 4
Exam 2
Classes 10 - 17

Wed Nov 10
Project 4 Assigned

20 Tue Nov 9 Hashing
21 Thu Nov 11 Hashing MAW 5
22 Tue Nov 16 Priority Queues and Heaps MAW 6
23 Thu Nov 18 Priority Queues and Heaps
24 Tue Nov 23 Skip Lists MAW 10 + notes

Tue Nov 23
Project 4 Due 11:59pm

Thu Nov 25

Mon Nov 29
Project 5 Assigned

25 Tue Nov 30 Skip Lists MAW 10 + notes
26 Thu Dec 2 Disjoint Sets MAW 8
27 Tue Dec 7 B - Trees MAW 4 + notes
28 Thu Dec 9 B - Trees MAW 4 + notes

Sun Dec 12
Project 5 Due 11:59pm

29 Tue Dec 14 Review

Final Exam
Classes 19 - 28

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 "Latest News" link. 
Last modified on Sunday August 29, 2004 by Mitch Edelman

Back up to Fall 2004 CMSC-341 Homepage