Analysis of Algorithms
L1: Introduction
Dr. Abeer Hamdy
Course Instructors
Lecturer:
Dr. Abeer Hamdy
TAs:
Karim
Samiha
Lecture1 Outline
Introduction
What is an algorithm
Why you need to study algorithms
Course Particulars
Course Objectives
References

13CSCI01I: Analysis of Algorithms
Assignment #1
Assigned: Wednesday 23/10/2013
Deadline: Thursday 31/10/2013
The assignment carries out 20% of the total mark of the course.
Total mark of the assignment: 100.
Objectives:
1. To apply Brute Force and Greedy

Analysis of Algorithm / Lab3
ANALYSIS OF ALGORITHM LAB3
The discussed topics in the lab are:
1. String Matching Problem
2. Closest Pair Problem
1 . STRING MATCHING PROBLEM
Given a string of n characters called the text and a string of m characters called

Analysis of Algorithms
Greedy Algorithms
Dr. Abeer Hamdy
Greedy Algorithm
A greedy algorithm is one of general
algorithmic techniques that can be used for
solving optimization problems.
One way to solve these kinds of problems is
to look at all possible

Analysis of Algorithms
Lab 4 Greedy Algorithms
Week 5 (Oct. 25-31)
Job scheduling problem
Problem Statement:
Consider the problem of scheduling n jobs of known durations t1,t2,.,tn for execution by a single
processor. The jobs can be executed in any order

Analysis of Algorithm / Lab2
ANALYSIS OF ALGORITHM LAB2
The discussed topics in the lab are:
1.
2.
3.
4.
Complexity Analysis
Exercises
Hands On
Challenge
1 . C OMPLEXITY ANALYSIS
Its the measure of the code performance, depending on difference aspects: Ef

CSCI01I03 : Analysis of Algorithms
Brute Force Algorithms
Dr. Abeer Hamdy
Algorithm Design Fundamental techniques
Brute Force
Greedy
Divide and conquer
Dynamic programming
BackTracking
What Is A Brute Force Algorithm?
Brute force is a straightforward app

Analysis of Algorithms
L2: A framework for algorithm
analysis
Dr. Abeer Hamdy
Lecture Outline
mathematical models for Running time
order-of-growth classifications
Asymptotic Notations
Types of Analysis
Summary
The Random Access Machine (RAM)
Model
A sing

Analysis of Algorithms
Shortest Paths Problem
Dr. Abeer Hamdy
Single-pair shortest path Problem
Given a weighted graph and two vertices S and M, we want
to find a path of minimum total weight between S and M.
Length of a path is the sum of the weights o