CMSC 341 Data Structures Spring 2011

Section 1 - Tues/Thur 1:00 - 2:15pm in ITE 231
Section 3 - Tues/Thur 10:00 - 11:15am in ITE 231

Mr. Dennis Frey
Office: ITE 209
Office hours: Mon/Wed 2:30 - 3:30
Tues/Thur 11:30 - 12:30
by appointment

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 Java, 2nd Edition, by Mark Alan Weiss, Addison-Wesley, ISBN 0-321-37013-9



We will assume that you have mastered the material from CMSC 201, CMSC 202, and CMSC 203. We will not review material that has been covered in the prerequisite courses. We do cover a few of the concepts from CMSC 202, but from a deeper point-of-view. We assume prior experience with Java, review of Java will not be provided. For those of you who are not familiar with Java, please seek help from Computer Science Help Center or TA.


Your grade for this course will be based on 4 programming projects, best 5 out of 6 homework assignments, 2 in-class exams and the final exam. These 3 exams are non-cumulative. The 4 programming projects are 40% of your final grade, 5 homeworks 10%, and 3 exams 50%.

All homework shall be submitted in hard copy in class of the due date.
No project or homework will be accepted past the due date resulting in zero points for that assignment.

Your semester average will be calculated according to the following formula

   Semester Average = 10 * (sum of your points on best 5 HW) / (total possible points of best 5 HW)
                 +    40 * (sum of your points on all projects ) / (total possible points on all projects)
		 +    50 * (sum of your points on all exams ) / (total possible points on all exams)

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.

Note that the due dates for the projects and the dates of the exams are already set (q.v., the syllabus and project policy page). Please plan your schedules accordingly. Makeup exams will be given only under the most dire circumstances (almost never). Project regrade request must be submitted to the TA for your section within 1 week of a returned grade. In some unusual circumstances you may receive a low project score because of a single, simple error that results in many incorrect outputs or results in a compiler/linker error. The definition of "simple error" is determined by your TA. In such cases, your TA may (at his discretion) allow you to fix the simple mistake and have your project regraded. A 10 point deduction will be assessed during the regrade process. There will be NO regrades for homeworks.

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.

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

Please Note Schedule Changes Effective March 14

1 Thur Jan 27 Introduction to CVS and Ant MAW 1, CVS & Ant notes Project 0 out
Tues Feb 1 Java refresh MAW 1
Thur Feb 3 Asymptotic Analysis MAW 2
4 Tues Feb 8 Asymptotic Analysis MAW 2 Project 0 due, Project 1 out
5 Thur Feb 10 List ADT and Implementations MAW 3.1 & 3.2 Homework 1 out
6 Tues Feb 15 Stacks and Queues MAW 3.2; 3.3
7 Thur Feb 17 Introduction to Trees MAW 4.1 & 4.2 Homework 1 due, Homework 2 out
8 Tues Feb 22 Binary Search Trees MAW 4.3

Wed Feb 23

Project 1 due, Project 2 out
Thur Feb 24 Binary Search Trees MAW 4.3 Homework 2 due
10 Tues Mar 1
Exam 1
Classes 1 - 9
Thur Mar 3 Splay Trees MAW 4.5-6, 11.5
12 Tues Mar 8 K-D Trees MAW 12.6
13 Thur Mar 10 Red-Black Trees MAW 12.2 + notes Homework 3 out
14 Tues Mar 15 Red-Black Trees MAW 12.2 + notes
15 Thur Mar 17 B-Trees MAW 4.7 Homework 3 due, Homework 4 out

Tues Mar 22
Spring Break

Thur Mar 24
Spring Break

16 Tues Mar 29 B-Trees MAW 4.7  
17 Thur Mar 31 Priority Queues and Heaps MAW 6
Sun Apr 3     Project 2 Due; Project 3 out
18 Tues Apr 5 Priority Queues and Heaps MAW 6 Homework 4 due
19 Thur Apr 7
Exam 2
Classes 11 - 18
20 Tues Apr 12 Hashing MAW 5
21 Thur Apr 14 Hashing MAW 5 Homework 5 out
22 Tues Apr 19 Skip Lists MAW 10.4.2 + notes

Wed Apr 20

23 Thur Apr 21 Skip Lists, Disjoint Sets MAW 10.4.2 & 8 Homework 5 due
  Sun Apr 24     Project 3 due, Project 4 out
24 Tues Apr 26 Disjoint Sets MAW 8
25 Thur Apr 28 Graphs MAW 9.1 - 9.3 + notes
26 Tues May 3 Graphs MAW 9.1 - 9.3 + notes Homework 6 out
27 Thur May 5 Graphs MAW 9.1 - 9.3 + notes
28 Tues May 10 Special Topics
Homework 6 due

Wed May 11

Project 4 due
29 Thur May 12 Review

Section 1 (1:00pm)
Tues, May 17, 1:00pm
Section 3 (10:00am)
Tues, May 17, 10:30am
Final Exam
Classes 20 - 28

Course Web Page

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 Thursday Jan 20, 2011 by Dennis Frey

email: frey AT cs DOT umbc DOT edu
Back up to Spring 2011 CMSC-341 Homepage