Department of Information and Computer Science
ICS 353-02: Design and Analysis of Algorithms – Fall 2004-2005 (041)
Location : (23) 011
Meeting Times : 11:00-12:15pm, UT
========================================================
Instructor: Dr. Wasfi Al-Khatib (office: (22) 133-1, phone: x1715).
e-mail: wasfi@ccse.kfupm.edu.sa
Office hours: UT: 10:00 – 10:50am and 2:00 – 3:00pm M: 9:30 – 11:30am
Textbook: Introduction to Algorithms: Design Techniques and analysis, M. Alsuwaiyel.
Prerequisites by Topic:
Data structures including linked lists, arrays, stacks, queues, trees, and graphs, and
Knowledge of a high level structured language.
Course Goals:
To provide the students with the following:
The fundamentals of algorithms and algorithmic techniques,
The ability to decide on the suitability of a specific technique for a given problem,
The ability to analyze the complexity of a given algorithm,
The ability to design efficient algorithms for new situations, using as building blocks the techniques learned, and
Introducing the concept of NP-complete problems.
Current Catalog Description:
Introduction to algorithms and review of data structure; Time and space analysis; Algorithm design techniques: divide-and-conquer, greedy algorithms, dynamic programming, search techniques; NP-complete problems and approximation algorithms.
Course Contents (tentative):
Basic Concepts in Algorithmic Analysis, Chapter1
Recurrence Relations, Master Theorem and Mathematical Preliminaries, Chapter 2 +
Review of Data Structures, Chapter 3
Advanced Data Structures, Chapter 4
Induction, Chapter 5
Divide and Conquer, Chapter 6
Dynamic Programming, Chapter 7
Greedy Algorithms, Chapter 8
Graph Traversal, Chapter 9
NP- Complete Problems, Chapter 10
Grading Policy:
-
Homeworks
|
10%
|
Quizzes
|
15%
|
Pop Quizzes
|
10%
|
Two Major Exams
|
30%
|
Final Exam
|
35%
|
Absences
|
-3.5%
|
Share with your friends: |