10. Write a program in āCā language that will perform the following operation on double link list. Each node of this list contains the address of previous as well as next node. The previous pointer of first node & next pointer of last node should contain null. 1. Creation of list with as many records as user want 2. Search a node in the list 3. Deletion at last position 4. Display 5. Exit Create separate functions for each operation. The create () will be used to create the list. It should accept no argument & return the address of the starting node. Search() will search a node in the list. It receives rollno as argument & return that node if found otherwise return null. The delete () function will delete the last node. It does not receive any argument & return structure type value at last position. The starting node of the double list must be declared as external pointer variable. Each element of double link list will contain the following information Roll No, Std Name, Course. Use do-while loop & switch case for generating the above menu. The format of the output should is given below: S.No. Roll No. Student Name Course 1 cse01 Anil Singh B.Tech
What is directive advice?
What is galvanic cell?
What is difference between java and java ee?
Is linq faster than foreach?
Define early construction of human being
How do I import a csv file into postgres?
How to convert nsnumber to nsstring in objective c?
What is the difference between the web server and application server?
what is start message event listener?
Expand-------ANCS
what is accounting in automobile
Is sql sequential or random?
What is ejb and how it works?
What are the features of zend framework?