Question

I need help with the code below. It is a C program, NOT C++.

It can only include '.h' libraries. I believe the program is in C++, but it must be a C program. Please help.

//

// main.c

// float_stack_class_c_9_29

//

//

/* Given the API for a (fixed size), floating point stack class, write the code to create a stack class (in C).

*/

#include

#include

#include

#include

header file to read and print the output on console

using namespace std; // Namespaces are used to organize code into logical groups and to prevent name collisions that can occur especially

//when your code base includes multiple libraries.

class float_stack

{

public:

  

float_stack();

size_t size() const;

bool empty() const;

float peek() const;

void pop();

void push(float value);

  

friend std::ostream& operator<<(std::ostream& os, const float_stack& st);

  

private:

  

void check_empty() const; // exit if true (throw exception in C++)

void check_overflow() const; // ditto

  

private:

static const size_t maxStack_ = 30;

size_t size_;

float data_[maxStack_];

  

};

float_stack::float_stack()

{

size_ = 0;

}

size_t float_stack::size() const

{

return size_;

}

bool float_stack::empty() const

{

return size_ == 0;

}

float float_stack::peek() const

{

return data_[size_-1];

}

void float_stack::pop()

{

size_--;

}

void float_stack::push(float value)

{

if(size_ < maxStack_)

{

data_[size_] = value;

size_++;

}

}

std::ostream& operator<<(std::ostream& os, const float_stack& st)

{

size_t size = st.size();

for(int i = size-1; i >= 0; i--)

os << st.data_[i] << " ";

os << endl;

return os;

}

void float_stack::check_empty() const // exit if true (throw exception in C++)

{

if(empty())

exit(1);

}

void float_stack::check_overflow() const // ditto

{

if(size_ == maxStack_)

exit(1);

}

int main(int argc, const char * argv[])

{

  

float_stack stack;

  

stack.push(23.2);

stack.push(3.12);

stack.push(54.3);

stack.push(98.0);

cout<

  

stack.pop();

cout<

  

return 0;

}

Answer 1

In C language, the concept of struct is equvivalent to struct. Below is the code for the same.

#include <stdio.h>
#include <stdlib.h>
#include <limits.h>

// structure representing stack
struct Stack
{
int top;
unsigned size;
int* arr;
};

// creating stack
struct Stack* createStack(unsigned size)
{
struct Stack* stack = (struct Stack*) malloc(sizeof(struct Stack));
stack->size = size;
stack->top = -1;
stack->arr = (int*) malloc(stack->size * sizeof(int));
return stack;
}

// Stack overflow condition
int IsFull(struct Stack* stack)
{ return stack->top == stack->size - 1; }

//Underflow of stack
int IsEmpty(struct Stack* stack)
{ return stack->top == -1; }

// to add an element to stack
void Push(struct Stack* stack, float ele)
{
if (IsFull(stack))
return;
stack->arr[++stack->top] = ele;
printf("%f pushed to stack\n", ele);
}

// Function to remove an item from stack. It decreases top by 1
float Pop(struct Stack* stack)
{
if (IsEmpty(stack))
return INT_MIN;
return stack->arr[stack->top--];
}
// Driver program to test above functions
int main()
{
struct Stack* stack = createStack(100);

Push(stack, 10.10);
Push(stack, 20.38);
Push(stack, 30.45);

printf("%f popped from stack\n", Pop(stack));

return 0;
}

C 1 Need Help With The Cx C++Shell C cpp.sh C++ shel cpp.sh anline C++ compiler bout cpp.sh 12 13 creating stack 14 struct Stack createStack(unsigned size) 15 16 17 18 19 20 21 struct Stack stack (struct Stack) malloc(sizeof(struct Stack)); stack-size size; stack->top1; stack->arr-nt) malloc(stack-sisizeof(int)) return stack; 23 Stack overflow condition 24 int IsFull(struct Stack stack) Δ 25 { return stack-top stack->size - 1; } 26 27 Underflow of stack 28 int IsEmpty(struct Stack stack) 29return stack->top1; 30 31 to add an element to stack 32 void Push(struct Stack stack, float ele) 34 if (IsFull(stack)) Get URL Run options compilation execution 10.1«3008 pushed to stack 20.379999 pushed to stack 30.458001 pushed to stack 30.800008 popped from stack Exit code: 8(nornal progran ternination) 12:38 PM 02/10/2017