Program Analysis - Generic Algorithm Design Paradigms

You must be able to consider a number of important data structures, with particular emphasis on priority queues and the generic graph data structure. You look at several basic graph algorithms, in particular:

depth-first search of graphs
breadth-first search of graphs
topological sorting of directed acyclic graphs.
Generic Design Paradigms
In the second part of the module, you consider four of the most important methods used as the basis for algorithm design:

greedy methods
divide and conquer approaches
dynamic programming
network flow.
In considering these generic design paradigms, you look at a number of well-known problems, including:

interval scheduling
single source shortest path
minimum spanning tree
Huffman codes construction
weighted interval scheduling
subset sum
sequence alignment
network flow
bipartite matching.