Mastering critical SKILLS in Data Structures using C

Understand DS inner details & design decisions effects + Solve ~130 problems to enhance your problem-solving skills
Mastering critical SKILLS in Data Structures using C
File Size :
6.69 GB
Total length :
19h 51m

Category

Instructor

Dr. Moustafa Saad Ibrahim

Language

Last update

2/2023

Ratings

4.8/5

Mastering critical SKILLS in Data Structures using C

What you’ll learn

Learn from basic to advanced data structures
~180 explained problems from Easy to Medium to Hard + quizzes
Well-written and modular short codes
Short but very informative and deep material
A fundamental step toward improving problem solving skills
A fundamental step toward interviews preparation
Algorithms course should be an easier learning experience

Mastering critical SKILLS in Data Structures using C

Requirements

Programming skills, Recursion, Pointers and Class Little Basics

Description

Almost all other courses focus on knowledge. In this course, we focus on gaining real skills.Overall:The course covers basic to advanced data structuresLearn the inner details of the data structures and their time & memory complexity analysisLearn how to code line-by-lineSource code and Slides and provided for all contentAn extensive amount of practice to master the taught data structures (where most other content fails!)~180 problems from easy to hard!Content:Asymptotic ComplexityVectorSingly Linked ListDoubly Linked ListProject: Sparse Array and MatrixStackQueueBinary TreeBinary Search TreeBinary HeapAVL TreeLetter Tree (Trie)Hash TableExtensive Homework sets with video solutionsTeaching Style:Instead of long theory then coding style, we follow a unique styleI parallelize the concepts with the codes as much as possibleGo Concrete as possibleUse Clear VisualizationBy the end of the journeySolid understanding of Data Structures topics in C++Mastering different skillsAnalytical and Problem-Solving skillsClean coding for data structuresBlack-box applying on DSWith the administered problem-solving skillsYou can start competitive programming smoothly [DS type]Smooth start in Algorithms courseOne more step toward interviews preparationPrerequisitesProgramming Skills:Up to arrays & functionsComfortable with recursive functionsComfortable with pointersBasics of OOP: Just Class, Private and Public Sections.Preferred: Learning and using STLProject Building SkillsBasic Programming Problem-Solving SkillsIt is going to be a transformative experience. Please read reviews to get a flavour of that. It is not going to be easy work. It will be Stanford-like course. You can skip homework if you want easier or shorter learning experience. Don’t miss such a unique learning experience!

Overview

Section 1: Getting Started

Lecture 1 What is a Data Structure?

Lecture 2 Why Data Structures?

Lecture 3 Effective usage of the course

Lecture 4 Resources and Students Community

Lecture 5 Important Note

Section 2: Vector

Lecture 6 Vector

Lecture 7 Appending operation

Lecture 8 Capacity Trick

Lecture 9 Insertion

Lecture 10 Abstract Data Type

Lecture 11 The missing steps

Lecture 12 Vector Homework – 5 Medium Challenges

Lecture 13 Vector Homework – Solutions

Section 3: Asymptotic Complexity

Lecture 14 Asymptotic Complexity (1)

Lecture 15 Asymptotic Complexity (2)

Lecture 16 Asymptotic Complexity (3)

Lecture 17 Asymptotic Complexity (4)

Section 4: Singly Linked List

Lecture 18 The Node

Lecture 19 Display Nodes

Lecture 20 Singly Linked List

Lecture 21 Traversal

Lecture 22 Effective Coding and Debugging for linked list

Lecture 23 SLL Homework 1 – 6 Easy Challenges

Lecture 24 SLL Homework 1 – Solutions

Lecture 25 Deletion

Lecture 26 Logical and physical Data Structures

Lecture 27 Important Update

Lecture 28 SLL Homework 2 – 5 Easy Challenges

Lecture 29 SLL Homework 2 – 5 Easy Challenges NOTE

Lecture 30 SLL Homework 2 – Solutions p1 p2 p3

Lecture 31 SLL Homework 2 – Solutions p4 p5

Lecture 32 SLL Homework 3 – 6 Medium Challenges

Lecture 33 SLL Homework 3 – Solutions p1 p2 p3

Lecture 34 SLL Homework 3 – Solutions p4 p5 p6

Lecture 35 SLL Homework 4 – 5 Medium to Hard Challenges

Lecture 36 SLL Homework 4 – Solutions p1 p2 p3

Lecture 37 SLL Homework 4 – Solutions p4 p5

Section 5: Doubly Linked List

Lecture 38 Doubly Linked List

Lecture 39 DLL Insertion

Lecture 40 DLL Deletion

Lecture 41 DLL Homework 1 – 4 Easy to Medium Challenges

Lecture 42 DLL Homework 1 – Solutions

