CMSC 341 Data Structures
Spring 2002
Section 0101
Mr. Dennis Frey
Tues/Thus 11:30-12:45
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.
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
- 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. 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.
Grading
Your grade for this course will be based upon 5 projects, 2 in-class exams
and the final exam. The projects are worth 50% of your grade, each project
weighted equally. Each in-class exam is worth 15 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 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.
Help Sessions
Help sessions are held throughout the semester at 8:30 PM every Thursday
and 11:00 AM every Friday in room ACIV 014. Help session topics include
Unix, makefiles, compiling with g++, good coding practices and C++ topics
such as working with templates, exceptions and class design. Projects
and exam review questions will also be discussed. Students are
encouraged to suggest help session topics.
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 "Crazy Ape" 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 "Crazy Ape?" Your mail will look much more professional if
you use your real name. Start using it now and give up the kid stuff.
- 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. 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.
Syllabus
Class |
Date
|
Topic
|
Reading
|
|
Mon 28 Jan
|
Project 1 Assigned
|
|
1
|
Tues 29 Jan
|
Introduction and C++
|
MAW 1
|
2
|
Thur 31 Jan |
C++ and OOP
|
MAW 1
|
3 |
Tues 05 Feb |
Asymptotic Analysis |
MAW 2 |
4 |
Thurs 07 Feb |
List ADT and Implementations |
MAW 3 |
5 |
Tues 12 Feb |
List Implementations |
MAW 3 |
|
Wed 13 Feb |
Project 1 Due
Project 2 Assigned
|
|
6 |
Thurs 14 Feb |
Stacks, Queues and Deques |
MAW 3 |
7 |
Tues 19 Feb
|
Stacks, Queues and Deques |
MAW 3 |
8 |
Thurs 21 Feb |
Binary Search Trees |
MAW 4 |
9 |
Tues 26 Feb |
Binary Search Trees
Project 2 Due at 11:59PM
| MAW 4 |
10 |
Thurs 28 Feb |
Balanced Search Trees
|
MAW 4 |
11 |
Tues 05 Mar |
Exam 1
|
Classes 1 thru 9
|
12 |
Wed 06 Mar
|
Project 3 Assigned
|
|
|
Thurs 07 Mar |
Balanced Search Trees
|
MAW 4
|
13 |
Tues 12 Mar |
Balances Search Trees |
MAW 4 |
14 |
Thurs 14 Mar |
Balanced Search Trees |
MAW 4 |
15 |
Tues 19 Mar |
Hashing
Project 3 Due at 11:59pm
| MAW 5 |
16
|
Thurs 21 Mar |
Hashing
|
MAW 5
|
|
Tues 26 Mar
|
Spring Break
|
|
|
Thurs 28 Mar
|
Spring Break
|
|
17 |
Tues 02 Apr |
Priority Queues and Heaps |
MAW 6 |
18 |
Thurs 04 Apr |
Priority Queues and Heaps |
MAW 6 |
19
|
Tues 09 Apr |
Exam 2
|
Classes 10 - 18
|
|
Wed 10 Apr
|
Project 4 Assigned
|
|
20 |
Thurs 11 Apr |
Skip Lists |
MAW 10 + Notes |
21 |
Tues 16 Apr |
Skip Lists |
MAW 10 + notes |
22 |
Thurs 18 Apr |
Graphs |
MAW 9 |
23 |
Tues 23 Apr |
Graphs
Project 4 Due 11:59pm
| MAW 9 |
|
Wed 24 Apr |
Project 5 Assigned
|
|
24 |
Thurs 25 Apr |
Graphs
|
MAW 9 |
25 |
Tues 30 Apr |
Disjoint Sets |
MAW 8 |
26 |
Thurs 02 May |
Disjoint Sets |
MAW 8 |
27 |
Tues 07 May |
B - Trees
Project 5 Due 11:59pm
| MAW 4 + notes |
28 |
Thurs 09 May |
B - Trees |
MAW 4 + notes |
29
|
Tues 13 May
|
Advanced Topic
|
|
|
Thurs May 16th 10:30 - 12:30
|
Final Exam
|
|
- 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/spring02/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 Friday, Jan 25, 2002 by Dennis L. Frey
email: frey@cs.umbc.edu
Back up
to Spring 2002 CMSC-341 Homepage