CMSC 230
Computer Science 2: Data Structures & Algorithms
Spring 2003
Instructor:Mrs. Patricia VanHise
Office: HH251Phone: 771-2726
Hours: Mon 11a - 12noon & Wed 11a - 12noon & by appointment
Text: Data Structures & Algorithms in Java 2nd Edition
(Lafore, Robert)
Publisher: Sams, 2003
ISBN: 0-672-32453-9
Reference: Problem Solving with Java 2nd Edition (chapters 8 - 10)
(Koffman; Wolz) Addison Wesley; ISBN0-201-72214-3
DATE(week of:)TOPICREADING
01/20Overview; I/O; Arrays Ch. 1 & 2
01/27Files; O(n2) SortsCh. 3
02/03Stacks & Expressions Ch. 4 p115-105 & p149-172
02/10Queues & Priority QueuesCh. 4 p132-p148
02/17Linked Lists Ch. 5 p145-202
02/24Abstract Data TypesCh. 5 p202-231
03/03Review & Midterm Examination
03/10Spring Break
03/17RecursionCh. 6
03/24Advanced SortsCh. 7 p315-355
03/31GraphsCh.13 p615-622
04/07Binary TreesCh. 8 p.365-388
04/14Binary TreesCh. 8 p389-414
04/21Hash TablesCh. 11
04/28HeapsCh. 12
The above schedule is tentative and may be revised as needed. Each reading assignment should be done BEFORE the class discussion. DO THE QUESTIONS AT THE END OF EACH CHAPTER. Check your answers and bring up any problems at the beginning of the next class.
Please contact me at if you must miss a class. Attendance is imperative and make-up work will not be provided except for verifiable medical or other emergency.
See for course information.
GRADING
Programs: 5 @ 20 pts each - due 2 weeks after assignment (if late deduct 1 pt per day)
Midterm Exam: 90 pts
Final Exam (cumulative): 95pts.
Class Participation: 15 pts (including short, exploratory labs)
SCALE
A 100-92%A- 91-90%
B+ 89-88%B 87-82%B- 81-80%
C+ 79-78%C 77-72%C- 71-70%
D+ 69-65%D 64-60%D-59-51%
F 50-0%
NOTES
Programming assignments should be done with a partner. You may choose your own partner or I will assign one. Do program #1 together. After that you may decide to stay with your partner, find another partner, or work alone. That decision must be submitted to me by e-mail and may not be changed for the remainder of the semester.
Programs will be graded on:
Problem Analysis: must show representative test data, processes and expected output.
Design: must be object oriented, identifying new classes which need to be written and
previously written classes which are appropriate to use and why.
Code: good style and well commented.
Correct and Complete Output
Written Summary: observations, conclusions, related questions raised by project.
Problem Analysis and Design must be submitted on paper no later than due date. However, early submission may afford you the opportunity for corrections and better final program grades.
One lab report per pair of partners will be accepted. Please use a cover page with both names, class day and time, and program number and name. Source code must also be submitted electronically and must run on UNIX. Explanation of how that can be done will be made in class. Tasks should be divided but both must write code. Also, both partners must be prepared to explain any part of the program. Critique each other. Work as a team. The same grade will be given to both partners and that may depend on an oral defense of the program by either upon request by the professor.