Course Description

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

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

Grading

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

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 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 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

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

• Dates and topics are subject to change as required by class progress
• MAW = Weiss text "Data Structures & Algorithm Analysis in C++"

Course Web Page

www.cs.umbc.edu/courses/undergraduate/341/fall03/index.shtml