Question

How to use C to output this:

indigo1 376 % lab9
Capacity = 4
Capacity = 8
0 5 10 15 20
Capacity = 16
0 5 10 15 20 25 30 35 40
Capacity = 32
0 5 10 15 20 25 30 35 40 45 50 55 60 65 70 75 80
0 5 10 15 20 25 30 35 40 45 50 55 60 65 70 75 80 85 90 95 100 105 110 115 120 125 130 135 140 145 150 155
Capacity = 16
0 5 10 15 20 25 30
Capacity = 8
0 5 10
Capacity = 4
0

printArray(): empty array.

indigo1 377 %

2. Implementation The codes to be submitted are util.c and util.h. Use the given template util.c and util.h and fill in yourcode. Submit your work with the following command: submit 2031 lab9 util.c util.n. • You are also given a file named lab9.c to test your code. Do not submit file 1ab9.c. • The first function to be implemented is insertlast (). See file util.c for its specification. The new element is to be inserted at the rear of the extendable array. When a new element is inserted into a full array, extend the array by doubling its current capacity Cle-g., if C == 4 then C is increased to 8). Use function malloc or calloc only to allocate memory for an array. Do not use the realloc function. Allocate a new array, copy the content of the old (smaller) array to the new (bigger) array, free the old array. The second function to be implemented is removeLast (). See file util.c for its specification. The function removes and returns the last element of the array (i.e., the element that was inserted last). If the array is empty, the function calls function printErz ( to display an error message and returns -1. After a deletion, if the number of elements in the array falls below C/4 (size < C/4), shrink the array by half of the current capacity, but the minimum capacity should always be 4 (e.g., if C == 16 and size < 4 then C is reduced to 8). Again, use function malloc or calloc to allocate memory only for a new array as explained above. Do not use the realloc function. You may define your own variables inside functions insertlast 1) and removeLast(). You need to implement the contents of util.n. The code should be compiled using: gec lab 9.c util.c-o lab9 In file util.c you are given several utility functions such as initArr(), printēzr() and printArray (). DO NOT modify these functions. Do not modify the function and structure definitions in file util.c. 3. Sample Inputs/Outputs See file labout.txt for the output from running programs labs. EECS 2031 Page 2 of 2 Common Notes Complete the header in file util.c and util.h with your student and contact information. Assume that all inputs are valid. No error checking is required on inputs.

This is Lab9.c:

This is util.c:

#include
#include

struct extendableArray {
int *arr;
int size;  
int capacity;
};

struct extendableArray *initArr()
{
struct extendableArray *a = ( struct extendableArray * ) malloc( sizeof( struct extendableArray ) );
if( !a ) {
   printf( "Insufficient memory!" );
   exit( 1 );
}
a->capacity = 4;  
a->arr = ( int * ) malloc( a->capacity * sizeof( int ));
if( !a->arr ) {
   printf( "Insufficient memory!" );
   exit(1) ;
}
a->size = 0;  
return a;
}

struct extendableArray *initArrCapacity(int capacity)
{
struct extendableArray *a = ( struct extendableArray * ) malloc(sizeof( struct extendableArray ) );
if( !a ) {
   printf( "Insufficient memory!" );
   exit( 1 );
}
a->capacity = capacity;
a->arr = ( int * ) malloc( a->capacity * sizeof( int ));

if( !a->arr ) {
   printf( "Insufficient memory!" );
   exit(1) ;
}
a->size = 0;  
return a;
}

int arrSize( struct extendableArray *a )
{
   return( a->size );
}

int arrCapacity( struct extendableArray *a )
{
   return( a->capacity );
}

int isEmpty( struct extendableArray *a)
{
   return( a->size == 0 );
}

int isFull( struct extendableArray *a )
{
   return( a->size == a->capacity );
}

void printErr( char *msg )
{
printf( "\n%s\n", msg );
}

void printArray( struct extendableArray *a )
{
int i;

if( isEmpty( a ) )
   printErr( "printArray(): empty array." );

for( i = 0; i < a->size; i++)
   printf( "%3d ", a->arr[i] );

printf("\n");
}

/************* DO NOT MODIFY ANYTHING ABOVE THIS LINE, *************/
/************* EXCEPT THE HEADER CONTAINING YOUR INFO **************/
/************* DO NOT MODIFY FUNCTION HEADERS *************/

