Data Structures and Algorithms In C ( DSA )

Data Structures and Algorithms In C ( DSA ), available at $89.99, has an average rating of 3.98, with 152 lectures, 12 quizzes, based on 1286 reviews, and has 5189 subscribers.

You will learn about Understand the details of Data Structures and algorithms (DSA) through animations Learn to write programs for different Data Structures and Algorithms in C language Get the confidence to face DSA programming interview questions Over 100 Data Structures and Algorithms (DSA) MCQ / interview questions Learn how to analyse algorithms Get the ability to write and trace recursive algorithms This course is ideal for individuals who are Programmers looking for jobs or Programmers wanting to write efficient code or Computer Science students having Data Structures as part of their curriculum or Non Computer science students wanting to enter IT industry It is particularly useful for Programmers looking for jobs or Programmers wanting to write efficient code or Computer Science students having Data Structures as part of their curriculum or Non Computer science students wanting to enter IT industry.

Enroll now: Data Structures and Algorithms In C ( DSA )

Summary

Title: Data Structures and Algorithms In C ( DSA )

Price: $89.99

Average Rating: 3.98

Number of Lectures: 152

Number of Quizzes: 12

Number of Published Lectures: 151

Number of Published Quizzes: 12

Number of Curriculum Items: 164

Number of Published Curriculum Objects: 163

Original Price: $129.99

Quality Status: approved

Status: Live

What You Will Learn

Understand the details of Data Structures and algorithms (DSA) through animations

Learn to write programs for different Data Structures and Algorithms in C language

Get the confidence to face DSA programming interview questions

Over 100 Data Structures and Algorithms (DSA) MCQ / interview questions

Learn how to analyse algorithms

Get the ability to write and trace recursive algorithms

Who Should Attend

Programmers looking for jobs

Programmers wanting to write efficient code

Computer Science students having Data Structures as part of their curriculum

Non Computer science students wanting to enter IT industry

Target Audiences

Programmers looking for jobs

Programmers wanting to write efficient code

Computer Science students having Data Structures as part of their curriculum

Non Computer science students wanting to enter IT industry

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

Instructor is author of popular books “C In Depth” and “Data Structures Through C In Depth” helped 250,000+ students & professionals.

This “Data Structures and Algorithms in C” (DSA) course will help you develop a strong background in Data Structures and Algorithms (DSA). 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 in C (DSA) 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 and Algorithms in C (DSA) course covers following topics with C language implementation :

Algorithm Analysis, Big O notation, Time complexity, Singly linked list, Reversing a linked list, Doubly linked list, Circular linked list, Linked list concatenation, Sorted linked list.

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

Linked List

Stack and Queue

Recursion

Binary Tree

Binary Search Tree

Heap

Sorting

Searching

Hashing

Throughout this Data Structures and Algorithms in C (DSA) course, a step by step approach is followed to make you understand different Data Structures and Algorithms (DSA). 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 (DSA) coding interviews questionsand work on projects. Good foundation on Data Structures and Algorithms in C (DSA) MCQ / interview questions topics helps you to attempt tricky dsa MCQ / interview questions.

In this Data Structures and Algorithms In C (DSA) 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 (DSA) online course on udemy will help software developers to refresh the concepts studied in Data Structures and Algorithms In C (DSA) books / notes / pdf and also to students learning from referred book / notes / pdf.

This DSA Self Paced course helps students to have great foundation to solve DSA in C problems. This will help them to solve LeetCode MCQ / problems and in google faang data structures and algorithms in C (DSA) MCQ / interview questions.

What students are saying about this course-

“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 Buybutton to enroll now and start learning.

Course Curriculum

Lecture 1: Introduction to Data Structures and Algorithms Through C In Depth

Chapter 1: Introduction to Data structures and Algorithms

Lecture 1: Important : Source Code Repository required for course

Lecture 2: Data Structures and Algorithms

Lecture 3: Measuring Running time of Algorithms

Lecture 4: Asymptotic Analysis

Lecture 5: Big O Notation

Lecture 6: Finding Big O

