1. Course Guide Lines CS210: Data Structures and Algorithms Course Guide Layal Kazma Prince Sultan University, College for Women

2. Outline zCourse Description zCourse Objectives zCourse Resources zCourse Calendar zInstructor Location & Office Hours zCourse Policies zMajor Exams & Final Exam zOverall Assessment zHow to Study for Course

3. Course Description zCS 210 : Data Structures and Algorithms. zCredit Hours: 3. zPrerequisite: CS 102.

4. Abstract Data Types ADT: is the study of classes of objects whose logical behavior is defined by a set of values and a set of operations.

5. Data Structures The term Data Structures refers to the study of data and how to present objects within a program; that is, the implementation of the structured relationships. We are now interested in the study of the abstract properties of classes of data objects in addition to how the objects might be represented in a program.

6. Course Objectives It is well known that data structures have a profound effect on the performance of programs and applications. The main purpose of this course is to introduce the main types of data structures and illustrate their use throughout simple examples and applications. In the process, some guidelines and principles for good programming and application development are given.

7. Course Resources zTextbook: Data Structures Using C++, D.S. Malik, 2 nd Ed, Course Technology. zAdditional References: 1.ADT, Data Structures and Problem Solving with C++, 2 nd Edition. by Larry Nyhoff, Prentice Hall, 2004. 2.C++ Plus Data Structures, by Nell Dale and David Teague, Jones and Bartlett Publishers, 2001. 3.Problem Solving with C++, The Object of Programming, by Walter Savitch, Addison Wesley, 2001. 4.Data Structures and Program Design in C++, by R. Kruse and A. Ryba, Prentice Hall, 1999

8. Course Calendar AssessmentAssessment task (eg. essay, test, group project, examination etc.) Week dueProportion of Final Assessment 1Quiz I & II & IIIWeek 4 & 10&13 20% 2Major ExamWeek 720% 43 Programming ProjectsThrough out semester 15 % 5Class ParticipationThrough out semester 5% 6Final ExamWeek 1740%

9. Instructor Location & Office Hours zMrs. Layal Kazma yOffice: W338 yEmail: lkazma@pscw.psu.edu.salkazma@pscw.psu.edu.sa yCourse Home Page: lkazma.synthasite.comlkazma.synthasite.com zOffice Hours: y yOther hours by appointment

10. Course Policies 1.Students must regularly come to class to participate in class activities and discussions. 2.If a student was absent in any lecture, then she is expected to read the lecture material and is welcomed for any specific question she may has. 3.There will be weekly tutorial problems as well as programming projects. 4.Students are encouraged to solve the tutorial problems before we do them together in class, but are NOT required to submit their solutions.

11. 1.No Make Up Quiz. Course Policies (Quizzes)

12. 1.15% of your grade will be assigned to PROGRAMMING projects. 2.Projects must be done individually( or in pairs as stated in the project’s requirements). 3.We do not expect to see two programming projects that look identical. In this case, BOTH projects will be rejected. 4.Late projects will be grade-penalized or might not be accepted at all if very late (3 days after due date). 5.All source files must be compiled and fully tested by the student before submission. 6.A program must be submitted in both electronic copy and hard copy. 7.Make sure the CD is labeled with your name and the assignment number. Course Policies (Assignments)

13. Major Exam (20%)/ Final Exam (40%) zMajor Exam is worth 20%. zFinal exam is worth 40%. The final exam will be cumulative.

14. How to Study for this Course zLectures: Attend, Listen and Participate. zTutorials: Prepare, Participate. zProjects: Give enough time, Work hard and Submit. zRead the chapter after the lecture. zTry to do most of the Review Questions in each chapter. zThink Critically – ask questions, make notes, and reflect on material.