Department of Computer Science College of Engineering University of the Philippines Diliman, Quezon City
COURSE NO. COURSE TITLE COURSE CREDIT SEMESTER INSTRUCTOR EMAIL ADDRESS
: : : : : :
CS 32 Data Structures 3 units First Semester, AY 2009-2010 Nestine Hope S. Hernandez
[email protected] COURSE DESCRIPTION
Concepts, algorithms and applications of complex data structures: tables, trees, graphs, heaps, generalized lists, multi-linked structures. Basic algorithmic techniques and analysis: sorting algorithms, hash tables, binary search trees, and balanced trees. CLASS SCHEDULE (WFR) Wednesdays and Fridays, 8:30 -10:00 AM, Classroom 2 COURSE OUTLINE 1 2 3 4 5
Introduction Mathematical Foundations Algorithms Stacks Queues and Deques LONG EXAM 1
6 7 8
Binary Trees Trees and Forests Graphs LONG EXAM 2
9 10 11
Linear Lists Generalized Lists Binary Search Trees LONG EXAM 3
12 13
Sequential Tables Hash Tables LONG EXAM 4
1
GRADING SYSTEM Requirements: 4 Long exams 3 Machine Problems
50% 50% GENERAL AVERAGE 93 - 100 88 - below 93 85 - below 88 82 - below 85 78 - below 82 74 - below 78 70 - below 74 65 - below 70 60 - below 65 below 60
FINAL GRADE 1.00 1.25 1.50 1.75 2.00 2.25 2.50 2.75 3.00 5.00
CLASS POLICIES EXAMS. Submit bluebooks before the date of examination. No make-up exam will be given unless with a valid excuse. Two missed exams would have one exam be graded zero, plus he/she will be obliged to take the final exam regardless if his/her grade is above the exemption cutoff. Three missed exams would have two exams be graded zero, plus he/she will be obliged to take the final exam regardless if his/her grade is above the exemption cutoff. Four missed exams would automatically incur a grade of 5.00. Complaints regarding examination results will be entertained only within a period of one week after the release of the examination papers. Use black or blue pen when taking examinations. Otherwise, no complaints regarding the examination results will be accepted. MACHINE PROBLEMS. Machine problems are to be done individually. Complaints will be entertained only within a week after the release of results. Late submissions would incur a 10% deduction per day late including holidays, weekends, and non-working days. Early submissions however are given 2.5% bonus points per day including holidays, weekends, and non-working days. ATTENDANCE. Students who exceed the maximum allowed absences (6) are advised to drop assuming that the deadline for dropping has not yet lapsed. Otherwise, he/she will be given a grade of 5.0. FINAL EXAM. In the event that the student’s pre-final grade falls below 70%, the student will be obliged to take the final exam. The final grade would then be computed as follows: Final Grade = (0.8 * Pre-final Grade) + (0.2 * Final Exam Score) Exempted students may opt to take the final examination with the chance of either pulling his/her grades up or down.
2
CHEATING. Cheating in any form will be subjected to proper disciplinary action and will merit a final grade of 5.0. DURING CLASS HOURS. No smoking. No eating/drinking. No sleeping. Turn off your cellular phones or put them in silent mode.
REFERENCES E. Quiwa. Data Structures. Alexan Publishing Company, 2007. A. Aho, J. Hopcraft, J. Ullman. Data Structures and Algorithms, Addison-Wesley, 1983. T . Cormen, C. Leiserson, R. Rivest, C. Stein. Introduction to Algorithms 2nd edition , MIT Press and McGraw-Hill, 2001.
3
