Careertail
About UsCoursesCareer PathsBlogOpportunities
Log In
Courses>Software Engineering>Byte-Sized-Chunks: Graph Algorithms and Problems in Java
DevelopmentByte-Sized-Chunks: Graph Algorithms and Problems in Java
Price:Paid
Length:5 hours
Content type:video
level:intermediate
Updated:21 February 2024
Published:22 August 2022
Similar courses
Opportunities
Courses>Software Engineering>Byte-Sized-Chunks: Graph Algorithms and Problems in Java
Byte-Sized-Chunks: Graph Algorithms and Problems in Java
4.7 (2.8k)
5 hours
2848 students
What you will learn
1Design and implement software using canonical graph algorithms - Djikstra, Prim, Kruskal, Bellman Ford and topological sort
2Understand the use-cases for the common graph algorithm
Target audiences
1Nope! 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'
2Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work
3Yep! Experienced software engineers who are looking to refresh important fundamental concepts
4Yep! MBA graduates or business professionals who are looking to move to a heavily quantitative role
Requirements
1Basic knowledge of programming is assumed, preferably in Java
FAQ
You can view and review the lecture materials indefinitely, like an on-demand channel.
Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don't have an internet connection, some instructors also let their students download course lectures. That's up to the instructor though, so make sure you get on their good side!
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
Similar courses
Opportunities
Make the most out of your online education
Careertail
Copyright © 2021 Careertail.
All rights reserved
Quick Links
Get StartedLog InAbout UsCourses
Company
BlogContactsPrivacy PolicyCookie PolicyTerms and Conditions
Stay up to date
Trustpilot
Careertail
Courses>Software Engineering>Byte-Sized-Chunks: Graph Algorithms and Problems in Java
DevelopmentByte-Sized-Chunks: Graph Algorithms and Problems in Java
Price:Paid
Length:5 hours
Content type:video
level:intermediate
Updated:21 February 2024
Published:22 August 2022
Similar courses
Opportunities
Courses>Software Engineering>Byte-Sized-Chunks: Graph Algorithms and Problems in Java
Byte-Sized-Chunks: Graph Algorithms and Problems in Java
4.7 (2.8k)
5 hours
2848 students
What you will learn
1Design and implement software using canonical graph algorithms - Djikstra, Prim, Kruskal, Bellman Ford and topological sort
2Understand the use-cases for the common graph algorithm
Target audiences
1Nope! 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'
2Yep! Computer Science and Engineering grads who are looking to really visualise data structures, and internalise how they work
3Yep! Experienced software engineers who are looking to refresh important fundamental concepts
4Yep! MBA graduates or business professionals who are looking to move to a heavily quantitative role
Requirements
1Basic knowledge of programming is assumed, preferably in Java
FAQ
You can view and review the lecture materials indefinitely, like an on-demand channel.
Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don't have an internet connection, some instructors also let their students download course lectures. That's up to the instructor though, so make sure you get on their good side!
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
Similar courses
Opportunities
Make the most out of your online education
Careertail
Copyright © 2021 Careertail.
All rights reserved
Quick Links
Get StartedLog InAbout UsCourses
Company
BlogContactsPrivacy PolicyCookie PolicyTerms and Conditions
Stay up to date
Trustpilot