1. Create a program that uses a LINKED LIST to do the following: a. Using the attached file, input.txt, read the integers and dynamically process alinked list. The file contains action code and integer pairs. Process these actions as they are read. The action code is first: I = Insert a new node with the corresponding value. Insert in ascending(sorted) order D = Delete the node with the corresponding value S = Search the current list for the corresponding value b. You may use any examples reviewed in class that explain how to process a linked list. The book contains examples and code to insert into, delete from and search a linked list c. If the action is 'S' and the value does NOT exist in the linked list, display an appropriate message. If the value DOES exist in the linked list, display an appropriate message. d. If the action is 'D' and the value does NOT exist in the linked list, display an appropriate message e. After all input is processed, display the contents of the resulting linked list f. Read until end of file. DO NOT code the loop for the number of values in the table g. Do not use the linked list ADT in the book (although you may use the code in the ADT methods as examples. Design and implement the solution however you wish(all in main, functions, etc.) The program may be named any name of our choice, must have a .cpp extention; variables may be any nameof your choice. please show the output of the program too Thank you
1. Create a program that uses a LINKED LIST to do the following: a. Using the attached file, input.txt, read the integers and dynamically process alinked list. The file contains action code and integer pairs. Process these actions as they are read. The action code is first: I = Insert a new node with the corresponding value. Insert in ascending(sorted) order D = Delete the node with the corresponding value S = Search the current list for the corresponding value b. You may use any examples reviewed in class that explain how to process a linked list. The book contains examples and code to insert into, delete from and search a linked list c. If the action is 'S' and the value does NOT exist in the linked list, display an appropriate message. If the value DOES exist in the linked list, display an appropriate message. d. If the action is 'D' and the value does NOT exist in the linked list, display an appropriate message e. After all input is processed, display the contents of the resulting linked list f. Read until end of file. DO NOT code the loop for the number of values in the table g. Do not use the linked list ADT in the book (although you may use the code in the ADT methods as examples. Design and implement the solution however you wish(all in main, functions, etc.) The program may be named any name of our choice, must have a .cpp extention; variables may be any nameof your choice. please show the output of the program too Thank you
Chapter3: Data Representation
Section: Chapter Questions
Problem 5VE: Assembly (machine) language programs for most computers use __________ notation to represent memory...
Related questions
Concept explainers
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).
Question
1. Create a program that uses a LINKED LIST to do the following:
a. Using the attached file, input.txt, read the integers and dynamically process alinked list.
The file contains action code and integer pairs. Process these actions as they are read.
The action code is first:
I = Insert a new node with the corresponding value. Insert in ascending(sorted) order
D = Delete the node with the corresponding value
S = Search the current list for the corresponding value
b. You may use any examples reviewed in class that explain how to process a linked list.
The book contains examples and code to insert into, delete from and search a linked
list
c. If the action is 'S' and the value does NOT exist in the linked list, display an appropriate message.
If the value DOES exist in the linked list, display an appropriate message.
d. If the action is 'D' and the value does NOT exist in the linked list, display an appropriate message
e. After all input is processed, display the contents of the resulting linked list
f. Read until end of file. DO NOT code the loop for the number of values in the table
g. Do not use the linked list ADT in the book (although you may use the code in the
ADT methods as examples. Design and implement the solution however you wish(all in main, functions, etc.)
The program may be named any name of our choice, must have a .cpp extention; variables may be any nameof your choice.
please show the output of the program too
Thank you
Transcribed Image Text:I 10 I 20 I 15 I 35 D 10 S 20D 19 I 22 I 25 D 15 S 99 I 34 I 45 I 20
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 7 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
Fundamentals of Information Systems
Computer Science
ISBN:
9781305082168
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
Fundamentals of Information Systems
Computer Science
ISBN:
9781337097536
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
Fundamentals of Information Systems
Computer Science
ISBN:
9781305082168
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
Fundamentals of Information Systems
Computer Science
ISBN:
9781337097536
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning