Data Structures and Algorithms: In-Depth using Python

Course Curriculum

Chapter 1: Course Overview

Lecture 1: Course Introduction

Lecture 2: Get the most out of this course

Lecture 3: Why we need Data Structure ?

Lecture 4: Why Learn Algorithms ?

Lecture 5: Abstract Data Type (ADT)

Lecture 6: Python Installation on Windows

Lecture 7: PyCharm (IDE) Installation on Windows

Chapter 2: Bonus: Python Crash Course (Basics and Fundamentals)

Lecture 1: First Python Program, Data Types and Variables

Lecture 2: Integers & Float Data Types

Lecture 3: Strings Data Types

Lecture 4: Boolean & None Data Types

Lecture 5: Arithmetic Operators & Integer Division

Lecture 6: Relational or Comparison Operators

Lecture 7: Logical Operators

Lecture 8: input() Function

Lecture 9: print() Function

Lecture 10: if, if-else and elif Statements

Lecture 11: range() Function

Lecture 12: while() & for() Loops

Lecture 13: break & continue Statements

Lecture 14: What are Lists?

Lecture 15: Using Lists and List Indexing

Lecture 16: What are Tuples ?

Lecture 17: Tuple Indexing

Lecture 18: Membership & Identity Operators

Lecture 19: What are Dictionaries?

Lecture 20: Using Dictionaries

Lecture 21: What are Functions?

Lecture 22: Writing Functions in Python?

Lecture 23: Importing Modules in Python

Lecture 24: Creating Your Own Modules

Lecture 25: Fundamentals of Object Oriented Programming

Lecture 26: Defining Classes & Creating Objects

Lecture 27: More on __init__ Method (Constructor)

Lecture 28: Understanding self Parameter

Lecture 29: Static and Local Variables

Chapter 3: Analysis of Algorithms

Lecture 1: Time Complexity

Lecture 2: Order of Growth

Lecture 3: Asymptotic Analysis

Lecture 4: Big-Oh Notation

Lecture 5: Big Omega Notation

Lecture 6: Big Theta Notation

Lecture 7: Performance Summary

Lecture 8: Space Complexity

Chapter 4: Recursion and Analysis of Recursive Functions

Lecture 1: How Recursion Works ?

Lecture 2: Iteration vs recursion lets Implement

Lecture 3: Time Complexity of Recursion – Recurrence Relation

Lecture 4: Recurrence Relation – Another example

Lecture 5: Types of Recursion – Tail and Head Recursion

Lecture 6: Types of Recursion – Tree Recursion

Lecture 7: Types of Recursion – Indirect Recursion

Lecture 8: Sum of N Natural Numbers

Lecture 9: Lets Implement Sum of N Numbers

Lecture 10: Factorial

Lecture 11: Lets Implement Factorial

Chapter 5: Searching Algorithms

Lecture 1: Linear Search Algorithm

Lecture 2: Lets Implement Linear Search

Lecture 3: Binary Search Iterative Algorithm

Lecture 4: Lets Implement Binary Search using Iterations

Lecture 5: Binary Search Recursive Algorithm

Lecture 6: Lets Implement Binary Search using Recursion

Chapter 6: Sorting Algorithms

Lecture 1: Sorting Introduction

Lecture 2: Stable and Unstable Sorting

Lecture 3: Selection Sort – Explanation, Algorithm and Analysis

Lecture 4: Selection Sort – Implementation

Lecture 5: Insertion Sort – Explanation, Algorithm and Analysis

Lecture 6: Insertion Sort – Implementation

Lecture 7: Bubble Sort – Explanation, Algorithm and Analysis

Lecture 8: Bubble Sort – Implementation

Lecture 9: Shell Sort – Explanation, Algorithm and Analysis

Lecture 10: Shell Sort – Implementation

Lecture 11: Merge Sort

Lecture 12: Merge Sort – Algorithm

Lecture 13: Merging – Algorithm

Lecture 14: Merge Sort – Complexity Analysis

Lecture 15: Merge Sort – Implementation

Lecture 16: Quick Sort

Lecture 17: Quick Sort – Algorithm

Lecture 18: Quick Sort – Complexity Analysis

Lecture 19: Quick Sort – Implementation

Lecture 20: Count Sort – Explanation, Algorithm and Analysis

Lecture 21: Count Sort – Implementation

Lecture 22: Radix Sort – Explanation, Algorithm and Analysis

Lecture 23: Radix Sort – Implementation

Lecture 24: Python's Built-in Sorting Functions

Lecture 25: Sorting Algorithms – Summary of Complexities

Chapter 7: Linked List

Lecture 1: Why do we use Linked List

Lecture 2: Creating Node of Linked List

Lecture 3: Playing with the links of Linked List

Lecture 4: How to Create Linked List

Lecture 5: Displaying or Traversing Linked List

Lecture 6: Lets Implement Creating and Displaying Linked List