Question

Kindly help Asap....correct answers and numbering will be greatly appreciated.. thanks

uestion 3 (50 In this problem we are going to implement C modules that implement what is (hopefully) reusable functionality. Each of the modules should make use of abstraction and information hiding where appropriate and include a header file ( .h) and a source code file ( . C). As discussed in class, the header file should define the API for your module. You may model these modules from the Java versions I reviewed in class...only write them in C. Make use of the static class to control access to variables and functions that you do not want to make visible to clients of your modules. Stacks and These modules should be standalone, that is, they should not contain ain). We will write a main) (or two main()'s if you want to test the modules separately) to test your modules...but not until part c. Note: I kept the definition of these modules simple so their functionaliy will be somewhat limited because you can only have a single stack or a single queue (the array containing the stack or queue is declared inside the module). If you'd like to do better check out the Extra Credit at the end of the assignment. (15 pts) Code a C module and a header file that encapsulates the functionality of a Stack of doubles using an array of 10 elements. Your stack module should implement these functions as a minimum, but you may expand the API to include additional functionality if you'd like. .int push(double d) inserts the d onto the stack. Returns 1 if the insertion was a. successful, 0 otherwise. double pop(void) returns the double on the top of the stack and deletes it from the stack. Retums NaN (https://www quora.com/W stack is empty double peek (void) returns the double on the top of the stack but does not delete it from the stack. Returns NaN if the stack is empty ifthe .int isEmpty(void) returns 1 if the stack is empty, 0 otherwise. . int isFull (void) returns 1 if the stack is full, 0 otherwise. .int 1istStackcontents(void) - Displays the contents of the stack on stdout (the console). The entries on the stack should be listed one per line. Does not delete any entries from the stack. Returns the number of entries that were displayed b. (15 pts) Code a C module and a header file that encapsulates the functionality of a Queue of char. The Queue should be implemented as a circular array of 10 elements. Your Queue module should implement these functions as a minimum, but you may expand the API to include additional functionality if you'd like .int enqueue (char d)-inserts the char d at the end of the queue. Returns 1 if the insertion was successful (ie. the Queue was not full), 0 otherwise

Answer 1

//Stack.h

#pragma once

#include<stdio.h>

int push(double d); //– inserts the d onto the stack.Returns 1 if the insertion was successful, 0 otherwise.

double pop(void); //returns the double on the top of the stack and deletes it from the stack.Returns NaN if the stack is empty.

double peek(void); //returns the double on the top of the stack but does not delete it from the stack.Returns NaN if the stack is empty.

int isEmpty(void);//– returns 1 if the stack is empty, 0 otherwise.

int isFull(void); //– returns 1 if the stack is full, 0 otherwise.

int listStackContents(void);

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

//Stack.c

#include"Stack.h"

#define NaN -1

//declare an array of 10 elements and top variable

double arr[10];

int top = 0;

int push(double d) //– inserts the d onto the stack.Returns 1 if the insertion was successful, 0 otherwise.

{

if (!isFull())

{

    arr[top++]=d;

    //return 1 to indicate successs

    return 0;

}

else

{

    return -1; //to indicate failure

}

}

double pop(void) //returns the double on the top of the stack and deletes it from the stack.Returns NaN if the stack is empty.

{

double ret;

if (!isEmpty())

{

    //make old element -1 to indicate its delete

    ret = arr[top - 1];

    arr[top - 1] = -1;

--top;

    return ret;

}

else

{

    return NaN;

}

}

double peek(void) //returns the double on the top of the stack but does not delete it from the stack.Returns NaN if the stack is empty.

{

if(!isEmpty())

   return arr[top - 1];

}

int isEmpty(void) //– returns 1 if the stack is empty, 0 otherwise.

{

if (top == 0)

    return 1;

else

    return 0;

}

int isFull(void) //– returns 1 if the stack is full, 0 otherwise.

{

if (top == 10)

    return 1;

else

    return 0;

}

int listStackContents(void)

{

int i;

printf("Content of stack are: ");

for (i = 0; i < top; i++)

{

    printf("%.2f ", arr[i]);

}

printf("\n");

return 0;

}

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

//main to test stack

#include"Stack.h"

int main()

{

printf("%.2f (-1 indicates stack is empty)\n ",pop());

push(2.2);

push(3.3);

listStackContents();

printf("Top of stack is %.2f",peek());

pop();

printf("\nContents of stack after pop: \n");

listStackContents();

}

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

//output

-1.00 (-1 indicates stack is empty)

Content of stack are: 2.20 3.30

Top of stack is 3.30

Contents of stack after pop:

Content of stack are: 2.20

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

//Queue.h

printf("\nContents of Queue after pop: \n");

listStackContents();

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

//Queue.c

#include"Queue.h"

#define NaN -1

//declare an array of 10 elements and top variable

double arr[10];

int front = 0;

int rear=0;

int enqueue(double d) //– inserts the d onto the stack.Returns 1 if the insertion was successful, 0 otherwise.

{

if (!isFull())

{

    arr[rear++]=d;

    //return 1 to indicate successs

    return 0;

}

else

{

    return -1; //to indicate failure

}

}

double dequeue(void) //returns the double on the top of the stack and deletes it from the stack.Returns NaN if the stack is empty.

{

double ret;

int i;

if (!isEmpty())

{

    //make old element -1 to indicate its delete

    ret = arr[front];

   //move elements from right to left

for(i = 0; i < rear-1; i++)

arr[i]=arr[i+1];

--rear;

    return ret;

}

else

{

    return NaN;

}

}

double peek(void) //returns the double on the top of the stack but does not delete it from the stack.Returns NaN if the stack is empty.

{

if(!isEmpty())

   return arr[front ];

}

int isEmpty(void) //– returns 1 if the stack is empty, 0 otherwise.

{

if (front == rear)

    return 1;

else

    return 0;

}

int isFull(void) //– returns 1 if the stack is full, 0 otherwise.

{

if (rear == 10)

    return 1;

else

    return 0;

}

int listStackContents(void)

{

int i;

printf("Content of Queue are: ");

for (i = 0; i < rear; i++)

{

    printf("%.2f ", arr[i]);

}

printf("\n");

return 0;

}

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

//main to test queue

#include"Queue.h"

int main()

{

printf("%.2f (-1 indicates Queue is empty)\n ",dequeue());

enqueue(2.2);

enqueue(3.3);

enqueue(4.3);

enqueue(5.3);

enqueue(6.3);

listStackContents();

printf("Front of Queue is %.2f",peek());

dequeue();

printf("\nContents of Queue after pop: \n");

listStackContents();

dequeue();

printf("\nContents of Queue after pop: \n");

listStackContents();

}

/*output of Queue

-1.00 (-1 indicates Queue is empty)

Content of Queue are: 2.20 3.30 4.30 5.30 6.30

Front of Queue is 2.20

Contents of Queue after pop:

Content of Queue are: 3.30 4.30 5.30 6.30

Contents of Queue after pop:

Content of Queue are: 4.30 5.30 6.30

*/