Byte-Sized-Chunks: Graph Algorithms and Problems in Java
What you'll 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
Course content
- Preview01:14
- Preview15:40
- 07:21Types Of Graphs
- 14:29The Directed And Undirected Graph
- 08:09Representing A Graph In Code
- 15:25Graph Using An Adjacency Matrix
- 17:53Graph Using An Adjacency List And Adjacency Set
- 10:08Comparison Of Graph Representations
- 14:56Graph Traversal - Depth First And Breadth First
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
Who this course is for:
- 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
Instructor
![Loony Corn](data:image/svg+xml,%3Csvg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 64 64"%3E%3C/svg%3E){kind=avatar}
- 4.2 Instructor Rating
- 22,028 Reviews
- 131,372 Students
- 73 Courses
Loonycorn is us, Janani Ravi and Vitthal Srinivasan. Between us, we have studied at Stanford, been admitted to IIM Ahmedabad and have spent years working in tech, in the Bay Area, New York, Singapore and Bangalore.
Janani: 7 years at Google (New York, Singapore); Studied at Stanford; also worked at Flipkart and Microsoft
Vitthal: Also Google (Singapore) and studied at Stanford; Flipkart, Credit Suisse and INSEAD too
We think we might have hit upon a neat way of teaching complicated tech courses in a funny, practical, engaging way, which is why we are so excited to be here on Udemy!
We hope you will try our offerings, and think you'll like them :-)