on-demand course

Python 3: Project-based Python, Algorithms, Data Structures

with Mashrur Hossain

September 2019

Beginner

14h 26m

English

Packt Publishing

Closed Captioning available in English

Watch now

Unlock full access

Includes

Earns Badge

Course outline

Introduction
1m 51s
Course structure and content overview
5m 43s
Section intro and overview
5m 55s
Download and install Python
5m 59s
Setup Atom as text editor (setup used in this course)
13m 39s
Exploring Jupyter Notebooks interface (optional)
16m 59s
Section intro and overview
7m 52s
Command line/Terminal basics
6m 27s
Strings, variables, top down execution flow
10m 31s
Strings: concatenation, indexing, slicing, python console
14m 14s
String methods, functions and import statements
17m 21s
Print formatting and special characters
13m 28s
Numbers, math, type casting and input
16m 47s
Introduction to branching (if, elif, else) and conditionals
12m 17s
Building if, elif, else blocks incrementally
12m 54s
Lists, dicts, sets and tuples - Intro to compound data types in Python
11m 2s
Lists - an in-depth look 1
12m 6s
Lists - an in-depth look 2
11m 19s
Dictionaries, sets and tuples
18m 23s
Iterators, for loops, generators, list comprehension
18m 8s
While loops, enumerate, zip
12m 43s
Functions - an introductory look
13m 1s
Functions - implementation step by step
14m 52s
Functions - execution context, frames, mutable vs. immutable arguments in-depth
14m 19s
Classes and objects - an introductory look
9m 29s
Building a custom Student class and intro to special methods
11m 59s
Add some methods to the class
6m 49s
Special methods and what they are
12m 34s
Reading from and writing to files
12m 22s
Add read functionality and utilize special and static methods
19m 46s
Inheritance, subclasses and complete example class
14m 47s
Lambda expressions and map function
10m 38s
Generators - under the hood
6m 41s
Build your own generators using yield
10m 6s
Introduction to section 4 and overview of the material covered in it
1m 18s
Bubble sort demonstration and complexity analysis
5m 39s
Bubble sort implementation
16m 40s
Selection sort demonstration and complexity analysis
9m 11s
Selection sort implementation
13m 2s
Insertion sort demonstration and assignment handoff
5m 23s
Insertion sort programmatic execution step by step
2m 20s
Performance measures - deep dive with a programmatic view
10m 10s
O(nlog(n)) performance and algorithm prerequisites
2m 8s
Analyze log(n), visualize the math behind it and how it relates to algorithms
11m 53s
Merge sort visualization and complexity analysis
13m 35s
Implement merge function - part 1
6m 32s
Implement merge function - part 2
6m 51s
Implement merge function - part 3
5m 0s
A look at the recursive divide function
5m 50s
In-depth look at execution context of recursive divide function
11m 48s
Recursion mini-project 1 - Countdown timer
5m 48s
Recursion mini-project 2 - Factorial
6m 46s
Recursion mini-project 3 - Fibonacci series
7m 21s
Complete merge sort algorithm and analyze updated execution context
7m 27s
Quicksort demo
5m 8s
Quicksort implementation
7m 28s
Section final project objective and motivation
1m 8s
Project specs and runtime execution intro
4m 15s
Project phase 1: Build random int list generator
6m 42s
Project phase 2: Get input from user for size and range
2m 50s
Project phase 3: Add functions, calculate and analyze runtime
7m 35s
Project phase 4: Extract redundancies, create function and cleanup code
9m 48s
Project phase 5: Add multiple run functionality and perform additional testing
5m 37s
Introduction to section 5
1m 11s
Intro to search - Linear, Bisection/Binary search
5m 56s
Bisection/Binary search - Iterative implementation
14m 27s
Bisection search - recursive implementation
9m 19s
Project handoff: Bringing it together
5m 21s
Project conclusion walkthrough
6m 41s
Hashmaps and O(1) search complexity
7m 59s
Hash project 1: Define and set up class blueprint with __init__ and __str__
6m 47s
Hash project 2: Set up insert and hashing functionality for data structure
7m 57s
Hash project 3: Add update functionality
9m 17s
Hash project 4: Build search method
5m 51s
Project: Use hash structure in a practical exercise - Quote finder
6m 7s
Project: Complete quote finder using hash table
8m 49s
Intro to linear data structures - Linked Lists
10m 40s
Build a custom linked list
15m 50s
Recursively reverse a linked list
8m 37s
Visualize Stacks and Queues, and their operations
11m 56s
Introduction to Trees and Binary Search Trees
14m 6s
In-order traversal of a Binary Search Tree
6m 47s
Build a Binary Search Tree from scratch - Insert
13m 7s
BST from scratch - In-order traversal
5m 3s
BST from scratch - Search
5m 17s
BST from scratch - Delete demo
6m 59s
BST - Deleting leaf nodes
13m 11s
BST - Deleting nodes with 1 child node
8m 44s
BST - Deleting nodes with 2 children
12m 27s
Project: Job Scheduler using Binary Search Trees - Introduction
7m 8s
Project: Job Scheduler execution flow
8m 57s
Project: Job Scheduler implementation tips and notes
10m 45s
Thank you for taking the course and next steps
3m 3s

Content preview from Python 3: Project-based Python, Algorithms, Data Structures

Introduction to branching (if, elif, else) and conditionals

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Start your free trial

Algorithms and Data Structures in Python: An overview

Kyle Dewey

Python Data Structures and Algorithms

Benjamin Baka

Python Algorithms: Mastering Basic Algorithms in the Python Language, Second Edition

Magnus Lie Hetland

Data Structures and Algorithms in Python

Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser

Publisher Resources

ISBN: 9781839216510Supplemental Content

Python 3: Project-based Python, Algorithms, Data Structures

with Mashrur Hossain

Chapter 1 : Introduction

Chapter 2 : Development environment setup

Chapter 3 : Python in-depth

Chapter 4 : Algorithms - Sort, performance, complexity and big O notation

Chapter 5 : Algorithms - Search and abstract data structures

Content preview from Python 3: Project-based Python, Algorithms, Data Structures

Introduction to branching (if, elif, else) and conditionals

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

You might also like

Algorithms and Data Structures in Python: An overview

Python Data Structures and Algorithms

Python Algorithms: Mastering Basic Algorithms in the Python Language, Second Edition

Data Structures and Algorithms in Python

Publisher Resources

Chapter 1 : Introduction

Chapter 2 : Development environment setup

Chapter 3 : Python in-depth

Chapter 4 : Algorithms - Sort, performance, complexity and big O notation

Chapter 5 : Algorithms - Search and abstract data structures

Content preview from Python 3: Project-based Python, Algorithms, Data Structures

Introduction to branching (if, elif, else) and conditionals

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,and much more.

You might also like

Algorithms and Data Structures in Python: An overview

Python Data Structures and Algorithms

Python Algorithms: Mastering Basic Algorithms in the Python Language, Second Edition

Data Structures and Algorithms in Python

Publisher Resources

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.