(C++ with Windows operating system if possible)
Assignment 9 - Reference Counting and a Linked List duc March 20th The assignment will give you practice writing constnictors and destictors, overloaded operator functions, and implementing a linked list. You will also employ a technique called reference connting. The Plan he oa of the assignment is to rack a list of various trut) tem . You wil read and process a transaction ile partially displayed below). he ransaction le contains pes o transactions ou are to store a count of he items Ln a sorted linked list. Details The transaction file contains slightly over 100 random transaction entries. The five transaction type entries are: 1. add ilem- add the ite to the inveutory, or increase the count for that item 2 remove item: remove the item from the inventor or decrease the count for that item. If the item does not exist, print error message. 3. print inwentory - print the contents of the linked listin sorted order) as shown belovw 4. misspelled transactions (add, remove, or print may be misspelled) - print an error message, inchuding the line number in the file 5. biank lines -skip over these (but count the lines) Program Requirements own linked list. You may not use any S TL containers. 1. You must write your 2. The linked list must be maintained in sorted (alphabetical) order by the (fruit) item. 3. The linked list node must contain the item name (fruit namc) and a count of the number of that item that are added to the list.. 4. You must print out the contents of the linked list when a "print list" transaction record appears. See sample output below 5. You must write at lcast 2 classes, a "node" class and a "linked list" class. Both classes must contain constructors and the "linked list" class must have a destructor 6. You must include at least two overloaded operators as member functions. 7. The print function of your "linked list" class must be implemented as an overloaded insertion operator function. Assignment 9 - Reference Counting and a Linked List duc March 20th The assignment will give you practice writing constnictors and destictors, overloaded operator functions, and implementing a linked list. You will also employ a technique called reference connting. The Plan he oa of the assignment is to rack a list of various trut) tem . You wil read and process a transaction ile partially displayed below). he ransaction le contains pes o transactions ou are to store a count of he items Ln a sorted linked list. Details The transaction file contains slightly over 100 random transaction entries. The five transaction type entries are: 1. add ilem- add the ite to the inveutory, or increase the count for that item 2 remove item: remove the item from the inventor or decrease the count for that item. If the item does not exist, print error message. 3. print inwentory - print the contents of the linked listin sorted order) as shown belovw 4. misspelled transactions (add, remove, or print may be misspelled) - print an error message, inchuding the line number in the file 5. biank lines -skip over these (but count the lines) Program Requirements own linked list. You may not use any S TL containers. 1. You must write your 2. The linked list must be maintained in sorted (alphabetical) order by the (fruit) item. 3. The linked list node must contain the item name (fruit namc) and a count of the number of that item that are added to the list.. 4. You must print out the contents of the linked list when a "print list" transaction record appears. See sample output below 5. You must write at lcast 2 classes, a "node" class and a "linked list" class. Both classes must contain constructors and the "linked list" class must have a destructor 6. You must include at least two overloaded operators as member functions. 7. The print function of your "linked list" class must be implemented as an overloaded insertion operator function
