Udemy
    •  
    •  
    •  
    •  
    •  
    •  
    •  
    •  
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
Aspect-Oriented Programming Using Rust and C++
Rating: 3.3 out of 5(3 ratings)
449 students

Aspect-Oriented Programming Using Rust and C++

Algorithms with Rust and C++, Learning functional programming and basic algorithms.
Created byAbhinav Raj
Last updated 9/2024
English
English [Auto],

What you'll learn

  • Rust
  • C++
  • Space Time Complexity
  • Optimizations
  • Algorithms

Course content

1 section • 7 lectures • 48m total length

  • Introduction to Algorithms 1021:40

    Explore space and time complexity concepts using Python for high-level ideas and Rust for benchmarking. Learn how language choices influence algorithm efficiency and how to calculate space-time complexity.

  • Algorithms5:57

    Visualize breadth-first search on a graph using Rust collections like HashMap, HashSet, and VecDeque, with visited and queue and an iterative print of graph elements, and hint at depth-first search.

  • Algorithms I16:03

    Explore breadth-first search in Rust and C++ using hash maps, vectors, and a queue to traverse a graph, track visited nodes, and print results from a main function.

  • Algorithms II1:46

    Explore a maze of variables and mappings, focusing on indicative direction moments and how to map directions for variables as we introduce x minus one and related values.

  • Algorithms III7:35

    Demonstrates implementing algorithms in c++ using standard containers such as stack, queue, list, and unordered_map, with turtle movement and screen drawing to illustrate grid-based logic.

  • Algorithms IV14:13

    Explore how algorithms control turtle motion in a C++ program, using grid-based movement, random and user-input strategies, and simple AI to drive motion dynamics.

  • Algorithm Implementation I1:43

    Explore algorithm implementation for a turtle moving on a grid, comparing random, user input, and simple (or zero x) options, with delta x and delta y and wasd controls.

Requirements

  • Prior programming experience and self-learning approach based on instructions.

Description

Welcome guys this is the second part of the Algorithmic Programming Series. "Algorithms 101 " is an advanced course designed for students who wish to deepen their understanding of sophisticated algorithmic techniques and their applications in solving real-world problems. Building on the foundational knowledge of basic algorithms and data structures, this course delves into complex algorithms, including graph algorithms, string processing, advanced dynamic programming, and more. With Rust and C++ intuitive syntax and a rich ecosystem of libraries, students will learn to implement these advanced algorithms efficiently, enhancing their problem-solving skills and preparing them for challenges in advanced software development, data science, and machine learning.

What You Will Learn:

  • Advanced-Data Structures: Dive into more complex data structures like balanced trees, heaps, disjoint set unions, and understanding their implementation and applications in Rust and C++.

  • Graph Algorithms: Learn the basics of Graph algorithms.

  • String Algorithms: Learn algorithms for string processing, such as string matching, tries, and suffix arrays.

  • Advanced Dynamic Programming: Go beyond the basics with advanced dynamic programming techniques for solving intricate problems with overlapping subproblems and optimal substructure properties.

  • Algorithmic Paradigms: Theoretical underpinnings and practical implementations.

  • Real-World Projects: Apply advanced algorithms to real-world problems through hands-on projects and build the essentials to start your self-paced learning.


Who this course is for:

  • This course is intended for students and software engineers.

Report abuse