COMPUTER SCIENCE 2320

COURSE SYLLABUS

Spring 2000

Dr. Maury Eggen

COURSE: Principles of Data Abstraction

INSTRUCTOR: Dr. Maurice L. Eggen

OFFICE: Halsell 201L

OFFICE HOURS:
MWF 8:00-9:30
MWF 1:30-2:20
TR 8:00-11:00
Others by appointment

MEETING HOURS AND ROOM:
1323: 10:30-11:20 MWF, Halsell 329,
2321: 9:30-10:20 MWF, Halsell 228,
2320: 12:45-2:00 TR, Halsell 329,

TEXT MATERIALS: Data Structures and Problem Solving using C++ by Mark Allen Weiss, Addision Wesley Publishers, Second Edition, 2000

COURSE: This course includes a study of abstract data types and their implementation in an object oriented environment. It will include axiomatic systems describing the classical computer science data structures: stacks, queues, lists, trees, graphs and the like. Analysis of the computational complexity of alternative implementation strategies in the context of typical algorithmic applications.

PREREQUISITE:CSCI 1321 or equivalent.

COURSE GOALS AND OBJECTIVES: The objectives of this course include, but are not limited to, the following:

1. Object oriented programming
2. Data abstraction
3. Modeling
4. Classical Data Structures
5. Implementation
6. Application

LABORATORY PROBLEMS: Computer implmentation and abstraction of fundamental data structures is critical to their understanding. As such several homework laboratory exercises will be required in this class. This class is programming intensive! If you are unwilling to spend time in the computer laboratory then this is not the right class for you. Classical unix methods for program organization are required, including make and makefiles, as well as other unix methods. Details for laboratory submission will be given in class. Please see the notes below concerning late work.

GRADES: The grades in this class will be determined by the results of three major examinations, given at approximately equal intervals in the semester, by the results of weekly quizzes, and by the results of homework assignments. Each of the three examinations will be approximately equally weighted, including the final, which will be given during the final examination week, and will serve as the third examination. Each examination is comprehensive, but will emphasize the most recent material. Each of the weekly quizzes will be worth a variable number of points depending on length and difficulty. Homework laboratory assignments will be worth a variable number of points depending on difficulty. Grades will be assigned according to the following scale:

90-100 A
80-89 B
70-79 C
60-69 D
with plus and minus grades assigned in marginal cases. I advise you to keep track of your scores so you know where you stand in the class at any time. I also encourage you to discuss your progress in class at any time with your friendly instructor.

EXAMINATION DATES:
Examination 1: February 17, 2000
Examination 2: March 23, 2000
Examination 3: April 27, 2000

NOTES:

1. Regular class attendance is required. Each unexcused absence deducts one percentage point from your final average. Excessive absences will be reported to appropriate university officials and may cause you to be (involuntarily) withdrawn from the class. Homework assignments are expected complete and on time. If you keep up you will have a better chance to be successful in this class, but if you fall behind you will have difficulty catching up. Make sure to contact your instructor if you are having difficulty.

2. Homework assignments that are identical beyond coincidence are in violation of the Academic Integrity policy of the university and will result in disciplinary action, including, but not limited to a failing grade on that assignment for all parties involved. You are responsible for the security of your work, both electronic and hard copy.

3. Discussion of the homework assignments between students is encouraged, but when it comes time for the final submission, make sure it is your own work. You are cheating yourself if you get the homework from some source other than creating your own.

4. Expect a quiz once per week. Quizzes will usually be given on Thursday and will cover the previous week's work. Quizzes will be taken when scheduled and will not be made up. Examinations will be taken when scheduled and will not be made up.

5. Homework will be due at the beginning of the class period on the day assigned. LATE WORK WILL NOT BE ACCEPTED. Make sure you resolve problems with printing, workstations, communication, etc. IN ADVANCE so your work may be submitted in a timely manner. Homework will NOT BE ACCEPTED FOR CREDIT if summitted late. Those of you who submit work late penalize the conscientious students who turn in their work on time.

6. The only exceptions to these policies are for University sanctioned activities or illness and require a note from your supervising professor (coach) or doctor. If you have unusual circumstances (as we all sometimes do) please discuss these with your instructor in advance.

ADDITIONAL REFERENCES:

Ford and Topp, Data Structures with C++, Prentice Hall, 1996.

Shiflet, Data Structures in C++, West Publishers, 1996.

Pothering and Naps, Introduction to Data Structures and Algorithm Analysis with C++, West Publishers, 1995

Sedgewick, Algorithms in C++, Addison Wesley Publishers, 1998.

Drozdek, Data Structures and Algorithms in C++, PWS Publishers, 1996.

Return to Dr. Eggen's Home Page