Algorithms
Recurrences
And
Correctness
Recurrences
Definition a recurrence is an equation
or inequality that describes a function in
terms of its value on smaller inputs
Example recurrence for Merge-Sort
if n = 1
(1)
T(n)
2T(n/2) + (n) if n > 1
Why Recu

The Theory of NPCompleteness
1
Introduction
A problem is said to be polynomial if there exists an algorithm that
solves the problem in time T(n)=O(nc), where c is a constant.
Examples of polynomial problems:
Sorting: O(n log n) = O(n2)
All-pairs shortest

Analysis of Algorithms
Dynamic Programming
Dynamic Programming
An algorithm design technique (like divide and
conquer)
Divide and conquer
Partition the problem into independent subproblems
Solve the subproblems recursively
Combine the solutions to so

Analysis of Algorithms
Dynamic Programming
Dynamic Programming
An algorithm design technique (like divide and
conquer)
Divide and conquer
Partition the problem into independent subproblems
Solve the subproblems recursively
Combine the solutions to so

Techniques for the Design of
Algorithms
Design and Analysis of Algorithms
Algorithmic Paradigms
General approaches to the construction of efficient
solutions to problems.
Such methods are of interest because:
They provide templates suited to solving a bro

PROJECTILE MOTION WORKSHEET
1. A ball is kicked horizontally at 8.0 m/s from a cliff 80m high. How far from the base of the cliff
will the stone strike the ground?
2. How long will it take a shell fired from a cliff at an initial velocity of 800 m/s at an

1. As the customer support manager, the first thing that I
would do is to confront Sofia and ask her if she really is
happy and content working for the team. If ever she is
unhappy, I will tell her that she should not worry because
the team, and I as th

IT145 A1 Chapter 1
Assignment Number 1
Submit your video answer (video link) on or before May 8, 2016
Video recording must show this presentation and your face as you answer the
question.
For the scenarios:
Use the five-step decision-making process discu