CS6033: Midterm Review
March 23, 2016
Midterm Exam Par;culars
Midterm will be open from Friday morning un;l Monday night.
You can choose any (reasonable) 150 minute slot in this window.
You have to make an appointment with ProctorU for your desire

Analysis of Algorithms
Shortest Paths
Thanks: George Bebis
Chapter 24
Shortest Path Problems
How can we find the shortest route between two
points on a road map?
Model the problem as a graph problem:
Road map is a weighted graph:
vertices = cities
edge

Graphs
I
Graphs are one of the unifying themes of computer science.
I
That so many dierent structures can be modeled using a
single formalism is a source of great power to the educated
programmer.
I
A graph G = (V , E ) is defined by a set of vertices V ,

CS 6033 Design and Analysis of Algorithms I, Section INET
Spring 2016 Schedule
Important Dates:
Semester start: 1/25/2016
First Class: 1/27/2016
Selection of Project Topic and Team: 2/26/2016
Spring Recess: 3/14 3/20/2016
Mid-

Analysis of Algorithms
CS 6033
Dynamic Programming
Thanks: George Bebis
(Chapter 15)
Final Exam
When: May 14, 2012, 6-8:30PM
Where: Online (Instructions will be forthcoming)
Let me immediately if you have a conflict or
cannot make it.
Reminder: HW 4 (

Analysis of Algorithms
GRAPHS
Chapter 22
Thanks: George Bebis
But First!
Midterm postmortem
2
The Good
1. [10 PTS] An O(n^2) algorithm is always faster than a O(n^3) algorithm. Is this true or
false? Why?
2. [10 PTS] Give an example of a sorting problem

Analysis of Algorithms
CS 6033
Hashing (Chapter 11) Contd
Thanks: Prof. George Bebis
Universal Hashing
In practice, keys are not randomly distributed
Any fixed hash function might yield (n) time
Goal: hash functions that produce random
table indices ir

Analysis(of(Algorithms
CS(477/677
Hashing
Thanks:(George(Bebis
(Chapter)11)
The(Search(Problem
Find(items(with(keys matching(a(given(search key
Given an array A, containing n keys, and a search key
x, find the index i such as x=A[i]
As in the case of s

CS6033: DESIGN AND ANALYSIS OF
ALGORITHMS 1
General Information
This class is listed in the catalog as:
CS-GY 6033 SECTION INET DESIGN AND ANALYSIS OF ALGORITHMS I
It is your responsibility to read all information in this "Syllabus and Polici