Advanced Data Structures and Algorithms in Java

Learn Advanced Data Structures and Algorithms in Java to provide efficient solutions to complex problems
4.2 (26 ratings)
Instead of using a simple lifetime average, Udemy calculates a
course's star rating by considering a number of different factors
such as the number of ratings, the age of ratings, and the
likelihood of fraudulent ratings.
383 students enrolled
$19
$75
75% off
Take This Course
  • Lectures 65
  • Length 7.5 hours
  • Skill Level All Levels
  • Languages English
  • Includes Lifetime access
    30 day money back guarantee!
    Available on iOS and Android
    Certificate of Completion
Wishlisted Wishlist

How taking a course works

Discover

Find online courses made by experts from around the world.

Learn

Take your courses with you and learn anywhere, anytime.

Master

Learn and practice real-world skills and achieve your goals.

About This Course

Published 10/2015 English

Course Description

This is a thoroughly detailed course that uses lots of animations to help you visualize the concepts.

This course provides a comprehensive explanation of different types of graph and various graph algorithms. Throughout the course a step by step approach is followed to make you understand different algorithms. Through this course you can build a strong foundation in Data Structures and Algorithms that can help you to crack coding interviews and work in the industry.

The course is broken down into easy to assimilate short lectures and complete working programs are shown for each concept that is explained. The algorithms and examples are explained with figures and animations to simplify the learning of this complex topic.

In this course, Java is used for implementing various Data structures and Algorithms, but you can easily implement them in any other language like C++, C#, Python.


What are the requirements?

  • Basic knowledge of programming in any language
  • Basic knowledge of linked list, stack, queue and binary search trees

What am I going to get from this course?

  • Understanding of various graph algorithms
  • Ability to implement different types of Graph and related algorithms

What is the target audience?

  • Professional Programmers wanting to write effective code
  • Programmers looking for jobs
  • Computer Science students having Data Structures as part of their curriculum
  • Non Computer science students wanting to enter IT industry

What you get with this course?

Not for you? No problem.
30 day money back guarantee.

Forever yours.
Lifetime access.

Learn on the go.
Desktop, iOS and Android.

Get rewarded.
Certificate of completion.

Curriculum

Introduction
Preview
01:26
Section 1: AVL Tree
Introduction
Preview
07:13
Rotations
07:12
Insertion in AVL tree - 1
10:43
Insertion in AVL Tree - 2
09:21
Insertion in AVL Tree - 3
14:13
Insertion in AVL Tree - 4
04:39
Examples of insertion in AVL Tree
07:15
Deletion in AVL Tree - 1
05:12
Deletion in AVL Tree - 2
10:36
Deletion in AVL Tree - 3
05:39
Examples of Deletion in AVL Tree
07:58
Section 2: Threaded Binary Tree
Introduction
12:27
Insertion
05:12
Deletion
07:36
Section 3: Expression Tree
Introduction
03:27
Constructing and Evaluating an Expression Tree
05:49
Implementation of Expression Tree
04:23
Section 4: B tree
Introduction
11:39
Inorder Traversal
05:26
Searching
09:36
Insertion
14:21
Implementation of Insertion - 1
19:02
Implementation of Insertion - 2
07:12
Deletion
03:47
Examples of Deletion from Leaf Node
09:31
Examples of Deletion from Non-Leaf Node
03:31
Implementation of Deletion
12:22
Section 5: Graph
Introduction
03:25
Terminology
09:09
Cycles
03:13
Connectivity in Undirected Graph
05:50
Connectivity in Directed Graphs
03:23
Tree and Forest
03:17
Representation of Graph : Adjacency Matrix
05:40
Adjacency Matrix in Java
14:47
Representation of Graph : Adjacency List
05:51
Adjacency List in Java
09:59
Transitive closure of a directed graph and Path Matrix
09:45
Warshall’s Algorithm
10:18
Warshall’s Algorithm in Java
02:01
Section 6: Traversal In Graph
Introduction
02:42
Breadth First Search
Preview
05:05
Implementation of Breadth First Search
06:54
Finding Shortest path in an unweighted graph
07:59
BFS Spanning Tree
02:45
BFS in Undirected Graphs : Finding Connected Components
07:19
Depth First Search
03:41
Implementation of Depth First Search through Stack
07:34
Recursive Implementation of Depth First Search
06:06
Classification of Edges in DFS of Directed Graph
06:59
Classification of Edges in DFS of Undirected Graph
04:53
Section 7: Shortest Paths in Graph
Shortest Path Problem
02:25
Dijkstra’s Algorithm
09:04
Dijkstra’s Algorithm : Example
08:29
Dijkstra's Algorithm in Java
04:47
Section 8: Minimum Spanning Tree of a Graph
Introduction
01:31
Prim’s Algorithm
03:38
Prim's Algorithm : Example
06:10
Prim’s Algorithm in Java
04:12
Kruskal’s Algorithm
02:33
Kruskal's Algorithm : Example
03:48
Implementation of Kruskal's Implementation
10:29
Kruskal’s Algorithm in Java
04:59
Section 9: Coupon Codes
Discount Coupons for my other courses
2 pages

Students Who Viewed This Course Also Viewed

  • Loading
  • Loading
  • Loading

Instructor Biography

Deepali Srivastava has a Master's degree in Mathematics and is the author of books "C in Depth" and "Data Structures Through C in Depth". She loves programming and is passionate about teaching. Whether writing a book or making a course, she always tries to present the concepts in a simplified way which helps students develop interest in the topic being taught. Her books have been appreciated by students and she hopes that her online courses will also prove to be helpful.

Ready to start learning?
Take This Course