Udemy

Advanced Algorithms and Data Structures in Python

立即報名
  • 3,351 名學生
  • 更新於 1/2022
4.6
(73 個評分)
  • 提示:
  • 透過本站連結購買Udemy課程,本站將獲得推廣佣金,有助未來提供更多實用進修課程資訊給讀者。

課程資料

報名日期*
全年招生
課程級別
學習模式
修業期
10 小時 21 分鐘
教學語言
英語
授課導師
Holczer Balazs
評分
4.6
(73 個評分)
課程連結
*提示: 以上時間表僅供參考,以機構網站為準。

課程簡介

Advanced Algorithms and Data Structures in Python

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

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)

  • theory behind the binary indexed tree or Fenwick tree data structure

  • how to use this data structure in computer vision and artificial intelligence

  • implementation in Python

Chapter 2: LRU Caches

  • what are caches and why are they so important

  • how to use doubly linked lists to implement caches

  • theory behind LRU caches

  • implementation in Python

Chapter 3: Splay Trees

  • what are splay trees

  • how to achieve caches with splay trees

Chapter 4: B-Trees

  • external memory and internal memory (RAM)

  • data structures for the external memory

  • trees with multiple children and multiple keys

  • what are B-tree data structures?

Chapter 5: Prefix Trees (Tries)

  • what are tries or prefix trees

  • real world applications of tries

  • autocomplete feature of tries

  • sorting with tries

  • IP routing

Chapter 6: Ternary Search Trees

  • what are ternary search trees

  • boggle game with tries

Chapter 7: Substring Search Algorithms

  • what are substring search algorithms and why are they important in real world softwares

  • brute-force substring search algorithm

  • hashing and Rabin-Karp method

  • Knuth-Morris-Pratt substring search algorithm

  • Z substring search algorithm (Z algorithm)

  • implementations in Python

Chapter 8: Topological Ordering

  • what is topological ordering (topological sort)?

  • topological ordering implementation with depth-first search

Chapter 9: Cycle Detection

  • how to detect cycles in graphs?

Chapter 10: Strongly Connected Components (Tarjan's Algorithm)

  • what are strongly connected components?

  • Tarjan's algorithm with depth-first search

Chapter 11: Hamiltonian cycles (Travelling Salesman Problem)

  • Hamiltonian cycles in graphs

  • what is the travelling salesman problem?

  • how to use backtracking to solve the problem

  • meta-heuristic approaches to boost algorithms

Chapter 12: Eulerian Cycles (Chinese Postman Problem)

  • Eulerian cycles in graphs

  • what is the chinese postman problem?

Thanks for joining my course, let's get started!


課程章節

  • 17 個章節
  • 80 堂課
  • 第 1 章 Introduction
  • 第 2 章 Fenwick Trees (Binary Indexed Trees)
  • 第 3 章 LRU Caches
  • 第 4 章 Splay Tree Data Structure
  • 第 5 章 B-Trees
  • 第 6 章 Trie Data Structures (Prefix Trees)
  • 第 7 章 Interview Questions - IP Routing with Tries
  • 第 8 章 Ternary Search Trees
  • 第 9 章 Interview Questions - Boggle Game
  • 第 10 章 Substring Search Algorithms
  • 第 11 章 Topological Ordering
  • 第 12 章 Cycle Detection
  • 第 13 章 Strongly Connected Components (Tarjan's Algorithm)
  • 第 14 章 Hamiltonian Cycles - Travelling Salesman Problem
  • 第 15 章 Eulerian Cycles - Chinese Postman Problem
  • 第 16 章 Algorhyme FREE Algorithms Visualizer App
  • 第 17 章 Course Materials (DOWNLOADS)

課程內容

  • 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


評價

  • M
    MADAKA JAYANTHI JAYANTHI
    2.5

    good

  • G
    Gusst Zanna
    5.0

    This guy is just too damn good!

  • M
    Mürşide Aki
    5.0

    It is very useful course and I learned lots of things thank you:)

  • J
    Jiefei Wang
    4.0

    Overall it is great. A bit easier than than the expectation. Some part of contents are not consistent in this version. For example, the Caches section refers to Splay Tree, which is the section after the Caches in this version; the Splay Tree section refers to Red-Black tree, which is removed in this version.

立即關注瀏覽更多

本網站使用Cookies來改善您的瀏覽體驗,請確定您同意及接受我們的私隱政策與使用條款才繼續瀏覽。

我已閱讀及同意