ITCS 345: Analysis and Design of Algorithms

1st Semester 2006/2007

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 W 11:00-12:40 S40-1047


Tests Date & Time:

Test Date Time
Test 1 30 October 2006 11:00-12:00
Make-up Test 1 23 November 2006 13:00-14:00
Test 2 4 December 2006 11:00-12:00
Final Exam 14 January 2007 14:30-16:30


Grading Policy:


Assignments:

Assignment Topic Due Date
Assignment 1 Asymptotic Notations 11 October 2006
Assignment 2 For & While loop Analysis,
Empirical Analysis
5 November 2006
Assignment 3 Recurrence Relations 22 November 2006
Assignment 4 Recursive Alogrithms Analysis 29 November 2006
Assignment 5 Design of Brute Force Algorithms 10 December 2006
Assignment 6 Divide & Conquer, Heap Algorithms,
Greedy Algorithms, Branch & Bound
27 December 2006

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


More Information


[Second Semester 2005/2006 Website] [First Semester 2005/2006 Website]


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