The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 17 Disjoint Sets Data Structure
A disjoint-sets data structure
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 16 Amortized Analysis
1
Amortized Analysis
Given a data struc
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
NP-completeness Lectures 24-26
1
Feasible Computation
So far, we have
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 7 Randomized Select
Randomized Selection
The selection problem (C
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 6 Randomized Quicksort
Randomized Partition and Randomized Quicks
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 5 Randomized algorithms; random permutation
Randomized algorithms
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 4 Quicksort; basic probability
Quicksort
Quicksort(A, p, r) Input
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
NP-completeness Lectures 24-26
1
Feasible Computation
So far, we have bee
The University of Texas at Austin Lecture 3 Department of Computer Sciences Professor Vijaya Ramachandran Divide & conquer; recurrence relations; master theorem CS357: ALGORITHMS, Spring 2006
Analyzin
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 2 Growth of functions; asymptotic analysis; summations
Growth of
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 11 Greedy, MST
1
The Greedy Framework
Rcall that an optimization
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lectures 11-14 Greedy, MST
1
The Greedy Framework
Rcall that an optimizat
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Depth-first Search Lectures 23-24
1
Depth-first Search
Let G = (V, E) be
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Depth-first Search
1
Depth-first Search
Let G = (V, E) be a directed or u
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Breadth-first search Lecture 22
1
Breadth-first search and unweighted sho
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Comparison & Integer Sorting Lecture 21
Lower bound on comparison-based s
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Hashing Lecture 20
1
Hashing
Hashing is a widely-used class of data struc
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Binary Search Trees Lectures 18-19
1
Dictionaries
A dictionary is a data
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 17 Disjoint Sets Data Structure
A disjoint-sets data structure ma
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 16 Amortized Analysis
1
Amortized Analysis
Given a data structure
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 15 Priority Queue; Heapsort
1
Data Structures
Sets manipulated by
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 1 Merge-sort; algorithm analysis; divide & conquer
Algorithms
An
CS357: ALGORITHMS
The University of Texas at Austin Department of Computer Sciences January 18, 2006 COURSE DESCRIPTION Time/Location/Unique number. MW 11:00-12:30, WEL 2.256, #54045 Professor. Vijaya
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 7 Randomized Select
Randomized Selection
The selection problem
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Depth-first Search Lectures 23-24
1
Depth-first Search
Let G = (V, E)
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Breadth-first search Lecture 22
1
Breadth-first search and unweighted
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Binary Search Trees Lectures 18-19
1
Dictionaries
A dictionary is a d
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Hashing Lecture 20
1
Hashing
Hashing is a widely-used class of data s
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Comparison & Integer Sorting Lecture 21
Lower bound on comparison-based
The University of Texas at Austin Department of Computer Sciences Professor Vijaya Ramachandran CS357: ALGORITHMS, Spring 2006
Lecture 15 Priority Queue; Heapsort
1
Data Structures
Sets manipulate