4.35 out of 5
4.35
10 reviews on Udemy

Advanced Data Structures and Algorithms in C ( DSA )

Advanced Data Structures and Algorithms in C Using C DSA Data Structures Algorithms DSA C LeetCode C Data Structures DSA
Instructor:
Deepali Srivastava
305 students enrolled
English [Auto]
Understand various data structures and algorithms (DSA) through animations
Get the ability to implement different algorithms in C
Get the confidence to face programming interviews
Learn theory and implementation of AVL Trees, B Trees, Threaded Binary Trees and Expression Trees
Graph, traversal and shortest path algorithms

This “Advanced Data Structures and Algorithms In C” course is thoroughly detailed and uses lots of animations to help you visualize the concepts.

This “Advanced Data Structures and Algorithms in C” tutorial 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 and it will help you to crack Data Structures and Algorithms in C coding interviews questions and work on projects. Good foundation on Data Structures and Algorithms in C interview topics helps you to attempt tricky interview questions.

This Data Structures and Algorithms using C course covers following topics with C implementation :

Trees : AVL Tree, Threaded Binary Tree, Expression Tree, B Tree explained and implemented in C

Graphs : Adjacency matrix, Adjacency list, Path matrix, Warshall’s Algorithm, Traversal, Breadth First Search (BFS), Depth First Search (DFS), Dijkstra’s Shortest Path Algorithm, Prim’s Algorithm and Kruskal’s Algorithm for minimum spanning tree

Here is the course content-

  • AVL Tree
  • Threaded Binary Tree
  • Expression Tree
  • B Tree
  • Graph
  • Traversal in Graph
  • Shortest Paths in Graph
  • Minimum Spanning Tree of a Graph

The Data Structures and Algorithms with C 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.  You will see code implementation of different data structures in C and algorithms are explained in step-wise manner.

In this Data Structures and Algorithms through C course, C programs are used for implementing various concepts, but you can easily code them in any other programming language like C++, C#, Java, Python.

This “Data Structures and Algorithms In C” online course on udemy will help software developers to refresh the concepts studied in Data Structures and Algorithms In C books / pdf and also to students learning from referred books / pdf.

 

So what are you waiting for, click on Buy button to enroll now and start learning.

Introduction

1
Introduction to Advanced Data Structures and Algorithms Through C
2
Source Code Repository

AVL Tree

1
Introduction
2
Rotations
3
Insertion in AVL Tree - 1
4
Insertion in AVL Tree - 2
5
Insertion in AVL Tree - 3
6
Insertion in AVL Tree - 4
7
Examples of insertion in AVL Tree
8
Deletion in AVL Tree - 1
9
Deletion in AVL Tree - 2
10
Deletion in AVL Tree - 3
11
Examples of deletion in AVL Tree
12
Your Review Matters!

Threaded Binary Tree

1
Introduction
2
Insertion
3
Deletion

Expression Tree

1
Introduction
2
Constructing and Evaluating an Expression Tree
3
Implementation of Expression Tree

B tree

1
Introduction
2
Inorder Traversal
3
Searching
4
Insertion
5
Implementation of Insertion - 1
6
Implementation of Insertion - 2
7
Deletion
8
Examples of Deletion from Leaf Node
9
Examples of Deletion from Non-Leaf Node
10
Implementation of Deletion

Graph

1
Introduction
2
Terminology
3
Cycles
4
Connectivity in Undirected Graph
5
Connectivity in Directed Graphs
6
Tree and Forest
7
Representation of Graph : Adjacency Matrix
8
Adjacency Matrix in C
9
Representation of Graph : Adjacency List
10
Adjacency List in C
11
Transitive closure of a directed graph and Path Matrix
12
Warshall’s Algorithm
13
Warshall’s Algorithm in C

Traversal in Graph

1
Introduction
2
Breadth First Search
3
Implementation of Breadth First Search
4
Finding Shortest path in an unweighted graph
5
BFS Spanning Tree
6
BFS in Undirected Graphs : Finding Connected Components
7
Depth First Search
8
Implementation of Depth First Search through Stack
9
Recursive Implementation of Depth First Search
10
Classification of Edges in DFS of Directed Graph
11
Classification of Edges in DFS of Undirected Graph

Shortest Paths in Graph

1
Shortest Path Problem
2
Dijkstra’s Algorithm
3
Dijkstra’s Algorithm : Example
4
Dijkstra’s Algorithm in C

Minimum Spanning Tree of a Graph

1
Introduction
2
Prim's Algorithm
3
Prim's Algorithm : Example
4
Prim's Algorithm in C
5
Kruskal's Algorithm
6
Kruskal's Algorithm : Example
7
Implementation of Kruskal's Algorithm
8
Kruskal's Algorithm in C

Bonus Lecture

1
Recommended Course and offer on my other courses
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!
4.4
4.4 out of 5
10 Ratings

Detailed Rating

Stars 5
4
Stars 4
4
Stars 3
2
Stars 2
0
Stars 1
0
00677b410955f7ba1dec0971f284a1ce
Get course
30-Day Money-Back Guarantee

Includes

7 hours on-demand video
3 articles
Full lifetime access
Access on mobile and TV
Certificate of Completion