Q1) 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. C.Append an element that contains the information of new students to the beginning of a list D.Append an element that contains the information of new students as a second node in the list E. Delete the first element from a list. F. Delete the nth element from a list. G. Insert an element before the nth element of a list. H. Free all nodes in a list. I. Concatenate two lists.
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
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”,”SeferMert”, 12005317, ”Mardin”,” Sefer@gmail.com”,“05531078621”,“CE”,”Meral Jemal”, 12005318,”Bursa”,” Meral@gmail.com”,“05531003578”,“E”,”DemetKemal”, 12005319,”Ankara”,” Demet@gmail.com”,“05531841220”,“E”};
Q1) 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.
C.Append an element that contains the information of new students to the beginning of a list
D.Append an element that contains the information of new students as a second node in the list
E. Delete the first element from a list.
F. Delete the nth element from a list.
G. Insert an element before the nth element of a list.
H. Free all nodes in a list.
I. Concatenate two lists.
Step by step
Solved in 2 steps with 1 images