Lecture 43 DLL Homework 2 – 4 Medium to Hard Challenges

Lecture 44 DLL Homework 2 – Solutions p1

Lecture 45 DLL Homework 2 – Solutions p2

Lecture 46 DLL Homework 2 – Solutions p3

Lecture 47 DLL Homework 2 – Solutions p4

Section 6: Project: Sparse Array and Matrix

Lecture 48 Description

Lecture 49 Solution Part 1

Lecture 50 Solution Part 2

Section 7: Stack

Lecture 51 What is Stack

Lecture 52 Array-based Stack

Lecture 53 Homework 1 – 6 Easy to Medium Challenges

Lecture 54 Homework 1 – Solutions p1 p2 p3

Lecture 55 Homework 1 – Solutions p4

Lecture 56 Homework 1 – Solutions p5 p6

Lecture 57 Homework 2 – 6 Medium to Hard Challenges

Lecture 58 Homework 2 – Solutions p1

Lecture 59 Homework 2 – Solutions p2 p3

Lecture 60 Homework 2 – Solutions p4

Lecture 61 Homework 2 – Solutions p5

Lecture 62 Homework 2 – Solutions p6

Lecture 63 Linked-list-based Stack

Lecture 64 Infix, Postfix and Prefix Notation

Lecture 65 Infix to Postfix 1

Lecture 66 Infix to Postfix 2

Lecture 67 Homework 3 – 5 Medium to Hard Challenges

Lecture 68 Homework 3 – Solutions p1 p2 p3

Lecture 69 Homework 3 – Solutions p4 p5

Section 8: Queue

Lecture 70 Simple Queue

Lecture 71 Circular Queue

Lecture 72 Linked-list-based Queue

Lecture 73 Homework 1 – 4 Easy to Medium Challenges

Lecture 74 Homework 1 – solutions

Lecture 75 Homework 2 – 3 Medium to Hard Challenges

Lecture 76 Homework 2 – Solutions

Lecture 77 STL Vector, Stack, Queue

Section 9: Binary Tree

Lecture 78 Trees

Lecture 79 Binary Tree Node

Lecture 80 Binary Tree Traversal 1

Lecture 81 Binary Tree Traversal 2

Lecture 82 Binary Tree Traversal 3

Lecture 83 Binary Tree Types

Lecture 84 Binary Tree Formulas

Lecture 85 Binary Tree Creation

Lecture 86 Homework 1 – 6 Easy Challenges

Lecture 87 Homework 1 – Solutions

Lecture 88 Homework 2 – 6 Medium to Hard Challenges

Lecture 89 Homework 2 – Solutions

Lecture 90 Level Order Traversal

Lecture 91 Homework 3 – 3 Medium to Hard Challenges

Lecture 92 Homework 3 – solutions

Lecture 93 Binary Tree Generation

Lecture 94 Homework 4 – 2 Medium Challenges

Lecture 95 Homework 4 – solutions

Lecture 96 Binary Tree Serialization

Lecture 97 Homework 5 – 3 Medium Challenges

Lecture 98 Homework 5 – solutions

Section 10: Binary Search Tree

Lecture 99 Binary Search Tree

Lecture 100 BST Insertion

Lecture 101 Homework 1 – 5 Easy to Medium Challenges

Lecture 102 Homework 1 – solutions p1 p2 p4 p5

Lecture 103 Homework 1 – Solutions p2 FIX

Lecture 104 Homework 1 – Solution p3

Lecture 105 BST Min & Successor 1

Lecture 106 BST Min & Successor 2

Lecture 107 Homework 2 – 3 Medium Challenges

Lecture 108 Homework 2 – solutions p1

Lecture 109 Homework 2 – solutions p2 p3

Lecture 110 Homework 3 – 4 Medium to Hard Challenges

Lecture 111 Homework 3 – Solutions

Lecture 112 BST Deletion 1

Lecture 113 BST Deletion 2

Lecture 114 BST Deletion 3- Design Consequences

Lecture 115 Homework 4 – 3 Easy to Medium Challenges

Lecture 116 Homework 4 – solutions p1 p2

Lecture 117 Homework 4 – p3 Solution

Section 11: Binary Heap

Lecture 118 Binary Heap

Lecture 119 Binary tree using array representation

Lecture 120 Heap Insertion

Lecture 121 Heap Deletion

Lecture 122 Heap Creation

Lecture 123 Homework 1 – 5 Easy to Medium Challenges

Lecture 124 Homework 1 – Solutions

Lecture 125 STL Priority Queue

Lecture 126 Homework 2 – 4 Medium to Hard Challenges

Lecture 127 Homework 2 – Solutions

Section 12: AVL Tree

Lecture 128 Self-balancing BST

Lecture 129 Tree Rotation

