You are going to implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this. Use C++, please read instructions carefully and new solution only!   The “data.txt” file has three lines of data   100, 110, 120, 130, 140, 150, 160 100, 130, 160 1@0, 2@3, 3@END   You need to 1. create an empty unsorted list 2. add the numbers from the first line to list using putItem() function. Then print all the current keys to command line in one line using printAll(). 3. delete the numbers given by the second line in the list by using deleteItem() function. Then print all the current keys to command line in one line using printAll().. 4. putItem () the numbers in the third line of the data file to the corresponding location in the list. For example, 1@0 means adding number 1 at position 0 of the list. Then print all the current keys to command line in one line using printAll().. You must implement the following functions by yourself and use them 1. putItem(parameter one is the object to be added): append the object at the end of the list. 2. putItem(parameter one is the object to be added, parameter two is the position starting from 0): insert the item at the position. 3. deleteItem(parameter is the key which is an integer): remove the item 4. getItem(parameter is an index value which starts from 0) returns the item object reference 5. printAll(parameter is the pointer that points to the beginning of the list), print all keys in order in the list.   PLEASE make sure the test data file matches exactly how it is displayed up there so I can also run it with the same type of data file! Please show output, and please post solution WITHOUT linked list class! Example output is added in image.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

You are going to implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this. Use C++, please read instructions carefully and new solution only!

 

The “data.txt” file has three lines of data

 

100, 110, 120, 130, 140, 150, 160

100, 130, 160

1@0, 2@3, 3@END

 

You need to

1. create an empty unsorted list

2. add the numbers from the first line to list using putItem() function.

Then print all the current keys to command line in one line using printAll().

3. delete the numbers given by the second line in the list by using deleteItem() function.

Then print all the current keys to command line in one line using printAll()..

4. putItem () the numbers in the third line of the data file to the corresponding location in the list. For example, 1@0 means adding number 1 at position 0 of the list.

Then print all the current keys to command line in one line using printAll()..

You must implement the following functions by yourself and use them

1. putItem(parameter one is the object to be added): append the object at the end of the list.

2. putItem(parameter one is the object to be added, parameter two is the position starting from 0): insert the item at the position.

3. deleteItem(parameter is the key which is an integer): remove the item

4. getItem(parameter is an index value which starts from 0) returns the item object reference

5. printAll(parameter is the pointer that points to the beginning of the list), print all keys in order in the list.

 

PLEASE make sure the test data file matches exactly how it is displayed up there so I can also run it with the same type of data file! Please show output, and please post solution WITHOUT linked list class! Example output is added in image.

Elements of list after inserting first line elements:
100->110->120->130->140->150->160->NULL
Elements of list after deleting second line items:
110->120->140->150->NULL
Elements of list after deleting second line items:
1->120->140->150->3->NULL
Transcribed Image Text:Elements of list after inserting first line elements: 100->110->120->130->140->150->160->NULL Elements of list after deleting second line items: 110->120->140->150->NULL Elements of list after deleting second line items: 1->120->140->150->3->NULL
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 8 images

Blurred answer
Knowledge Booster
Linked List Representation
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.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education