King Fahd University of Petroleum & Minerals

College of Computing and Mathematics

Information and Computer Science Department

ICS 202: Data Structures and Algorithms (3-3-4)

Syllabus – Second Semester 2023-2024 (232)
Website: Blackboard.
Class Time, Venue and Instructor Information:
Lecturer

Sec. Time Venue Instructor Office Hours

UTR Wasfi G. Al-Khatib
01 22-119
08:00 - 08:50am Office: 22-328 / MS Teams UT: 10:00 – 11:30am;
02
UTR
24-165
Phone: 013-860-1715 Also by appointment
09:00 - 09:50am E-mail: [email protected]
Rashad Othman UT: 12:00 – 12:50pm;
UTR Office: 22-106
03 24-236A Also by appointment
11:00 - 11:50am Phone: 013-860-8839
E-mail: [email protected]
Yahya Garout
UTR: 1:00 – 2:00pm;
UTR Office: 22-108
F06
11:00 - 11:50am
22-125
Phone: 013-860-4296 Also by appointment
E-mail: [email protected]

U Mohammed Ayub
51 22-335
02:00-04:40pm Office: 22-115 R: 12:30 – 01:50 pm;
R Phone: MS Teams (By appointment) Also, by appointment
54 22-335
02:00-04:40pm E-mail: [email protected]
U M Faisal Nurnoby
52 22-339
02:00-04:40pm Office: 22-115 T: 8:00am - 10:00am
T Phone: MS Teams (By appointment) Also, by appointment
53 22-335
02:00-04:40pm E-mail: [email protected]
Sulafah Noruldeen
T Office:22-219 Sunday 1-1:50 PM;
F57 7-137
02:00-04:40pm Phone: 0502717971 Also, by appointment
E-mail: [email protected]

Text Books:
Adam Drozdek, “Data Structures and Algorithms in Java”, Thomson Learning, 4th edition, 2013, ISBN 978-981-
4239-23-3.

Catalog Course Description:

Review of object-oriented concepts; Basic algorithms analysis; Fundamental data structures - implementation
strategies for stacks, queues and linked lists; Recursion; Implementation strategies for tree and graph algorithms;
Greedy Algorithms; Hash tables; Applications of data structures (e.g. data compression and string matching).
Prerequisite: ICS 108

Course Objectives:
The objectives of this course are to:
1. Introduce students to fundamental data structures; their algorithms, implementations and applications.
2. 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.

Course Learning Outcomes:

After completion of this course, the student shall be able to:
1. Apply object oriented concepts (inheritance, polymorphism, etc.) in software design. [SO 2]
2. Implement various data structures and their algorithms, and apply them in implementing simple
applications. [SO 2]
3. Analyze simple algorithms and determine their efficiency using big-O notation. [SO 1]
4. Analyze the efficiency of the fundamental data structures in terms of both time and space. [SO 1]
5. Decide which data structures are suitable for which applications. [SO 2]
6. Apply the knowledge of data structures to other application domains such as data compression and hashing.
[SO 2]
Assessment Plan:
Assessment Tool (Lecture) Weight
Homework Assignments 10%
Quizzes 10%
Quiz 1: in class.
Quiz 2: in class.
Quiz 3: in class.
Quiz 4: in class.
Quiz 5: in class.
Midterm Exam: TBA 25%
Final Exam: TBA 30%

Assessment Tool (Lab) Weight

Two (2) Lab Quizzes (Before and After Midterm) 2 * 6% = 12%
One (1) Lab Project 8%
Lab Assignments 5%

Main Topics and Their Coverage (Tentative)

1. Review of Object Oriented Principles (1 Lecture and 1 (review) lab, SDF/Algorithms and Design)
2. Introduction to Algorithm Analysis (4 Lectures, AL/Basic Analysis)
3. Linked Lists (4 Lectures and 1 Lab, SDF/Fundamental Data Structures)
4. Stacks & Queues (3 Lectures and 1 Lab, SDF/Fundamental Data Structures)
5. Recursion (4 Lectures and 1 Lab, SDF/Algorithms and Design)
6. Trees, Binary Trees, Binary Search Trees & Tree Traversal Algorithms (4 Lectures and 1 Lab, AL/Fundamental
Data Structures and Algorithms)
7. Binary Heaps (2 Lectures and 1 Lab, AL/Fundamental Data Structures and Algorithms)
8. AVL Trees & B/B+-Trees (6 Lectures and 1 Lab, AL/Advanced Data Structures, Algorithms, and Analysis)
9. Graphs, Graph Traversal Algorithms (7 Lectures and 1 Lab, AL/Fundamental Data Structures and Algorithms)
10. Hashing and String Matching (6 Lectures and 2 Labs).
11. Data Compression (3 lectures).

Notes:
• All course material will be made available on Blackboard.
• Attendance will be checked for each class.
• An unexcused absence can become an excused absence ONLY by an official letter from the Students
Affairs office.
• Students are expected to be courteous toward the instructor and their classmates throughout this course.
• All mobile phones must be turned off during class and exams.
• Soft copies of homework assignments (according to the instructions given with each assignment) are to
be submitted, through Gradescope, 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, midterm and/or final exams.
• Check the Blackboard course page regularly for announcements and updates.
Course Weekly Schedule1
Week # Date Lecture Topic Lab Topic Notes

14-Jan Introduction
W #1 16-Jan Review of OOP No Lab
18-Jan Complexity Analysis
21-Jan Complexity Analysis
W #2 23-Jan Complexity Analysis Review of Object-Oriented Concepts HW #1 is posted
25-Jan Linked Lists
28-Jan Linked Lists
W #3 30-Jan Linked Lists Singly Linked Lists
1-Feb Linked Lists
4-Feb Stacks HW #1 is due
W #4 6-Feb Stacks Doubly Linked Lists HW #2 is posted
8-Feb Queues
11-Feb Recursion
W #5 13-Feb Recursion Stacks and Queues
15-Feb Recursion
18-Feb Recursion Analysis
Lab Quiz 01
W #6 20-Feb Binary Trees
22-Feb Founding Day Vacation
25-Feb Binary Trees HW #2 is due
W #7 27-Feb Binary Search Trees Recursion HW #3 is posted
29-Feb Binary Search Trees

3-Mar AVL Trees

Binary and Binary Search Trees
W#8 5-Mar AVL Trees Lab Project Assigned
7-Mar Binary Heaps
10-Mar Binary Heaps
W #9 12-Mar B Trees AVL Trees
14-Mar B Trees
17-Mar B+ Trees HW #3 is due
W #10 19-Mar B+ Trees Binary Heaps HW #4 is posted
21-Mar Hashing
24-Mar Hashing
W #11 26-Mar Hashing Lab Quiz 02
28-Mar String Matching
31-Mar - 18-Apr Ramadan And Eid Al-Fitr Break
21-Apr String Matching

W #12 23-Apr String Matching Hashing

25-Apr Graph Representations and Traversals

28-Apr Graph Representations and Traversals

W #13 30-Apr Graph Representations and Traversals String Matching HW #4 is due

2-May Graph Representations and Traversals

5-May Graph and Greedy Algorithms

W #14 7-May Graph and Greedy Algorithms Graphs and Graph Algorithms
9-May Graph and Greedy Algorithms
12-May Data Compression No Lab
W #15 14-May Data Compression Lab Project Demos Due
16-May Data Compression
19-May Review

1
Lab tasks may not be accurate due to the breaks. Please consult your lab instructors for exact dates