/* Inserts integer d at the rear of the array, right behind the last element. */

void insertLast( struct extendableArray **a, int d )
{
/* Add your implementation here */
}

/* Removes and returns the last element of the array (the element that was inserted last). */
/* If the array is empty, call printErr() to display a message and return -1. */

int removeLast( struct extendableArray **a )
{

   /* Add your implementation here */

return( 0 ); /* replace this line with your own code */
}

(util.h can add any code)

Answer 1

//util.h

struct extendableArray {
int *arr;
int size;
int capacity;
};

struct extendableArray *initArr();
struct extendableArray *initArrCapacity(int capacity);
int arrSize( struct extendableArray *a );
int isEmpty( struct extendableArray *a);
int isFull( struct extendableArray *a );
void printErr( char *msg );
void printArray( struct extendableArray *a );
void insertLast( struct extendableArray **a, int d );
int removeLast( struct extendableArray **a );

//util.c

#include<stdio.h>
#include<stdlib.h>
#include"util.h"

struct extendableArray *initArr()
{
struct extendableArray *a = ( struct extendableArray * ) malloc( sizeof( struct extendableArray ) );
if( !a ) {
   printf( "Insufficient memory!" );
   exit( 1 );
}
a->capacity = 4;
a->arr = ( int * ) malloc( a->capacity * sizeof( int ));
if( !a->arr ) {
   printf( "Insufficient memory!" );
   exit(1) ;
}
a->size = 0;
return a;
}

struct extendableArray *initArrCapacity(int capacity)
{
struct extendableArray *a = ( struct extendableArray * ) malloc(sizeof( struct extendableArray ) );
if( !a ) {
   printf( "Insufficient memory!" );
   exit( 1 );
}
a->capacity = capacity;
a->arr = ( int * ) malloc( a->capacity * sizeof( int ));

if( !a->arr ) {
   printf( "Insufficient memory!" );
   exit(1) ;
}
a->size = 0;
return a;
}

int arrSize( struct extendableArray *a )
{
   return( a->size );
}

int arrCapacity( struct extendableArray *a )
{
   return( a->capacity );
}

int isEmpty( struct extendableArray *a)
{
   return( a->size == 0 );
}

int isFull( struct extendableArray *a )
{
   return( a->size == a->capacity );
}

void printErr( char *msg )
{
printf( "\n%s\n", msg );
}

void printArray( struct extendableArray *a )
{
int i;

if( isEmpty( a ) )
   printErr( "printArray(): empty array." );

for( i = 0; i < a->size; i++)
   printf( "%3d ", a->arr[i] );

printf("\n");
}

/************* DO NOT MODIFY ANYTHING ABOVE THIS LINE, *************/
/************* EXCEPT THE HEADER CONTAINING YOUR INFO **************/
/************* DO NOT MODIFY FUNCTION HEADERS *************/

/* Inserts integer d at the rear of the array, right behind the last element. */

void insertLast( struct extendableArray **a, int d )
{
   int i;
   if((*a)->size == (*a)->capacity){
       (*a)->capacity = (*a)->capacity * 2;
       int *array = (int*) malloc(((*a)->capacity)*(sizeof (int)));
      
       for(i=0;i<(*a)->size;i++) array[i] = (*a)->arr[i];
      
       free((*a)->arr);
       (*a)->arr = array;
   }
  
   (*a)->arr[(*a)->size] = d;
   (*a)->size = (*a)->size + 1;
}

/* Removes and returns the last element of the array (the element that was inserted last). */
/* If the array is empty, call printErr() to display a message and return -1. */

int removeLast( struct extendableArray **a )
{
   if((*a)->size == 0){
       printErr("Array is Empty");
       return -1;
   }
   int val = (*a)->arr[--(*a)->size];
   int i;
      
   if((*a)->capacity> 4 && (*a)->size < (*a)->capacity /4) {
       if((*a)->capacity > 8) (*a)->capacity = (*a)->capacity/2;
       else (*a)->capacity = 4;
      
       int *array = (int*) malloc(((*a)->capacity)*(sizeof (int)));
      
       for(i=0;i<(*a)->size;i++) array[i] = (*a)->arr[i];
      
       free((*a)->arr);
       (*a)->arr = array;
      
   }

   return val;
}