Notes in Algorithms and Data Structures

To Subscribe, use this Key

Subdecks

Status	Last Update	Fields
Published	05/15/2024	Outline Prim's Algorithm
Published	05/15/2024	Describe depth first search
Published	05/15/2024	How do you perform breadth first search
Published	05/15/2024	What is a topological sort
Published	05/15/2024	How do you perform cycle detection with DFS
Published	05/15/2024	How to you find the shortest path on an unweighted graph
Published	05/15/2024	Outline the Bellman Ford Algorithm
Published	05/15/2024	What is the complexity of the Bellman Ford algorithm
Published	05/15/2024	How do we detect a negative weight cycle in Bellman Ford
Published	05/15/2024	How can we store a weighted graph
Published	05/15/2024	Outline Dikjstra's Algorithm
Published	05/15/2024	What is the complexity of Dijkstra's algorithm
Published	05/15/2024	How does A* search differe from Dijkstra's
Published	05/15/2024	What does gradient descent do
Published	05/15/2024	What is the gradient descent algorithm for a function \(f(x)\)
Published	05/15/2024	How can we use gradient descent to learn a function from data
Published	05/15/2024	What is the mathematical def. of a local minimum
Published	05/15/2024	What is El Gamal Encryption
Published	05/15/2024	How do we generate a public key for el gamal encryption
Published	05/15/2024	How do we encrypt a message with el gamal, with a public key \((p, g, g^x \; mod \; p)\)
Status	Last Update	Fields