Question 1:Prepare a menu driven C program for inserting and deletion operation for a queue structureof employee information “struct student“ and the structure of a queue “struct queue”.a. Create a Circular queue using tenStudent array (copy from array into the queuewill be done).b. Using the circular queue which is populated at step 1, create two new circularqueues, one for Male and one for Female employees. These new queues will becreated during the deletion of the circular queue and use gender fields fordetermining Male(M) and Female(F) queues.c. End of operation (To write a COMPLETE C program)struct studentint TC;char F_name[12];char L_name[12];int age;char gender[2];/* M=male, F=Female */struct queue{struct student allperson[15];int front , rear;};struct Linked_list_node{struct student info;struct node *next;};struct Tree_node {struct node *left ;struct student info ;struct node *right;};sruct person tenStudent[10]={123,"Ahmet", "Osman", 21, "M",234,"Sevgi" ,"Kemal", 26, "F",128,"Osman" ,"Mert",18,"M",432,"Mert", "Osman", 27,"M",287,"Ayse" ,"Mert",34,"F"423,"Kemal", "Mehmet", 21, "M",634,"Lale", "Ali", 16, "F",828,"Sefer", "Osman", 15,"M",252,"Meral" ,"Kemal",27,"F",887,"Demet" ,"Mert",34,"F"}; Question 1:Prepare a menu driven C program for inserting and deletion operation for a queue structureof employee information “struct student“ and the structure of a queue “struct queue".a. Create a Circular queue using tenStudent array (copy from array into the queuewill be done).b. Using the circular queue which is populated at step 1, create two new circularqueues, one for Male and one for Female employees. These new queues will becreated during the deletion of the circular queue and use gender fields fordetermining Male(M) and Female(F) queues.c. End of operation

#include<stdio.h>#include<conio.h>#include<stdlib.h> struct student{ int…

Question 1:
Prepare a menu driven C program for inserting and deletion operation for a queue structure
of employee information “struct student“ and the structure of a queue “struct queue”.
a. Create a Circular queue using tenStudent array (copy from array into the queue
will be done).
b. Using the 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 the circular queue and use gender fields for
determining Male(M) and Female(F) queues.
c. End of operation

(To write a COMPLETE C program)
struct student
int TC;
char F_name[12];
char L_name[12];
int age;
char gender[2];/* M=male, F=Female */
struct queue
{
struct student allperson[15];
int front , rear;
};
struct Linked_list_node
{
struct student info;
struct node *next;
};
struct Tree_node {
struct node *left ;
struct student info ;
struct node *right;
};
sruct person tenStudent[10]={
123,"Ahmet", "Osman", 21, "M",
234,"Sevgi" ,"Kemal", 26, "F",
128,"Osman" ,"Mert",18,"M",
432,"Mert", "Osman", 27,"M",
287,"Ayse" ,"Mert",34,"F"
423,"Kemal", "Mehmet", 21, "M",
634,"Lale", "Ali", 16, "F",
828,"Sefer", "Osman", 15,"M",
252,"Meral" ,"Kemal",27,"F",
887,"Demet" ,"Mert",34,"F"
};

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Source Code

VIEW

Output

VIEW

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

