CMSC 341 Data Structures
Fall 2003
Sections 0201 and 0301
Mr. Mitch Edelman
Section 0301 TuTh 5:30 - 6:45
Section 0201 TuTh 7:00 - 8:15
ITE 229
Course Description
Data structures are the focus of this course. The principle objective is to
help you learn how to design and analyze a wide range of data structures.
This course covers data structures and associated algorithms. We will
examine Relationships among data structures, their utility in various situations,
and factors affecting their performance in algorithms. You will
learn to analyze the demands and performance of algorithms, how to choose
appropriate data structures, and how to integrate data structures and algorithms
into effective C++ code.
Announcements
- October 14 because of the lecture we lost in September
(thanks, Isabel), all class lecture dates are pushed back 1 class.
However, the second exam will still be given on its scheduled day, Nov. 4
Textbooks
Required: Data Structures and Algorithm Analysis in C++, 2nd
Edition, by Mark Alan Weiss, Addison-Wesley
Recommended:
- Your favorite C++ reference book -- here are some of mine
- 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
Lajoie
Addison-Wesley, 1998, ISBN 0-201-82470-1
- C++ FAQs, Second Edition by Marshall Cline, Greg Lomow,
Mike Girou
Addison-Wesley, 1999, ISBN 0-201-30983-1
- Effective C++ Second Edition by Scott Meyers
Addison-Wesley
- More Effective C++ by Scott Meyers
Addison-Wesley
- Thinking in C++ by Bruce Eckel.
This book is available in its entirety on the web at
http://www.mindview.net/Books/TICPP/ThinkingInCPP2e.html
- 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
text.
- 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.
Prerequisites
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. A few advanced
C++ topics such as templates and exceptions will be reviewed, as will recursion.
Grading
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% and the final
is worth 20%. 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. It is not this section's
policy to offer Makeup exams. Ever. Please do not ask.
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.
Projects are due on the date stated on the course syllabus. Please note that
you are responsible for managing your time and commitments in this course, other
courses you're taking, and in your life. In other words, unless an emergency
arises, you are expected to submit all work before its due date. This also includes
anticipating that computer resources get scare right around project due dates.
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:
- Please do not email program code. If you want me or the TA to help
you debug your code 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
course.
- Please use your real name. Email from "Love Monkey" does not get the
attention you may want it to. Besides, when you get that great-paying job
because you know data structures so well, will you want to send mail to
your boss from "Hot and Steamy"? Besides which, my spam filter will
kill any mail from disguised names.
- Include a meaningful subject line, something like "CMSC 341 Project
2 question."
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.
For your information, last semester, 2 course F's were awarded in 341 for
issues of academic dishonesty (along with non-removable records of the reason
on those persons' transcripts. A third person lost a full letter grade.
As much as I hate to get involved in this kind of stuff, I do, and so do the
other professors. 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. You won't
need a calculator for any of the exams. 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.
Syllabus
Class
| Date
| Topic
| Reading
|
1
| Thu 28 Aug
| Introduction and C++
| MAW 1
|
2
| Tue 2 Sep
| C++ and OOP
| MAW 1
|
3
| Thu 4 Sep
| Asymptotic Analysis
| MAW 2
|
| Mon 8 Sep
| Project 1 Assigned
|
|
4
| Tue 9 Sep
| Asymptotic Analysis
| MAW 2
|
5
| Thu 11 Sep
| List ADT and Implementations
| MAW 3
|
6
| Tue 16 Sep
| List Implementations
| MAW 3
|
7
| Thu 18 Sep
| Stacks, Queues and Deques
| MAW 3
|
| Sun 21 Sep
| Project 1 Due 11:59pm
|
|
8
| Tue 23 Sep
| Stacks, Queues and Deques
| MAW 3
|
9
| Thu 25 Sep
| Recursion
| Class notes
|
10
| Tue 30 Sep
| Exam 1
| Classes 1 thru 8
|
| Wed 1 Oct
| Project 2 Assigned
|
|
11
| Thu 2 Oct
| Binary Search Trees
| MAW 4
|
12
| Tue 7 Oct
| Binary Search Trees
| MAW 4
|
13
| Thu 9 Oct
| Balanced Search Trees
| MAW 4
|
| Tues 14 Oct
| Project 2 Due
|
|
14
| Tue 14 Oct
| Balanced Search Trees
| MAW 4
|
| Wed 15 Oct
| Project 3 Assigned
|
|
15
| Thu 16 Oct
| Balanced Search Trees
| MAW 4
|
16
| Tue 21 Oct
| Balanced Search Trees
| MAW 4
|
17
| Thu 23 Oct
| Hashing
| MAW 5
|
| Tues 28 Oct
| Project 3 Due at 11:59pm
|
|
18
| Tue 28 Oct
| Hashing
| MAW 5
|
19
| Thu 30 Oct
| Priority Queues and Heaps
| MAW 6
|
| Wed 5 Nov
| Project 4 Assigned
|
|
20
| Tue 4 Nov
| Exam 2
| Classes 10 - 19
|
21
| Thu 6 Nov
| Priority Queues and Heaps
| MAW 6
|
22
| Tue 11 Nov
| Fibonacci Heaps
| MAW 11.4
|
23
| Thu 13 Nov
| Skip Lists
| MAW 10 + Notes
|
24
| Tue 18 Nov
| Skip Lists
| MAW 10 + notes
|
| Tues 23 Nov
| Project 4 Due 11:59pm
|
|
| Mon 24 Nov
| Project 5 Assigned
|
|
25
| Thu 20 Nov
| Disjoint Sets
| MAW 8
|
26
| Tue 25 Nov
| Disjoint Sets
| MAW 8
|
| Thu 27 Nov
| Thanksgiving Vacation
|
|
27
| Tue 2 Dec
| B - Trees
| MAW 4 + notes
|
| Wed 3 Dec
| Project 5 Due 11:59pm
|
|
28
| Thu 4 Dec
| B - Trees
| MAW 4 + notes
|
29
| tue 9 Dec
| Advanced Topics
|
|
| Thu Dec. 11
|
Final Exam
| Everything since Exam 2
|
- Dates and topics are subject to change as required by class progress
- MAW = Weiss text "Data Structures & Algorithm Analysis
in C++"
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
www.cs.umbc.edu/courses/undergraduate/341/fall03/index.shtml
Please check the web page frequently. Any changes to the page will be
mentioned in the "What's New" link.
Last modified on August 23, 2003 by Mitch Edelman
email: edelman@cs.umbc.edu
Back up
to Fall 2003 CMSC-341 Homepage