Question

CS 241 Program 03 Due: Thursday, October 18th Main topics: Arrays& Pointers Memory allocation ram Specification: A stack is a container that can be defined in terms of an array where all adds are preformed at the end of the sequence of existing values, and all removes are also preformed at end of the sequence of existing values. An empty stack is one that has no existing values in the array at all. We use the notion of top of the stack to keep track of (at which index) a new value in the sequence is to be added. Hence, an empty stack is one in which top is equal to 0 and a full stack is one in which top is equal to the array's physical size capacity. For this assignment, you will write a C program to create and use an array based stack Requirements: You must write a C program which satisfies the following: . Your C program must dynamically allocate the memory for the underlying array of float values, with a capacity of 1024. Your C program must dynamically free this memory before termination. Your C program must declare and define functions to: - Create an empty stack (of float values) with a capacity of 1024. - Test to see if the stack is empty - Test to see if the stack is full - Push (add) an item (a float value) onto the stack - if not already full -Pop (remove) an item (a float value) from the stack if not already empty . Your C program must define a main function to fully test all of the above funcionality. Notes: 1. A stack is really three separate data items: (a) a float pointer to the array (b) an int top index indicator (c) an int capacity (physical size of the array) 2. The effective size of the stack (number of items in the stack) cabe deduced from the top index indicator Sample run(s):

Answer 1

stack.c

#include<stdio.h>

#include<stdlib.h>

#include<limits.h> //INT_MIN

//structure for stack

struct stack

{

int top;

int capacity;

float *array;

};

//create a emptyp stack of size capacity

struct stack* createStack(int capacity)

{

struct stack* stk=(struct stack*)malloc(sizeof(struct stack));

stk->capacity=capacity;

stk->top=0;

stk->array=(float*)malloc(stk->capacity*sizeof(float));

return stk;

}

//check for stack is full or not

int isFull(struct stack *stk)

{

if(stk->top==(stk->capacity-1))

return 1;

return 0;

}

//check for stack is empty

int isEmpty(struct stack* stk)

{

return stk->top==0;

}

//push data to stack

void push(struct stack* stk,float data)

{

if(isFull(stk))

{

printf("\nstack is full");

return;

}

stk->array[++stk->top]=data;

printf("\n%.2f pushed to stack\n",data);

}

//pop data from stack

float pop(struct stack *stk)

{

if(isEmpty(stk))

{

printf("\nStack is empty");

return INT_MIN;

}

return stk->array[stk->top--];

}

int main()

{

struct stack* stk=createStack(1024);

push(stk,10.24);

push(stk,13.0);

push(stk,14.21);

printf("\n%.2f popped from stack\n",pop(stk));

push(stk,1.78);

push(stk,90.21);

printf("\n%.2f Popped from stack\n",pop(stk));

return 0;

}//end of main

OUTPUT