This article explains how Linux thread stacks work, why improper stack size or unchecked recursion can cause crashes and memory leaks, and provides practical debugging tools, stack‑size tuning methods, and optimization techniques—including thread‑pool usage and real‑world case studies—to keep concurrent programs stable and efficient.
This article explains how Linux processes and glibc threads allocate stacks, then details Go's runtime mechanisms for creating thread stacks and lightweight goroutine stacks, including guard‑based detection and automatic stack growth, with code examples and diagrams.
This tutorial shows how C arrays are stored in the stack, global segment, and heap on a 64‑bit Linux system, using gcc compilation, gdb inspection, and concrete memory addresses to illustrate the exact layout of each region.
This article explains the fundamental differences between stack and heap memory allocation, covering their allocation mechanisms, performance characteristics, common pitfalls such as stack overflow and memory leaks, practical code examples in C/C++, and typical interview questions to help developers choose the right memory model for their applications.
This article clarifies whether a C++ vector object resides on the stack, heap, or in static storage, explains that its elements are almost always allocated on the heap, covers special cases like small‑vector optimization, and provides interview‑ready answers with sample code and memory‑location experiments.
The article reflects on why mid‑career engineers are often relegated to legacy‑maintenance work, argues that such roles can be leveraged for growth by modernizing systems and adopting AI, and then presents the classic Valid Parentheses coding challenge, explaining a stack‑based solution with implementations, complexity analysis, and common pitfalls.
This article explains the principles of queues and stacks, demonstrates how to simulate a FIFO queue using two LIFO stacks in PHP, provides full source code, usage examples, complexity analysis, and discusses practical applications and possible extensions.
This article explains the fundamental differences between stack and heap memory, covering their structures, allocation strategies, performance characteristics, language-specific examples in Java, C++, and Python, and provides guidance on when to use each type for efficient programming.
This article explains the Linux kernel’s memory management for a process, covering virtual address spaces, page‑fault handling, VMA allocation, stack and heap initialization, sbrk/brk usage, thread‑stack creation, and the glibc ptmalloc heap allocator with concrete code examples and diagrams.
This guide outlines the core data structures—arrays, 2D arrays, queues, linked lists, stacks, trees, and hash maps—explaining their characteristics, typical use‑case scenarios, and concrete examples to help embedded developers write efficient, scalable code.
This article explains how to replace recursive functions in PHP with stack‑based iteration, loop‑driven depth‑first tree traversal, and even a goto‑based approach, providing complete code examples and discussing the trade‑offs of each method.
This article explains why mastering assembly language is crucial for understanding how computers execute code, covering the nature of low‑level languages, CPU instruction encoding, registers, memory models such as heap and stack, and walks through a complete x86 example with detailed instruction analysis.
This article introduces x86 assembly language, explaining its historical origins, the role of CPU registers such as EAX and ESP, the heap and downward‑growing stack memory models, and demonstrates basic stack‑frame operations like push, call, mov, add, pop, and ret through a simple compiled example.
An overview of the BSS, data, and text segments in program memory—explaining their roles for uninitialized, initialized global variables and executable code, plus heap and stack basics, illustrated with C examples that show how segment placement affects binary size.
The article explains C’s memory allocation, detailing how functions like malloc obtain heap space, the role of system calls such as brk, the distinction between stack and heap, address layout, fragmentation challenges, and practical implications for efficient dynamic memory management.
This article systematically analyzes a function call in an embedded system from four perspectives—assembly code, registers, stack layout, and map files—illustrating how the compiler generates the call, what values each register holds, how the stack is allocated, and how to trace execution using disassembly and memory views.
This article introduces the LeetCode Hard‑level "Basic Calculator" problem, explains its interview background, provides a detailed problem statement with examples, outlines the key algorithmic concepts and solution approach using a stack, and includes a complete Java reference implementation.
This article explains C language memory partitioning—including stack, heap, global/static, constant, and code sections—illustrates their characteristics and growth directions, then applies the concepts to STM32F103 by showing memory map details and providing a complete Keil‑based C program that prints the addresses of variables in each region.
This article explains the C language memory segmentation—including stack, heap, global/static, constant, and code areas—illustrates their behavior on STM32F103 with Keil V5, and provides detailed example code that prints the addresses of variables in each region to demonstrate allocation and lifetime.
This article explains six typical OutOfMemoryError situations in Java—heap, native thread, stack overflow, direct buffer, GC overhead, and Metaspace—provides code examples that trigger each issue, shows the resulting exception messages, and offers practical tips such as using thread pools, limiting recursion depth, adjusting GC settings, and configuring Metaspace to avoid these memory problems.
This article explains the definitions, characteristics, and overflow cases of sequential and circular queues and stacks, provides Java implementations for these data structures, demonstrates their usage with sample code and results, and discusses practical applications of queue thinking in database-driven workflows.
The article explains Go’s stack and heap memory, showing that stack allocations are fast, LIFO‑ordered and compile‑time sized while heap allocations grow upward, require garbage collection, and occur when variables escape a function, urging developers to prefer stack use for better performance.
This article explains the five memory partitions in C, the storage regions created during compilation and linking, the different program segments (code, RO data, RW data, BSS, heap, stack), the proper use of const and pointers, 8051-specific memory qualifiers, and a detailed comparison of stack and heap allocation, including practical code examples.
This article provides a comprehensive guide to C memory organization, covering the five primary memory regions, the layout of compiled C programs, detailed segment types such as code, read‑only, read‑write, BSS, heap and stack, as well as const usage, pointer rules, and embedded‑system storage qualifiers.
The article investigates a real‑world Android navigation bug by dissecting how FLAG_ACTIVITY_NEW_TASK interacts with launch modes, task affinities and intent construction, revealing that the flag does not always behave like singleTask, that START_DELIVERED_TO_TOP may fail to deliver new intents, and offering debugging steps and practical fixes.
This article explains how C programs allocate, resize, initialize, and transfer memory using functions like malloc, free, realloc, memset, memcpy, memmove, and alloca, and provides coding standards to avoid out‑of‑bounds errors, leaks, and use‑after‑free bugs.
This article explains the JVM memory layout, covering the heap (including Xms/Xmx tuning, Young/Old generations, and garbage collection), Metaspace versus PermGen, the thread‑private JVM stack and native method stack, and the program counter register, with practical code examples.
This article explains the JVM memory layout, covering the heap (young and old generations), Metaspace, virtual machine stacks, native method stacks, and the program‑counter register, while describing their roles, configuration parameters and how they interact during garbage collection and method execution.
This article demystifies the JVM’s runtime data areas and illustrates, with a simple Java example and animation, how a program’s bytecode is executed—from the program counter and stack frames to heap allocation and garbage collection—providing a clear, step‑by‑step view of Java execution.
This article explains the JVM memory layout, covering the heap area, its configurable size and generational structure, the Metaspace replacement for PermGen, the thread‑private virtual machine stack and native method stack, as well as the program counter register and related garbage‑collection behavior.
The article walks through building a simple JavaScript HTML parser by explaining browser parsing basics, using regular expressions to detect tags, managing a stack to match opening and closing elements, creating element and text node objects, and outlining code snippets while noting omitted features like script and style handling.
This article explains how the Java Virtual Machine achieves write‑once‑run‑anywhere by abstracting platform differences, then details the JVM’s internal components—including the class‑loader subsystem, runtime data areas such as heap, stack, method area, and program counter—followed by code examples and analysis of object layout, pointer compression, and memory allocation strategies.
This article explains the JVM memory architecture, covering the heap (young and old generations, Eden and Survivor spaces), Metaspace, virtual machine stacks, native method stacks, and the program counter register, while also illustrating key JVM parameters and bytecode execution with examples.
This article explains how to create a basic HTML parser in JavaScript by using regular expressions and a stack to convert an HTML string into a tree of nodes, complete with code examples, initialization steps, and handling of opening, closing, and self‑closing tags.
This article explains how memory allocation on the stack is faster than on the heap, demonstrates the process with assembly instructions, provides benchmark code comparing allocation speeds, discusses compiler optimizations, and outlines the differences, advantages, and pitfalls of stack and heap memory usage.
This article introduces the fundamentals of data structures and algorithms, covering basic structures such as arrays and linked lists, common sorting algorithms, advanced structures like B+ trees and red‑black trees, explains Big O notation, and provides Java code examples for dynamic arrays, linked lists, queues, and stacks.
This article explains the concept of a stack as a LIFO data structure, its hardware implementation in CPUs, how it supports function calls and multitasking, and details the four types of stacks used in Linux—including process, thread, kernel, and interrupt stacks—along with code examples and diagrams.
This article provides a comprehensive overview of the Java Virtual Machine memory architecture, covering heap layout, allocation, tuning parameters, garbage collection, stack frames, method area, metaspace, native method stack, program counter, direct memory, and code cache, with practical code examples and diagnostics.
This article provides a comprehensive overview of the Java Virtual Machine memory layout, covering the heap, metaspace, stack frames, program counter, direct memory, and code cache, along with practical tuning tips, demonstration code for heap OOM, and references for deeper study.
This article examines the various causes of Java OutOfMemoryError, demonstrating heap overflow, stack overflow, metaspace exhaustion, and direct memory exhaustion through practical code examples, and explains how to diagnose and differentiate memory leaks from genuine memory overuse using JVM tools.
This article explains the various types of Java OutOfMemoryError, shows how to trigger each one on HotSpot JVM, provides diagnostic steps and relevant JVM flags, and offers practical code examples for heap, stack, metaspace, and direct memory overflow scenarios.
This article provides a comprehensive overview of data structures and algorithms, covering fundamental concepts such as data, elements, objects, logical and storage structures, common structures like lists, stacks, queues, trees, graphs, algorithm design techniques, complexity analysis, and includes visual resources and code examples.
This article explains the stack data structure, its LIFO characteristics, typical applications such as bracket matching, expression evaluation, next‑greater‑element problems, browser navigation, and JavaScript execution contexts, and provides clear JavaScript code examples for each scenario.
This comprehensive guide explains core data concepts, defines data, data objects, elements and types, explores logical and physical structures, details sequential, linked, indexed and hash storage, and provides Java code examples for arrays, linked lists, stacks, queues, trees, binary search trees, AVL and red‑black trees, illustrating how to choose and implement appropriate structures for real‑world problems.
This article explains Java 8's memory architecture, detailing the differences between JVM-managed memory and native memory, and describing each runtime data area—including the program counter, JVM stack, native method stack, heap, method area, and direct memory—along with common questions about variable storage and native methods.
This article explains the causes of various Java OutOfMemoryError scenarios—including heap, stack, metaspace, and direct memory overflow—provides diagnostic tools, shows reproducible code examples, and offers practical solutions such as adjusting JVM parameters and optimizing code to prevent memory exhaustion.
This article provides a concise overview of eight essential data structures—arrays, linked lists, stacks, queues, hash tables, trees, heaps, and graphs—explaining their definitions, core operations, and typical applications in software development and computer science.
This article explains the difference between value passing and reference passing in Java, clarifies how primitive and object types are stored in stack and heap, and demonstrates the behavior with concrete code examples showing how modifications affect (or do not affect) the original arguments.
This article investigates whether Java int primitives are cached during execution, detailing JVM stack allocation, the specific bytecode instructions (iconst, bipush, sipush, ldc) used for different int ranges, and how local variable tables and operand stacks interact, illustrated with code and bytecode examples.
This article explains the meaning of "stack" in Java, examines the JDK's Stack class implementation—including its inheritance from Vector and core methods—provides full source code, demonstrates array manipulation with System.arraycopy, and explores common stack applications such as browser navigation, function call stacks, and complexity analysis.
This article provides a comprehensive overview of the Java Virtual Machine memory model, detailing each runtime data area—including the heap, stacks, method area, program counter, and direct memory—and explains their purposes and interactions within Java applications.
This article explains the differences between Java's heap and stack memory areas, their advantages and disadvantages, and demonstrates how string objects are allocated and shared with clear code examples that illustrate memory usage and performance implications.
This article explains how Go's runtime initializes, allocates, expands, and shrinks goroutine stack memory, detailing the underlying heap structures, global pools, platform‑specific constants, and the code paths that handle stack growth and reclamation.
This article introduces eight fundamental data structures—arrays, linked lists, stacks, queues, hash tables, trees, heaps, and graphs—explaining their definitions, core operations, typical applications, and visual illustrations to help programmers master essential concepts for software development and technical interviews.
This article introduces eight fundamental data structures—arrays, linked lists, stacks, queues, hash tables, trees, heaps, and graphs—explaining their definitions, core operations, typical applications, and key characteristics to help developers build a solid foundation.
This article provides a comprehensive overview of the Java Virtual Machine memory layout, covering heap regions, Metaspace, stack frames, native method stack, program counter, direct memory, and code cache, along with configuration tips, diagnostic commands, and illustrative code examples to help readers understand memory allocation and garbage collection.
This guide explains the principles of stack (LIFO) and queue (FIFO) data structures, demonstrates how to implement them in Python using classes with methods for push, pop, enqueue, dequeue, and provides complete example code for both stack.py and queue implementations.
This comprehensive guide walks through the four‑layer backend stack, component selection for startups—including languages, databases, messaging, monitoring, and deployment tools—and offers practical advice on choosing cloud providers, defining processes, and designing a cloud‑centric architecture for fast‑moving companies.
This article provides a detailed comparison of Java's List interface implementations—ArrayList, LinkedList, Vector, and Stack—explaining their underlying data structures, key methods such as get, set, add, and remove, performance characteristics, thread safety, and appropriate usage scenarios.
This article explores the maximum number of threads a Java Virtual Machine can support, examining factors such as CPU, operating system, JVM version, and memory, and presents real‑world experiments, code examples, and theoretical calculations to help developers understand and manage thread limits effectively.
This article explains the core concepts of stacks, queues, and priority queues, discusses their time complexities, and provides complete Java implementations using arrays, including methods for insertion, removal, peeking, and display, along with a circular array queue example.
This article explains the differences between Java heap and stack memory, their advantages and disadvantages, and demonstrates how string objects are stored and shared using code examples that illustrate memory allocation and reference behavior.
This article explains the concepts of Call Stack and Stack, demonstrates their operation with JavaScript examples, discusses Node.js default stack size and depth limits, shows how to query and adjust stack size, and examines V8's compilation optimizations across multiple Node versions.
This article explains the differences between stack and heap memory on Android devices, outlines typical memory problems such as high usage, leaks, and overflow, and demonstrates practical testing methods using the dumpsys meminfo command and the LeakCanary library with code examples.
This article explains the stack data structure, its Python interface, and demonstrates practical algorithms such as bracket matching, maze solving, postfix expression evaluation, and the knapsack problem, providing clear code examples and visual illustrations for each concept.
This article explains how LINE Manga uses a custom Page Stack architecture, inspired by iOS UINavigationController, to deliver native‑like, smooth page transitions in a web environment, addressing back‑button latency, scroll restoration, and lazy‑load image issues with practical React/React‑Router examples.
This article explains the structure and operation of the JVM stack, including stack frames, local variable tables, operand stacks, slots, and common bytecode instructions, providing code examples and visual aids to help readers grasp how Java bytecode is executed on the stack.
This article demystifies JavaScript memory by explaining stack and heap concepts, variable objects, primitive and reference types, and the mark‑and‑sweep garbage‑collection algorithm, helping front‑end developers write more efficient code.
This article explains the concept of a stack as a LIFO data structure, shows how to implement a Stack class in JavaScript with essential methods like push, pop, size, empty, peek, and clear, and demonstrates practical usage through recursive and iterative factorial calculations.
This article explains how a running program's code and variables are organized in Linux memory, covering virtual address mapping, the purpose of each segment (text, rodata, data, bss, stack, heap), and demonstrates the concepts with concrete C examples and memory‑map screenshots.
Through a whimsical tale of a class named Account, the article explains Java class loading, the hierarchy of classloaders, bytecode execution, the method area, stack, heap, garbage collection, and debugging, providing an engaging overview of JVM fundamentals.
This article explains the concept of heaps, especially min‑heaps, and demonstrates how PHP's SPL provides ready‑made implementations for stacks, queues, min‑heaps, and fixed‑size arrays with clear code examples.
