Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
cPP,C++,c++,cpp Language Linked list. Solve the program using c++ language Linked list.

cPP,C++,c++,cpp Language Linked list. Solve the program using c++ language Linked list.

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question

cPP,C++,c++,cpp Language Linked list.

Solve the program using c++ language Linked list.

Question no.2: Implement the singly circular linked list of Employee with data members Name, id and salary. Add at least 5 nodes in the list. You will create a pointer named as last to keep the address of last node of list. Create the following functions: Last Name Name Name Name Name ID ID ID ID ID Salary Salary Salary Salary Salary Next Next Next Next Next • Createlist() to create a list of certain length. • CreateNode() to create the nodes dynamically. • readAlINodes() to get data of all nodes from user. • readeNode() to get data of single node from user. • displayAlINodes() to print out data of complete list. • displayNode() to print out the data of single node in a list. • InsertAtstart() to insert the new node at the start of list. • InsertAtlast() to insert the new node at end of the list. • insertAtTarget() to insert the new node at user specified location in the list. findTarget() to find the target node where new node is to be inserted. Date: 21/3/2021 • deleteAtStart() to delete the first node at the start of list. • deleteAtlast() to delete the last node at end of the list. • findSLast() to find the second last node in the list. • deleteAtTarget() to delete the node at user specified location in the list. • findPrevTarget() to find the node before the target node which is to be delete from list.
Transcribed Image Text:Question no.2: Implement the singly circular linked list of Employee with data members Name, id and salary. Add at least 5 nodes in the list. You will create a pointer named as last to keep the address of last node of list. Create the following functions: Last Name Name Name Name Name ID ID ID ID ID Salary Salary Salary Salary Salary Next Next Next Next Next • Createlist() to create a list of certain length. • CreateNode() to create the nodes dynamically. • readAlINodes() to get data of all nodes from user. • readeNode() to get data of single node from user. • displayAlINodes() to print out data of complete list. • displayNode() to print out the data of single node in a list. • InsertAtstart() to insert the new node at the start of list. • InsertAtlast() to insert the new node at end of the list. • insertAtTarget() to insert the new node at user specified location in the list. findTarget() to find the target node where new node is to be inserted. Date: 21/3/2021 • deleteAtStart() to delete the first node at the start of list. • deleteAtlast() to delete the last node at end of the list. • findSLast() to find the second last node in the list. • deleteAtTarget() to delete the node at user specified location in the list. • findPrevTarget() to find the node before the target node which is to be delete from list.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS