the code.txt is the code so far done and reports.pdf is the (assignment) work that needs to be...

Question

the code.txt is the code so far done and reports.pdf is the (assignment) work that needs to be finished in the code.txt and now I have test.txt which you can use to test the two functions, just need the two Functions, Report_Jobs and Report_Memory done by Wednesday, the functions can't have any advanced code in them, like one of them I think should be an array but the limit is 100 and you use a while loop I think to print it out. It should be kind of basic code, no like tables or anything, unless like an array or somethingHere is the format to use for the following two services of the  memory manager.        1. Report_Jobs    For each job you should report each block of memory they use.  You should report the blocks  in order but you do NOT have to report the jobs in order of job number.  The Colum Headers  should also be printed  (the green below)        JOB Memory Usage    1  10 – 50   54 – 75   200 – 240   5 1 – 9  101 – 134  3 180 – 184  185 – 192          2. Report_Memory    This should be a sequential dump of all memory showing usage.      Memory Block          JOB    0 – 9  5  10 – 50  1  51 – 53  FREE  54 – 75  1  76 – 100  FREE  101 – 134  5  135 – 179  FREE  180 – 184  3  185 - 192  3  193 – 199  FREE  200 – 240  1  241 – 255  FREE                    #include  #include   // for setw() using namespace std; /******************************************* ******************************************** */ // GLOBAL DATA STRUCTURES ======================= typedef struct FREE_NODE * FREEPTR; typedef struct ALLOCNODE * ALLOCPTR; struct FREE_NODE  // FREE LIST NODES {   int start_byte;   int end_byte;   int size;      FREEPTR next; }; struct ALLOCNODE // ALLOCTADED LIST NODES {   int start_byte;   int end_byte;   int size;   int id;      ALLOCPTR next; }; // ======   GLOBAL DATA ========================= FREEPTR  freelist = NULL;  // the FREE link list ALLOCPTR alloclist = NULL; // the ALLOCATED link list int total_memory_managed = 0; // the amount of memory managed //======   PROTOTYPES =========================== //--- test only --- void dump_freelist(void); void dump_alloclist(void); //--- utility --- void remove_empty_freenodes(void); void insert_freeblock(FREEPTR fptr); void merge_freenodes(void); //--- interface --- void init_memory_manager(const int amount); int allocate_memory(const int job, const int amount); void release_memory(const int job); int total_free(void); int total_allocated(void); int largest_free(void); int job_allocated(const int job); void report_memory(void); //STUB void report_jobs(void); // STUB //==========  MAIN ============================= int main(void) {   char ch ;  // used to pause between tests   int r;     // results of allocate_memory   // ================================================================================   cout   " >ch;   cout >ch;   cout >ch;   cout >ch;   cout >ch;   cout  start_byte = 0; 	freelist -> end_byte = amount - 1; 	freelist -> size = amount; 	freelist -> next = NULL; 	     return ;	 } /* ======================================== int total_free(void); Description:  compute the total number of bytes not allocated Parameters: NONE Return value: the amount of total free bytes Notes: ===========================================*/ int total_free(void) {   int amount = 0;   FREEPTR tmp = freelist;   while (tmp != NULL)   {      amount = amount + tmp->size; 	 tmp = tmp->next;   }     return amount; // return amount of free memory } /* ======================================== int total_allocated(void); Description:  compute the total number of bytes allocated Parameters: NONE Return value: the amount of total allocated bytes Notes: ===========================================*/ int total_allocated(void) {   int amount = 0;   ALLOCPTR tmp = alloclist;   while (tmp != NULL)   {      amount = amount + tmp->size; 	 tmp = tmp->next;   }     return amount; // return amount of allocated memory }; /* ======================================== int largest_free(void); Description: find the largest available free block of memory Parameters: NONE Return value: the amount of free memory in the block Notes: ===========================================*/ int largest_free(void) {   int amount = 0;   FREEPTR tmp = freelist;   while (tmp != NULL)   {     if (tmp->size > amount) 	    amount = tmp->size; 	tmp = tmp->next;   }   return amount; } /* ======================================== int job_allocated(const int job); Description: compute the total amount of memory allocated to a particular job. Parameters:  -	job  :  the

