Clarifications

• In the example I have sent to you, n1=128 n2=64 n3=64 n4=256, we are assuming that n2 and n3 are not buddies. Otherwise, they had to be merged into a node of size 128.
• Let say we have empty nodes with sizes: n1=128 n2=64 n3=64 n4=256. Assume they are not buddies. If we want to allocate space for a process of size 32, we will use the smallest space and we will split it. That means we will split n2.
• Question: Buddy ile memory allocate ederken n1=128 n2=64 n3=64 n4=256 seklinde bosluklar olsa (64 ler buddy degil), ve 64 KB lik bir process icin yer ayirmamiz gerekse, hangi bos alan kullanilir? Answer: n2 kullanilir. n2 ve n3 un buddy olmadiklarini farz ediyoruz. Olsalardi zaten birlestirilmis olurlardir.
• Note that while allocating space with Buddy Algorithm, you will use the smallest buddy that is large enough to hold the program. If there are more than one smallest buddies, you will use the one that starts at a lower (smaller) address.
• We assume that the physical memory starts with address 0.
• The sample output given in the assignment is NOT for the input example given. It is just an independent example indicating what the output format will be.
• You can assume process IDs are positive integers (nonzero).
• In printing the holes in Buddy algorithm, you will consider an unused buddy as a hole to be printed. If a portion of a buddy is used, you will not print that. Additionally, you will NOT consider adjascent empty (unused/available) buddies of different sizes as a single hole. You will print them seperately.
• You will just simulate allocation of memory. You will not really allocate memory for a program.

• 1. Inputtan maximum ve minimum kac tane process okuyabiliriz? 
  
  Answer: 
  Min: zero
  Max: limit not specified. any number of lines. 
  
  If, in your C program, you read a line from input file about a user
  program and you could not load that user program since there is not
  enough space (i.e. you could not allocate memory), then you just skip
  that user program (i.e. you just ignore that line and never come back)
  in your C program. You don't need to come back.
  
  2. Okudugumuz processlerin memory size araligi ne olmali?
  
  Answer: 
  
  Min: 1 KB
  Max: 2^memsize KB
  
  memsize, is the command line expoenent parameter.
  
  For example, if memory size is 1 MB, then program sizes in the input
  file can be between 1 KB and 1024 KB.
  
  3. Random input olusturulurken; kac satirlik (veya satir araligi) bir
  dosya olusturmaliyiz?
  
  Answer: It is totally up to you. 
  
  4. En son memoryde kalan processleri print ederken id sirasina gore
  mi, yoksa location sirasina gore mi prinit etmeliyiz? 
  
  Answer: We are not printing process information. We 
  are printing empty space information and while printing
  that we are printing According to Location. 
  
  5. Input dosyasi girilmemisse; random sayi generate etmek in
  yazdigimizz metod bir input dosyasi olustursa ve program onu kullanarak
  calismaya devam etse olur mu ?
  
  Answer: Yes, you can do that.