1. So far, we have learnt many insert functions of linked lists . Now you have to write another insert function where the inserted value will be inserted in a sorted manner. void InsertSort(int item); • After inserting some values with this insert function, print the list. All the inserted values will be taken as user input. Then write a function by which you can remove all the repeated items from the linked list. void RemoveDuplicate (); Input Insert - 3, 4, 1, 2, 3, 1, 5, 1 Output 11123345 RemoveDuplicate(); 12345 2 You are building a travel agency system Now write a class for traveler where vou can
1. So far, we have learnt many insert functions of linked lists . Now you have to write another insert function where the inserted value will be inserted in a sorted manner. void InsertSort(int item); • After inserting some values with this insert function, print the list. All the inserted values will be taken as user input. Then write a function by which you can remove all the repeated items from the linked list. void RemoveDuplicate (); Input Insert - 3, 4, 1, 2, 3, 1, 5, 1 Output 11123345 RemoveDuplicate(); 12345 2 You are building a travel agency system Now write a class for traveler where vou can
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...
Related questions
Question
100%
This is a cpp program do exactly in the question says
do the input and required details names exactly in the question says
try to do it fast thank you
follow the pattern please thank you :)
![1. So far, we have learnt many insert functions of linked lists . Now you have to write
another insert function where the inserted value will be inserted in a sorted manner.
void InsertSort(int item);
After inserting some values with this insert function, print the list. All the inserted values
will be taken as user input.
Then write a function by which you can remove all the repeated items from the linked list.
void RemoveDuplicate ();
Input:
Insert - 3, 4, 1, 2, 3, 1, 5, 1
Output
11123345
RemoveDuplicate();
12345
2. You are building a travel agency system. Now, write a class for traveler where you can
put-
a. Name of the traveler(String)
b. Passport number(String) [Every passport number's first two characters contain
letters and the rest of the characters contain numbers. Where first two characters
represent the country name]
c. Number of times he/she traveled outside the country(Int).
You have to enlist all the information of travelers in an unsorted list.
Note - Every input has to be taken from the user.
Print all the travelers' every information.
Delete those travelers' information from the list who didn't travel outside of the
country and print the travelers' information who are in the list after deletion.
Print those travelers' information who are from Bangladesh and traveled to at
least 3 countries.
In the given example prefix in the passport name -
BD - Bangladesh
UG - Uganda
PN- Papua New Guinea
JP - Japan](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F66691ccb-969b-48b8-b907-8b977c1e429d%2Fbdb44847-006d-410e-ab0e-f27ae58076cb%2F779lhth_processed.png&w=3840&q=75)
Transcribed Image Text:1. So far, we have learnt many insert functions of linked lists . Now you have to write
another insert function where the inserted value will be inserted in a sorted manner.
void InsertSort(int item);
After inserting some values with this insert function, print the list. All the inserted values
will be taken as user input.
Then write a function by which you can remove all the repeated items from the linked list.
void RemoveDuplicate ();
Input:
Insert - 3, 4, 1, 2, 3, 1, 5, 1
Output
11123345
RemoveDuplicate();
12345
2. You are building a travel agency system. Now, write a class for traveler where you can
put-
a. Name of the traveler(String)
b. Passport number(String) [Every passport number's first two characters contain
letters and the rest of the characters contain numbers. Where first two characters
represent the country name]
c. Number of times he/she traveled outside the country(Int).
You have to enlist all the information of travelers in an unsorted list.
Note - Every input has to be taken from the user.
Print all the travelers' every information.
Delete those travelers' information from the list who didn't travel outside of the
country and print the travelers' information who are in the list after deletion.
Print those travelers' information who are from Bangladesh and traveled to at
least 3 countries.
In the given example prefix in the passport name -
BD - Bangladesh
UG - Uganda
PN- Papua New Guinea
JP - Japan
![Input:
Tanvir , BD14245, 3
Enan , BD12345, 1
Junayet, UG12345, 1
Akash, PN13245, O
Eren, JP13345, 4
Output:
[Tanvir ] [BD14245] [3]
(Enan ] (BD12345] [1]
[Junayet ] [UG12345] [1]
[Akash ] [PN13245] [0]
[Eren ] [JP13345] (4)
List who traveled outside of their
country
[Tanvir] [BD14245] [3]
(Enan ] [BD12345][1]
[Junayet ] [UG12345] (1]
[Eren ] [JP13345] [4]
After delete operation
Travelers who visited to at least 3
countries
Elite Travelers
[Tanvir ] [BD14245] [3]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F66691ccb-969b-48b8-b907-8b977c1e429d%2Fbdb44847-006d-410e-ab0e-f27ae58076cb%2Fzcxacec_processed.png&w=3840&q=75)
Transcribed Image Text:Input:
Tanvir , BD14245, 3
Enan , BD12345, 1
Junayet, UG12345, 1
Akash, PN13245, O
Eren, JP13345, 4
Output:
[Tanvir ] [BD14245] [3]
(Enan ] (BD12345] [1]
[Junayet ] [UG12345] [1]
[Akash ] [PN13245] [0]
[Eren ] [JP13345] (4)
List who traveled outside of their
country
[Tanvir] [BD14245] [3]
(Enan ] [BD12345][1]
[Junayet ] [UG12345] (1]
[Eren ] [JP13345] [4]
After delete operation
Travelers who visited to at least 3
countries
Elite Travelers
[Tanvir ] [BD14245] [3]
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY