Computer Science content

    • Build with Naz : Rust, Memory performance & latency - locality, access, allocate, cache lines

      Moore’s Law, the observation that the number of transistors on a chip doubles roughly every 2 years, ended around 2015–2020. This means CPU bound code that runs slowly will run slowly on future CPUs. The traditional approach of Big-O analysis and algorithmic improvements is no longer accurate, since it only accounts for "op-count" and ignores the cost of memory access. Modern CPUs have many cores, but each core isn't getting any faster. So using parallelism is another way to get more performance. Let's explore memory performance and latency in Rust.
    • Algorithms and data structures in TypeScript: non binary tree traversal

      This tutorial is part of a collection of tutorials on basic data structures and algorithms that are created using TypeScript. Information is depicted visually using diagrams and code snippets. This article may be useful if you are trying to get more fluency in TypeScript or need a refresher to do interview prep for software engineering roles.
    • Algorithms and data structures in TypeScript: string tokenizer, rate limiter

      This tutorial is part of a collection of tutorials on basic data structures and algorithms that are created using TypeScript. Information is depicted visually using diagrams and code snippets. This article may be useful if you are trying to get more fluency in TypeScript or need a refresher to do interview prep for software engineering roles.
    • Build a non-binary tree that is thread safe using Rust

      This article illustrates how we can build a non-binary tree in Rust using various approaches until we end up with a version that is thread safe and supports parallel tree walking as well. Topics like interior mutability, sharing ownership, weak and strong references, custom traits for polymorphic behavior, are covered in this article.
    • Algorithms in Kotlin, Schedule ordered tasks

      This tutorial shows how one might schedule ordered tasks that need to be executed when a particular state is reached. However, these states might be reached in any order.
    • Algorithms in Kotlin, Caches, Part 7/7

      This tutorial is part of a collection of tutorials on basic data structures and algorithms that are created using Kotlin. This project is useful if you are trying to get more fluency in Kotlin or need a refresher to do interview prep for software engineering roles.
    • Algorithms in Kotlin, Binary Trees, Part 6/7

      This tutorial is part of a collection of tutorials on basic data structures and algorithms that are created using Kotlin. This project is useful if you are trying to get more fluency in Kotlin or need a refresher to do interview prep for software engineering roles.
    • Algorithms in Kotlin, Graphs, Part 5/7

      This tutorial is part of a collection of tutorials on basic data structures and algorithms that are created using Kotlin. This project is useful if you are trying to get more fluency in Kotlin or need a refresher to do interview prep for software engineering roles.
    • Algorithms in Kotlin, Recursion, Part 4/7

      This tutorial is part of a collection of tutorials on basic data structures and algorithms that are created using Kotlin. This project is useful if you are trying to get more fluency in Kotlin or need a refresher to do interview prep for software engineering roles.
    • Algorithms in Kotlin, Stacks and Queues, Part 3/7

      This tutorial is part of a collection of tutorials on basic data structures and algorithms that are created using Kotlin. This project is useful if you are trying to get more fluency in Kotlin or need a refresher to do interview prep for software engineering roles.
    • Algorithms in Kotlin, Strings, Part 2/7

      This tutorial is part of a collection of tutorials on basic data structures and algorithms that are created using Kotlin. This project is useful if you are trying to get more fluency in Kotlin or need a refresher to do interview prep for software engineering roles.
    • Algorithms in Kotlin, Big-O-Notation, Part 1/7

      This tutorial is part of a collection of tutorials on basic data structures and algorithms that are created using Kotlin. This project is useful if you are trying to get more fluency in Kotlin or need a refresher to do interview prep for software engineering roles.

    Subscribe to RSS feed