Design and Analysis of Algorithms (CSC 380)

Fall 2019

Dr. Gur Saran Adhar

Slides

Java Driver Code/Algorithm

Animation/Other

Design Techniques
Design by Induction
Divide and Conquer
Greedy
Dynamic Programming
Annealing

Optimal Binary Search Tree (PPT)

Chapter-5 (Divide and Conquer) slides)

Chapter-6 (Dynamic Programming) slides

Analysis Techniques
Analysis

Growth of Functions

Chapter-2 (analysis) slides

Running Time Estimates

Max Size of Solvable Problems

Recurrences

Dynamic Programming

1	AssemblyLineTest.java
2	LCSTest.java
3	MatrixChainMultiplyTest.java
4	OptimalBSTTest.java

Greedy Algorithms

1	ActivitySelectionTest.java
2	HuffmanTest.java

String Matching

Example Calculations

Example Pattern Matching  Products for String Matching

String Matching

Computational Geometry

Minimum Spanning Trees

MST example application

MSTTest.java

MST

Single Source Shortest Paths

1	DiffConstraintsTest.java
2	SSSPTest.java

Dijkstra's Algorithm Animated

All Pairs Shortest Paths

1	APSPTest.java
2	JohnsonTest.java
3	TransClosureTest.java

Maximum Flow

Max-Flow Slides 1from KT

Max-Flow Slides 2 from KT

EdmondsKarpTest.java

Matching

Solving Matching Problem using Simulated Annealing

Matching Program in C (using simulated annealing)

Back To Home

---