# Advanced Algorithms Study Guide
General Tips
- Be specific, define abbreviations
- ex. **DO NOT DO** G(V,E)
- **DO** Graph, v- set of vertices, e-set of nodes
- When writing algorithms it is best to use pseudocode
- if using English be extremely precise
**8 or 9 Questions**
- At Least 3 Questions from First Question
- Solving Recurrence Relation
- Graphs
- Mathematical Induction
- At least 2 Questions From 2nd Midterm
- 11.3
- [Approximation Algorithms](/Rnf2MnSWSDqwyQ6qipvHZg)
- Problem Reduction
- **IMPORTANT**
- Hamiltonian Circuit
- Starts and ends at same vertex
- Visits each vertex once
- Knapsack Problem
- [[Nondeterministic Algorithms]]
- 2 Stages
- Guessing
- Verification
- After 2nd Midterm
- Dynamic Programming
- Understand the Recurrence Relation to Understand the algorithm
- Principle of Optimality
- Longest Common Subsequence
- [[Warshall's Algorithm|Warshall]] and Floyd Algorithm
- String Algorithms
- Brute Force String Matching
- [[Horspool's Algorithm]]
-
{"metaMigratedAt":"2023-06-17T15:49:55.012Z","metaMigratedFrom":"Content","title":"Advanced Algorithms Study Guide","breaks":false,"contributors":"[{\"id\":\"37bdebdd-5883-46b4-9b8c-3926b9d393bf\",\"add\":1076,\"del\":24}]"}