AWK Program Structure AWK scripts are organized into three main blocks: BEGIN block Body block (pattern-action block) END block BEGIN { awk-commands } /pattern/ { awk-commands } END { awk-commands } 1. BEGIN Block The BEGIN block is executed once and only once, before any input line is read. It’s typically used for initialization, such … Read more
In its simplest form, binary search works on a contiguous sequence with specified left and right indices, also known as the search space. It continuously narrows down the search range to eventually locate the target value or determine that it does not exist. Basic Concept Binary search maintains three pointers: left, right, and mid At … Read more
🦜 1. When Someone Tells You to Type curl parrot.live When a friend tells you to type curl parrot.live in your terminal, you might not expect much. Maybe some text? A joke? But then, this happens: Yes, that’s a parrot — dancing in your terminal. This article will demystify how it works, explain how text … Read more
Time complexity is a way to describe how the running time of an algorithm changes relative to the size of its input. In other words, it answers the question: “If I make the input bigger, how much longer will this algorithm take to run?” Key Points: Input size is usually denoted as n. Time complexity … Read more
the most clear modern C++ course for free. cs106L at stanford CS 106L: Standard C++ Programming videos CS 106L Fall 2019 – Lecture 0: Introduction (Screencast) cs106l/cs106l-assignments: Course assignments for CS106L C++ template debugging tool: https://cppinsights.io/ C/C++ to assembly tool: https://godbolt.org/ macro debugger: notfoundry/ppstep: Interactive C/C++ preprocessor macro debugger
roadmap The slide you’ve provided discusses the concept of a "roadmap" in the context of combinatorial motion planning. Here’s an explanation of the key elements: Topological Graph G: A graph $G$ is considered, where: Vertices represent different configurations $q$ that belong to a free configuration space, denoted as $C_{free}$. Edges represent paths $\Pi$ that connect … Read more
pooling server This image explains a Polling Server scheduling policy used in real-time systems, specifically in the context of fixed-priority scheduling. 1. Server Task Release: The server task $\tau_s$ is released periodically with a period $T_s$. This means the server is ready to perform work at regular intervals. 2. Handling Aperiodic Events: When the server … Read more
Overview of the Slide The slide starts by stating that, implementation-wise, most models for local collision avoidance can be classified into three categories. These methods are different ways a robot can process sensor data and decide how to move to avoid obstacles while heading toward a goal. Let’s dive into each one. 1. Force-Based (Related … Read more
