ITCS 345: Analysis and Design of Algorithms

1st Semester 2005/2006

Department of Computer Science, University of Bahrain

[Syllbus] [Instructor & TA] [Prerequisites] [Textbook] [Time Table] [Tests] [Grading Policy] [Assignments] [More Info.]


Description:

This course will introduce the students to the fundamentals notions in the area of design and analysis of algorithms. Student will get familiar with a range of algorithms design techniques such as: Brute Force, Divide & Conquer, Decrease & Conquer, Transform and Conquer, Greedy Algorithms, Dynamic Programming, Backtracking and Branch & Bound Technique. This course is a mandentory 300 level course for the student enrolled in the Bachelor of Science track in Computer Science at the University of Bahrain.


Syllbus


Instuctor & Teaching Assistant:

Instructor Teaching Assistant
Name Dr. Ali Khan Abdulla Eid
Office S40-2058 -
Office Hours UTH 10:00 AM - 11:00 AM -
Email


Prerequistes:


Textbook:

References:


Time Table:

Section Time Place
Lecture Section 1 MW 9:30-10:45 S40-2053
Section 2 UTH 13:00-14:00 S40-2049
Tutorial both Sections S 15:00-16:40 S40-1047


Tests Date & Time:

Test Date Time
Test 1 15 November 2005 11:00-12:00
Test 2 11 December 2005 11:00-12:00
Final Exam 25 December 2005 14:30-16:30


Grading Policy:


Assignments:

Assignment Topic Due Date
Assignment 1 Asymptotic Notations 10 October 2005
Assignment 2 For & While loop Analysis,
Empirical Analysis
22 October 2005
Assignment 3 Recurrence Relations 29 October 2005
Assignment 4 Design of Brute Force Algorithms 19 November 2005
Assignment 5 Programming assignment 26 November 2005
Assignment 6 Divide & Conquer 3 December 2005
Assignment 7 Heap Algorithms,Greedy Algorithms, Branch & Bound 13 December 2005

Note: Late Assignments will incur a penalty of 10% for each working day up to 5 days.


More Information


Copyrights © 2007. All rights reserved.
First Semester 2005/2006