Learn about memory allocation and garbage collection in Java to prevent memory leaks and build more efficient, robust applications.
Baeldung Author
Eugene Kovko
Here's what I've written (so far):
Baeldung on Java
- All
- Java (6)
- Testing (3)
- DevOps (2)
- Programming (1)
- Java Concurrency (1)
- Java Collections (1)
- Architecture (1)
- Algorithms (1)
External Debugging With JMXTerm
Learn how to use JMXTerm to perform external debugging on a Java application.
Java Modularity and Unit Testing
Explore Java Modularity and learn how it affected the testing in Java applications.
The Difference Between junit-vintage-engine and junit-jupiter-engine
Filed under Testing
Explore the difference between the junit-vintage-engine and the junit-jupiter-engine.
Pipeline Design Pattern in Java
Filed under Architecture, Java
Learn about the Pipeline pattern as a potent tool.
Introduction to Datafaker
Filed under Testing
Learn how to generate mock data for different purposes with Datafaker.
The Problem With ‘src refspec does not match any’
Filed under Programming
Learn how to deal with refspec errors and what is the reason behind them.
Static Fields and Garbage Collection
Filed under Java
Learn how garbage collection in Java deals with classes and static fields.
Permutations of a String in Java
Filed under Algorithms
Learn how we to easily create permutations in Java using third-party libraries.
Volatile vs. Atomic Variables in Java
Filed under Java Concurrency
Learn the difference between the volatile keyword and atomic classes and what problems they solve
Scripted vs Declarative Pipelines in Jenkins
Filed under DevOps
A quick and practical comparison between scripted and declarative pipelines in Jenkins.
Difference Between Map and HashMap in Java
Filed under Java Collections
Learn why interfaces are a great means for abstraction and defining a contract.
The Adapter Pattern in Java
Filed under Java
Understand the Adapter Design Pattern with a practical Java implementation
Baeldung on Computer Science
- All
- Software Architecture (5)
- Programming (4)
- Core Concepts (2)
- Concurrency (2)
- Sorting (1)
- Research (1)
- Path Finding (1)
- OS (1)
- Algorithms (1)
The Printer-Spooler Problem
Filed under Concurrency
Explore the Printer-Spooler problem, which provides valuable insight into the challenges of concurrency control and the necessity of synchronization mechanisms in computer systems.
How to Narrow Down a Research Problem?
Filed under Research
Explore the significance of a good research question, emphasizing its role in refining the scope and aligning research objectives.
The Bounded-Buffer Problem
Filed under Concurrency, OS
Explore the Bounded-Buffer Problem.
Federation in Computing
Filed under Core Concepts
Explore the concept of the federation in computing that enables organizations and systems to collaborate effectively while maintaining autonomy.
Eventual Consistency vs. Strong Eventual Consistency vs. Strong Consistency
Filed under Software Architecture
Explore topics of consistency, strong eventual consistency, and strong consistency depending on the specific requirements and constraints of the distributed system.
Explaining the Context Design Pattern
Filed under Programming, Software Architecture
Explore several patterns that use the idea of context.
Factory Method vs. Factory vs. Abstract Factory
Filed under Programming, Software Architecture
Learn about the Factory pattern and all its flavors.
Dependency Injection vs. Service Locator
Filed under Programming, Software Architecture
Explore two patterns: Dependency Injection and Service Locator.
Builder Pattern vs. Factory Pattern
Filed under Software Architecture
Explore the differences and similarities between the Factory and Builder patterns.
State Pattern vs. Strategy Pattern
Filed under Programming
Explore the differences between the Strategy and the State pattern.
Quicksort vs. Timsort
Filed under Sorting
Explore the differences between Timsort and Quicksort.
Decrease-Key Dijkstra’s Algorithm
Filed under Path Finding
Learn about a priority queue implementation that supports the Decrease-Key in Dijkstra algorithm.
An Introduction to the Theory of Asymptotic Notations
Filed under Algorithms, Core Concepts
Understand the concepts behind the theory of the Big-O notation.