1. ICE 245: Algorithms Instructor: Dr. Mohammad Arifuzzaman
Dept of Electronics and Communication Engineering
East West University

2. Course Objectives
The computer algorithm is a rich and heavily studied area in computer science, whose impact has been great in both the practical and theoretical aspects of several arena of engineering.
As a big picture, this course's aim is to introduce you to various standard methods for designing algorithms, including the greedy method, divide-and-conquer, and dynamic programming etc.

3. Course Logistics Textbook: Introduction to Algorithms:
-Thomas H. Cormen, Charls E.
Leiserson, Ronald L. Rivest
Reference Book:
Fundamentals of Computer Algorithms
–Sartaj Sahni and Sanguthevar R. Ellis Horowitz
Others: Lectures, Homework, Useful links,
Supplementary material,
Announcements

4. Expected outcome of the course:
Students who complete the course will have demonstrated the ability to
do the following:
Analyze worst-case running times of algorithms using asymptotic analysis.
Describe the divide- and-conquer paradigm and explain when an algorithmic design situation calls for it.
Describe the dynamic-programming paradigm and explain when an algorithmic design situation calls for it.
Describe the greedy paradigm and explain when an algorithmic design situation calls for it.
Explain the major graph algorithms and their analyses. Employ graphs to model engineering problems, when appropriate.
Explain what an approximation algorithm is, and the benefit of using approximation algorithms.

5. Where to find me My Office: Block C, Room# 459 Office Hours :
Mentioned in my Weekly Routine
and/ or by appointment ( ) My
Website :
Graduate Teaching Assistant (GTA) : Sadia Nowrin

6. Class Expectations
Class participation – Your input is needed for good discussion
Keep up with reading material
Complete assignments and projects on time
Follow academic integrity code

7. Grading Scheme Assignment Points Midterm 1 15 Midterm 2 Lab 20 Quiz 10
Class participation
Final exam
Total
100

8. Thank You!