Objectives:

Description:

Details:

• As before, input will be from stdin and output will be to stdout.

• Queue ADT:
  In a service/logistics setting, one strategy is to process items as they arrive, also known as first in, first out (or FIFO). In this setting, we are not discriminating between items. For instance, in a package delivery setup, we process packages by the order of their arrival only. That is, the first package to arrive will be the first package to be processed. Same in a vaccination framework: the first person that shows up gets the shot. Your program will use an array for implementation of the queue ADT. This array will contain integers. You are provided with Queue.h. The first requirement of this homework is to write Queue.c that implements the functions in Queue.h.

• Application:
  You will make a simple application to test your ADT implementation. Call it simulator.c. Your application must support the following input commands:
  • ADD val -- Which adds a package to the queue
  • SERVICE -- Which processes the package at the front of the queue. If no package to process, return Queue Empty
  • PRINT -- Which prints all the content in the queue
  • LENGTH - Which prints the number of elements contained in the queue
• Files for this program: The following files are provided to you, and should all be submitted with your work.
  • Makefile: Makefile for compiling your code.
  • Queue.h: Do not change this file. It has a list of functions that you need to implement for the Queue ADT.
  • Queue.c: This is where you define the Queue struct and implement your Queue ADT. Only type code where you see the TODOs.
  • simulator.c: This is where you put your client app.

  Sample input is provided in:

  • test1.txt --> output1.txt
  • test2.txt --> output2.txt

  Submission:

  • Make sure that you've compiled and tested your code on the campus unix timeshare before submitting. On the unix timeshare, put materials in a folder named hwk2 and zip it up.

    Submit on unix timeshare. Use the command: submit cse101-ap.f21 hwk2 hwk2.zip

    You can submit as often as you want up until the deadline. We will only look at your most recent submission.

  ---

  Last modified .