Heap

We can understand references in several ways. The reference is a data type in Java. (also in other languages) The reference is the object’s source, created by using a new keyword. Now, let’s begin with the data type: Java has 2 data types: primitive data type and reference data type…

Introduction “Toxin” is a pwn challenge hosted by hackthebox. First Considerations The challenge provided: The binary of the program to exploit The library used remotely The right loader to use to load the libc First I patched the binary (using pwninit) to force the executable to also load the library provided by the…

Hi, everyone today will be talking about Heaps. I watched a Youtube video about developing heaps using Go Lang and it was very interesting. We are trying to learn the basic concepts about heaps like inserting and extracting data from heaps and also the time complexity of heaps. finally will…

Background In this article, I will focus on the topic of data structure and algorithms (in my eyes, one of the most important skills for software engineers). One day I came across a question that goes like this: how can building a heap be O(n) time complexity? This question confused me…

Hello everyone! Welcome to my third blog post of the C/C++ in-depth blog series. So today we are discussing something interesting, Pointers. First, let’s look at what are we going to discuss today. Definition of pointers Declaration of a pointer Initialising a pointer Dereferencing a pointer Dynamic memory allocation Uses…

Yazılım dünyasında popülerliğini yitirmeyen java’da garbage collection nasıl çalışır konusuna java ile program yazan hemen herkes kafa yormuştur. Derinlemesine düşünüp, araştırmış olanlar da vardır.Bu konudan ben de bahsetmek istiyorum. Javada yazılmış olan yazılımın çalışması esnasında hafızada belli bir yer ayrılır bu yere “managed heap” denir. Bu kısım belli zamanlarda temizlenir, işte biz bu işleme “garbage collection” bir nevi çöp toplama mekanizması denir.

JavaScript 的記憶體配置 基本資料型態 primitive data type JavaScript ： string, number, bigint, boolean, undefined, symbol, and null 為了不讓開發者對配置困擾，JavaScript 會在宣告值的同時完成記憶體配置 let a = 1 配置一記憶體空間給數字 let b = “one” 配置記憶體空間給字串 JavaScript 以不同資料型別來分配記憶體，主要原因是stack比heap記憶體小，而且stack的大小是固定的，而heap是動態變化。 Stack (堆疊) 棧內存 — 後進先出（First In Last Out） 基本型別primitive type 的值的大小固定,會存放在stack記憶體 stack在記憶體中用來存放可以預測生命週期的資料 heap(堆積) 堆內存 — 先進先出（First In First Out） 物件型別的值大小不固定，會存放在heap 記憶體 Heap的區塊專收執行期間動態產生的資料，由於為動態產生故結束點無法由系統來掌握 遞迴函式recursive 如果寫太深可能會造成stackoverflow的問題, 下面延伸閱讀的部分有測試js堆內存最大可呼叫次數。

In last article we discussed about VM(Virtual Machine) and types of virtual machines. I hope you read that article if not, please go through the below link to read it. Introduction to JVM(Java Virtual Machine)- Part 01 Today you’re going to learn about what is the Java Virtual Machine. Before we talking about JVM, let’s talk about…medium.com As you know now there is not a thing exist called JVM in reality. You can’t search and download it…

Introduction “Tcache Tear” is a pwn challenge hosted by pwnable.tw. In particular, it is a heap challenge. First Considerations The challenge provided both the binary of the program to exploit and the library used remotely. First I patched the binary (using pwninit) to force the executable to also load the correct library locally. …