in c language typedef _people { int age; char name[ 32 ] ; } People_T ; People_T data [ 3 ]; Using string lib function, Assign 30 and Cathy to the first cell, Assign 40 and John to the second cell and Assign 50 and Tom to the third cell
#include <conio.h>#include <iostream>#include <string> using namespace std;bool check = true;struct node {char name[20];char jobtitle[20];int empno;char branch;node *next;}*head,*lastptr; // pointes void add() // calling {node *p; //*p pomiterp=new node;cout<<"Enter name of employ:"<<endl;gets(p->name);cout<<"Enter job title of employ:"<<endl;gets(p->jobtitle);cout<<"Enter Number of employ:"<<endl;cin>>p->empno;cout<<"Enter branch of employ:"<<endl;cin>>p->branch;p->next=NULL; if(check) //if check is true its means heads is empty and there is no node exist.{head = p;lastptr = p;check = false;}else{lastptr->next=p;lastptr=p;}cout<<endl<<"Recored Entered";} void modify() {node *ptr; node *prev=NULL;node *current=NULL;int e_no;cout<<"Enter Number to…
In C, using malloc to allocate memory for a linked list uses which memory allocation scheme? Heap allocation Static allocation
C++ problem #include <iostream> #include <string> using namespace std; class node { public: string data; node* next; }; //Print all items from first to end of list void printList(node* first) { } int main() { //Create a new node with data "Tiger" node* T; T = new node; (*T).data = "Tiger"; //Create a node with "Monkey" node* M; M = new node; (*M).data = "Monkeykey"; //Now, hook T's next field to point to M. (*T).next = M; //Let's create a "Whale" node node* W; W = new node; (*W).data = "Whale"; //Hook M's next to W (*M).next = W; //Let's create a "Dpg" node node* D; D = new node; (*D).data = "Dog"; //Let's hook W's next to D (*W).next = D; //Make next point of last item //point to nothing (null) (*D).next = nullptr; // Step 1: printList(T); //Print: Tiger Monkey Whale Dog // Step 2: create function that removes last item from…
Huffman code // C program for Huffman Coding #include<stdio.h> #include<stdlib.h> #define MAX_TREE_HT 100 struct MinHeapNode { char data; unsigned freq; struct MinHeapNode *left, *right; }; struct MinHeap { unsigned size; unsigned capacity; struct MinHeapNode** array; }; struct MinHeapNode* newNode(char data, unsigned freq) { struct MinHeapNode* temp = (struct MinHeapNode*)malloc (sizeof(struct MinHeapNode)); temp->left = temp->right = NULL; temp->data = data; temp->freq = freq; return temp; } struct MinHeap* createMinHeap(unsigned capacity) { struct MinHeap* minHeap = (struct MinHeap*)malloc(sizeof(struct MinHeap)); minHeap->size = 0; minHeap->capacity = capacity; minHeap->array = (struct MinHeapNode**)malloc(minHeap-> capacity * sizeof(struct MinHeapNode*)); return minHeap; } void swapMinHeapNode(struct MinHeapNode** a, struct MinHeapNode** b) { struct MinHeapNode* t = *a; *a = *b;…
C++ Given code #include <iostream>using namespace std; class Node {public:int data;Node *pNext;}; void displayNumberValues( Node *pHead){while( pHead != NULL) {cout << pHead->data << " ";pHead = pHead->pNext;}cout << endl;} //Option 1: Search the list// TODO: complete the function below to search for a given value in linked lsit// return true if value exists in the list, return false otherwise. ?? linkedlistSearch( ???){ } //Option 2: get sum of all values// TODO: complete the function below to return the sum of all elements in the linked list. ??? getSumOfAllNumbers( ???){ } int main(){int userInput;Node *pHead = NULL;Node *pTemp;cout<<"Enter list numbers separated by space, followed by -1: "; cin >> userInput;// Keep looping until end of input flag of -1 is givenwhile( userInput != -1) {// Store this number on the listpTemp = new Node;pTemp->data = userInput;pTemp->pNext = pHead;pHead = pTemp;cin >> userInput;}cout <<"…
C++ Binary Search Tree program Create a class "Person" with three member variables string first name, string last name, int age. The primary key will be the last name. User will be prompted with a menu with two options: 1, "Enter person", where they will enter the persons first name, last name and age, or 2, "View person list" where the person may view the information previously added.
in c language !! typedef struct {long restaurant_id;char restaurant_name[10];char description[120];double rate;char cuisine[30]; opening_year;long capacity;char city[30];char address[60];char owner[30];} RECORD_t, *RECORD; RECdelete (unsigned long restaurant_id, RECORD *restaurant_array, unsigned long *p_size){int rec;int index;// index <- find the index of the RECORD with given restaurant_id in restaurant_array ????? (I DIDNT)if (index is valid)rec=restaurant_array[index];elserec=NULL;return rec;}
C++ ProgrammingActivity: Deque Linked List Explain the flow of the main code not necessarily every line, as long as you explain what the important parts of the code do. The code is already correct, just explain the flow. SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS int main(int argc, char** argv) { DLLDeque* deque = new DLLDeque(); int test; cin >> test; //Declarations int tempnum; int num; int sum; int count; bool addfirst = false; bool addlast = false; bool remfirst = false; bool remlast = false; switch (test) { case 0: //Implementation do{ cin >> num; if(num == 0){ break; } //Reset tempnum = num; count = 0; sum = 0; addfirst = false; addlast = false; remfirst = false; remlast =…
C++ PROGRAMMINGBinary Search Trees SEE ATTACHED PHOTO FOR THE PROBLEM INSTRUCTIONS It doesn't have to be long, as long as you explain what the important parts of the code do. (The code is already implemented and correct, only the explanation needed) #include "node.h" #include <iostream> using namespace std; class BSTree { node* root; int size; node* create_node(int num, node* parent) { node* n = (node*) malloc( sizeof(node) ); n->element = num; n->parent = parent; n->right = NULL; n->left = NULL; return n; } bool search(node* curr, int num) { if (curr == NULL) { return false; } if (num == curr->element) { return true; } if (num < curr->element) { return search(curr->left, num); } return search(curr->right, num); } node* search_node(node* curr, int num) { if (num ==…
Check 1 ALLLEURE #include #include using namespace std; void PrintSize(vector numsList) { cout intList (2); PrintSize(intList); cin >> currval; while (currVal >= 0) { } Type the program's output intList.push_back(currval); cin >> currval; PrintSize(intList); intList.clear(); PrintSize(intList); return 0; CS Scanned with Calin canner Janviantars Input 12345-1 Output Feedback? 口口。
in c language !! typedef struct {long restaurant_id;char restaurant_name[10];char description[120];double rate;char cuisine[30]; opening_year;long capacity;char city[30];char address[60];char owner[30];} RECORD_t, *RECORD; RECORD delete (unsigned long restaurant_id, RECORD *restaurant_array, unsigned long *p_size){int rec;int index;// index <- find the index of the RECORD with given restaurant_id in restaurant_array ????? (I DIDNT)if (index is valid)rec=restaurant_array[index];elserec=NULL;return rec;}