CareerCup

char BYTE[1000] = {};

char * getAllocation(unsigned int reqMemory)
{
	static unsigned int memCtr = 0;

	if(memCtr + reqMemory > 999)
		return NULL;

	memCtr += reqMemory;
	return &BYTE[memCtr-reqMemory];
}

refer K&R. It has given implementation, plus exercises would add real fire to the answer..

I think best fit algorithm can be used for simulating memory management. Segments of free memory spaces can be kept track of through a BST and for every new memory allocation request, BST can be used to get the best fit available for that request.

char BYTE[1000] = {};

char * getAllocation(unsigned int reqMemory)
{
static unsigned int memCtr = 0;

if(memCtr + reqMemory > 999)
return NULL;

memCtr += reqMemory;
return &BYTE[memCtr-reqMemory];
}

{
char byte[1000];

char* alloc(int siz)
{
static int ctr =0;
if(siz > 999-ctr) return NULL;
ctr=999-siz;
return ctr-siz;
}

}

Buddy system

void * malloc(int length)
{
      return new byte[length];
}