In c++ program. Please show the output of this program

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...
icon
Related questions
Question

In c++ program. Please show the output of this program

BETA Can't read the text? Switch theme
2. [CSDC103 ] PE02 Singly Linked List Search and
Delete
PROBLEM DESCRIPTION
Update the code from the previous question by including a search &
delete command. The program must now also be able to search for
the first instance of a node and delete it.
INPUT FORMAT
The input consists of a series of N character-integer pairs c; n;, where
c; is the command and n; is the value associated with the command. If
the command does not require n; (as in deletion & refresh), then the
n¡ supplied is ignored. For the search command, n will be treated as
the value to be checked within the list.
CONSTRAINTS
1 <= N <= 10³
-100 <= n <= 100
1 <= 1 <= N
the current valid commands are as follows:
i for insertion
d for deletion
r for refresh
s for search
x search and delete
For c,
OUTPUT FORMAT
For each cn pair, display the number of nodes present on the list
enclosed in brackets followed by the current content of the list.
If c is invalid, display INVALID COMMAND.
If the c='d' but the list is already empty, display THE LIST IS ALREADY
EMPTY.
If c='s' and n is on the list, display VALUE FOUND. Otherwise, display
VALUE NOT FOUND.
If c='x' and n is on the list, display the list effectively deleting the node
with value n. If n is not on the list, display VALUE NOT FOUND.
Transcribed Image Text:BETA Can't read the text? Switch theme 2. [CSDC103 ] PE02 Singly Linked List Search and Delete PROBLEM DESCRIPTION Update the code from the previous question by including a search & delete command. The program must now also be able to search for the first instance of a node and delete it. INPUT FORMAT The input consists of a series of N character-integer pairs c; n;, where c; is the command and n; is the value associated with the command. If the command does not require n; (as in deletion & refresh), then the n¡ supplied is ignored. For the search command, n will be treated as the value to be checked within the list. CONSTRAINTS 1 <= N <= 10³ -100 <= n <= 100 1 <= 1 <= N the current valid commands are as follows: i for insertion d for deletion r for refresh s for search x search and delete For c, OUTPUT FORMAT For each cn pair, display the number of nodes present on the list enclosed in brackets followed by the current content of the list. If c is invalid, display INVALID COMMAND. If the c='d' but the list is already empty, display THE LIST IS ALREADY EMPTY. If c='s' and n is on the list, display VALUE FOUND. Otherwise, display VALUE NOT FOUND. If c='x' and n is on the list, display the list effectively deleting the node with value n. If n is not on the list, display VALUE NOT FOUND.
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

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