2017-03-26 04:58:34

Byte-Sized-Chunks: Graph Algorithms and Problems in Java

156 students enrolled

Please confirm that you want to add **Byte-Sized-Chunks: Graph Algorithms and Problems in Java** to your Wishlist.

Djisktra, Prim, Kruskal, Bellman-Ford, the topological sort - all will make sense now!

156 students enrolled

What Will I Learn?

- Design and implement software using canonical graph algorithms - Djikstra, Prim, Kruskal, Bellman Ford and topological sort
- Understand the use-cases for the common graph algorithm

Requirements

- Basic knowledge of programming is assumed, preferably in Java

Description

**Note: This course is a subset of our much longer course 'From 0 to 1: Data Structures & Algorithms' so please don't sign up for both:-)**

**This is an animated, visual and spatial way to learn data structures and algorithms**

- Our brains process different types of information differently - evolutionarily we are wired to absorb information best when it is visual and spatial i.e.
**when we can close our eyes and see it** - More than most other concepts,
**Data Structures and Algorithms are best learnt visually.**These are incredibly easy to learn visually, very hard to understand most other ways - This course has been put together by a team with tons of everyday experience in thinking about these concepts and using them at work at
**Google, Microsoft and Flipkart**

*Taught by a Stanford-educated ex-Googler.*

The graph is a data structure that is used to model a very large number of **real world problems**. It's also an **programming interview favorite**. The study of graphs and algorithms associated with graphs forms an entire field of study called graph theory.

- Directed and undirected graphs
- Adjacency matrices, lists and sets
- Breadth and Depth-First traversal
- Topological sort
- Djikstra's algorithm
- Bellman-Ford algorithm
- Prim's algorithm
- Kruskal's algorithm

**Using discussion forums**

Please use the discussion forums on this course to engage with other students and to help each other out. Unfortunately, much as we would like to, it is not possible for us at Loonycorn to respond to individual questions from students:-(

**We're super small and self-funded with only 2-3 people developing technical video content. ****Our mission is to make high-quality courses available at super low prices.**

The only way to keep our prices this low is to ***NOT offer additional technical support over email or in-person***. The truth is, direct support is hugely expensive and just does not scale.

We understand that this is not ideal and that a lot of students might benefit from this additional support. Hiring resources for additional support would make our offering much more expensive, thus defeating our original purpose.

**It is a hard trade-off.**

Thank you for your patience and understanding!

Who is the target audience?

- Nope! Please don't enroll for this class if you have already enrolled for our 15-hour course 'From 0 to 1: Data Structures and Algorithms'
- Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work
- Yep! Experienced software engineers who are looking to refresh important fundamental concepts
- Yep! MBA graduates or business professionals who are looking to move to a heavily quantitative role

Students Who Viewed This Course Also Viewed

About the Instructor

A 4-person team;ex-Google; Stanford, IIM Ahmedabad, IIT