Lecture 130 Imbalance Types

Lecture 131 AVL Insertion

Lecture 132 AVL Deletion

Lecture 133 STL Set & Map

Lecture 134 Homework 1 – 7 Medium to Hard Challenges

Lecture 135 Homework 1 – solutions p1 p2 p3

Lecture 136 Homework 1 – solutions p4

Lecture 137 Homework 1 – solutions p5

Lecture 138 Homework 1 – solutions p6

Lecture 139 Homework 1 – solutions p7

Section 13: Letter Tree (Trie)

Lecture 140 Letter Tree

Lecture 141 Trie Implementation

Lecture 142 Homework 1 – 5 Easy to Medium Challenges

Lecture 143 Homework 1 – Solutions p1 p2 p3

Lecture 144 Homework 1 – Solutions p4 p5

Lecture 145 Homework 2 – 3 Medium Challenges

Lecture 146 Homework 2 – Solution p1

Lecture 147 Homework 2 – Solution p2

Lecture 148 Homework 2 – Solution p3

Lecture 149 Homework 3 – 2 Hard Challenges

Lecture 150 Homework 3 – Solutions p1

Lecture 151 Homework 3 – Solutions p2

Section 14: Hash Table

Lecture 152 Hash Function

Lecture 153 Overflow in Hash Functions

Lecture 154 Hash Table

Lecture 155 Chaining

Lecture 156 Chaining Implementation

Lecture 157 Homework 1 – 5 Medium Challenges

Lecture 158 Homework 1 – Solutions p1 p2 p3

Lecture 159 Homework 1 – Solutions p4

Lecture 160 Homework 1 – Solutions p5

Lecture 161 Probing

Lecture 162 Probing Implementation

Lecture 163 Unordered Set and Map

Lecture 164 Homework 2 – 5 Medium Challenges

Lecture 165 Homework 2 – Solutions p1

Lecture 166 Homework 2 – Solutions p2 p3

Lecture 167 Homework 2 – Solutions p4

Section 15: Review: 1D Arrays Problem-Solving

Lecture 168 1D Arrays

Lecture 169 1D Arrays Practice 1

Lecture 170 1D Arrays Practice 2

Lecture 171 Homework 1 – 5 Easy to Medium Challenges

Lecture 172 Homework 1 – Solutions p1 p2 p3

Lecture 173 Homework 1 – Solutions p4 p5

Lecture 174 Homework 2 – 6 Medium Challenges

Lecture 175 Homework 2 – Solutions p1 p2

Lecture 176 Homework 2 – Solutions p3 p4

Lecture 177 Homework 2 – Solutions p5 p6

Lecture 178 Homework 3 – 5 Hard Challenges

Lecture 179 Homework 3 – Solutions p1 p2

Lecture 180 Homework 3 – Solutions p3

Lecture 181 Homework 3 – Solutions p4

Lecture 182 Homework 3 – Solutions p5

Section 16: Review: Char Arrays Problem-Solving

Lecture 183 Char Arrays 1

Lecture 184 Char Arrays 2

Lecture 185 Char Arrays Practice

Lecture 186 Homework 1 – 6 Easy to Medium Challenges

Lecture 187 Homework 1 – Solutions p1 p2

Lecture 188 Homework 1 – Solutions p3

Lecture 189 Homework 1 – Solutions p4

Lecture 190 Homework 1 – Solutions p5 p6

Lecture 191 Homework 2 – 3 Medium Challenges

Lecture 192 Homework 2 – Solutions p1

Lecture 193 Homework 2 – Solutions p2

Lecture 194 Homework 2 – Solutions p3

Lecture 195 Homework 3 – Application

Lecture 196 Homework 3 – Application Solution

Section 17: Review: Multidimensional Arrays Problem-Solving

Lecture 197 Multidimensional Arrays 1

Lecture 198 Multidimensional Arrays 2

Lecture 199 Position neighbours

Lecture 200 Practice 1

Lecture 201 Practice 2

Lecture 202 Homework 1 – 3 Easy Challenges

Lecture 203 Homework 1 – Solutions p1 p2 p3

Lecture 204 Homework 2 – 4 Medium to Hard Challenges

Lecture 205 Homework 2 – Solutions p1 p2 p3 p4

Lecture 206 Homework 3 – Application

Lecture 207 Homework 3 – Application Solution

Section 18: Thank You

Lecture 208 Bonus

Mastering inner details of several important data structures,Not just learn, but strongly apply & alter data structures,whoever want to master more of computer science fundamentals

Course Information:

Udemy | English | 19h 51m | 6.69 GB
Created by: Dr. Moustafa Saad Ibrahim

You Can See More Courses in the Developer >> Greetings from CourseDown.com

New Courses

Scroll to Top