CMSC 341 Data Structures Fall 2005

Section 0101 (Tues/Thurs 8:30 - 9:45am ITE 229)
Section 0401 (Tues/Thurs 1:00 - 2:15pm ACIV 006)

Mr. Dennis Frey

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



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.

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.

Class Schedule

1 Thurs Sep 1 Introduction and C++ MAW 1
Tues Sep 6 C++ and OOP MAW 1
3 Thurs Sep 8 Asymptotic Analysis MAW 2

Mon Sep 12
Project 1 Assigned
4 Tues Sep 13 Asymptotic Analysis MAW 3
5 Thurs Sep 15 List ADT and Implementations MAW 3
6 Tues Sep 20 List Implementations MAW 3
7 Thurs Sep 22 Stacks, Queue, Dequeue ADT MAW 3

Sun Sep 25
Project 1 Due at 11:59pm

8 Tues Sep 27 Stacks, Queue, Dequeue ADT MAW 3
9 Thurs Sep 29 Recursion class notes
10 Tues Oct 4
Exam 1
classes 1 - 9

Wed Oct 5
Project 2 Assigned

Thurs Oct 6 Binary Trees MAW 4
12 Tues Oct 11 Binary Search Trees MAW 4
13 Thurs Oct 13 Balanced Search Trees MAW 4
14 Tues Oct 18 Balanced Search Trees MAW 4

Wed Oct 19
Project 2 Due at 11:59pm

Thurs Oct 20
Project 3 Assigned

15 Thurs Oct 20 Balanced Search Trees MAW 4
16 Tues Oct 25 Balanced Search Trees MAW 4 & 12
17 Thurs Oct 27 Balanced Search Trees MAW 4 & 12
18 Tues Nov 1 Priority Queues and Heaps MAW 6
Thurs Nov 3 Priority Queues and Heaps MAW 6

Thurs Nov 3
Project 3 Due at 11:59pm

20 Tues Nov 8
Exam 2
Classes 10 - 17

Wed Nov 9
Project 4 Assigned

21 Thurs Nov 10 K-D Trees ???
22 Tues Nov 15 Disjoint Sets MAW 8
23 Thurs Nov 17 Hashing MAW 5
24 Tues Nov 22 Hashing MAW 5

Tues Nov 22
Project 4 Due 11:59pm

Thurs Nov 24

Mon Nov 28
Project 5 Assigned

25 Tues Nov 29 Skip Lists MAW 10 + notes
26 Thurs Dec 1 Skip Lists MAW 10 + notes
27 Tues Dec 6 B - Trees MAW 4 + notes
Thurs Dec 8 B - Trees MAW 4 + notes

Sun Dec 11
Project 5 Due 11:59pm

Tues Dec 13

8:30 class - Thursday Dec 15th, 8:00am
1:00 class - Tuesday Dec 20th, 1:00pm
Final Exam
Classes 19 - 29

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 Wednesday Aug 10, 2005 by Dennis Frey

Back up to Fall 2005 CMSC-341 Homepage