Lecture Notes

• Notes on Basic Data Structures
• Notes of Linked List
• Notes on Stable Matching - Gale-Shapley
• Notes on Algorithm Analysis
• Notes on Binary Search Tree
• Notes on Sorting Algorithms
• Notes on Merge Sort
• Notes on Quick Sort
• Notes on Priority Queue with Heap
• Notes on Graphs (BFS)
• Notes on Graphs (DFS)
• Notes on Topological Sort
• Notes on P, NP, and NP-Complete
• Notes on Greedy Algorithm
• Notes on Kruskal’s Minimum Spanning Tree Algorithm
• Notes on Prim’s Minimum Spanning Tree Algorithm
• Notes on Dijkstra's Shortest Path Algorithm
• Notes on Dynamic Programming
• Notes on Longest Common Subsequence
• Notes on the Knapsack Problem
• Notes on the Bellman-Ford Algorithm
• Notes on the Ford-Fulkerson Algorithm

Class Outline

I Intend to cover the following chapters/appendices in our book. Some of the outlines might be entirely from my lecture. The order will depend in part on student interaction and input.

• Basic Data Structures
  • Arrays
  • Linked Lists
  • Stacks
  • Queues
• Introduction to Algorithms
  • Stable Matching Problem
• Algorithm Analysis
  • Asymptotic
  • Complexity
  • Correctness
• Searching & Sorting
  • Binary Search
  • Bubble Sort
  • Selection Sort
  • Insertion Sort
• Divide/Conquer/Combine
  • Mergesort
  • Quicksort
• Trees and Graphs
  • Priority Queue (Heap)
  • Breadth-First Search
• Graphs
  • Depth-First Search
  • Topological Ordering
• Algorithm Design by Brute Force / Exhaustive Search
  • P, NP, and NP-Complete
  • Hamiltonian Cycle and Traveling Salesman Problem (TSP)
• Greedy Algorithms
  • Introduction
  • Dijkstra's Shortest Path Algorithm
• Greedy Algorithms
  • Kruskal’s Minimum Spanning Tree Algorithm
  • Prim’s Minimum Spanning Tree Algorithm
• Dynamic Programming
  • Fibonacci numbers
  • Longest Common Subsequence
• Dynamic Programming
  • Knapsack Problem
  • Bellman–Ford Algorithm
• Network Flows
  • Ford-Fulkerson Algorithm
  • Max Flow-Min Cut, Maximum Bipartite Matching