# Data Structures and Algorithms In C

Data structures and algorithms through c in depth udemy free download. Data Structures and Algorithms in C Using C DSA Data Structures Algorithms LeetCode DSA C Data Structures Self-Paced.

## You will Learn

12 sections • 151 lectures • 10h 15m total length

• Introduction to Data Structures and Algorithms Through C In Depth
2 lectures • 2min
• Introduction to Data Structures and Algorithms Through C In Depth
Preview
01:35
Source Code Repository
00:12
• Introduction to Data structures and Algorithms
12 lectures • 46min
Data Structures and Algorithms
02:54
Measuring Running time of Algorithms
02:20
Asymptotic Analysis
02:46
Big O Notation
04:06
Finding Big O
05:21
Tight and Loose Upper Bounds
01:30
Introduction Quiz A
10 questions
Big O analysis of Algorithms
02:00
Finding Time Complexity
03:16
Big O analysis of Algorithms: Examples
11:24
Worst case, Best case and Average Case Analysis
03:48
Common Complexities
03:00
Abstract Data Types
03:49
Introduction Quiz B
9 questions
23 lectures • 1hr 42min
• Introduction to Linked List in C
Preview
04:57
• Traversing and Searching a Single Linked List
Preview
05:27
• Finding pointers in a Single linked list
Preview
05:12
00:01
• Insertion in a Single Linked List
Preview
05:14
• Insertion in a Single Linked List..contd
Preview
07:37
Deletion in a Single Linked List
03:56
00:16
02:12
10 questions
03:03
Insertion in a doubly linked List
06:34
03:37
02:32
02:19
Insertion in a circular Linked List
03:13
Deletion in a circular linked list
02:15
Concatenation
03:03
05:45
04:31
09:47
Sorting a Linked list using Bubble Sort
07:24
Sorting a Linked list using Merge Sort
03:28
Finding and Removing a cycle in a Linked list
09:58
8 questions
• Stack and Queue
17 lectures • 1hr 16min
Introduction
02:09
Stack
01:29
Array Implementation of Stack
04:59
03:57
Queue
01:13
Array Implementation of Queue
06:24
03:52
02:21
Circular Queue
07:55
Deque
08:01
Priority Queue
02:36
Checking validity of an expression containing nested parentheses
05:49
Function calls
02:16
Evaluating Arithmetic Expressions
03:22
Polish Notations
05:56
Converting infix expression to postfix expression
10:31
Evaluation of postfix expression
03:12
Stack and Queue Quiz
9 questions
• Recursion
13 lectures • 38min
Introduction
02:38
Flow of control in Recursive functions
02:09
Winding and unwinding phase
01:12
Factorial
03:33
Printing numbers from 1 to n
04:45
Sum of digits of an integer
03:34
Base conversion
02:05
Finding nth power of a number
01:38
Euclids Algorithm
02:48
Fibonacci Series
02:31
Tower of Hanoi
06:44
Tail recursion
02:40
Recursion vs. Iteration
01:26
Recursion Quiz
10 questions
• Binary Tree
16 lectures • 1hr 4min
• Binary Search Tree
6 lectures • 34min
Introduction
03:03
Traversal in Binary Search Tree
01:55
Searching in a Binary Search Tree
06:08
Nodes with Minimum and Maximum key
03:23
Insertion in a Binary Search Tree
07:40
Deletion in a Binary Search Tree
11:48
Binary Search Tree Quiz
9 questions
• Heap
6 lectures • 25min
Introduction
02:40
Heap Representation
02:12
Insertion in Heap
07:27
Deletion
07:37
Building a heap
04:15
Heap Applications
01:06
Heap Tree Quiz
7 questions
• Sorting
39 lectures • 2hr 3min
Introduction to Sorting Algorithms
05:02
Sort Stability
02:25
Selection Sort
01:49
Selection Sort Example
01:18
Selection Sort in C
02:55
Analysis of Selection Sort
02:20
Bubble Sort
02:24
• Bubble Sort Example
Preview
02:11
Bubble Sort in C
04:15
Improvement in Bubble Sort
02:16
Analysis of Bubble Sort
02:04
Sorting Quiz A
10 questions
Insertion Sort
02:37
Insertion Sort Example
02:22
Insertion Sort in C
03:43
Analysis of Insertion sort
04:40
Shell Sort
02:24
Shell Sort Example
02:07
Shell Sort in C
03:24
Analysis of Shell Sort
03:29
Merging two Sorted Arrays
05:54
Recursive Merge Sort
02:29
Recursive Merge Sort in C
03:40
Analysis of Merge Sort
00:36
Iterative Merge Sort
01:31
Iterative Merge Sort in C
02:45
Quick Sort
06:56
Quick Sort in C
06:48
Analysis of Quick Sort
03:00
Binary tree sort
03:05
Binary Tree Sort in C
02:31
Analysis of Binary Tree Sort
01:14
Heap Sort
07:02
Heap Sort : C implementation and Analysis
01:46
04:17
Radix Sort : C implementation and Analysis
05:28
04:50
02:44
01:02
Sorting Records
01:53
Sorting Quiz B
10 questions
• Searching
5 lectures • 35min
Linear Search
04:58
Variations of Linear Search
06:42
Binary Search
06:04
Implementation of Binary Search
13:51
Analysis of Binary Search
02:55
• Hashing
11 lectures • 1hr 10min
04:17
Hashing
06:26
Collisions
02:10
Hash Functions
09:13
10:48
07:40
09:21
05:23
04:31
Separate Chaining
06:54
Implementation of Separate Chaining

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

