Udemy - Advanced Algorithms and Data Structures in Python 2022

seeders: 10
leechers: 7
updated:
Download torrent
Added by freecoursewb in Other > Tutorials
Download Fast Safe Anonymous
movies, software, shows...

Files

[ DevCourseWeb.com ] Udemy - Advanced Algorithms and Data Structures in Python 2022
  • Get Bonus Downloads Here.url (0.2 KB)
    • ~Get Your Files Here ! 01 - Introduction
    • 001 Introduction.mp4 (11.2 MB)
    • 001 Introduction_en.vtt (2.4 KB)
    02 - Fenwick Trees (Binary Indexed Trees)
    • 001 What are Fenwick trees.mp4 (45.6 MB)
    • 001 What are Fenwick trees_en.vtt (13.2 KB)
    • 002 Fenwick trees theory - tree structure.mp4 (17.7 MB)
    • 002 Fenwick trees theory - tree structure_en.vtt (4.9 KB)
    • 003 Fenwick trees theory - update.mp4 (30.6 MB)
    • 003 Fenwick trees theory - update_en.vtt (9.0 KB)
    • 004 Fenwick trees implementation I.mp4 (26.5 MB)
    • 004 Fenwick trees implementation I_en.vtt (8.4 KB)
    • 005 Fenwick trees implementation II.mp4 (42.4 MB)
    • 005 Fenwick trees implementation II_en.vtt (9.6 KB)
    03 - LRU Caches
    • 001 Why to use cache.mp4 (17.8 MB)
    • 001 Why to use cache_en.vtt (3.9 KB)
    • 002 LRU cache illustration.mp4 (28.2 MB)
    • 002 LRU cache illustration_en.vtt (8.9 KB)
    • 003 LRU cache implementation I.mp4 (34.3 MB)
    • 003 LRU cache implementation I_en.vtt (10.5 KB)
    • 004 LRU cache implementation II.mp4 (44.6 MB)
    • 004 LRU cache implementation II_en.vtt (11.0 KB)
    • 005 LRU cache implementation III.mp4 (25.3 MB)
    • 005 LRU cache implementation III_en.vtt (5.0 KB)
    04 - Splay Tree Data Structure
    • 001 What are splay trees.mp4 (55.3 MB)
    • 001 What are splay trees_en.vtt (15.9 KB)
    • 002 Splay tree introduction - example.mp4 (10.6 MB)
    • 002 Splay tree introduction - example_en.vtt (4.6 KB)
    • 003 Splay trees implementation I.mp4 (27.6 MB)
    • 003 Splay trees implementation I_en.vtt (7.8 KB)
    • 004 Splay trees implementation II.mp4 (34.2 MB)
    • 004 Splay trees implementation II_en.vtt (8.0 KB)
    • 005 Splay trees implementation III.mp4 (54.4 MB)
    • 005 Splay trees implementation III_en.vtt (9.9 KB)
    • 006 Splay trees application.mp4 (16.2 MB)
    • 006 Splay trees application_en.vtt (3.6 KB)
    05 - B-Trees
    • 001 What is external memory.mp4 (38.6 MB)
    • 001 What is external memory_en.vtt (9.7 KB)
    • 002 Disk access times.mp4 (21.1 MB)
    • 002 Disk access times_en.vtt (5.0 KB)
    • 003 What are B-trees.mp4 (29.4 MB)
    • 003 What are B-trees_en.vtt (9.5 KB)
    • 004 B-tree introduction - insertion.mp4 (21.5 MB)
    • 004 B-tree introduction - insertion_en.vtt (13.6 KB)
    • 005 B-tree introduction - deletion.mp4 (15.3 MB)
    • 005 B-tree introduction - deletion_en.vtt (7.9 KB)
    • 006 B-tree variants and file systems.mp4 (23.0 MB)
    • 006 B-tree variants and file systems_en.vtt (5.8 KB)
    06 - Trie Data Structures (Prefix Trees)
    • 001 What are tries (prefix trees).mp4 (41.0 MB)
    • 001 What are tries (prefix trees)_en.vtt (11.4 KB)
    • 002 Prefix tree introduction - insertion and searching.mp4 (25.5 MB)
    • 002 Prefix tree introduction - insertion and searching_en.vtt (11.4 KB)
    • 003 Prefix tree introduction - sorting.mp4 (12.4 MB)
    • 003 Prefix tree introduction - sorting_en.vtt (5.0 KB)
    • 004 Prefix tree introduction - autocomplete.mp4 (12.5 MB)
    • 004 Prefix tree introduction - autocomplete_en.vtt (4.5 KB)
    • 005 Prefix tree introduction - associative arrays.mp4 (11.5 MB)
    • 005 Prefix tree introduction - associative arrays_en.vtt (5.8 KB)
    • 006 Tries data structure implementation I.mp4 (50.7 MB)
    • 006 Tries data structure implementation I_en.vtt (12.6 KB)
    • 007 Tries data structure implementation II.mp4 (34.7 MB)
    • 007 Tries data structure implementation II_en.vtt (7.2 KB)
    • 008 Tries data structure implementation III.mp4 (67.9 MB)
    • 008 Tries data structure implementation III_en.vtt (12.0 KB)
    • 009 Trie data structures as associative arrays.mp4 (28.8 MB)
    • 009 Trie data structures as associative arrays_en.vtt (5.0 KB)
    • 010 Hashing based data structures and tries.mp4 (27.4 MB)
    • 010 Hashing based data structures and tries_en.vtt (8.1 KB)
    • 011 Applications of trie data structures.mp4 (27.7 MB)
    • 011 Applications of trie data structures_en.vtt (6.4 KB)
    07 - Interview Questions - IP Routing with Tries
    • 001 Networking and the longest common prefix problem.mp4 (28.6 MB)
    • 001 Networking and the longest common prefix problem_en.vtt (8.8 KB)
    • 002 Longest common prefix implementation.mp4 (44.6 MB)
    • 002 Longest common prefix implementation_en.vtt (8.8 KB)
    08 - Ternary Search Trees
    • 001 What are ternary search trees.mp4 (27.0 MB)
    • 001 What are ternary search trees_en.vtt (7.6 KB)
    • 002 Ternary search tree visualization.mp4 (25.3 MB)
    • 002 Ternary search tree visualization_en.vtt (12.7 KB)
    • 003 Ternary search tree implementation I.mp4 (35.4 MB)
    • 003 Ternary search tree implementation I_en.vtt (7.7 KB)
    • 004 Recursion and stack memory visualization.mp4 (35.7 MB)
    • 004 Recursion and stack memory visualization_en.vtt (9.7 KB)
    • 005 Ternary search tree implementation II.mp4 (28.8 MB)
    • 005 Ternary search tree implementation II_en.vtt (6.2 KB)
    • 006 Ternary search tree implementation III.mp4 (37.7 MB)
    • 006 Ternary search tree implementation III_en.vtt (6.4 KB)
    09 - Interview Questions - Boggle Game
    • 001 What is boggle and how to solve it.mp4 (23.7 MB)
    • 001 What is boggle and how to solve it_en.vtt (8.6 KB)
    • 002 Boggle game with ternary search tree implementation I.mp4 (38.9 MB)
    • 002 Boggle game with ternary search tree implementation I_en.vtt (8.3 KB)
    • 003 Boggle game with ternary search tree implementation II.mp4 (65.5 MB)
    • 003 Boggle game with ternary search tree implementation II_en.vtt (13.5 KB)
    • 004 Boggle game with ternary search tree implementation III.mp4 (22.7 MB)
    • 004 Boggle game with ternary search tree implementation II

Description

Advanced Algorithms and Data Structures in Python 2022



https://DevCourseWeb.com

MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz
Language: English | Size: 2.63 GB | Duration: 10h 21m

Fenwick trees, Caches, Splay Trees, Prefix Trees (Tries), Substring-Search Algorithms and Travelling Salesman Problem

What you'll learn
Have a good grasp of algorithmic thinking
Be able to develop your own algorithms
Be able to detect and correct inefficient code snippets
Understand Fenwick trees
Understand caches (LRU caches and Splay Trees)
Understand tries and ternary search trees
Understand substring search algorithms (Rabin-Karp method, KMP algorithm and Z algorithm)
Understand the Hamiltonian cycle problem (and travelling salesman problem)
Understand Eulerian cycle problem
Requirements
Python basics
Some theoretical background (big O notation )
Description
This course is for those who are interested in computer science and want to implement the algorithms and given data structures in Python. In every chapter you will learn about the theory of a given data structure or algorithm and then you will implement them from scratch.

Chapter 1: Binary Indexed Trees (Fenwick Trees)



Download torrent
2.6 GB
seeders:10
leechers:7
Udemy - Advanced Algorithms and Data Structures in Python 2022
Loading...