Mastering Data Structure Using C

Mastering Data Structure Using C, available at $49.99, has an average rating of 4.15, with 108 lectures, based on 79 reviews, and has 685 subscribers.

You will learn about Stack Queue Linked List Tree Heap Hashing Tries Graph This course is ideal for individuals who are Programmers who are interested to learn DataStructure It is particularly useful for Programmers who are interested to learn DataStructure.

Enroll now: Mastering Data Structure Using C

Summary

Title: Mastering Data Structure Using C

Price: $49.99

Average Rating: 4.15

Number of Lectures: 108

Number of Published Lectures: 108

Number of Curriculum Items: 108

Number of Published Curriculum Objects: 108

Original Price: ?7,900

Quality Status: approved

Status: Live

What You Will Learn

Stack

Queue

Linked List

Tree

Heap

Hashing

Tries

Graph

Who Should Attend

Programmers who are interested to learn DataStructure

Target Audiences

Programmers who are interested to learn DataStructure

As applications are getting complex and data rich, there are three common problems that applications face now-a-days.

Data Search ? Consider an inventory of 1 million(106) items of a store. If the application is to search an item, it has to search an item in 1 million(106) items every time slowing down the search. As data grows, search will become slower.

Processor speed ? Processor speed although being very high, falls limited if the data grows to billion records.

Multiple requests ? As thousands of users can search data simultaneously on a web server, even the fast server fails while searching the data.

To solve the above-mentioned problems, data structures come to rescue. Data can be organized in a data structure in such a way that all items may not be required to be searched, and the required data can be searched almost instantly.

Course Curriculum

Chapter 1: Singly Linked List

Lecture 1: Introduction

Lecture 2: Why Dynamic DataStructure ?

Lecture 3: Why Linked List ?

Lecture 4: What is Linked List ?

Lecture 5: More about Linked List

Lecture 6: How to display linked list ?

Lecture 7: Iterative Implementation of Creating and displaying the linked list

Lecture 8: Recursive Implementation of Creating and displayibf Linked List

Lecture 9: Time and Space Complexity Analysis of Displaying Nodes in Linked List

Lecture 10: How to count Nodes in linked list ?

Lecture 11: Implementation of counting nodes in linked list

Lecture 12: Time and Space Complexity Analysis of counting nodes in linked list

Lecture 13: How to find the sum of all nodes in linked list ?

Lecture 14: Implementation of finding the sum of all nodes in linked list

Lecture 15: Time and Space Complexity Analysis of finding sum of all nodes in linked list

Lecture 16: Finding maximum element in a Linked List

Lecture 17: Implementation of finding maximum element in a Linked List

Lecture 18: Time and Space Complexity Analysis of finding maximum element in linked list

Lecture 19: Searching in a Linked List

Lecture 20: Implementation of Searching in Linked List

Lecture 21: Time and Space Complexity Analysis of Searching in Linked List

Lecture 22: How to insert new node in Linked List ?

Lecture 23: Implementation of inserting new node in Linked List

Lecture 24: Time Complexity Analysis of inserting new node in Linked List

Lecture 25: Recursive Approach of inserting a new node in Linked List

Lecture 26: Implementation of Inserting a new Node in Linked List

Lecture 27: Time and Space Complexity Analysis of Inserting a new node in Linked List

Lecture 28: Creating Linked List using Insert Function

Lecture 29: Implementation of Creating Linked List using Insert Function

Lecture 30: Time and Space Complexity Analysis of Creating Linked List using Insert Function

Lecture 31: Inserting a Node in Sorted Linked List

Lecture 32: Recursive Approach of inserting a new node in Sorted Linked List

Lecture 33: Implementation of inserting a new Node in Sorted Linked List

Lecture 34: Time and Space Complexity of inserting a new node in sorted Linked List

Lecture 35: Deleting a Node from Linked List

Lecture 36: Recursive Approach of deleting a Node from Linked List

