Department of Information and Computer Science



Download 60 Kb.
Page1/2
Date18.11.2023
Size60 Kb.
#62625
  1   2
041ICS353syllabus

King Fahd University of Petroleum and Minerals

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.


Prerequisite: ICS 202: Data Structures




Prerequisites by Topic:


  1. Data structures including linked lists, arrays, stacks, queues, trees, and graphs, and

  2. Knowledge of a high level structured language.

Course Goals:
To provide the students with the following:

  1. The fundamentals of algorithms and algorithmic techniques,

  2. The ability to decide on the suitability of a specific technique for a given problem,

  3. The ability to analyze the complexity of a given algorithm,

  4. The ability to design efficient algorithms for new situations, using as building blocks the techniques learned, and

  5. 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):

  1. Basic Concepts in Algorithmic Analysis, Chapter1

  2. Recurrence Relations, Master Theorem and Mathematical Preliminaries, Chapter 2 +

  3. Review of Data Structures, Chapter 3

  4. Advanced Data Structures, Chapter 4

  5. Induction, Chapter 5

  6. Divide and Conquer, Chapter 6

  7. Dynamic Programming, Chapter 7

  8. Greedy Algorithms, Chapter 8

  9. Graph Traversal, Chapter 9

  10. NP- Complete Problems, Chapter 10

Grading Policy:

Homeworks

10%

Quizzes

15%

Pop Quizzes

10%

Two Major Exams

30%

Final Exam

35%

Absences

-3.5%


Download 60 Kb.

Share with your friends:
  1   2




The database is protected by copyright ©ininet.org 2024
send message

    Main page