King Fahd University of Petroleum & Minerals
College of Computer Science & Engineering
Information & Computer Science Department
ICS202
Data Structures
2
About



It is a 4 credits course
15 weeks of classes
Every week :




3 lectures of 50 minutes each
1 lab of 3 hours
Work at home
Syllabus
3
Course Details

Section 02 :



Instructor : Dr. Wasfi Al-Khatib




Time : SMW 11:00 - 11:50
Room 24-116
Office : 22-313
Phone : 1715
Email : wasfi@kfupm.edu.sa
Office Hours :



SMW 11:00 – 11:50am
SMW 2:10 – 3:00pm
Or by appointment
4
Course Details

Section 05 :



Instructor : Dr. Sami Zhioua




Time : SMW 9:00 - 9:50am
Room 24-106
Office : 22-137-2
Phone : 1251
Email : zhioua@kfupm.edu.sa
Office Hours :



SM 10:00am – 12:00pm
W 10:00 – 11:00am
Or by appointment
5
Textbooks
1.
2.
“Data Structures and Algorithms in Java”, 2nd
Edition, Adam Drozdek, Thomson Learning, ISBN
0-534-49252-5.
“Data Structures and Algorithms with Object
Oriented Design Patterns in Java”, Bruno R. Preiss,
John Wiley & Sons, Inc., 2000.
6
Course Objectives


Introduce students to fundamental data structures;
their algorithms, implementations and applications.
Teach students how to analyze the efficiency of the
fundamental data structures in terms of both time
and space so that they are able to decide what data
structure is suitable for a given problem.
7
Course Learning Outcomes

After completion of this course, the student shall be
able to:




apply object oriented concepts (inheritance, polymorphism,
design patterns, etc.) in software design.
implement various data structures and their algorithms, and
apply them in implementing simple applications.
analyze simple algorithms and determine their efficiency
using big-O notation.
apply the knowledge of data structures to other application
domains like Graphs, Trees and Hashing.
8
Topics (Tentative)
Topics of Coverage
Number of Number of
Lectures Laboratories
Review & Introduction to
Design Patterns
3
3
Introduction to Algorithm
Analysis
3
0
Review of Linked Lists
3
1
Review of Stacks & Queues
2
1
Recursion and Recursive
Algorithms
5
1
Tree Structures and their
Applications
14
3
Graphs and Graph Algorithms
9
2
Hashing Techniques
3
1
LZ-based Compression
Techniques
3
0
Lecture Slides &
Text Book References
Lectures 1-3, Preiss Chapter
5
Lectures 4-6, Preiss Chapter
3, Drozdek Chapter 2
Lectures 7-9, Preiss Chapter
4, Drozdek Chapter 3
Lectures 10-11, Preiss
Chapter 6, Drozdek Chapter 4
Lectures 12-16, Slides,
Drozdek Chapter 5
Lectures 17-30, Preiss
Chapter 9, Drozdek Chapter 6
and 7, Heap Sort (Drozdek pg
484)
Lectures 31-39, Preiss
Chapter 16, Drozdek Chapter
8
Lectures 40-42, Preiss
Chapter 8
Lectures 43-45, Slides.
9
Grade Distribution
Assessment Tool
Laboratory Assignments
Weight
20% (see Lab Guidelines)
4 Homework Assignments (2.5% * 4)
10%
Active Participation
05%
5 Quizzes, 2% each
10%
EXAM 1: Thursday 20 October 2011, 10-12:00pm
15%
EXAM 2: Thursday 1 December 2011, 10-12:00pm
15%
Final Exam: Tuesday 10 January 2012, 7:30am
25%
Notes





All course material will be made available at URL:
http://www.ccse.kfupm.edu.sa/~ics202.
Attendance will be checked each class.
An unexcused absence can become an excused
absence ONLY by an official letter from the Dean of
Student’s office.
Students are expected to be courteous toward the
instructor, the lab instructor and their classmates
throughout the duration of this course.
All cell phones and pagers must be turned off during
class and exams.
10
11
Notes



Soft copies of homework assignments (according to the
instructions given with each assignment) are to be submitted,
through Blackboard Assignment Submissions, by the due date
and time indicated. No late homework will be accepted.
Discussing questions among your classmates and on
Blackboard is highly encouraged. Copying homework solutions
from each other is NOT permitted and will be considered
CHEATING.
Material covered in homework assignments, which maybe
outside the material presented in class, are required to be
mastered by the students and can be tested on in quizzes,
major exams and/or final exams.
Active Participation will be assessed in the form of 0.5% for
each correct and/or fruitful participation in class discussions
and/or on Blackboard discussions list. These participations will
be clearly announced during class and on Blackboard.
12
Notes (Cont.)



24-Hour Policy: One has 24 hours to object to the
grade of a homework, quiz or a major from the end
of the class time in which the graded
exam/homework papers have been distributed. If for
some reason you cannot contact the instructor
within this period, send him an email requesting an
appointment. The email should be sent within the
24-hour time period.
Exams, homework assignments and quizzes are
generally CHALLENGING.
Check the Blackboard course page and the ICS 202
Webpage regularly for announcements and updates.