II. CASE (40%) [LO 3, 40 points] Patients arriving in an emergency unit of a hospital...

 

Transcribed Image Text:

II. CASE (40%) [LO 3, 40 points] Patients arriving in an emergency unit of a hospital are queued based on their arrival. They are then checked by nurses and the nurses have the right to move the patients queue up depending on the nature of the emergency. The nature of the emergency is categorized into 2 different classes as follows: Class 1: high urgency. In this case the patient will move to the front of the queue Class 2: low urgency. In this case the patient will stay in his/her original queue. You as the programmer is going to write a program using C programming language to implement this queueing system. The queue starts from 0 patient. Inputting "service" will remove one patient from the queue. You may use any variation of linked list data structure that you have learned in the class. Your program should validate the input. For example: nature of emergency only accepts 1 or 2. Service only accepts Y or N. An example of simulation would be follows Patient Arrive (Name): Argile Nature of Emergency:2 Queue content: Argile Service? N Patient Arrive (Name): Donna Nature of Emergency:2 Queue content: Argile - Donna Service? N Patient Arrive (Name) : Bobby Nature of Emergency:2 Queue content: Argile - Donna - Bobby Service? Y Queue content: Donna-Bobby Patient Arrive (Name): Meriam Nature of Emergency: 1 Queue content: Meriam Donna Bobby Service? Y Queue content: Donna Bobby Note: Entering "End" in the patient's name will end the program. II. CASE (40%) [LO 3, 40 points] Patients arriving in an emergency unit of a hospital are queued based on their arrival. They are then checked by nurses and the nurses have the right to move the patients queue up depending on the nature of the emergency. The nature of the emergency is categorized into 2 different classes as follows: Class 1: high urgency. In this case the patient will move to the front of the queue Class 2: low urgency. In this case the patient will stay in his/her original queue. You as the programmer is going to write a program using C programming language to implement this queueing system. The queue starts from 0 patient. Inputting "service" will remove one patient from the queue. You may use any variation of linked list data structure that you have learned in the class. Your program should validate the input. For example: nature of emergency only accepts 1 or 2. Service only accepts Y or N. An example of simulation would be follows Patient Arrive (Name): Argile Nature of Emergency:2 Queue content: Argile Service? N Patient Arrive (Name): Donna Nature of Emergency:2 Queue content: Argile - Donna Service? N Patient Arrive (Name) : Bobby Nature of Emergency:2 Queue content: Argile - Donna - Bobby Service? Y Queue content: Donna-Bobby Patient Arrive (Name): Meriam Nature of Emergency: 1 Queue content: Meriam Donna Bobby Service? Y Queue content: Donna Bobby Note: Entering "End" in the patient's name will end the program.

Answer rating: 100% (QA)

C CODE include include include structure of linked list node struct node head of the linked list struct node head function prototypes function to inse... View the full answer