Meenakshi · Accepted Answer

#include 
#include   // for setw()
using namespace std;
/*******************************************
********************************************
*/
// GLOBAL DATA STRUCTURES =======================
typedef struct FREE_NODE * FREEPTR;
typedef struct ALLOCNODE * ALLOCPTR;
struct FREE_NODE  // FREE LIST NODES
{
  int start_byte;
  int end_byte;
  int size;
  
  FREEPTR next;
};
struct ALLOCNODE // ALLOCTADED LIST NODES
{
  int start_byte;
  int end_byte;
  int size;
  int id;
  
  ALLOCPTR next;
};
// ======   GLOBAL DATA =========================
FREEPTR  freelist = NULL;  // the FREE link list
ALLOCPTR alloclist = NULL; // the ALLOCATED link list
int total_memory_managed = 0; // the amount of memory managed
//======   PROTOTYPES ===========================
//--- test only ---
void dump_freelist(void);
void dump_alloclist(void);
//--- utility ---
void remove_empty_freenodes(void);
void insert_freeblock(FREEPTR fptr);
void merge_freenodes(void);
//--- interface ---
void init_memory_manager(const int amount);
int allocate_memory(const int job, const int amount);
void release_memory(const int job);
int total_free(void);
int total_allocated(void);
int largest_free(void);
int job_allocated(const int job);
void report_memory(void); //STUB
void report_jobs(void); // STUB
//==========  MAIN =============================
int main(void)
{
  char ch ;  // used to pause between tests
  int r;     // results of allocate_memory
  // ================================================================================
  cout   " >ch;
  cout >ch;
  cout >ch;
  cout >ch;
  cout >ch;
  cout  start_byte = 0;
	freelist -> end_byte = amount - 1;
	freelist -> size = amount;
	freelist -> next = NULL;
	
    return ;	
}
/* ========================================
int total_free(void);
Description:  compute the total number of bytes not allocated
Parameters: NONE
Return value: the amount of total free bytes
Notes:
===========================================*/
int total_free(void)
{
  int amount = 0;
  FREEPTR tmp = freelist;
  while (tmp != NULL)
  {
     amount = amount + tmp->size;
	 tmp = tmp->next;
  }  
  return amount; // return amount of free memory
}
/* ========================================
int total_allocated(void);
Description:  compute the total number of bytes allocated
Parameters: NONE
Return value: the amount of total allocated bytes
Notes:
===========================================*/
int total_allocated(void)
{
  int amount = 0;
  ALLOCPTR tmp = alloclist;
  while (tmp != NULL)
  {
     amount = amount + tmp->size;
	 tmp = tmp->next;
  }  
  return amount; // return amount of allocated memory
};
/* ========================================
int largest_free(void);
Description: find the largest available free block of memory
Parameters: NONE
Return value: the amount of free memory in the block
Notes:
===========================================*/
int largest_free(void)
{
  int amount = 0;
  FREEPTR tmp = freelist;
  while (tmp != NULL)
  {
    if (tmp->size > amount)
	    amount = tmp->size;
	tmp = tmp->next;
  }
  return amount;
}
/* ========================================
int job_allocated(const int job);
Description: compute the total amount of memory allocated to a particular job.
Parameters: 
-	job  :  the number of the job
Return value: the total amount of memory allocated to the job
Notes:

the code.txt is the code so far done and reports.pdf is the (assignment) work that needs to be finished in the code.txt and now I have test.txt which you can use to test the two functions, just need...

Answer To: the code.txt is the code so far done and reports.pdf is the (assignment) work that needs to be...

Answer To This Question Is Available To Download

Related Questions & Answers

Submit New Assignment