Lecture 7: Tight and Loose Upper Bounds

Lecture 8: Big O analysis of Algorithms

Lecture 9: Finding Time Complexity

Lecture 10: Big O analysis of Algorithms: Examples

Lecture 11: Worst case, Best case and Average Case Analysis

Lecture 12: Common Complexities

Lecture 13: Abstract Data Types

Chapter 2: Linked List

Lecture 1: Introduction to Linked List in C

Lecture 2: Traversing and Searching a Single Linked List

Lecture 3: Finding pointers in a Single linked list

Lecture 4: Difference between while(p!=NULL) and while(p->link!=NULL)

Lecture 5: Insertion in a Single Linked List

Lecture 6: Insertion in a Single Linked List..contd

Lecture 7: Deletion in a Single Linked List

Lecture 8: Your Review Matters!

Lecture 9: Reversing a Single Linked List

Lecture 10: Doubly linked list

Lecture 11: Insertion in a doubly linked List

Lecture 12: Deletion from doubly linked list

Lecture 13: Reversing a doubly linked list

Lecture 14: Circular linked list

Lecture 15: Insertion in a circular Linked List

Lecture 16: Deletion in a circular linked list

Lecture 17: Concatenation

Lecture 18: Linked List with Header Node

Lecture 19: Sorted linked list

Lecture 20: Merging of sorted Linked lists

Lecture 21: Sorting a Linked list using Bubble Sort

Lecture 22: Sorting a Linked list using Merge Sort

Lecture 23: Finding and Removing a cycle in a Linked list

Chapter 3: Stack and Queue

Lecture 1: Introduction

Lecture 2: Stack

Lecture 3: Array Implementation of Stack

Lecture 4: Linked List Implementation of Stack

Lecture 5: Queue

Lecture 6: Array Implementation of Queue

Lecture 7: Linked List implementation of Queue

Lecture 8: Queue through Circular Linked List

Lecture 9: Circular Queue

Lecture 10: Deque

Lecture 11: Priority Queue

Lecture 12: Checking validity of an expression containing nested parentheses

Lecture 13: Function calls

Lecture 14: Evaluating Arithmetic Expressions

Lecture 15: Polish Notations

Lecture 16: Converting infix expression to postfix expression

Lecture 17: Evaluation of postfix expression

Chapter 4: Recursion

Lecture 1: Introduction

Lecture 2: Flow of control in Recursive functions

Lecture 3: Winding and unwinding phase

Lecture 4: Factorial

Lecture 5: Printing numbers from 1 to n

Lecture 6: Sum of digits of an integer

Lecture 7: Base conversion

Lecture 8: Finding nth power of a number

Lecture 9: Euclids Algorithm

Lecture 10: Fibonacci Series

Lecture 11: Tower of Hanoi

Lecture 12: Tail recursion

Lecture 13: Recursion vs. Iteration

Chapter 5: Binary Tree

Lecture 1: Introduction to Trees

Lecture 2: Binary Tree

Lecture 3: Strictly Binary Tree and Extended Binary Tree

Lecture 4: Full binary tree and Complete Binary Tree

Lecture 5: Array Representation of Binary trees

Lecture 6: Linked Representation of Binary Trees

Lecture 7: Traversal in Binary Tree

Lecture 8: Preorder Traversal

Lecture 9: Inorder Traversal

Lecture 10: Postorder Traversal

Lecture 11: Level order traversal

Lecture 12: Finding height of a Binary tree

Lecture 13: Binary Tree in C

Lecture 14: Constructing Binary tree from Traversals

Lecture 15: Constructing binary tree from inorder and preorder traversals

Lecture 16: Constructing binary tree from postorder and inorder traversals

Chapter 6: Binary Search Tree

Lecture 1: Introduction

Lecture 2: Traversal in Binary Search Tree

Lecture 3: Searching in a Binary Search Tree

Instructors

Deepali Srivastava
Author, Ultimate Python Programming

Rating Distribution

1 stars: 58 votes

2 stars: 59 votes

3 stars: 233 votes

4 stars: 452 votes

5 stars: 484 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

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!