www.cs.cmu.edu

CMU 15-451 (Algorithms), Fall 2010

Jeremiah Blocki, jblocki+451@cs.cmu.edu: Monday @ 3:30 PM. GHC 7th floor lounge. Students can email me if they want to meet at a different time. Anvesh Komuravelli, anvesh+451@cs.cmu.edu: Friday @ 4 ...
GitHub

Dijkstra's Algorithm.cpp

This code is implementation of Dijkstra's algorithm using Adjacency list representation for Undirected weighted graph. When to use Dijkstra's algorithm and Floyd Warshall algorithm ? -> Dijkstra's ...
Hacker

Solving the All-pairs Shortest Paths Problem With the Floyd-Warshall Algorithm in C#

All of us solve a “shortest path” problem many times a day. Unintentionally of course. We solve it on our way work or when we browse the Internet or when we arrange our things on a desk. Sounds a bit… ...
GitHub

Technical Interview Cheat Sheet

Big O - upper bound Big Omega - lower bound Big Theta - upper and lower bound - that's what's usually used but called Big O. An ArrayList is implemented with an array. When the array hits capacity, ...
Hacker

Real-world Use Cases of Dynamic Programming

Dynamic programming is a powerful technique for solving optimization problems that can be divided into smaller sub-problems. The main idea of dynamic programming is to avoid recomputing the same ...
Simon Fraser University

CMPT 307

Aug 2: I'll have 2-hour office hours on Wed, Aug 7, 11:30-13:30. Aug 2: The final exam on Aug 9 will be on all topics of the course, with equal emphasis. You'll have 3 hours for an exam that will be ...