(To write a COMPLETE C program) Prepare a menu-driven C program for Inserting and deletion operation for both a queue structure and a linked list of student information which has the following structure declaration. struct student { char Student_name[30]; int TC; char address[20]; char email[30]; char mobile[12]; char department[2];/* CE=Computer Engineering, E=English */ }; Define the following Initialized array of structure in your program. struct student 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”}; Using struct Student HKU [10] A.Create a linked list of ten nodes, sorted using TC. B.Create a list of ten nodes, sorted using Student_name.
(To write a COMPLETE C program)
Prepare a menu-driven C program for Inserting and deletion
operation for both a queue structure and a linked list of student
information which has the following structure declaration.
struct student
{ char Student_name[30];
int TC;
char address[20];
char email[30];
char mobile[12];
char department[2];/* CE=Computer Engineering, E=English */
};
Define the following Initialized array of structure in your program.
struct student 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”};
Using struct Student HKU [10]
A.Create a linked list of ten nodes, sorted using TC.
B.Create a list of ten nodes, sorted using Student_name.
Step by step
Solved in 2 steps
