Data Structures on Oguz Yilmaz Blog

Kubernetes series Part 1: Understanding and Installing Kubernetes

Wed, 22 Dec 2021 11:18:09 +0300

What is Kubernetes?

Kubernetes is an open-source container orchestration platform that automates the deployment, scaling, and management of containerized applications. Originally developed by Google, it is now maintained by the Cloud Native Computing Foundation (CNCF) and supported by a large community of contributors.

Kubernetes has become essential infrastructure for modern application deployment and management. As organizations move towards microservices and cloud-native architectures, understanding Kubernetes is crucial for developers and operations teams alike.

Graphs

Mon, 08 Mar 2021 11:18:09 +0300

In this article we will look into another Abstract Data Type (ADT) called Graphs. First I will talk about what is a graph, then I will show how we represent them in code and finally I will show some common operations and algorithms that can be performed on graphs. Let’s get started!

What is a graph?

A graph is simply a web of nodes connected to each other in some way. These nodes are called vertices and the connections between them are called edges. Each node can have values associated with it.

Arrays

Tue, 02 Feb 2021 11:18:09 +0300

If you’re learning programming, one of the first and most fundamental data structures you’ll encounter is the array. Arrays are incredibly useful and show up all the time in code, so having a solid grasp of how they work is essential. In this article, we’ll take an in-depth look at what arrays are, how they work under the hood, and some key operations and concepts. Let’s jump in!

What is an array ?

Fundamentally, an array is an abstract data type (ADT) that stores a collection of elements, each of which is identified by an index. An ADT is a mental model that defines a set of properties and operations that a data structure must have. For an array for example we want the index is a non-negative integer and that integer will represent the position of an element in the array. We also want to have some operations on the array, such as accessing an element, updating an element, deleting an element, and searching for an element.

Hash Maps

Mon, 18 Jan 2021 11:18:09 +0300

We’ve talked about arrays, linked lists, and other fundamental data structures. Now, we’re going to dive into hash maps, another essential data structure that every programmer should understand. Hash maps are incredibly efficient for storing and retrieving key-value pairs, making them essential for many programming tasks and complex algorithms. Let’s dive into what hash maps are, how they work under the hood, and their key operations and concepts!

What is a hash map?

Fundamentally, a hash map is an abstract data type (ADT) that stores key-value pairs where each key must be unique. The key can be of any data type that can be hashed (convertible via a hash function), and the value can be of any type. We will use an array to store the key-value pairs, and a hash function to convert the key into an index in the array.