0% found this document useful (0 votes)
83 views6 pages

Data Structure Proposal

This document defines a queue data structure and its implementation for managing patient records in a hospital setting. It includes struct definitions for patient data, a queue class with methods for adding, removing, and retrieving patients. It also defines functions for input/output of patient data and a menu interface. The main function initializes three queue objects for different hospital departments and provides a top-level menu to select a department and interact with its queue.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
83 views6 pages

Data Structure Proposal

This document defines a queue data structure and its implementation for managing patient records in a hospital setting. It includes struct definitions for patient data, a queue class with methods for adding, removing, and retrieving patients. It also defines functions for input/output of patient data and a menu interface. The main function initializes three queue objects for different hospital departments and provides a top-level menu to select a department and interact with its queue.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

#include<iostream>

#include<conio.h>
#include<string>
// define maximum number of patients in a queue
#define MAXPATIENTS 100
using namespace std;
// define structure for patient data
struct patient
{
char FirstName[50];
char LastName[50];
char ID[20];
};
// define class for queue
class queue
{
public:
queue(void);
int AddPatientAtEnd(patient p);
int AddPatientAtBeginning(patient p);
patient GetNextPatient(void);
int RemoveDeadPatient(patient * p);
void OutputList(void);
char DepartmentName[50];
private:
int NumberOfPatients;
patient List[MAXPATIENTS];
};
// declare member functions for queue
queue::queue()
{
// constructor
NumberOfPatients = 0;
}
int queue::AddPatientAtEnd(patient p)
{
// adds a normal patient to the end of the queue.
// returns 1 if successful, 0 if queue is full.
if (NumberOfPatients >= MAXPATIENTS)
{
// queue is full
return 0;
}
// put in new patient
else
List[NumberOfPatients] = p; NumberOfPatients++;
return 1;
}
int queue::AddPatientAtBeginning(patient p)
{
// adds a critically ill patient to the beginning of the queue.
// returns 1 if successful, 0 if queue is full.

if (NumberOfPatients >= MAXPATIENTS)


{
// queue is full
return 0;
}
// move all patients one position back in queue
for (int i = NumberOfPatients - 1; i >= 0; i--)
{
List[i + 1] = List[i];
}
// put in new patient
List[0] = p; NumberOfPatients++;
return 1;
}
patient queue::GetNextPatient(void)
{
// gets the patient that is first in the queue.
// returns patient with no ID if queue is empty
int i; patient p;
if (NumberOfPatients == 0)
{
// queue is empty

cout << "queue is empty" << endl;


}
// get first patient
p = List[0];
// move all remaining patients one position forward in queue
NumberOfPatients;
for (i = 0; i < NumberOfPatients; i++)
{
List[i] = List[i + 1];
}
// return patient
return p;
}
int queue::RemoveDeadPatient(patient * p)
{
// removes a patient from queue.
// returns 1 if successful, 0 if patient not found
int i, j, found = 0;
// search for patient
for (i = 0; i < NumberOfPatients; i++)
{
if (List[i].ID, p->ID == 0)
{
// patient found in queue
*p = List[i]; found = 1;
// move all following patients one position forward in queue
NumberOfPatients;
for (j = i; j < NumberOfPatients; j++)
{
List[j] = List[j + 1];
}
}
}
return found;
}
void queue::OutputList(void)
{
// lists entire queue on screen
int i;
if (NumberOfPatients == 0)
{
cout << "Queue is empty";
}
else
{
for (i = 0; i < NumberOfPatients; i++)
{
cout << endl << List[i].FirstName;
cout << endl << List[i].LastName;
cout << endl << List[i].ID;
}
}
}
// declare functions used by main:
patient InputPatient(void)
{
// this function asks user for patient data.
patient p;
cout << "Please enter data for new patient First name : ";
cin.getline(p.FirstName, sizeof(p.FirstName));
cout << "Last name : ";
cin.getline(p.LastName, sizeof(p.LastName));
cout << "Social security number : ";
cin.getline(p.ID, sizeof(p.ID));
// check if data valid
if (p.FirstName[0] == 0 || p.LastName[0] == 0 || p.ID[0] == 0)
{
// rejected
cout << "Error : Data not valid.Operation cancelled.";
system("pause");
}
return p;
}
void OutputPatient(patient * p)
{
// this function outputs patient data to the screen
if (p == NULL || p->ID[0] == 0)
{
cout << "No patient" << endl << endl;
return;
}
else
cout << "Patient data : "<<endl << endl;
cout << "First name : " << p->FirstName << endl << endl;
cout << "Last name : " << p->LastName << endl << endl;
cout << "Social security number : " << p->ID << endl << endl;
}
int ReadNumber()
{
// this function reads an integer number from the keyboard.
// it is used because input with cin >> doesn’t work properly!
char buffer[20];
cin.getline(buffer, sizeof(buffer));
return atoi(buffer);
}
void DepartmentMenu(queue * q)
{
// this function defines the user interface with menu for one

int choice = 0, success; patient p;


while (choice != 6)
{
// clear screen
// print menu
cout << endl << endl<<"Welcome to department : " << q->DepartmentName <<
endl << endl;
cout << "Please enter your choice : " << endl;
cout << "1: Add normal patient" << endl;
cout << "2: Add critically ill patient" << endl;
cout << "3: Take out patient for operation" << endl;
cout << " 4: Remove dead patient from queue" << endl;
cout << "5: List queue" << endl;
cout << "6: Change department or exit" << endl;
// get user choice
choice = ReadNumber();
// do indicated action
switch (choice)
{
case 1: // Add normal patient
p = InputPatient();
if (p.ID[0])
{
success = q->AddPatientAtEnd(p);
if (success)
{
cout << "Patient added :" << endl;
}
else
{
// error
cout << "Error : The queue is full.Cannot add patient :
" << endl;
}
OutputPatient(&p);
cout << endl<<"Press any key" << endl;
system("pause");
}
break;
case 2: // Add critically ill patient
p = InputPatient();
if (p.ID[0])
{
success = q->AddPatientAtBeginning(p);
if (success)
{
cout << endl<<"Patient added :" << endl;
}
else
{
// error
cout << endl<<"Error : The queue is full.Cannot add
patient : " << endl;
}
OutputPatient(&p);
cout << "Press any key" << endl;
system("pause");
}
break;
case 3: // Take out patient for operation
p = q->GetNextPatient();
if (p.ID[0])
{
cout << "Patient to operate :" << endl;
OutputPatient(&p);
}
else
{
cout << "There is no patient to operate." << endl << endl;
}
cout << "Press any key" << endl << endl;
system("pause");
break;
case 4: // Remove dead patient from queue
p = InputPatient();
if (p.ID[0])
{
success = q->RemoveDeadPatient(&p);
if (success)
{
cout << "Patient removed :" << endl << endl;
}
else
{
// error
cout << "Error : Cannot find patient :" << endl <<
endl;
}
OutputPatient(&p);
cout << "Press any key" << endl << endl;
system("pause");
}
break;
case 5: // List queue
q->OutputList();
cout << "Press any key" << endl << endl;
system("pause"); break;
}
}
}
// main function defining queues and main menu
int main()
{
int i, MenuChoice = 0;
// define three queues
queue departments[3];
// set department names
strcpy_s(departments[0].DepartmentName , "Heart clinic");
strcpy_s(departments[1].DepartmentName, "Lung clinic");
strcpy_s(departments[2].DepartmentName, "Plastic surgery");
while (MenuChoice != 4)
{
// clear screen
// print menu
cout << "Welcome to Software City Hospital" << endl << endl;
cout << "Please enter your choice :" << endl << endl;
cout << "press 1 for heart clinic" << endl << endl;
cout<<" press 2 for lung clinic "<<endl<<endl;
cout<<" press 3 for plastic surgery"<<endl<<endl;
cout << "4: Exit" << endl << endl;
// get user choice
MenuChoice = ReadNumber();
// is it a department name?
if (MenuChoice >= 1 && MenuChoice <= 3)
{
// call submenu for department
// (using pointer arithmetics here:)
DepartmentMenu(departments + (MenuChoice - 1));
}
}
}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy