Oreilly – Six Small Algorithm Projects with Python 2023-12

Six Small Algorithm Projects with Python. This course is a video tutorial that teaches how to solve programming problems using applied algorithms in the form of six practical projects. One of the most popular courses on the Manning Platform, this course is taught by data scientist Charles Rice and presents the concepts in a practical way. In this course, participants will be introduced to various applications of algorithms, including recursion to draw complex shapes, searching in linked data structures, managing trees, finding shortest paths in networks, scheduling tasks, image processing, and creating fractals. Each project consists of several steps, including working with organization trees, designing networks, analyzing critical paths, applying image filters, optimally assigning tasks, and generating mathematical fractals. By combining theory and practice, this course provides a comprehensive understanding of algorithms, data structures, and programming techniques in Python.

What you will learn:

• Using recursion to draw complex shapes
• Searching in linked data structures
• Layout and drawing of trees
• Using network algorithms to find the shortest paths
• Assigning employees to jobs using algorithms
• A diverse understanding of algorithmic topics
• Familiarity with different data structures
• Improve general programming techniques

Who is this course suitable for?

• Computer science students seeking a practical understanding of algorithms.
• Programmers who want to improve their algorithmic skills.
• Anyone interested in learning how to solve programming problems using algorithms.

Six Small Algorithm Projects with Python course specifications

• Publisher: Oreilly
• Instructor: Charles Rice ,  Rod Stephens
• Training level: Beginner to advanced
• Training duration: 6 hours and 31 minutes

Course headings

• Project 1: Trees
  Milestone 1 – Node Classes
  Milestone 2 – Outline Views
  Milestone 3 – Exhaustive Search
  Milestone 4 – Traversals
  Milestone 5 – Drawing
  Milestone 6 – Org Charts
  Milestone 7 – Updating Sorted Trees
• Project 2: Shortest Paths
  Milestone 1 – Network Classes
  Milestone 2 – Drawing Networks
  Milestone 3 – Test Networks
  Milestone 4 – Selecting Nodes
  Milestone 5 – Shortest Paths
• Project 3: Scheduling
  Milestone 1 – Topological Sorting
  Milestone 2 – PERT Charts
  Milestone 3 – Critical Paths
  Milestone 4 – Gantt Charts
• Project 4: Image Processing
  Milestone 1 – File
  Milestone 2 – Geometry
  Milestone 3 – Point Operations
  Milestone 4 – Enhancements
  Milestone 5 – ImageOps
  Milestone 6 – Filters
  Milestone 7 – Custom Kernels
  Milestone 8 – Special
• Project 5: Work Assignment
  Milestone 1 – Generating Test Networks
  Milestone 2 – Finding Maximal Flows
  Milestone 3 – Assigning Jobs
• Project 6: Fractals
  Milestone 1 – Recursive Line-Drawing Fractals
  Milestone 2 – Strange Attractors
  Milestone 3 – Escape-Time Fractals

Pictures from the Six Small Algorithm Projects with Python course

Sample course video

Download link

Download Part 1 – 1 GB

Download Part 2 – 246 MB

File(s) password: www.downloadly.ir

File size

1.2 GB