Prepare a menu driven C program for Inserting and deletion operation for a queue structure of employee information which has the following structure declaration. Structure of a queue will be defined as follows. struct person int empNo; char name[12]; int age; char gender[2];/* M=male, F=Female */ }; struct queue struct person allperson[15]; int front , rear; }; Define the following Initialized array of structure in your program. sruct person tenPerson[10]={123,"Ahmet", 21, "M", 234,"Sevgi", 26, "F", 128,"Osman", 18,"M", 432,"Mert",27,"M", 287,"Ayse",34,"F" 828,"Sefer", 15,"M", 252,"Meral",27,"F", 887,"Demet",34,"F"}; 423,"Kemal", 21, "M",634,"Lale", 16, "F", Following steps of operations will take place in your menu driven program. 1. Create a Circular queue using tenPerson array structure(copy from array into queue will be done). 2. Delete all the elements of queue and list all the deleted from the monitor. 3. Using circular queue which is populated at step 1, Create two new circular queues, one for Male and one for Female employees. These new queues will be created during the deletion of circular queue and use gender fields for determining Male(M) and Female(F) queues. 4. List the content of Male queue and Female queue during delete operation of each queue. 5. End of operation
Prepare a menu driven C program for Inserting and deletion operation for a queue structure of employee information which has the following structure declaration. Structure of a queue will be defined as follows. struct person int empNo; char name[12]; int age; char gender[2];/* M=male, F=Female */ }; struct queue struct person allperson[15]; int front , rear; }; Define the following Initialized array of structure in your program. sruct person tenPerson[10]={123,"Ahmet", 21, "M", 234,"Sevgi", 26, "F", 128,"Osman", 18,"M", 432,"Mert",27,"M", 287,"Ayse",34,"F" 828,"Sefer", 15,"M", 252,"Meral",27,"F", 887,"Demet",34,"F"}; 423,"Kemal", 21, "M",634,"Lale", 16, "F", Following steps of operations will take place in your menu driven program. 1. Create a Circular queue using tenPerson array structure(copy from array into queue will be done). 2. Delete all the elements of queue and list all the deleted from the monitor. 3. Using circular queue which is populated at step 1, Create two new circular queues, one for Male and one for Female employees. These new queues will be created during the deletion of circular queue and use gender fields for determining Male(M) and Female(F) queues. 4. List the content of Male queue and Female queue during delete operation of each queue. 5. End of operation
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
C programming
![Prepare a menu driven C program for Inserting and deletion operation for a queue
structure of employee information which has the following structure declaration.
Structure of a queue will be defined as follows.
struct person
int empNo;
char name[12];
int age;
char gender[2];/* M=male, F=Female */
};
struct queue
struct person allperson[15];
int front , rear;
};
Define the following Initialized array of structure in your program.
sruct person tenPerson[10]={123,"Ahmet", 21, "M",
234,"Sevgi", 26, "F", 128,"Osman", 18,"M", 432,"Mert",27,"M",
287,"Ayse",34,"F"
828,"Sefer", 15,"M", 252,"Meral",27,"F", 887,"Demet",34,"F"};
, 423,"Kemal", 21, "M",634,"Lale", 16, "F",
Following steps of operations will take place in your menu driven program.
1. Create a Circular queue using tenPerson array structure(copy from array into
queue will be done).
2. Delete all the elements of queue and list all the deleted from the monitor.
3. Using circular queue which is populated at step 1, Create two new circular queues,
one for Male and one for Female employees. These new queues will be created
during the deletion of circular queue and use gender fields for determining Male(M)
and Female(F) queues.
4. List the content of Male queue and Female queue during delete operation of each
queue.
5. End of operation](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F695d2234-b6de-45f4-a5b2-a087c7d4312b%2F8a7d42d2-c166-4014-be23-5138f241ec2b%2Fd3emdl_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Prepare a menu driven C program for Inserting and deletion operation for a queue
structure of employee information which has the following structure declaration.
Structure of a queue will be defined as follows.
struct person
int empNo;
char name[12];
int age;
char gender[2];/* M=male, F=Female */
};
struct queue
struct person allperson[15];
int front , rear;
};
Define the following Initialized array of structure in your program.
sruct person tenPerson[10]={123,"Ahmet", 21, "M",
234,"Sevgi", 26, "F", 128,"Osman", 18,"M", 432,"Mert",27,"M",
287,"Ayse",34,"F"
828,"Sefer", 15,"M", 252,"Meral",27,"F", 887,"Demet",34,"F"};
, 423,"Kemal", 21, "M",634,"Lale", 16, "F",
Following steps of operations will take place in your menu driven program.
1. Create a Circular queue using tenPerson array structure(copy from array into
queue will be done).
2. Delete all the elements of queue and list all the deleted from the monitor.
3. Using circular queue which is populated at step 1, Create two new circular queues,
one for Male and one for Female employees. These new queues will be created
during the deletion of circular queue and use gender fields for determining Male(M)
and Female(F) queues.
4. List the content of Male queue and Female queue during delete operation of each
queue.
5. End of operation
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY