What you'll learn
Understand the most important data structures
Implement Data structures from scratch in python
Analyze algorithms using the big O notation
Reverse a linked list
Understand and implement stacks, queues, trees, linked lists and graphs from scratch
Requirements
Very basic python knowledge
Description
You'll learn about the most important and basic data structures that every veteran programmer knows about in detail. By the end of the course, you'll be able to implement these from absolute scratch.The course is designed to help the students write their own code. Each module has explanation parts and implementation parts, you're encouraged to implement an explained topic on your own. Data Structures covered in the course.Singly Linked ListsDoubly Linked ListsStacks QueuesBinary Search TreesGraphsComputational ComplexityAlgorithmsReversing a linked listRecursive and iterative tree traversalBreadth First SearchDepth First SearchAnalysisBig O notationWho is this course for?Many people learn programming and are told to learn data structures and algorithms to pass coding interviews and get jobs. This course is designed for an individual who has some python programming knowledge and wants to get better at it by learning data structures. Even if you have no python experience but know some other programming language, this can be a great chance to learn python. For people who don't know python, this provides programming problems to get better at python.How the course is designedThe course is designed with 7 major modules. We go from installing python, to setting up jupyter notebook to understanding and implementing data structures from scratch. We also visualize computational complexity of different operations we write for these data structures in the final section on computational complexity. What will you get out of itBetter understanding of data structures.More tools at your disposal for solving programming problems.Ability to implement data structures from scratch in python.Opportunity to practice python.
Overview
Section 1: Introduction
Lecture 1 What this course is about
Lecture 2 How to take the course effectively
Section 2: Environment Setup
Lecture 3 Setting up your environment
Section 3: Stacks and Queues
Lecture 4 Section Introduction
Lecture 5 Stack
Lecture 6 Stack Implementation
Lecture 7 Valid Brackets Problem
Lecture 8 Valid Brackets Problem solution
Lecture 9 Queues
Lecture 10 Queue Implementation
Lecture 11 Section Conclusion
Section 4: Singly Linked Lists
Lecture 12 Section Introduction
Lecture 13 Introduction to Linked Lists
Lecture 14 Singly Linked List Implementation
Lecture 15 Singly Linked List: Push Method
Lecture 16 Singly Linked List: Unshift Method
Lecture 17 Singly Linked List: Shift Method
Lecture 18 Singly Linked List Traversal
Lecture 19 Singly Linked List Pop
Lecture 20 Singly Linked List Insert
Lecture 21 Singly Linked List Remove
Lecture 22 Singly Linked List Reverse
Lecture 23 Singly Linked Lists: Conclusion
Section 5: Doubly Linked Lists
Lecture 24 Section Introduction
Lecture 25 Doubly Linked Lists: Introduction
Lecture 26 Doubly Linked Lists: Implementation
Lecture 27 Doubly Linked Lists: Push Method
Lecture 28 Doubly Linked Lists: Unshift Method
Lecture 29 Doubly Linked Lists: Shift Method
Lecture 30 Doubly Linked Lists: Pop Method
Lecture 31 Doubly Linked Lists: Insert Method
Lecture 32 Doubly Linked Lists: Remove
Lecture 33 Doubly Linked Lists: Reverse
Lecture 34 Doubly Linked Lists: Conclusion
Section 6: Binary Search Trees
Lecture 35 Section Introduction
Lecture 36 Binary Search Trees: Introduction
Lecture 37 Binary Search Trees: Implementation
Lecture 38 Binary Search Trees: Insertion Introduction
Lecture 39 Binary Search Trees: Insertion Implementation (Iterative)
Lecture 40 Binary Search Trees: Insertion Implementation (Recursive)
Lecture 41 Binary Search Trees: Preorder Traversal (Part 1)
Lecture 42 Binary Search Trees: Preorder Traversal Part 2
Lecture 43 Binary Search Trees: Inorder Traversal
Lecture 44 Binary Search Trees: Postorder Traversal
Lecture 45 Binary Search Trees: Delete Explanation
Lecture 46 Binary Search Trees: Delete Implementation
Lecture 47 Binary Search Trees: Search
Lecture 48 Binary Search Trees: Conclusion
Section 7: Graphs
Lecture 49 Section Introduction
Lecture 50 Graphs: The Basics
Lecture 51 Graphs: Implementation
Lecture 52 Graphs: Breadth First Search
Lecture 53 Graphs: Depth First Search
Lecture 54 Graphs: Conclusion
Section 8: Computational Complexity
Lecture 55 Section Introduction
Lecture 56 Big O Notation: Introduction
Lecture 57 Big O: Arrays
Lecture 58 Big O: Stacks and Queues
Lecture 59 Big O: Linked Lists
Lecture 60 Big O: Binary Search Trees
Lecture 61 Big O: Graphs
Lecture 62 Big O: Conclusion
Section 9: Course Conclusion
Lecture 63 Course Conclusion and what's next
Beginner python programmers curious about data structures,Beginners wanting to up their programming game,Beginners interested in learning about data structures from scratch

Homepage

https://www.udemy.com/course/data-structures-for-absolute-beginners-in-python/