Question: I already have stackADT.c completed. Could you create a queueADT.c that impliments linked lists? Also, If you could write what sqjuggler.c and sqjuggler.h would look

I already have stackADT.c completed. Could you create a queueADT.c that impliments linked lists? Also, If you could write what sqjuggler.c and sqjuggler.h would look like that would help out a lot! I attached a fuller description of the project and what the input and output are supposed to be like.

I already have stackADT.c completed. Could you create a queueADT.c that impliments

linked lists? Also, If you could write what sqjuggler.c and sqjuggler.h would

This project is to write a program to test the functionality of stackADT (textbook p500-p501) and queueADT that implemented using linked lists. You will read data from the test.dat file. When you read add number, the number should be inserted to both stack (push) and queue (enqueue) named inStack and inQueue, respectively. When you read delete, data should be deleted from both inStack (pop) and inQueue (dequeue). Data popped from inStack should be enqueued in outQueue. Similarly, data dequeued from inQueue should be pushed in outStack. This project is to write a program to test the functionality of stackADT (textbook p500-p501) and queueADT that implemented using linked lists. You will read data from the test.dat file. When you read add number, the number should be inserted to both stack (push) and queue (enqueue) named inStack and inQueue, respectively. When you read delete, data should be deleted from both inStack (pop) and inQueue (dequeue). Data popped from inStack should be enqueued in outQueue. Similarly, data dequeued from inQueue should be pushed in outStack

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!