17 OCT 2024 - Welcome Back to TorrentFunk! Get your pirate hat back out. Streaming is dying and torrents are the new trend. Account Registration works again and so do Torrent Uploads. We invite you all to start uploading torrents again!
TORRENT DETAILS
[FTUForum.com] [UDEMY] Algorithmic Problems In Python [FTU]
TORRENT SUMMARY
Status:
All the torrents in this section have been verified by our verification system
• Implement feedforward neural networks from scratch
Course content
all 40 lectures 04:04:05
Requirements
• Basic Python
Description
This course is about the fundamental concepts of algorithmic problems, focusing on recursion, backtracking and dynamic programming. As far as I am concerned these techniques are very important nowadays, algorithms can be used (and have several applications) in several fields from software engineering to investment banking or R&D.
Section 1:
• what is recursion
• stack memory and recursion
• factorial numbers problem
• Fibonacci numbers
• towers of Hanoi problem
• recursion vs iteration
Section 2:
• what is backtracking
• n-queens problem
• Hamiltonian cycle problem
• knight's tour problem
• coloring problem
• NP-complete problems
Section 3:
• what is dynamic programming
• Fibonacci numbers
• knapsack problem
• coin change problem
• rod cutting problem
In each section we will talk about the theoretical background for all of these algorithms then we are going to implement these problems one by one.
The first chapter is about recursion. Why is it crucial to know about recursion as a computer scientist? Why stack memory is crucial in recursion? We will consider several recursion related problems such as factorial problem or Fibonacci numbers. The second chapter is about backtracking: we will talk about problems such as n-queens problem or hamiltonian cycles and coloring problem. In the last chapter we will talk about dynamic programming, theory first then the concrete examples one by one: Fibonacci sequence problem and knapsack problem.
Thanks for joining the course, let's get started!
Who this course is for:
• This course is meant for newbies who are not familiar with algorithmic problems in the main or students looking for some refresher.
VISITOR COMMENTS (0 )
FILE LIST
Filename
Size
0. Websites you may like/How you can help Team-FTU.txt
237 B
1. Introduction/1. Introduction.mp4
11.9 MB
1. Introduction/1. Introduction.vtt
2.1 KB
2. Backtracking/1. Backtracking introduction.mp4
14.4 MB
2. Backtracking/1. Backtracking introduction.vtt
6.8 KB
2. Backtracking/10. Knight tour implementation.mp4
21.1 MB
2. Backtracking/10. Knight tour implementation.vtt
9.7 KB
2. Backtracking/11. UPDATE Knight's Tour.html
716 B
2. Backtracking/12. Maze problem introduction.mp4
6.8 MB
2. Backtracking/12. Maze problem introduction.vtt
4.1 KB
2. Backtracking/13. Maze problem implementation.mp4
20.7 MB
2. Backtracking/13. Maze problem implementation.vtt
9 KB
2. Backtracking/14. NP-complete problems.mp4
9 MB
2. Backtracking/14. NP-complete problems.vtt
4.5 KB
2. Backtracking/2. N-queens problem introduction.mp4
22.6 MB
2. Backtracking/2. N-queens problem introduction.vtt
12.1 KB
2. Backtracking/3. N-queens problem implementation.mp4
29 MB
2. Backtracking/3. N-queens problem implementation.vtt