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.
Data Structures and Algorithm Analysis in C++, 2nd Edition
by Mark Allen Weiss
Addison-Wesley, ISBN 0-201-36122-1
Your favorite C++ reference book:
My personal favorite
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, 1997, ISBN 0-201-92488-9
More Effective C++
by Scott Meyers
Addison-Wesley, 1995, ISBN 0-201-63371-X
Thinking in C++
by Bruce Eckel
Prentice Hall, 2000, ISBN 0-139-79809-9
This book is available in its entirety on the web at:
Additional Books on Data Structures:
Data Structures and Algorithm Analysis
by Clifford Shaffer
Prentice-Hall, 1996, ISBN 0-130-28446-7
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, ISBN 0-071-09219-6
Covers some material not covered by the Heileman text.
Data Structures and Algorithms
by Alfred Aho, John Hopcroft, and Jeffrey Ullman
Addison-Wesley, 1983, ISBN 0-201-00023-7
This is one of the all-time classics, written in Pascal.
Fundamentals of Data Structures in C++
by Ellis Horowitz, Sartaj Sahni, and Dinesh Mehta
W H Freeman & Co, 1995, ISBN 0-716-78292-8
Another classic. In C++. This is one of the all-time classics, written in Pascal.
Abstract Data Types
by Nell Dale and Henry Walker
Houghton Mifflin Company College Division, 1996, ISBN 0-669-40000-9
A high-level view of data structures and algorithms, with no programming language specified. A very worthwhile and modern text with an alternative viewpoint.
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) with appropriate documentation.
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 (again, with documentation).
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.
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 my.umbc.edu and clicking on the BlackBoard tab at the top of the page.
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:
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.
||Wed Jan 28
|Mon Feb 2
Project 1 Assigned
||Mon Feb 2||C++ and OOP
|3||Wed Feb 4||Asymptotic Analysis||MAW 2|
|4||Mon Feb 9||Asymptotic Analysis||MAW 3|
|5||Wed Feb 11||List ADT and Implementations||MAW 3|
|Sun Feb 15|
|Mon Feb 16|
|6||Mon Feb 16||List Implementations||MAW 3|
|7||Wed Feb 18||Stacks, Queue, Dequeue ADT||MAW 3|
|8||Mon Feb 23||Stacks, Queue, Dequeue ADT||MAW 3|
||Wed Feb 25||Classes 1 - 8|
|Sun Feb 29|
|10||Mon Mar 1||Recursion||class notes|
|11||Wed Mar 3||Binary search trees||MAW 4|
|Mon Mar 8|
|12||Mon Mar 8||Binary Search Trees||MAW 4|
|13||Wed Mar 10||Balanced Search Trees||MAW 4|
|14||Mon Mar 15||Balanced Search Trees||MAW 4|
||Wed Mar 17||Balanced Search Trees||MAW 4|
|Sun Mar 21|
|Mon Mar 22|
|Wed Mar 24|
|16||Mon Mar 29||Balanced Search Trees||MAW 4 & 12|
|17||Wed Mar 31||Balanced Search Trees||MAW 4 & 12|
||Mon Apr 5||
||Classes 10 - 17
|Wed Apr 7
|19||Wed Apr 7||Hashing
|20||Mon Apr 12||Hashing
|21||Wed Apr 14||Hashing||MAW 5|
|22||Mon Apr 19||Priority Queues and Heaps||MAW 6|
|Tues Apr 20||
|Wed Apr 21||
|23||Wed Apr 21||Priority Queues and Heaps
|24||Mon Apr 26||Skip Lists||MAW 10 + notes|
|25||Wed Apr 28||Skip Lists||MAW 10 + notes|
|26||Mon May 3||Disjoint Sets||MAW 8|
|27||Wed May 5||B - Trees||MAW 4 + notes|
|Sun May 9
|28||Mon May 10
||B - Trees||MAW 4 + notes|
|Mon May 17|
6:00 - 8:00pm
||Classes 19 - 28
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 Coursewide CMSC 341 web page URL is:
I have also put together a webpage specific to the 0201 section, it is at:
Please check both web pages frequently. Any changes to the coursewide page will be mentioned in the "Latest News" link.