Jump to content

Dear members, finally, we decided to refresh our theme. Decision was brought based on multiple factors, primarily because of technical needs as old one is not compatible with a new platform version, but also because you all asked for a darker theme.
Here you go!

Please head here if you want to vote https://www.elite7hackers.net/topic/411861-the-new-theme/


This site uses cookies! Learn More

This site uses cookies!

For providing our services, we do use cookies.
But get used, this is what most of modern web do!
However we have to warn you since we are obligated to so due to EU laws.

By continuing to use this site, you agree to allow us to store cookies on your computer. :)
And no, we will not eat your computer nor you will be able to eat those cookies :P

Sign in to follow this  

Algorithms and Data Structures in Python - Part II

Recommended Posts

Algorithms and Data Structures in Python - Part II
.MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz, 2 Ch
Genre: eLearning | Language: English + .VTT | Duration: 3 hours | Size: 929 MB

Fenwick trees, caches, prefix trees and substring-search algorithms implemented in Python
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
Python basics
Some theoretical background ( big O notation )
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
theory behind LRU caches
implementation in Python
Chapter 3: Prefix Trees (Tries)
what are tries or prefix trees
real world applications of tries
implementation in Python
Chapter 4: Substring Search Algorithms
what are substring search algorithms and why are they important in real world softwares
brute-force substring search algorithm
Boyer-Moore algortihm
Knuth-Morris-Pratt substring search algorithm
implementation in Python
Thanks for joining my course, let's get started!
Who is the target audience?
This course is suited for anyone who has some basic knowledge in Python


Buy Premium From My Links To Get Resumable Support,Max Speed & Support Me
[b]Download (Uploadgig)[/b]
Download ( Rapidgator )
Download ( NitroFlare )

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  

Elite7Hackers Netwok

Hack the imagination!

Support and inquiries

Open support ticket here or email us at [email protected]


Highlighted/recommended lights


Important Information

By using this site, you agree to our Privacy Policy and Terms of Use.