Hands-On Data Structures and Algorithms in Rust

Hands-On Data Structures and Algorithms in Rust, available at $64.99, has an average rating of 4.65, with 49 lectures, 7 quizzes, based on 203 reviews, and has 2092 subscribers.

You will learn about How Rust can help you keep your memory access safe and effective How we can use Rust to build Generic Algorithms that we can use again and again across our codebase Greedy, dynamic, and Iterative algorithms and when to use them Different data structures such as Maps, Trees, and Linked lists, and when it is appropriate to use them. Why and how an Entity Component System separates the different parts of the object into different storage areas How we can build files that work like simple databases using BTrees How we can run our programs even faster-using Multithreading This course is ideal for individuals who are This course is for programmers who want to get to grips with all data structures and algorithms in the latest version of Rust programming language, to help organize your code better and accomplish predefined tasks. It is particularly useful for This course is for programmers who want to get to grips with all data structures and algorithms in the latest version of Rust programming language, to help organize your code better and accomplish predefined tasks.

Enroll now: Hands-On Data Structures and Algorithms in Rust

Summary

Title: Hands-On Data Structures and Algorithms in Rust

Price: $64.99

Average Rating: 4.65

Number of Lectures: 49

Number of Quizzes: 7

Number of Published Lectures: 49

Number of Published Quizzes: 7

Number of Curriculum Items: 56

Number of Published Curriculum Objects: 56

Original Price: $109.99

Quality Status: approved

Status: Live

What You Will Learn

How Rust can help you keep your memory access safe and effective

How we can use Rust to build Generic Algorithms that we can use again and again across our codebase

Greedy, dynamic, and Iterative algorithms and when to use them

Different data structures such as Maps, Trees, and Linked lists, and when it is appropriate to use them.

Why and how an Entity Component System separates the different parts of the object into different storage areas

How we can build files that work like simple databases using BTrees

How we can run our programs even faster-using Multithreading

Who Should Attend

This course is for programmers who want to get to grips with all data structures and algorithms in the latest version of Rust programming language, to help organize your code better and accomplish predefined tasks.

Target Audiences

This course is for programmers who want to get to grips with all data structures and algorithms in the latest version of Rust programming language, to help organize your code better and accomplish predefined tasks.

Rust is a modern systems programming language designed with safety to simplify the development of large, complex software projects. Data structure and Algorithms are key to help in the collection and organization of the data for performing operations on the data and set instructions/logic to accomplish tasks in these projects. This course will be your guide for implementing classic data structures and algorithms in Rust, helping you to get up and running as a confident Rust programmer.

You will begin with a primer to Rust and its syntax. You will then explore the language of Time and Memory complexity by comparing different sorting methods. You’ll then learn about Lists and Binary Trees, implement them, and compare them, to show the advantages and use cases of each. Next, you will cover different algorithms in-depth such as sorting, graph, dynamic programming, greedy, divide and conquer, and more. You will learn how counterintuitive techniques can actually make it easier to build scalable projects!

By the end of the course, you will have a sound knowledge of the key data structures and algorithms in Rust to confidently implement them in your applications.

About the Author

Matthew Stoodley is a programming expert and enthusiast, who was drawn to learn about Rust and master its features initially due to its low power usage and memory safety capabilities. He primarily uses Rust to build board games.

In addition, he also possesses several years of experience in Go, PHP, and JavaScript.

Course Curriculum

Chapter 1: Getting to Grips with Rust and its Syntax

Lecture 1: Course Overview

Lecture 2: Install Rust and Running a Simple Program

Lecture 3: Build complex structures with Struct and Enum

Lecture 4: Results and Options

Lecture 5: Looping Mechanisms in Iterators

Lecture 6: Stack Data Structure in Rust

Lecture 7: Mutability, Variables, Copying, and Cloning

Lecture 8: Use Memory Effectively with Pointers and Lifetimes

Lecture 9: Own Memory on the Heap with Box, String, and Vecs

Lecture 10: Difference Between Str and String

Lecture 11: Uploading to Crates

Chapter 2: Algorithm Complexity and Sorting Algorithms

Lecture 1: Sorting Using Bubble Sort

Lecture 2: Divide and Conquer Sorting with Merge Sort

Lecture 3: Sorting in Place with Quick Sort

Lecture 4: Improving Our Quick Sorter with Pseudo Random Numbers

Lecture 5: Spiting Quick Sort Using Multiple Threads

Lecture 6: Let Rayon Speed It Up with Work Stealing

Lecture 7: Cut the Right Corners to Increase Your Speed with Dynamic Programming

Chapter 3: Building Linked Lists and Binary Trees

Lecture 1: Creating a Linked List

Lecture 2: Viewing Data in Both Directions with Doubly Linked Lists

Lecture 3: Building a Binary Tree to Efficiently Store and Sort Data

Lecture 4: Converting Binary Tree to a Binary Balance Tree

Lecture 5: Learning About Skip Lists and Their Potential Advantages

Lecture 6: Managing the Heights of a Skip List

Lecture 7: Computing Huffman Encoding and to Compress Data

Chapter 4: Model Real Situations as Graphs of Connected Nodes

Lecture 1: Consider the Options for Creating and Storing Graphs

Lecture 2: Filling the Graph

Lecture 3: Route Structure

Lecture 4: Finding the Shortest Path

Lecture 5: A Greedy Solution to the Travelling Salesman

Lecture 6: Improve the Solution Using Iterative Methods

Chapter 5: Getting Constant Time Data Access Using HashMap

Lecture 1: What a HashMap Is and Why and When Do We Use Them

Lecture 2: Building HashMap from Scratch

Lecture 3: Building a Bucket List for the HashMap to Use

Lecture 4: Finishing the HashMap

Lecture 5: Testing and Improving Our HashMap

Lecture 6: HashMap versus BTreeMap

Chapter 6: Organizing Your Data by Type with Entity Component Systems

Lecture 1: Understand What an ECS Is and How It Differs from Traditional Structures

Lecture 2: Creating an ID Generator

Lecture 3: Creating Data Stores

Lecture 4: Building ECS Systems

Lecture 5: Combining It All into a Simple CLI Game

Lecture 6: Introduction to Specs

Chapter 7: Persistent Storage Data Structure

Lecture 1: Creating a Blob Data File

Lecture 2: Converting Any Data Size to Byte String

Lecture 3: Creating a Blob Store

Lecture 4: Adding to the Blob Store

Lecture 5: Reading from the Blob Store

Lecture 6: Removing an Element from the Blob Store

Instructors

Packt Publishing
Tech Knowledge in Motion

Rating Distribution

1 stars: 4 votes

2 stars: 7 votes

3 stars: 21 votes

4 stars: 65 votes

5 stars: 106 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!