Subtitles are available for the first section only. Closed Captioning for rest of the sections is in progress and are available as [Auto-generated].

This “Data Structures and Algorithms in C” tutorial will help you develop a strong background in Data Structures and Algorithms. The course is broken down into easy to assimilate short lectures, and after each topic there is a quiz that can help you to test your newly acquired knowledge. The examples are explained with animations to simplify the learning of this complex topic. Complete working programs are shown for each concept that is explained.

This Data Structures and Algorithms using C course provides a comprehensive explanation of data structures like linked lists, stacks and queues, binary search trees, heap, searching, hashing. Various sorting algorithms with implementation and analysis are included in this tutorial. Concept of recursion is very important for designing and understanding certain algorithms so the process of recursion is explained with the help of several examples.

This Data Structures in C course covers following topics with C language implementation :

Stack, Queue, Circular Queue, Dequeue, Priority queue, Polish Notations, Infix to Postfix, Evaluation of Postfix, Binary Tree, Binary Search Tree, Tree Traversal (inorder, preorder, postorder, level order), Recursion, Heap, Searching, Hashing

Sorting : Selection, Bubble, Insertion, Shell, Merging, Recursive Merge, Iterative Merge, Quick, Heap, Binary tree, Radix, Address calculation sort

Here is the course content-

• Algorithm Analysis
• Stack and Queue
• Recursion
• Binary Tree
• Binary Search Tree
• Heap
• Sorting
• Searching
• Hashing

Throughout this Data Structures and Algorithms with C course, a step by step approach is followed to make you understand different Data Structures and Algorithms. You will see code implementation of different data structures in C language and algorithms are explained in step-wise manner. 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.

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

This Learn 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 book / pdf.

This DSA Self Paced course helps students to have great foundation to solve DSA problems.

“Till now I felt Data Structures is a complex subject. But this course is helping to understand how simple they are.”

“This is exactly how I hoped to learn data structure and algorithm, PLUS, it’s using C!!”

“Instructor is teaching in very well and efficient manner with a good pace ,clears every doubts and teaches concepts deeply.”

“Great class, explains topics very well, better than any college class I ever took.”

“yes this course has helped me a lot in discovering new topics and the example programs are also quite helpful.”

“I really appreciate the way the steps are broken down incrementally.”

“Deepali does a great job in explaining all the concept and the course is very well organized. First the concept is explained on paper and then there is a walk through of the code, and then execution of the code. I have learnt a great deal from this course.”

“I am taking notes and writing code side by side watching videos which makes it beneficial to understand the code and easier to grasp the concept of the topic rather than just copying the source code. Thank you Deepali Mam for not giving the source it was better to write the code by myself. The videos are informative, detailed and right on point with step by step code programs and I feel learned a lot taking your course then the class which I took at University. This course made my base of data structures in C pretty strong thank you for that.”

“This is an awesome course. If you need to understand then try to write every code yourself then try to analyze it. that’s how you can gain confidence.”

“I’m re-learning something what I am learn years ago, and this course is perfect for my need.”

“Its quite helpful, it nicely supplements what you have studied in the book.”

“Excellent presentation and content. Easily comprehensible. Since Data Structures and Algorithms are heart of computer science will give a 5 star for this kind of knowledge resource.”

“It is one of the best courses that I have ever taken in Data Structures and C.”

“Good foundation course covering the fundamentals of data structures in C.”

“It’s definitely a good course for beginners who have basic knowledge in C and want to learn Data Structures and Algorithms. Really good explanation by the instructor with experience of even writing a book on Data structures.”

“Till now its above expectations.Mam I am also following your both book “C in Depth” and “Data Structure Using C”.”

“Great in depth explanations of the data structures and algorithms covered.”

“good and perfect teaching for basic levels for beginners in data structures.”

“Very good clarification and reference for common data structures and algorithms.”

“The Course material was very good and the concepts and the logical reasons behind the algorithm is explained.”

“It was a great experience”

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

## Who this course is for:

• Programmers looking for jobs
• Programmers wanting to write efficient code
• Computer Science students have Data Structures as part of their curriculum
• Non-Computer science students wanting to enter the IT industry