To write a COMPLETE C program) Prepare a menu-driven C program for Inserting and deletion operations for a queue structure of teacher information which has the following structure declaration. Structure of a queue will be defined as follows. struct teacher { char F_name[12]; char L_name[12]; int TC; char address[20]; char email[30]; char mobile[12]; char department[2];/* CE=Computer Engineering, E=English */ }; struct queue {struct teacher std_info[10]; int front , rear; }; Define the following Initialized array of structure in your program. struct teacher HKU [10]={”Ahmet” ,”Osman”, 12005310,”Gaziantep”,”Ahmet@gmail.com”,“05531001020”,“CE”, ”Sevgi” ,”Mert”, 12005311,”Konya”,” Sevgi@gmail.com”, “05531141990”,“E”, ”Osman”, ”Kemal”, 12005312,”Istanbul”,” Osman@gmail.com”, “05531331023”,“CE”, ”Mert”, ”Osman”, 12005313, ”Antalya”,” Mert@gmail.com”, “05531041424”,“CE”, ”Ayse”,”Omer”, 12005314,”Ankara”,” Ayse@gmail.com”, “05531087412”,“E”, ”Kemal”, “ali”, 12005315, ”Izmir”,” Kemal@gmail.com”, “05535471028”,“CE”, ”Lale”, ”Can”, 12005316, ,”Trabzon”,” Lale@gmail.com”, “05534712036”,“E”, ”Sefer”, ”Mert”, 12005317, ”Mardin”,” Sefer@gmail.com”, “05531078621”,“CE”, ”Meral”, ,”Jemal”, 12005318,”Bursa”,” Meral@gmail.com”, “05531003578”,“E”, ”Demet”, ”Kemal”, 12005319,”Ankara”,” Demet@gmail.com” ,“05531841220”,“E”}; The following steps of operations will take place in your menu-driven program. 1. Create a Circular queue using HKU array structure (copy from array into the queue will be done). 2. Using the circular queue which is populated in step 1, Create two new circular queues, one for Computer Engineering teachers and one for English teachers. These new queues will be created using department fields for determining Computer Engineering (CE) and English (E) queues. 3. Print the contents of Computer Engineering QUEUE and EnglishQUEUE. 4. Deletethe contents of THE THREE QUEUES. 5. End of operation
To write a COMPLETE
C program)
Prepare a menu-driven C program for
Inserting and deletion operations for a queue structure of teacher information
which has the following structure declaration.
Structure of a queue will be defined as follows.
struct teacher
{ char F_name[12]; char L_name[12]; int TC;
char address[20]; char email[30];
char mobile[12];
char department[2];/* CE=Computer
Engineering, E=English */
};
struct queue
{struct teacher std_info[10]; int front
, rear;
};
Define the following Initialized array of structure in your program.
struct teacher HKU [10]={”Ahmet”
,”Osman”, 12005310,”Gaziantep”,”Ahmet@gmail.com”,“05531001020”,“CE”,
”Sevgi” ,”Mert”, 12005311,”Konya”,” Sevgi@gmail.com”,
“05531141990”,“E”,
”Osman”,
”Kemal”, 12005312,”Istanbul”,” Osman@gmail.com”,
“05531331023”,“CE”,
”Mert”, ”Osman”, 12005313,
”Antalya”,” Mert@gmail.com”,
“05531041424”,“CE”,
”Ayse”,”Omer”,
12005314,”Ankara”,” Ayse@gmail.com”,
“05531087412”,“E”,
”Kemal”, “ali”, 12005315,
”Izmir”,” Kemal@gmail.com”,
“05535471028”,“CE”,
”Lale”, ”Can”, 12005316, ,”Trabzon”,” Lale@gmail.com”,
“05534712036”,“E”,
”Sefer”,
”Mert”, 12005317, ”Mardin”,” Sefer@gmail.com”,
“05531078621”,“CE”,
”Meral”, ,”Jemal”, 12005318,”Bursa”,” Meral@gmail.com”,
“05531003578”,“E”,
”Demet”,
”Kemal”, 12005319,”Ankara”,” Demet@gmail.com” ,“05531841220”,“E”};
The following steps of
operations will take place in your menu-driven
program.
1. Create a Circular queue using HKU array structure (copy from array into the queue will be done).
2. Using the circular queue which is populated in step 1, Create two new circular queues, one for Computer Engineering teachers and one for English teachers. These new queues will be created using department fields for determining Computer Engineering (CE) and English (E) queues.
3. Print the contents of Computer Engineering QUEUE and EnglishQUEUE.
4. Deletethe contents of THE THREE QUEUES.
5. End of operation
Step by step
Solved in 2 steps
