CMSC 341 Data Structures
Spring 2003 Section 0201-0301
Section 0201 Tuesday/Thursday 7:00-8:15 P.M. SS 206
Section 0301 Tuesday/Thursday 5:30-6:45 P.M. SS 206
Instructor: Mitch Edelman
you may check your grades here
Please Note the schedule changes for the couple of
lectures lost because of the snow.
Especially, you should note the date change for the exam!
In the event of snow
cancellation on 2/27, the exam will be pushed back to 3/6.
The course is titled "Data Structures", and we will deal with them
in some depth; the primary course objective is to learn to design amd analyze
the performance of a number of "classical" data structures.
The course covers data structures and associated algorithms. We will study the
relationships among data structures, their utility in various situations, and
factors affecting their performance. You will learn to analyze the time and
space complexity of algorithms, how to choose appropriate data structures, and
how to integrate data structures into programs.
Required: Data Structures and Algorithm Analysis in C++, 2nd
Edition, by Mark Alan Weiss, Addison-Wesley
- Your favorite C++ reference book -- some suggestions
- The C++ Programming Language, Special Edition by Bjarne Stroustroup
(He's the guy who invented the language)
Addison-Wesley, 2000, ISBN 0-201-70073-5
- C++ Primer, Third Edition by Stanely B. Lippman, Josee
Addison-Wesley, 1998, ISBN 0-201-82470-1
- C++ FAQs, Second Edition by Marshall Cline, Greg Lomow,
Addison-Wesley, 1999, ISBN 0-201-30983-1
- Effective C++ Second Edition by Scott Meyers
- More Effective C++ by Scott Meyers
- Thinking in C++ by Bruce Eckel.
This book is available in its entirety on the web at
- Data Structures and Algorithm Analysis by Clifford Shaffer,
Prentice-Hall, 1996. This book has good coverage of data structures and algorithm
analysis in C++. It has excellent descriptions of a number of data structures.
- Data Structures, Algorithms, and Applications in C++ by Sartaj
Sahni, McGraw-Hill, 1998. Covers some material not covered by the Heileman
- Data Structures and Algorithms by Alfred Aho, John Hopcroft,
and Jeffrey Ullman, Addison-Wesley, 1983. This is one of the all-time classics,
written in Pascal.
- Fundamentals of Data Structures by Ellis Horowitz, Sartaj Sahni,
and Dinesh Mehta, 1995. Another classic. In C++.
- Abstract Data Types by Nell Dale and Henry Walker, D.C. Heath
and Company, 1996. A high-level view of data structures and algorithms,
with no programming language specified. A very worthwhile and modern text
with an alternative viewpoint.
The course prerequisites are
203. You are expected to have some proficiency in program design using
C++. We will not review material that has been covered in the
prerequisite courses. A part of the course discusses 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.
If you work and have planned travel time around an exam, you need to
notify me in advance.
If you miss an exam for any reason other than illness requiring
medical attention or for an emergency, you will receive a zero on the exam.
An "emergency" is "a situation or occurrence of a serious nature, developing
suddenly AND unexpectedly, and demanding immediate action.
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.
Please note that "timely" means "submitted on or before the announced due date".
In particular, due date extensions for projects don't happen.
Attendance and Readings
You are responsible for all material covered in the lectures, 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.
PowerPoint slides are usually available in advance of the lectures; they are there
to support your preparation for class. They are not a substitute for lecture attendance.
So, even though I do not take attendance and you are not required to attend lectures, you
run a very high risk of severely damaging your grade by skipping them.
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.
You should plan on spending at least 12-15 hours per week outside of the
classroom on preparing for and reviewing lecture materials and the projects.
Also, if the only code you write in here this semester is for the projects,
you can reasonably expect a "C" in the course. To learn this material, you really need
to experiment with it. That means writing demonstration code for your individual
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
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 my.umbc.edu
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
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:
- Please do not email program code. If you want me or the TA to help
you debug your code, first submit the code in the usual way, and then
send email about the problem. We will look at the submitted code. Please do NOT
mail code to me or to the TA!
- Note that the Help Center does not offer help with code for this
- I get in the vicinity of 40 or 50
pieces of junk mail daily, and unless you want my mail filters to scrub you
immediately, use your real name in email messages to the course staff. Mail from
"hormonal and ready for action" aren't DOA - they just never arrive!
Also, use your GL account for mail. And if you must send mail from hotmail,
please include your umbc return address.
- Include a meaningful subject line, something like "CMSC 341 Project
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
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.
|Mon Jan 27
Project 1 Assigned
|Tues Jan 28
Introduction and C++
|Thurs Jan 30
||C++ and OOP
||Tues Feb 4
||Thurs Feb 6
||List ADT and Implementations
|Sun Feb 9
||Project 1 Due at 11:59pm
|Mon Feb 10
||Project 2 Assigned
||Tues Feb 11
||Thurs Feb 13
||Stacks, Queues and Deques
||Tues Feb 18
||Stacks, Queues and Deques|
||Thurs Feb 20
||Binary Search Trees|
||Tues Feb 25
||Stack, Queue,Deque (just ADT)
|Wed Feb 26
||Project 2 due at 11:59pm
||Thurs Feb 27
||Tues Mar 4
||Classes 1 - 10
|Wed Mar 5
||Project 3 Assigned
|Thurs Mar 6
||Balanced Search Trees
||Tues Mar 11
||Balanced Search Trees
||Thurs Mar 13
||Balanced Search Trees
|Sun Mar 16
||Project 3 due at 11:59
||Tues Mar 18
|Thurs Mar 20
|Tues Mar 25
|Thurs Mar 27
||Tues Apr 1
||Priority Queues and Heaps
||Thurs Apr 3
||Priority Queues and Heaps
|Tues Apr 8
||Classes 10 - 18
|Wed Apr 9
Project 4 Assigned
||Thurs Apr 10
||MAW 10 + Notes
||Tues Apr 15
||MAW 10 + notes
||Thurs Apr 17
||Tues Apr 22
|Tues Apr 22
Project 4 Due 11:59pm
|Wed Apr 23
Project 5 Assigned
||Thurs Apr 24
||Tues Apr 29
||Thurs May 1
||Tues May 6
||B - Trees
||MAW 4 + notes
|Tues May 6
|Project 5 Due 11:59pm
||Thurs May 8
||B - Trees
||MAW 4 + notes
||Tues May 13
|Thu May 15 - 6:00 - 8:00pm; |
Tues May 20 - 6:00 - 8:00pm;
||Classes 20 - 29
NOTE:Section 0301 (5:30 - 6:45) students must take their
final exam on Thursday, May 15; Section 0201 (7:00 - 8:15) students must take
the final exam on Tuesday, May 20
- Dates and topics are subject to change as required by class progress
- MAW = Weiss text "Data Structures & Algorithm Analysis
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
Please check the web page frequently. Any changes to the page will be
mentioned in the "What's New" link.
Last modified on Monday January 20, 2003 by Mitch Edelman
to Spring 2003 CMSC-341 Homepage