7 रिपॉजिटरी
Implementations of fundamental memory-based structures like linked lists, stacks, queues, and trees for low-level systems programming.
Distinct from Tree Data Structures: The candidates are either UI-specific or purely educational; this tag captures production-ready, low-level algorithmic implementations.
Explore 7 awesome GitHub repositories matching operating systems & systems programming · Data Structures. Refine with filters or upvote what's useful.
This project is a technical reference and educational guide focused on the internal architecture of the Linux kernel. It serves as a low-level systems programming resource and documentation for operating system internals, detailing the implementation of core mechanisms within the kernel source code. The materials provide a detailed study of the Linux kernel, tracing behavior through actual C source and assembly. It specifically covers the progression from the bootloader and decompression to the final kernel entry point, alongside the management of hardware interrupts and symmetric multiproces
Details core organization patterns including doubly linked lists, radix trees, and bit arrays for efficient kernel storage.
This project is a comprehensive library of fundamental computer science algorithms and data structures implemented in C. It provides a collection of modular, portable code blocks designed for educational purposes and integration into production software, focusing on procedural execution and direct hardware interaction. The library distinguishes itself through a focus on low-level systems programming, offering memory-efficient implementations of stacks, queues, linked lists, and trees. It includes specialized suites for cryptographic data protection, audio signal processing, and network commun
Complex information is organized by linking memory addresses directly to create efficient stacks, queues, and trees without high-level overhead.
Blender is a professional 3D creation suite designed for modeling, animation, rendering, and video editing. It functions as an open-source 3D engine that provides a comprehensive framework for procedural geometry, physics simulation, and high-quality visual output. The platform is built upon a foundational architecture that utilizes data-block-based memory management and a dependency-graph-based evaluation system to handle complex scene transformations and geometry updates. The software distinguishes itself through a highly modular, node-based procedural architecture that allows users to cons
Implements foundational memory-based data structures for high-performance graphics pipeline operations.
The Rust Programming Language Book is the official technical guide and educational resource for the Rust language. It provides a comprehensive walkthrough of the language's design, focusing on its core identity as a systems programming language that enforces memory safety and high-performance execution without the need for a garbage collector. The project is distinguished by its focus on ownership, borrowing, and lifetime tracking, which allow the compiler to verify memory safety and thread safety at compile time. It covers the language's unique approach to zero-cost abstractions, including t
Provides low-level, memory-safe implementations of fundamental data structures for systems programming.
F Prime एक कंपोनेंट-आधारित फ्रेमवर्क है जिसे एम्बेडेड और स्पेसफ्लाइट सॉफ्टवेयर के विकास और परिनियोजन (deployment) के लिए डिज़ाइन किया गया है। यह एक मॉड्यूलर आर्किटेक्चर प्रदान करता है जो सॉफ्टवेयर लॉजिक को कम्युनिकेशन इंटरफेस से अलग करता है, जिससे डेवलपर्स को डोमेन-विशिष्ट मॉडलिंग भाषा के माध्यम से सिस्टम संरचनाओं को परिभाषित करने की अनुमति मिलती है। यह मॉडल-आधारित दृष्टिकोण स्वचालित कोड जनरेशन को सक्षम बनाता है, जो जटिल सिस्टम टोपोलॉजी में निरंतरता सुनिश्चित करता है और सॉफ्टवेयर मॉड्यूल के बीच सख्त इंटरफेस अनुबंधों को बनाए रखता है। यह फ्रेमवर्क अपने एकीकृत बिल्ड सिस्टम और ग्राउंड डेटा ऑपरेशंस सूट के माध्यम से खुद को अलग करता है। यह एम्बेडेड सॉफ्टवेयर के पूरे जीवनचक्र को स्वचालित करता है, क्रॉस-कंपाइलेशन और डिपेंडेंसी मैनेजमेंट से लेकर टेलीमेट्री और कमांड इंटरफेस के जनरेशन तक। ऑनबोर्ड फ्लाइट सॉफ्टवेयर और ग्राउंड-आधारित मॉनिटरिंग दोनों के लिए एक एकीकृत वातावरण प्रदान करके, यह विविध हार्डवेयर प्लेटफॉर्मों पर वितरित एम्बेडेड सिस्टम के निर्बाध एकीकरण, परीक्षण और कमांड-एंड-कंट्रोल की सुविधा प्रदान करता है। अपने मुख्य आर्किटेक्चर से परे, इस प्रोजेक्ट में सिस्टम ऑब्जर्वेबिलिटी के लिए व्यापक उपकरण शामिल हैं, जिनमें रीयल-टाइम टेलीमेट्री विज़ुअलाइज़ेशन, इवेंट लॉगिंग और डायग्नोस्टिक ट्रेसिंग शामिल हैं। यह बेयर-मेटल वातावरण से लेकर रीयल-टाइम ऑपरेटिंग सिस्टम तक, परिनियोजन परिदृश्यों की एक विस्तृत श्रृंखला का समर्थन करता है, और मेमोरी मैनेजमेंट, स्टेट-ड्रिवन व्यवहार मॉडलिंग, और एसिंक्रोनस टास्क निष्पादन के लिए तंत्र प्रदान करता है। यह प्रोजेक्ट एक C++ रिपॉजिटरी के रूप में बनाए रखा गया है, जिसमें व्यापक डॉक्यूमेंटेशन और क्रॉस-प्लेटफॉर्म विकास के लिए बिल्ड-सिस्टम सपोर्ट शामिल है।
Automates the creation of serializable structures and enumerations from system models to ensure consistency across software communication.
This project is a comprehensive collection of C++ libraries and toolkits providing reference implementations for data structures, graph algorithms, and bitwise logic. It serves as a C++ algorithm reference containing over 180 solved coding problems and a specialized toolkit for competitive programming. The repository distinguishes itself through extensive low-level bit manipulation libraries for parity checks, endianness detection, and XOR-based logic. It also provides a wide array of reference solutions for complex algorithmic challenges involving backtracking, graph theory, and dynamic prog
Includes scratch implementations of fundamental C++ structures such as linked lists and binary search trees.
This project is a Go algorithm implementation library designed for technical interview preparation. It provides a collection of common data structures and algorithmic solutions to help practice for software engineering coding assessments. The library includes a custom data structure collection featuring linked lists, stacks, queues, trees, and hash maps. It also implements specific algorithmic solutions, such as A* pathfinding for calculating the shortest path between nodes and a real-time stream processor for computing moving averages and running medians from continuous data inputs.
Implements fundamental memory-based structures including linked lists, stacks, queues, and trees.