Introduction to Algorithms
Hash Tables
Hash Tables
Motivation: symbol tables
A compiler uses a symbol table to relate symbols to associated data
Symbols: variable names, procedure names, etc.
Associated data: memory location, call graph, etc.
For a sym

essay 2 :
Primary obstacle which restrains an individual from learning is when he thinks that he knows
everything about a particular topic or subject. This ideology is the second biggest barrier to
study as an individual feels that he knows everything mak

Chapter15
ReviewTechniques
SlideSettoaccompany
SoftwareEngineering:APractitionersApproach,7/e
by Roger S. Pressman
Slides copyright 1996, 2001, 2005, 2009 by Roger S. Pressman
For non-profit educational use only
May be reproduced ONLY for student use at t

Chapter17
SoftwareTestingStrategies
SlideSettoaccompany
SoftwareEngineering:APractitionersApproach,7/e
by Roger S. Pressman
Slides copyright 1996, 2001, 2005, 2009 by Roger S. Pressman
For non-profit educational use only
May be reproduced ONLY for student

Chapter 22:
Elementary GraphAlgorithms
Undirected Graph
Information
Technology
Example: A city map for
pedestrians (edges are streets,
nodes are intersections)
A
F
B
C
G
H
K
E
D
J
I
L
M
N
2
Directed Graph (Digraph)
Information
Technology
Example: A city m

Divide and Conquer
Recall
Divide the problem into a number of sub-problems that are smaller
instances of the same problem.
Conquer the sub-problems by solving them recursively. If the subproblem sizes are small enough, however, just solve the sub-proble

Introduction to Algorithms
Greedy Algorithms
Greedy Algorithms
A greedy algorithm always makes the choice that looks best
at the moment
My everyday examples
Playing cards
Invest on stocks
Choose a university
The hope
A locally optimal choice will l

Maximum Flow
Chapter 26
Flow Graph
A common scenario is to use a graph to represent a
flow network and use it to answer questions
about material flows
Flow is the rate that material moves through the
network
Each directed edge is a conduit for the mate

Single-Source Shortest
Paths
Single-Source Shortest Path
Problem: Given a weighted directed graph G, find the minimumweight path from a given source vertex s to another vertex v
Shortest-path
minimum weight
Weight of path is sum of edges
e.g., a road

Introduction to Algorithms
Quicksort
Introduction for Quicksort
Worst-case running time: (n)
Expected running time: (n lg n)
Constants hidden in (n lg n) are small
Another divide-and-conquer algorithm
The array A[p.r] is partitioned into two non-empt

Introduction to Algorithms
Counting Sort
Sorting So Far
Insertion Sort
Easy to code
Fast on small inputs (less than ~ 50
elements)
Fast on nearly-sorted inputs
O(n ) worst case
2
O(n ) average (equally-likely inputs) case
2
O(n ) reverse-sorted cas

Marriotts Customer- Focused
E-business strategy
INTRODUCTION
Headquartered at Washington in the US.
In year 2003, it had a network in excess of 2,600 operating units in the US
1,15.000 employees
spread over 65 countries across the world.
Marriott bec