0% found this document useful (0 votes)
12 views2 pages

Algorithm Analysis & Design Course Outline

The document outlines the course 'Algorithm Analysis and Design' offered at Arba Minch University, detailing the course description, objectives, and breakdown of topics covered over the semester. It includes information on contact hours, assessment methods, and references for further reading. The course aims to equip students with skills in algorithm analysis, design techniques, and problem-solving strategies in computer engineering.

Uploaded by

tayeworktasewu83
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
12 views2 pages

Algorithm Analysis & Design Course Outline

The document outlines the course 'Algorithm Analysis and Design' offered at Arba Minch University, detailing the course description, objectives, and breakdown of topics covered over the semester. It includes information on contact hours, assessment methods, and references for further reading. The course aims to equip students with skills in algorithm analysis, design techniques, and problem-solving strategies in computer engineering.

Uploaded by

tayeworktasewu83
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

ARBA MINCH UNIVERSITY, Institute of Technology (AMiT)

Faculty of Electrical & Computer Engineering


Course Outline

Course Name: Algorithm Analysis and Design Instructor: Fasika T.


Course Code: ECEG 5192 Email: [Link]@[Link]
ECTS:5 Mobile: +251 949670865
Pre-Requisite: Object Oriented Programming Office:
Academic year: 2025/2026 Semester: 1st
Target groups: G5E-Comp Consultation Hours: 9:00AM-4:30 PM (Tue)
Name: ______________________ ID, Section:_____________________

Contact Hours Lecture Tutorial Lab/Practical Home Study Total


per week 2 1 3 3 9

I: Course Description:
This course is intended to present the algorithm design techniques, analysis of sorting & searching
algorithms, graph algorithms, string processing Algorithms, problem complexity and type, introduction to
parallel computation.

II: Course Objectives


Upon completion of this course, students will be able to;
⚫ To understand and exemplify algorithm analysis methods
⚫ Module Data Storage and Analysis computation

III: Course Breakdown

Methodology Sessions References/


Chapter
Week

Topics Activities Chapters

1. Algorithm analysis basics ➢ Defining ➢ Gapped ➢ lecture ➢ Handou


✓ The running time of a program, &Explain lectures ts
Algorithm
Big-Oh, Omega and Theta analysis
1 1
notations,
✓ Lower bounds, worst and
average case analysis, time and
space trade-offs
2 Recurrences ➢ Defining & ➢ Gapped ➢ lecture ➢ Handou
2-3 2 lectures ts
✓ Recurrences Explain
recurrence
✓ Master Method
4 Test chapters 1,2

Page 1 of 2
November 30, 2025
ARBA MINCH UNIVERSITY, Institute of Technology (AMiT)
Faculty of Electrical & Computer Engineering
Course Outline

3. Analysis of Sorting and Searching ➢ Explaining ➢ Gapped ➢ Lecture ➢ Handou


algorithms: different lectures & lab ts
simple sorting
✓ Analysis of Simple Algorithms:
and searching
✓ sorting and searching algorithms
5-9 3 ✓ Analysis of Advanced Algorithms:
 advanced trees
 heaps
 hash tables

4. Algorithm design techniques ➢ Gapped ➢ Lecture


✓ Brute force ➢ Defining lectures & lab Hando
&Explain uts
11- ✓ Divide-and-conquer,
4
15 ✓ dynamic programming
✓ greedy algorithms, backtracking,
branch and bound, amortized
analysis.
5. Algorithms for fundamental graph ➢ Defining ➢ Gapped ➢ Lecture Hand
problems &Explain lectures & lab outs
16 5
✓ Depth-first search, connected
components, topological sort, and
shortest paths.

IV: Assessment Methods:


Assessments Contribution % Date
Tests 25
Assignments 10
Final Exam 40
Projects and other 20
Quiz 5

VI: References
1 Cormen, Leiserson, Rivest : Introduction to Algorithms
2 Robert Sedgwick, Algorithms in C/C++
3 Aho, Hopcroft, Ullman: The Design & Analysis of Computer Algorithms

Page 2 of 2
November 30, 2025

You might also like