Lecture 37: Implementation of deleting a Node from Linked List

Lecture 38: Time and Space Complexity of deleting a node from linked list

Lecture 39: How to check if linked list is sorted ?

Lecture 40: Recursive approach to check if linked list is sorted

Lecture 41: Implementation of checking if linked list is sorted

Lecture 42: Time and Space Complexity Analysis of checking if linked list is sorted

Lecture 43: Removing Duplicates from Linked List

Lecture 44: Recursive Approach of removing duplicates from Linked List

Lecture 45: Implementation of removing duplicates from Linked List

Lecture 46: Time and Space Complexity of removing duplicates from linked list

Lecture 47: Reversing Linked List Method 1

Lecture 48: Implementation of Reversing Linked List Method 1

Lecture 49: Reversing Linked List Method 2

Lecture 50: Implementation of Reversing Linked List Method 2

Lecture 51: Time and Space Complexity Analysis of reversing linked list

Lecture 52: Concatenation and Merging of two Linked List

Lecture 53: Implementation of Concatenating and Merging of two Linked List

Lecture 54: Time and Space Complexity Analysis of Concatenating and Merging Linked List

Lecture 55: Check if Linked List has Loop

Lecture 56: Recursive Approach of checking if linked list has loop

Lecture 57: Implementation of checking if linked list has loop

Lecture 58: Time and Space Complexity of checking if linked list has loop

Chapter 2: Circular Linked List

Lecture 1: How to display circular Linked List ( Iterative and Recursive Approach )

Lecture 2: Implementation of displaying circular linked list

Lecture 3: Time and Space Complexity of displaying circular linked list

Lecture 4: Insertion in Circular Linked List

Lecture 5: Implementation of insertion in Circular Linked List

Lecture 6: Time and Space Complexity of inserting a new Node in Circular Linked List

Lecture 7: How to delete a node in Circular Linked List

Lecture 8: Counting Nodes in Circular Linked List

Lecture 9: Implementation of deleting a Node from Circular Linked List

Lecture 10: Time and Space Complexity Analysis of deleting a Node from Circular Linked List

Chapter 3: Doubly Linked List

Lecture 1: Creating and Displaying Linked List

Lecture 2: Implementation of creating and displaying Doubly Linked List

Lecture 3: Time and Space Complexity of Creating and displaying doubly Linked List

Lecture 4: How to delete a node in doubly linked list ?

Lecture 5: Implementation of How to delete a node in doubly linked list

Lecture 6: Time and Space Complexity Analysis of Deleting a Node from Doubly Linked List

Chapter 4: Stack

Lecture 1: Introduction to Stack DataStructure

Lecture 2: Operations on Stack using Arrays – Part 1

Lecture 3: Operations on Stack using Arrays – Part 2

Lecture 4: Stack Using Linked List – Part 1

Lecture 5: Implementation of Stack Using Linked List

Lecture 6: Time and Space Complexity Analysis of Stack Using Linked List

Chapter 5: Queue

Lecture 1: Introduction to Queue DataStructure

Lecture 2: Queue using Array – Part 1

Lecture 3: Queue using Array – Part 2

Lecture 4: Implementation of Queue using Array

Lecture 5: Drawback of Simple Queue using Array and Circular Queue

Lecture 6: Implementation of circular queue

Lecture 7: Queue Using Linked List

Lecture 8: Implementation of Queue using Linked List

Lecture 9: Double Ended Queue

Chapter 6: Binary Heap

Lecture 1: Binary Heap Part 1

Lecture 2: Binary Heap Part 2

Lecture 3: Binary Heap Part 3

Lecture 4: Implementation of Binary Heap

Chapter 7: Hashing

Instructors

SACHIN NANDHA SABARISH J
Founder, CEO – LearnLogicify Technologies LLP

Rating Distribution

1 stars: 3 votes

2 stars: 2 votes

3 stars: 12 votes

4 stars: 25 votes

5 stars: 37 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!