Udemy
    •  
    •  
    •  
    •  
    •  
    •  
    •  
    •  
Subscribe
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
Mastering Data Structure Using C
Rating: 4.2 out of 5(114 ratings)
858 students

Mastering Data Structure Using C

Let us Master it
Created bySACHIN NANDHA SABARISH J
Last updated 3/2021
English

What you'll learn

  • Stack
  • Queue
  • Linked List
  • Tree
  • Heap
  • Hashing
  • Tries
  • Graph

Course content

8 sections • 108 lectures • 36h 37m total length

  • Introduction12:41
  • Why Dynamic DataStructure ?36:37
  • Why Linked List ?27:37
  • What is Linked List ?27:37
  • More about Linked List30:36
  • How to display linked list ?18:36
  • Iterative Implementation of Creating and displaying the linked list26:24
  • Recursive Implementation of Creating and displayibf Linked List32:05
  • Time and Space Complexity Analysis of Displaying Nodes in Linked List26:15
  • How to count Nodes in linked list ?36:55
  • Implementation of counting nodes in linked list16:01
  • Time and Space Complexity Analysis of counting nodes in linked list27:47
  • How to find the sum of all nodes in linked list ?44:21
  • Implementation of finding the sum of all nodes in linked list14:24
  • Time and Space Complexity Analysis of finding sum of all nodes in linked list23:09
  • Finding maximum element in a Linked List35:42
  • Implementation of finding maximum element in a Linked List14:01
  • Time and Space Complexity Analysis of finding maximum element in linked list24:02
  • Searching in a Linked List26:33
  • Implementation of Searching in Linked List15:49
  • Time and Space Complexity Analysis of Searching in Linked List34:43
  • How to insert new node in Linked List ?33:47
  • Implementation of inserting new node in Linked List15:27
  • Time Complexity Analysis of inserting new node in Linked List18:12
  • Recursive Approach of inserting a new node in Linked List11:15
  • Implementation of Inserting a new Node in Linked List9:55
  • Time and Space Complexity Analysis of Inserting a new node in Linked List14:21
  • Creating Linked List using Insert Function15:46
  • Implementation of Creating Linked List using Insert Function15:46
  • Time and Space Complexity Analysis of Creating Linked List using Insert Function13:04
  • Inserting a Node in Sorted Linked List27:24
  • Recursive Approach of inserting a new node in Sorted Linked List21:32
  • Implementation of inserting a new Node in Sorted Linked List13:32
  • Time and Space Complexity of inserting a new node in sorted Linked List21:24
  • Deleting a Node from Linked List29:45
  • Recursive Approach of deleting a Node from Linked List18:18
  • Implementation of deleting a Node from Linked List16:56
  • Time and Space Complexity of deleting a node from linked list19:23
  • How to check if linked list is sorted ?22:52
  • Recursive approach to check if linked list is sorted21:25
  • Implementation of checking if linked list is sorted15:27
  • Time and Space Complexity Analysis of checking if linked list is sorted23:10
  • Removing Duplicates from Linked List15:05
  • Recursive Approach of removing duplicates from Linked List17:32
  • Implementation of removing duplicates from Linked List12:49
  • Time and Space Complexity of removing duplicates from linked list16:42
  • Reversing Linked List Method 118:40
  • Implementation of Reversing Linked List Method 111:49
  • Reversing Linked List Method 222:54
  • Implementation of Reversing Linked List Method 210:14
  • Time and Space Complexity Analysis of reversing linked list15:38
  • Concatenation and Merging of two Linked List46:33
  • Implementation of Concatenating and Merging of two Linked List28:29
  • Time and Space Complexity Analysis of Concatenating and Merging Linked List18:48
  • Check if Linked List has Loop24:21
  • Recursive Approach of checking if linked list has loop13:07
  • Implementation of checking if linked list has loop24:49
  • Time and Space Complexity of checking if linked list has loop20:21

Requirements

  • Recursion
  • Syntax of C Programming

Description

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.

Who this course is for:

  • Programmers who are interested to learn DataStructure

Report abuse