Advanced Search
Search Results
29 total results found
5.8 Advanced Project: A Multi-Sensor Data Logger
In this chapter, we will build a complete data logging application that utilizes all the core concepts we have learned: hardware interrupts for precise data acquisition, queues for safe data transfer, multiple tasks with different priorities for processing and...
Tutorial: Setting Up a Collaborative Jupyter Lab
This tutorial outlines the steps to set up a collaborative Jupyter Lab environment for multiple users. Make sure to follow each step carefully. A. Initial Preparation Create a Tmux Session: Open your terminal and run the command: tmux new -t your_se...
Surat Menyurat
Template EMAS
Header EMAS 1 - Literal Header <p dir="ltr" style="text-align: center;"><img src="https://emas3.ui.ac.id/draftfile.php/2625380/user/draft/495439476/Logo.png" alt="Logo" width="256" height="256" class="img-fluid atto_image_button_text-top"></p> <p dir="ltr" s...
1. Motivation: The Quest for the Ideal Sorting Algorithm
In our study of advanced sorting algorithms, we have explored powerful techniques that offer significant performance improvements over basic O(n²) methods. However, these advanced algorithms often come with their own set of trade-offs. Let's recap two of the m...
2. Prerequisite: An Introduction to the Tree Data Structure
Before we can understand the Heap, we must first be familiar with its underlying structure: the Tree. In computer science, a tree is a widely used data structure that simulates a hierarchical structure, with a set of connected nodes. Core Components Every tr...
3. The Heap Data Structure
Now that we understand the concept of a binary tree, we can define a Heap. A Heap is a specialized tree-based data structure that satisfies two specific properties. The Two Defining Properties of a Heap For a binary tree to be considered a Heap, it must adhe...
4. Core Operations and the Heap Sort Algorithm
The Heap Sort algorithm is a two-phase process that masterfully uses the properties of the Max-Heap. Both phases rely on a core "helper" operation that maintains the heap property. The Engine of the Heap: The siftdown Operation To build and maintain a heap, ...
5. The Heap in Practice: The C++ Standard Template Library (STL)
While understanding how to build Heap Sort from scratch is crucial for algorithmic knowledge, in modern C++, we often leverage the powerful abstractions provided by the Standard Template Library (STL). The concepts of a heap are primarily exposed through std::...