Syllabus
Textbook
The course text is Algorithm Design, by Jon Kleinberg and Eva Tardos. ISBN:0-321-29535-8.
Please note that there are several options with respect to obtaining the book. Students can purchase the text at any bookstore in both new and used format, buy or rent it online directly from the the usual Internet textbook resellers such as: Chegg.com or Cengagebrain.com. As outlined above, there are many buying options available. Pick the way that works best for you!
Instructor
Office: Engineering A0407
School of Computing
Southern Illinois University
(618) 453-6059
sajedul.talukder@siu.edu
Quote
"The only man who never makes mistakes is the man who never does anything."
- Theodore RooseveltCS 330 Intro to the Design and Analysis of Algorithms
Midterm Exam
The midterm exam date TBA.Midterm Study Guide
There will be no coding questions. Study the examples and time complexities of the algorithms. Also, look into the homework problems. The exam will have 8 questions.- Basic Data Structures
- Arrays
- Linked Lists
- Stacks
- Queues
- Introduction to Algorithms
- Stable Matching Problem
- Algorithm Analysis
- Asymptotic
- Complexity
- Searching & Sorting
- Binary Search
- Bubble Sort
- Selection Sort
- Insertion Sort
- Divide/Conquer/Combine
- Mergesort
- Quicksort
Final Exam
The final exam date TBA.Final Study Guide
There will be no coding questions. Study the examples and time complexities of the algorithms. Also, look into the homework problems. The exam will have 8 questions.- Trees and Graphs
- Priority Queue (Heap)
- Breadth-First Search
- Graphs
- Depth-First Search
- Topological Ordering
- P, NP, and NP-Complete
- Traveling Salesman Problem (TSP)
- Greedy Algorithm
- Dijkstra's Shortest Path Algorithm
- Kruskal’s Minimum Spanning Tree Algorithm
- Prim’s Minimum Spanning Tree Algorithm
- Dynamic Programming
- Longest Common Subsequence
- Knapsack Problem
- Other Problems
- Ford-Fulkerson Maximum Flow Algorithm