Announcements

• 12/30/05 grades were submitted. if you wish, send me an email and I'll reply with your grade and scores on final and Project 5
• 12/10/05 Final Exam location for both sections is FA018 If you go to MP012, you will be in the wrong room.
• 11/22/05 I will hold a final exam review session on Monday, 12/12 (starting at 8:30 PM) and Tuesday 12/13, from 7:00 - 9:00 PM. All 341 students are welcome to attend
• 11/18/05 The third midterm (aka Final Exam) will be held on Monday, 12/19.
  Times: the 5:30 section will have its exam from 6:00 - 8:00 PM
  the 7:10 section will have its exam from 8:30 - 10:30 PM
• 11/1/05 BS/MS Program Presentation
  On Monday, 11/7, the 7:10 section will have a visitor: Dr. Mark Olano
  On Wednesday, 11/9, the 5:30 section will have a visitor, Dr. Brooke Stephens
  They will be presenting information on the combined BS/MS program
• 9/7/05 Extra Power Point slides for Templates
  the example for "method 2" (using an instantiation file) to deal with "compiling" templates can be found here. You should try to break the code in different ways and see what errors (compiler or linker) you come up with.

Course Description

Course Content

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 time and space demands of algorithms, how to choose data structures appropriate to problems you will solve, and to design programs that use them effectively.

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

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.
A note on coding You will find that your knowledge of the materials we cover in lecture will be enhanced by coding the data structures and experimenting with them. If the only coding you do is the projects, you may reasonably expect to earn a "C" for the semester. In other words, you should engage this material in as many different ways as you can.

BlackBoard Discussion Board

Contacting Me or the TAs

• Do not email program code. If you want me or the TA to help you debug your code, submit it 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's!
• Note that the Help Center does not offer help with code for this course.
• I receive in the order of 200 pieces of junk mail and spam a day. Please use your real name, send mail from your UMBC email account, and add "CS341" to the subject line - or else your mail may wind up being filtered out.
• Include a meaningful subject line, something like "CMSC 341 Project 2 question."

Academic Integrity

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.

Class Schedule

• 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/fall05/index.shtml