Introduction of ECE665
Computer Algorithms
What is algorithm
That is:
Approaches to efficient solutions to
problems.
Introduction of Algorithms
2
Motivation of Studying Algorithm
Resources are limited
Huge amount of data
a good algorithm is like a sharp knife…
----Thomas H. Cormen
Introduction of Algorithms
3
Bad algorithms vs. good
algorithms
Temporal requirements

Running time
Spatial requirements

Memory used
Hardware requirements

Power, CPUs, Hard Disks
Introduction of Algorithms
4
Algorithm examples for
Internet
Finding routes

shortest path, traveling salesman
Searching engine

google
Packet filtering

IP address looking up
Queuing

Routers, servers
Etc…
Introduction of Algorithms
5
Class Information
Description: Computer Algorithms
Credit: 3CR
Meeting time: TuTh 11:15-12:30pm
Location: Martson 211
Introduction of Algorithms
6
About the Instructor
Prof. Lixin Gao




Telephone: 413-545-4548
Office: KEB 211B
Office Hour: Tues, Thu 1-2pm,
KEB 211B
Email: [email protected]
Introduction of Algorithms
7
Outline of this Course
Algorithm Analysis

methodologies for analyzing algorithms
Basic Data Structures

stacks, queues, trees, heaps.
Combinatorial Algorithms

search trees and sorting algorithms.
Fundamental Design Strategies

greedy methods, dynamic programming, etc.
Introduction of Algorithms
8
Outline of this Course – cont.
Graph Algorithms

graph traversals (DFS and BFS), minimum
spanning tree.
Randomized Algorithms
Network Flows and Matching

max-flow/min-cut.
NP-completeness

approximation algorithms.
Applications to Computer Networks,
Communications.
Introduction of Algorithms
9
Textbook
Algorithm Design, Foundations, Analysis and
Internet Examples, by M. T. Goodrich, R.
Tamassia, John Wiley & Sons Inc, 2002,
ISBN: 0-471-38365-1
Introduction of Algorithms
10
Course Website
http://rio.ecs.umass.edu/~lgao/ece665_13
What you can find from the website





Class schedule
Lecture slides
Homework assignment
Exam information
Etc.
Introduction of Algorithms
11
Grading Policy
Final Project (10%)

Students are expected to complete a paper on design and/or
implementation of advanced algorithms
Homework (30%)

There are five homework assignments
Midterm Exam (30%)

Date to be announced
Final Exam (30%)

Date to be announced
Introduction of Algorithms
12
Makeup Class
Friday?
Introduction of Algorithms
13