ITCS 345: Analysis and Design of Algorithms

2nd 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:

ITCS 215: Data Structure
ITCS 251: Discrete Mathematics

Textbook:

Introduction to the Design & Analysis of Algorithms, by Anany Levitin, Addison-Wesley; ISBN 0-321-21076-X

References:

Intorduction to Algorithms, by Cormen, Leiserson, Rivest and Stein; Second Edition (highly recommended)
Fundamentals of Algorithms, by Bassard and Brateley (recommended)
Data Structures & Algorithms Analysis in C++, by Mark Weiss; Second Edition

Time Table:

	Time	Place
Lecture	SMW 13:00-14:00	S40-2049
Tutorial	T 11:00-12:40	S40-1047

Tests Date & Time:

Test	Date	Time
Test 1	2 April 2006	11:00-12:00
Test 2	14 May 2006	11:00-12:00
Final Exam	10 June 2006	14:30-16:30

Grading Policy:

Assignment & Quizzes: 20%
Term Tests: 40%
Final Exam: 40%

Assignments:

Assignment	Topic	Due Date
Assignment 1	Asymptotic Notations	14 March 2006
Assignment 2	For & While loop Analysis, Empirical Analysis	25 March 2006
Assignment 3	Analysis of Iterative & Recursive Alogrithms	1 April 2006
Assignment 4	Recurrence Relations	11 April 2006
Assignment 5	Design of Brute Force Algorithms	25 April 2006
Assignment 6	Programming assignment	9 May 2006
Assignment 7	Divide & Conquer, Heap Algorithms,	23 May 2006
Assignment 8	Greedy Algorithms, Branch & Bound	30 May 2006

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

More Information

[First Semester 2005/2006 Website]