COLLEGE OF ARTS AND SCIENCES UNIVERSITY OF THE PHILIPPINES MANILA

The Health Sciences Center Rizal Hall, Padre Faura St., Ermita, Manila

Course Code: CMSC 123 Course Name: Data Structures Credit: 3 units (2 units lecture + 1 unit laboratory) Prerequisite: CMSC 21 and CMSC 55 Course Description: Concepts, algorithms and applications of complex data structures: tables, trees,

graphs, heaps, generalized lists, multilinked structures. Basic algorithmic techniques and analysis: sorting algorithms, hash tables, binary search trees and balanced trees.

Course Objectives: At the end of the course, the student should be able to:

1. Discuss the representation and use of primitive data types and built-in data structures 2. Explain and utilize recursion, linked lists, stacks, queues, trees and graphs 3. Compare alternative implementations of data structures with respect to performance 4. Describe the techniques of algorithm analysis 5. Discuss the advantages and disadvantages of many types of algorithms 6. Incorporate algorithm design know-how and data structures to create reliable and structured

programs Topic Outline: 1. Basic Concepts 2. Mathematical Preliminaries 3. Algorithms 4. Stacks 5. Queues and Deques

First Exam 6. Binary Trees 7. Applications of Binary Trees 8. Trees and Forests 9. Graphs 10. Applications of Graphs

Second Exam 11. Linear Lists 12. Generalized Lists 13. Sequential Tables 14. Binary Search Trees 15. Hash Tables

Third Exam Text: Quiwa, Evangel P. Data Structures. Electronics Hobbyists Publishing House, Manila, 2007. (available at the Department of Computer Science, UP Diliman) References: Aho, A.V., Hopcroft J.E., Ullman J.D. Data Structures and Algorithms. Addison-Wesley, 1983. Cormen, T.H., Leiserson C.E., Rivest R.L. and Stein C. Introduction to Algorithms Second Edition. MIT Press, U.S.A. Goodrich, R., Tamassia R. Data Structures and Algorithms in Java Second Edition. John Wiley & Sons, 2001.

COLLEGE OF ARTS AND SCIENCES UNIVERSITY OF THE PHILIPPINES MANILA

The Health Sciences Center Rizal Hall, Padre Faura St., Ermita, Manila

Lafore, Robert. Data Structures & Algorithms in Java. Sams, 1998. Knuth, D.E. The Art of Computer Programming, Vols 1 to 3. Addison-Wesley, Massachusetts, 1973. Weiss, Mark Allen. Data Structures & Problem Solving Using C++. Addison-Wesley. Grading System: 1. For the lecture, three (3) long examinations will be given during the semester. For the laboratory,

series of machine problems (MPs) will be given during the semester. 2. Passing grade is 60% and a student needs to get a minimum of 50% for both lecture and laboratory,

respectively, to pass the course. 3. Your final grade will be computed as follows:

Final Grade = 0.5 lect grade + 0.5 lab grade Lect Grade = average of all the exams Lab Grade = average of all MPs

and will be based on the table below Final Average Final Grade 93 and above 1.00

90 – 92 1.25 87 – 89 1.50 84 – 86 1.75 80 – 83 2.00 75 – 79 2.25 70 – 74 2.50 65 – 69 2.75 60 – 64 3.00 55 – 59 4.00

Below 55 5.00 4. Last day of dropping is February 26, 2010. A student is considered dropped upon submission of

the instructor’s copy of the dropping slip to the i nstructor. A student who unofficially drops the course will get a grade of 5.0.

5. Any complaints on the exam and MP grades should be made within one week from the date they were released. No complaints will be entertained after the specified period.

Instructor: Lecture/Laboratory Richard Bryann Chua (rbchua@upm.edu.ph) Couses@DPSM Enrollment Key: cs123fezg203