Explore the OPT algorithm that minimizes page faults in theory and is a benchmark for evaluating page replacement algorithms in practice.

### Also find me here:

# Baeldung Author

## Amar Kaswan

Amar is an experienced senior researcher with a demonstrated history of publishing high-quality papers and mentoring students in technical education at CFTIs. Skilled in data structures, algorithms, classification, regression, metaheuristic optimization. Hands-on experience in C, C++, Matlab, Latex, Yacc, Flex, MPI, MultiSim, Linux, and Windows through laboratory work and various short terms courses.

## Here's what I've written (so far):

## Baeldung on Computer Science

- All
- Data Structures (2)
- Trees (1)
- Security (1)
- Searching (1)
- Programming (1)
- OS (1)
- Math and Logic (1)
- Algorithms (1)

### Error Detection: Hamming Code

Filed under Security

Learn how to detect errors using the Hamming code.

### Greedy Algorithm to Find Minimum Number of Coins

Filed under Math and Logic, Searching

Learn a greedy algorithm to find the minimum number of coins for making the change of a given amount of money

### Find the Next Higher Number

Filed under Algorithms

Learn an algorithm for finding the next higher number that can be formed using the digits of a given non-negative number.

### Introduction to the Binary Tree Data Structure

Filed under Data Structures, Trees

A quick and practical introduction to the Binary Tree data structure.

### Types of Queues

Filed under Data Structures, Programming

Learn about various types of queues and their applications.