this is what I am using of your code in post # 3 , that password thing removed, not really needed it is of part of your home work, is it?
Fixed your first print out for commands to screen , fixed your returns warnings by adding return 0 in all of them, and replaced that printf with your fixed one.
added your redone function
Code:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#define MAX 6 //Size of queue array
/*FUNCTION PROTOTYPES START*/
void enqueue(int data);
int dequeue();
int position(int n);
void print();
void clear();
void remove_nth(int n);
void help(void);
void status();
void queue_display();
void loading();
void cancel_appt();
void doctor_ready(int room_no);
void doctor_away(int id);
void patient_discharge(int n);
void doctors();
int check_if(int id);
int first();
int last();
bool is_empty();
bool is_full();
/*FUNCTION PROTOTYPES FINISH*/
/*GLOBAL VARIABLE DECLARATIONS START*/
int queue[MAX]; //Queue for patients waiting
int room_no[10][2]; //2d array for Doctors rooms
int front = -1; //Front of queue
int rear = -1; //Back of queue
int num = -1;
int pos = 1; //Position of a number in an array
/*GLOBAL VARIABLE DECLARATIONS FINISH*/
int main(int argc, char * * argv) {
/*Patient Commands
i-Patient check in
p-Patient queue position
q-Patient quit
d-Available doctors
h-Help - display commands*/
/*Doctors Commands
o-Paitient check out
r-Doctor ready
a-Doctor away
w-Waiting list
x-Exit*/
/*Other
s-Room status (for testing purposes)*/
for (int i = 0; i < 10; i++)
for (int j = 0; j < 2; j++){ //Initialise rooms to zero
room_no[i][j] = 0;
}
/*WELCOME MESSAGE*/
puts("Hello and welcome to Leeds Student Medical Practice");
puts("Press RETURN to continue...");
getchar();
system("clear");
loading();
char choice; //Choice for switch statement
do { //Do-While loop to keep switch statement running until exit of program
printf("\nMo's Surgery\n"
"-------------\n"
"Patient commands\n"
"----------------------\n"
"i # - Check in on arrival, where # is your patient id number\n"
"p #- Check position in queue\n"
"q #- Cancel appointment\n"
"d - View # of available Doctors\n"
"Enter a command\n"
"hint - to view available commands enter 'h'\n"
">>>");
scanf(" %c", & choice);
/*SWITCH START*/
switch (choice) {
case 'h':
loading();
system("clear");
help();
break;
case 'i':
loading();
system("clear");
int patient_id;
scanf(" %d", &patient_id);
enqueue(patient_id);
break;
case 'p':
loading();
system("clear");
scanf("%d", &patient_id);
position(patient_id);
break;
case 'q':
loading();
system("clear");
scanf(" %d", &patient_id);
cancel_appt(patient_id);
break;
case 'd':
loading();
system("clear");
doctors();
break;
case 'o':
loading();
system("clear");
scanf("%d", &patient_id);
remove_nth(patient_id);
break;
case 'r':
loading();
system("clear");
int room_id;
scanf("%d", &room_id);
doctor_ready(room_id);
break;
case 'a':
loading();
system("clear");
scanf("%d", &room_id);
doctor_away(room_id);
break;
case 's':
loading();
system("clear");
status();
break;
case 'w':
loading();
system("clear");
print();
break;
case 'u':
queue_display();
break;
case 'x':
loading();
system("clear");
exit(1);
break;
default:
printf("Error, command not recognised. Please enter a valid command.\n");
/*SWITCH FINISH*/
}
} while (choice != 'x'); //Do-while finish
return 0;
}
/*HELP FUNCTION (Prints list of commands for user)*/
void help() {
puts("Patient commands");
puts("----------------------");
puts("i - Check in on arrival");
puts("p - Check position in queue");
puts("q - Cancel appointment");
puts("d - View # of available Doctors\n");
puts("Administrator commands only");
puts("------------------------------");
puts("o - Check patient out");
puts("r - Call patient");
puts("a - Doctor away");
puts("w - View waiting list\n");
puts("Other");
puts("----------");
puts("x - Exit\n");
}
/*QUEUE 'IS EMPTY' FUNCTION (Checks if queue is empty)*/
bool is_empty() {
if (front == -1 && rear == -1)
return true;
else
return false;
}
/*QUEUE 'IS FULL' FUNCTION (Checks if queue is full)*/
bool is_full() {
if ((rear == MAX - 1 && front == 0) || (front == rear + 1))
return true;
else {
return false;
}
}
/*ENQUEUE FUNCTION (Inserts element at rear end)*/
/*
void enqueue(int data) {
if (check_if(data) == 1)
puts("You have checked in already!");
else if (is_full())
puts("\nSorry, the waiting queue is full. Please try again later.");
else {
if (rear == MAX - 1 && front != 0)
rear = -1;
queue[++rear] = data;
printf("\nWelcome Patient No. %d\nAll Doctors a busy right now.\nPlease relax in the waiting area.\n\n", data);
if (front == -1)
front = 0;
for (int i = 0; i <= 10; i++) {
if (room_no[i][0] == 1 && room_no[i][1] == 0) {
printf("Welcome Patient No. %d\n Please come to room # %d.\n", data, i + 1);
room_no[i][1] = data;
dequeue();
break;
} else if (i == 10) {
position(data);
break;
}
}
}
}
***/
void enqueue(int data) { if (check_if(data) == 1) {
puts("You have checked in already! To view position in queue press 'p #', where # represents your ID number.");
} else if (is_full())
puts("\nSorry, the waiting queue is full. Please try again later.");
else if (is_empty()) {
front = 0;
rear = 0;
queue[rear] = data;
} else if (rear == MAX - 1 && front != 0) {
rear = 0;
queue[rear] = data;
printf("\nWelcome Patient No. %d\nAll Doctors are busy right now.\nPlease relax in the waiting area.\n\n", data);
} else {
queue[++rear] = data;
}
for (int i = 0; i <= 10; i++) {
if (room_no[i][0] == 1 && room_no[i][1] == 0) {
printf("Welcome Patient No. %d\n Please come to room # %d.\n", data, i + 1);
room_no[i][1] = data;
dequeue();
break;
} else if (i == 10) {
position(data);
break;
}
}
}
int check_if(int id) {
if (queue[rear] == id)
return 1;
else {
for (int i = 0; i < 10; i++) {
if (id == room_no[i][1])
return 1;
}
}
for (int i = front; i != rear; i++) {
if (queue[i] == id) {
return 1;
} else if (i == MAX - 1)
i = 0;
else
return 0;
}
return 0;
}
/*DEQUEUE FUNCTION (Removes element in queue from front end)*/
int dequeue() {
if (is_empty())
puts("\nNothing in queue!!!");
else {
printf("\n%d has been removed from the queue.\n", queue[front++]);
if (front == MAX)
front = 0;
if (front - 1 == rear)
front = rear = -1;
}
return queue[front];
}
/*FIRST FUNCTION (Returns element at front of queue)*/
int first() {
if (front == -1) {
puts("Error: cannot return front from empty queue");
return -1;
}
else {
printf("%d\n\n", queue[front]);
}
return 0;
}
/*LAST FUNCTION (Returns element at back of queue)*/
int last() {
if (rear == -1) {
puts("Error: cannot return rear from empty queue");
return -1;
}
else {
printf("%d\n\n", queue[rear]);
}
return 0;
}
/*PRINT FUNCTION (Prints out queue)*/
void print() {
if (front == -1)
puts("\nNothing to display");
else {
int i = front;
puts("\nThe following patients are waiting: \n");
if (front <= rear) {
while (i <= rear)
printf("%d\t", queue[i++]);
}
else {
while (i <= MAX - 1)
printf("%d\t", queue[i++]);
i = 0;
while (i <= rear)
printf("%d\t", queue[i++]);
printf("\n");
}
}
}
/*POSITION FUNCTION (Tells user their position in the queue)*/
int position(int n) {
for (int i = front; i <= rear; i++)
{
if (queue[i % MAX] == n) {
printf("You are in the queue!\n");
printf("Position in queue is %d \n", (i%MAX + 1) - front);
return 0;
}
}
return 0;
}
/*REMOVE NTH FUNCTION (Removes nth element from queue)*/
void remove_nth(int n) {
int i;
if ((front == -1) && (rear == -1)) {
puts("Queue is empty! Nothing to remove.");
return;
}
for (i = 0; i <= rear; i++) {
if (n == queue[i]) {
for (; i < rear; i++) {
queue[i] = queue[i + 1];
}
queue[i] = 0;
rear--;
if (rear == -1)
front = -1;
puts("Succesfully deleted\n");
return;
}
}
printf("\n%d not found in queue to delete\n\n", n);
}
/*STATUS FUNCTION (Checks if rooms are available or not)*/
void status() {
for (int i = 0; i < 10; i++) {
printf("Room %i: ", i + 1);
if (room_no[i][0] == 0)
puts("Unoccupied");
else if (room_no[i][1] == 0)
puts("Dr is present with no patient");
else
printf("A Dr is in with patient no. %i\n", room_no[i][1]);
}
}
/*DOCTORS FUNCTION (Displays the number of doctors currently available at the surgery, and a list of all examination rooms that are currently staffed)*/
void doctors() {
int doctor_count = 0;
int rooms_ocup[10];
for (int i = 0; i < 10; i++) {
if (room_no[i][0] == 1) {
rooms_ocup[doctor_count] = i;
doctor_count++;
}
}
if (doctor_count > 1) {
printf("Currently there are %i Doctors in the Surgery. They are in rooms ", doctor_count);
for (int i = 0; i < doctor_count - 1; i++)
printf("%i, ", rooms_ocup[i]);
printf("%i, ", rooms_ocup[doctor_count - 1]);
} else printf("Currently there is 1 Doctor in the Surgery. They are in room %i.\n", rooms_ocup[0]);
}
/*DOCTOR READY FUNCTION (Allows doctor to declare they are ready to accept patients)*/
void doctor_ready(int room_id) {
int x = room_id - 1;
for (int i = 0; i <= 10; i++) {
if (i == x)
room_no[i][0] = 1;
}
if (room_id > 10 || room_id < 1)
puts("Wrong room! There are only ten rooms!");
else if (is_empty() == 0) {
if (room_no[x][1] == 0) {
printf("Patient number %d, the Doctor will see you now. Please come to room #%d", queue[front], room_id);
room_no[x][1] = queue[front];
dequeue();
} else
puts("Current patient needs to be discharged");
} else
puts("There are no patients waiting to be seen.");
}
/*DOCTOR AWAY FUNCTION (Allows doctor to declare they are leaving their room)*/
void doctor_away(int id) {
if(room_no[id - 1][1] != 0)
puts("Please discharge your patient before leaving.");
else
room_no[id - 1][0] = 0;
}
/*DISCHARGE PATIENT FUNCTION (Checks patient out of a room)*/
void patient_discharge(int n){
for(int i = 0; i <= 10; i++){
if(i == 10)
puts("That patient isn't in any room!");
else if (room_no[i][1] == n) {
room_no[i][1] = 0;
break;
}
}
}
/*CANCEL FUNCTION (Allows patient to cancel appt. (similair to remove_nth))*/
void cancel_appt(int n) {
int i;
if ((front == -1) && (rear == -1)) {
puts("Queue is empty! Nothing to cancel.");
return;
}
for (i = 0; i <= rear; i++) {
if (n == queue[i]) {
for (; i < rear; i++) {
queue[i] = queue[i + 1];
}
queue[i] = 0;
rear--;
if (rear == -1)
front = -1;
puts("Appointment successfully canceled\n");
return;
}
}
printf("\n%d not found in queue to delete\n\n", n);
}
/*QUEUE DISPLAY FUNCTION (Displays array)*/
void queue_display() {
printf("First: %d Last %d \n", front, rear);
for (int i = 0; i < MAX; i++){
if(i == front)
puts("(First->)");
if(i == rear)
puts("(Last->)");
printf("%d\t", queue[i]);
}
printf("\n\n");
}
/*CLEAR FUNCTION (Clears entire queue)*/
void clear(){
front = -1;
rear = -1;
}
void loading() {
puts("Loading...\n");
//For loop to add delay to give loading effect
for (int c = 1; c <= 32767; c++)
for (int k = 1; k <= 32767; k++) {}
}
this is the out put for first run adding first patent
Code:
userx@slackwhere:~/bin
$ ./doctor_queue
Hello and welcome to Leeds Student Medical Practice
Press RETURN to continue...
Loading...
Mo's Surgery
-------------
Patient commands
----------------------
i # - Check in on arrival, where # is your patient id number
p #- Check position in queue
q #- Cancel appointment
d - View # of available Doctors
Enter a command
hint - to view available commands enter 'h'
>>>i 1
Loading...
Welcome Patient No. 1
Please come to room # 11.
1 has been removed from the queue.
Mo's Surgery
-------------
Patient commands
----------------------
i # - Check in on arrival, where # is your patient id number
p #- Check position in queue
q #- Cancel appointment
d - View # of available Doctors
Enter a command
hint - to view available commands enter 'h'
>>>
how you can see what it is doing, you're the programmer for this ... the ball is in your court. I'm just a tester 
Originally Posted by GeorgeIO
Yes, it is an update. My bad for not stating that. But your idea is perhaps a better one.
