Question

Pointers &Pointer arithmetic Memory allocation and freeing Main topics: Exercise This lab is designed to give you practice working with pointers and memory allocation Getting Started To start this exercise, you should 1. Open eclipse and create a new C project named Labo6 2. Add a Source File (named lab06.c) to this project. Problem Description 1. You are to write a complete C program that creates a stack (of float values) that is initially empty (top 0), and has a capacity of exactly one. 2. You are to write a function that when given your stack, its top, its capacity, and a float value to be pushed, will return a pointer to a stack that is identical to the given stack but with the new value pushed on top. Note, if the given stack is already full, you will need to: . create a new stack that is twice the size of the given stack copy all the current values from the given stack to the new stack, preserving their order copy the given new value into the new stack at location top . free the stack pointed to by the given stack argument . modify the given top and capacity arguments to reflex the changes return the address of the new stack via the functions return value if the stack is NOT already full, you will need to copy the given new value into the stack pointed to by the given stack argument at location top . modify the given top to reflex the change . return the address of the given stack via the functions return value 3. Notice that in this model, a push "never" fails... 4. You are to add code to your program's main function in order to verify that your function is working correctly with you stack. Hint: its capacity will at all times be a power of 2 (1, 2, 4, 8, 5. Once you have written your Program and function: (a) Make sure that your program compiles and runs without errors or warnings. (b) Run your program enough times to check all the cases for correctness.
Need help about C PROGRAMMING,, pls use only C LANGUAGE.., yea so im doing this exercise as a practice for c programming, could someone do this as well so i could compare if my code makes makes sense and to see and help correct the errors im getting right now..

Any helpful help would be appreciated..

Answer 1

--------------------------------------------------------------------------------------------------------------------------

// Code Below

#include<stdio.h>
#include<stdlib.h>
typedef struct stack{
float *value;
int top;
int capacity;
} stack;

stack *pushvalue(stack *initStack,float val){
int i,j;
//if top == capacity then the stack is full
if(initStack->top == initStack->capacity){
//create a new stack twice the size
stack *newStack = (stack*)malloc(sizeof(stack)*1);
newStack->value = (float*)malloc(sizeof(float)*(2*initStack->capacity));
newStack->capacity = 2*initStack->capacity;
for(i=0;i<initStack->top;i++){
newStack->value[i] = initStack->value[i];
}
newStack->value[i] = val;
newStack->top = initStack->top+1;
free(initStack);
return(newStack);
}else{
initStack->value[initStack->top] = val;
initStack->top += 1;
return(initStack);
}
}

void printStackConfig(stack *s){
int i;
if(s->top == 0){
printf("The Stack is empty\n");
printf("\n");
}else{
printf("The top element of the stack is %.3f\n",s->value[s->top-1]);
printf("The total number of elements present in the stack is %d\n",s->top);
printf("The current capacity of the stack is %d\n",s->capacity);
printf("\n");
}
}
int main(){
int i,j,k,n;
stack initStack;
// initializing a new stack
initStack.capacity = 1;
initStack.top = 0;
initStack.value = (float*)malloc(sizeof(float)*initStack.capacity);

printStackConfig(&initStack);
stack *s1,*s2,*s3;
s1 = pushvalue(&initStack,0.5);
printStackConfig(s1);
s2 = pushvalue(s1,0.6);
printStackConfig(s2);
s3 = pushvalue(s2,0.75);
printStackConfig(s3);
s1 = pushvalue(s3,1.2);
printStackConfig(s1);
s2 = pushvalue(s1,2.34);
printStackConfig(s2);

return(0);
}

--------------------------------------------------------------------------------------------------------------------------

// Since the Chegg text editor removes '\n'(newline character) from the printf statements

// i am attaching screenshot of the function ' void printStackConfig(stack *s) ' which contains

// all the printf statements so that it becomes easy to know which printf statement contains '\n'

void printStackConfig(stack s) int i; if (s-top0) printf ("The Stack is empty\n") printf ("n"): else printf ("The top element of the stack is % .3f\n", s->value [s->top-11); printf("The total number of elements present in the stack is %d\n", s-top); printf("The current capacity of the stack is %d\n", s->capacity); printf("n)

--------------------------------------------------------------------------------------------------------------------------

// ScreenShot of sample output obtained after running the code

The Stack is empty The top element of the stack is e.5ee The total number of elements present in the stack is 1 The current capacity of the stack is1 The top element of the stack is e.6ee The total number of elements present in the stack is 2 The current capacity of the stack is 2 The top element of the stack is e.750 The total number of elements present in the stack is 3 The current capacity of the stack is 4 The top element of the stack is 1.200 The total number of elements present in the stack is 4 The current capacity of the stack is 4 The top element of the stack is 2.340 The total number of elements present in the stack is 5 The current capacity of the stack is8