Data Structures and Algorithms Using C - Complete Course

Sundeep Saradhi Kanthety via YouTube

Start learning Write review

Details

Start learning

Provider

YouTube
Pricing

Free Video
Languages

English
Duration & workload

1 day 22 hours 36 minutes
Sessions

On-Demand
Level

Intermediate

Found in

Learn fundamental data structures and algorithms through comprehensive hands-on programming tutorials using C and Python. Master essential concepts including arrays, linked lists (single, circular, and doubly), stacks, queues, and their practical implementations. Explore advanced topics such as binary trees, binary search trees, AVL trees with rotations, graph theory including DFS and BFS traversals, and minimum spanning tree algorithms like Prim's and Kruskal's. Develop proficiency in sorting algorithms including bubble sort, insertion sort, selection sort, merge sort, heap sort, quick sort, radix sort, and shell sort, alongside searching techniques like linear and binary search. Understand hashing concepts including hash functions, collision handling techniques such as separate chaining, linear probing, quadratic probing, and double hashing. Practice tree operations including traversals, construction from different traversal combinations, and expression tree building. Gain expertise in graph representations, terminology, and spanning tree algorithms with step-by-step examples and practical coding exercises in both C and Python programming languages.

Syllabus

DS_1-Introduction to Data Structures | Must-Know for Every CS Student | DSA using C
DS_2-Arrays in Data Structures | Advantages & Limitations Explained | DSA using C
DS_3-Single Linked List in C | Creation and Display Explained Step-by-Step | DSA using C
DS_4-Single Linked List in C | Insertion at Beginning, End & Specific Position | DSA using C
DS_5-Single Linked List in C | Deletion from Beginning, End & Specific Position | DSA using C
DS_6-Single Linked List in C | Count Nodes & Reverse the List Easily | DSA using C
DS_7-Singly Linked List | Advantages & Disadvantages Explained Clearly | DSA using C
DS_8-Circular Linked List in C | Create and Display Explained Step-by-Step | DSA using C
DS_9-Circular Linked List in C | Insertion at Beginning, End & Specific Position | DSA using C
DS_10-Circular Linked List in C | Deletion from Beginning, End & Any Position | DSA using C
DS_11-Doubly Linked List in C | Create and Display Explained Step-by-Step | DSA using C
DS_12-Doubly Linked List in C | Insertion at Beginning, End & Specific Position | DSA using C
DS_13-Doubly Linked List in C | Deletion from Beginning, End & Specific Position | DSA using C
DS_14-Stack Using Arrays in C | Implementation Explained Step-by-Step | DSA using C
DS_15-Queue Using Arrays in C | Step-by-Step Implementation Tutorial | DSA using C
DS_16-Stack Using Linked List in C | Step-by-Step Implementation | DSA using C
DS_17-Queue Using Linked List | Linked List Based Enqueue & Dequeue | DSA using C
DS_18-Infix to Postfix Conversion | Stack Application in Data Structures | DSA using C
DS_19-Infix to Postfix Conversion Examples | Stack Application in Data Structures | DSA using C
DS_20-Evaluation of Postfix Expression | Stack Application in C Programming | DSA using C
DS_21-Check Balanced Parentheses Using Stack | Data Structures in C | DSA using C
C_38,DS_22-Linear Search in C | Step-by-Step with Example | DSA using C
C_39,DS_23- Binary Search Algorithm Explained in C | Step-by-Step with Example | DSA using C
C_40,DS_24-Bubble Sort Algorithm | Step-by-Step Explanation with Example | DSA using C
C_41,DS_25- Insertion Sort Algorithm | Step-by-Step Explanation with Example | DSA using C
DS_26-Selection Sort Algorithm | Step-by-Step Explanation with Example | DSA using C
D_27-Merge Sort Algorithm | Step-by-Step Explanation with Example | DSA using C
D_28-Heap Sort Algorithm | Step-by-Step Explanation with Example | DSA using C
DS_29-Quick Sort Algorithm | Step-by-Step Explanation with Example | DSA using C
DS_30-Radix Sort & Bucket Sort in C | Step-by-Step with Example | DSA using C
DS_31Shell Sort Algorithm | Step-by-Step Explanation with Example | DSA using C
DS_32-Tree Terminology in Data Structures | Root, Leaf, Edge, Level & More Explained | DSA using C
DS_33-Binary Trees in Data Structures | Types of Binary Trees Explained | DSA using C
DS_34-Binary Tree Representation in C | How Binary Trees Are Represented | DSA using C
DS_35-Binary Tree Traversals Explained | Inorder, Preorder, Postorder with ExampleN | DSA using C
DS_36-Build an Expression Tree | Data Structures Simplified | DSA using C
DS_37-Binary Tree Construction Using Inorder and Preorder Traversals | DSA using C
DS_38-Binary Tree Construction Using Inorder and Postorder | Step-by-Step in C | DSA using C
DS_39-Binary Search Tree (BST) in C | Full Operations Explained | DSA using C
DS_40-Binary Search Tree (BST) Construction & Insertion | Step-by-Step in C | DSA using C
DS_41-Binary Search Tree Deletion | Step-by-Step Logic with Examples | DSA using C
DS_42-Find Element in BST | Binary Search Tree Search Operation | DSA using C
DS_43-Minimum Element in Binary Search Tree | Step-by-Step in C | DSA using C
DS_44-Maximum Value in Binary Search Tree | Step-by-Step in C | DSA using C
AVL TREE - DATA STRUCTURES
ROTATIONS IN AVL TREES - DATA STRUCTURES
AVL TREE CONSTRUCTION | ELEMENT INSERTION - DATA STRUCTURES
GRAPH TERMINOLOGY & TYPES OF GRAPHS - DATA STRUCTURES
REPRESENTATION OF GRAPHS - DATA STRUCTURES
DEPTH FIRST SEARCH(DFS) | GRAPH TRAVERSALS - DATA STRUCTURES
BREADTH FIRST SEARCH(BFS) | GRAPH TRAVERSALS - DATA STRUCTURES
INTRODUCTION TO SPANNING TREE AND MINIMUM COST SPANNING TREE IN DATA STRUCTURES || DATA STRUCTURES
PRIM'S ALGORITHM || FINDING MINIMUM COST SPANNING TREE || DATA STRUCTURES
EXAMPLE TO FIND MINIMUM COST SPANNING TREE USING PRIM'S ALGORITHM || PRIM'S ALGORITHM EXAMPLE
KRUSKAL'S ALGORITHM || FINDING MINIMUM COST SPANNING TREE || DATA STRUCTURES
Linear Data Structures Using C || Course for Beginners || Arrays, Lists, Stacks, Queues Explained
Non-Linear Data Structures Using C || Trees & Graphs Explained || Full DSA Course | Easy Explanation
Top 5 Free Websites for Practice Coding || Practice Coding || Learn Coding from Free Websites
Coding on Your Smart TV: Execute C, C++, Java, Python Programs || Execute Programs on SmartTV
Introduction to HASHING in Data Structures || Hash Functions,Hash Table, Hash Keys,Hash Values in DS
COLLISION HANDLING TECHNIQUES || SEPERATE CHAINING || OPEN AND CLOSED HASHING || HASHING IN DS
LINEAR PROBING || COLLISION HANDLING TECHNIQUES || OPEN AND CLOSED HASHING || HASHING IN DS
DOUBLE HASHING || COLLISION HANDLING TECHNIQUES || OPEN AND CLOSED HASHING || HASHING IN DS
QUADRATIC PROBING || COLLISION HANDLING TECHNIQUES || OPEN AND CLOSED HASHING || HASHING IN DS
Hash Functions in Data Structures || Division Method || Mid Square || Folding Method || DS
REHASHING IN DATA STRUCTURES || HASHING IN DS
Linear Data Structures and Algorithms in Python - 8 Hour Deep Dive with Code || DSA using Python