Implement the three self-organizing list heuristics:

Count – Whenever a record is accessed it may move toward the front of the list if its number of accesses becomes greater than the record(s) in front of it.

Move-to-front – Whenever a record is accessed it is moved to the front of the list. This heuristic only works well with linked-lists; because, in arrays the cost of shifting all the records down one spot every time you move a record to the front is too expensive.

Transpose – whenever the record is accessed swap it with the record immediately in front of it.

Compare the cost of each heuristic by keeping track of the number of compares required when searching the list.

Additional Instructions

Use the SelfOrderedListADT abstract data type and the linked-list files I have provided to implement your self-ordered lists. You may incorporate the author’s linked list implementation via inheritance or composition, which ever makes the most sense to you (I will not evaluate that aspect of your implementation). You are allowed to make changes to any of the files I have provided, except SelfOrderedListADT and test.txt, to make your implementation of SelfOrderedListADT cleaner. The same applies to the link.h (the link node implementation). You may not change SelfOrderedListADT or test.txt files.

I want you to run two tests

The first test is with char types. Use the add() function to build a list in the following order: A B C D E F G H (do not add ‘I’ here). After you have built that initial list I want you to use the find function to input the following characters: F D F G E G F A D F G E H I (note that ‘I’ is not in the initial list; I want to see what your program does when it searches for an item that is not already in the list). For each heuristic display the order of the final list and the number of compares.

The second test is using the test.txt file I have provided using the data type string. Do not modify the test text file; because, I am going to compare your results with my own and modifying the test file will throw your results off. For this test I want you to do the following for each heuristic:

Read into your program the test.txt file adding words to your list using your find() function, and then

Print out

the total number of words in your list,

the total number of compares, and

SelfOrderedListADT Functions:

find() – finds a value in the list and, if found, increments the frequency. If not found then find() calls add() to append the value to the end of the list (initial frequency of an item added this way is 0). In either case find() calls your reorder function (see below) to reorder the list in accordance to the heuristic being used and find() increments the number of compares made (whereas add() (see below) does not).

add – appends the value to the end of the list without doing any compares or adjusting frequencies.

getCompares – returns the total number of compares done by find when searching for values in the list.

Size – returns the size of the list.

printlist – prints the list in the following format: value-## where “value” is the actual value of the node (either a char or a string) and ## is the frequency of that value. You will need a printlist() and a printlist(n) method because for your char tests you will print the entire list but for the string test I only want the first 10 nodes printed.

reorder – you can call this method whatever you want but what I am looking for is a method or methods that reorders your list as appropriate based on the heuristic you are using. This method is typically called by find().

$Count Heuristic: Size of list: 64 Number of compares: 2605 the-12 of-8 Front-5 is-4 record-4 it-4 list-2 move-2 a-2 to-2 whenever-2 access ed-2 in-2 with-1 cost-1 Move to Front Heuristic: Size of list: 64 Number of compares: 2705 searching-1 of-8 number-1 the-12 heuristic-1 cost-1 it-4 front-5 in-2 record-4 with-1 accessed-2 is-4 whenever-2 to-2 Transpose Heuristic: Size of list: 64 Number of compares: 2824 the-12 assignment-0 implement-0 list-2_three-0 self-organizing-0 heuristics-0 w henever-2 a-2 record-4 it-4 is-4 count-0 of-8 accessed-2 D:\Documents\NetBeans Projects\CSCI 215 Assignment 4 ebug\MinGW-Windows> Self Ordered Lists\dist\D --$
Transcribed Image Text:Count Heuristic: Size of list: 64 Number of compares: 2605 the-12 of-8 Front-5 is-4 record-4 it-4 list-2 move-2 a-2 to-2 whenever-2 access ed-2 in-2 with-1 cost-1 Move to Front Heuristic: Size of list: 64 Number of compares: 2705 searching-1 of-8 number-1 the-12 heuristic-1 cost-1 it-4 front-5 in-2 record-4 with-1 accessed-2 is-4 whenever-2 to-2 Transpose Heuristic: Size of list: 64 Number of compares: 2824 the-12 assignment-0 implement-0 list-2_three-0 self-organizing-0 heuristics-0 w henever-2 a-2 record-4 it-4 is-4 count-0 of-8 accessed-2 D:\Documents\NetBeans Projects\CSCI 215 Assignment 4 ebug\MinGW-Windows> Self Ordered Lists\dist\D --
Transcribed Image Text:Acceptable Outputs for Character List: Characters A-H “added()" to the list before any calls to find() are made: My starting list structure for all heuristics is: A-0 B-0 C-0 D-0 E-0 F-0 G-0 H-0 Count Heuristic: The number of compares is: 61 My final list structure with frequencies is: F-4 G-3 D-2 E-2 A-1 H-1 B-0 C-0 I-0 My list size is: 9 Move-to-front heuristic: The number of compares is: 70 My final list structure with frequencies is: I-0 H-1 E-2 G-3 F-4 D-2 A-1 B-0 C-0 My list size is: 9 Transpose heuristic: The number of compares is: 78 My final list structure with frequencies is: A-1 B-0 F-4 D-2 G-3 E-2 H-1 C-0 I-0 My list size is: 9

Question

Implement the three self-organizing list heuristics:

Count – Whenever a record is accessed it may move toward the front of the list if its number of accesses becomes greater than the record(s) in front of it.
Move-to-front – Whenever a record is accessed it is moved to the front of the list. This heuristic only works well with linked-lists; because, in arrays the cost of shifting all the records down one spot every time you move a record to the front is too expensive.
Transpose – whenever the record is accessed swap it with the record immediately in front of it.

Compare the cost of each heuristic by keeping track of the number of compares required when searching the list.

Additional Instructions

Use the SelfOrderedListADT abstract data type and the linked-list files I have provided to implement your self-ordered lists. You may incorporate the author’s linked list implementation via inheritance or composition, which ever makes the most sense to you (I will not evaluate that aspect of your implementation). You are allowed to make changes to any of the files I have provided, except SelfOrderedListADT and test.txt, to make your implementation of SelfOrderedListADT cleaner. The same applies to the link.h (the link node implementation). You may not change SelfOrderedListADT or test.txt files.

I want you to run two tests

The first test is with char types. Use the add() function to build a list in the following order: A B C D E F G H (do not add ‘I’ here). After you have built that initial list I want you to use the find function to input the following characters: F D F G E G F A D F G E H I (note that ‘I’ is not in the initial list; I want to see what your program does when it searches for an item that is not already in the list). For each heuristic display the order of the final list and the number of compares.
The second test is using the test.txt file I have provided using the data type string. Do not modify the test text file; because, I am going to compare your results with my own and modifying the test file will throw your results off. For this test I want you to do the following for each heuristic:
1. Read into your program the test.txt file adding words to your list using your find() function, and then
2. Print out
  1. the total number of words in your list,
  2. the total number of compares, and

SelfOrderedListADT Functions:

find() – finds a value in the list and, if found, increments the frequency. If not found then find() calls add() to append the value to the end of the list (initial frequency of an item added this way is 0). In either case find() calls your reorder function (see below) to reorder the list in accordance to the heuristic being used and find() increments the number of compares made (whereas add() (see below) does not).
add – appends the value to the end of the list without doing any compares or adjusting frequencies.
getCompares – returns the total number of compares done by find when searching for values in the list.
Size – returns the size of the list.
printlist – prints the list in the following format: value-## where “value” is the actual value of the node (either a char or a string) and ## is the frequency of that value. You will need a printlist() and a printlist(n) method because for your char tests you will print the entire list but for the string test I only want the first 10 nodes printed.
reorder – you can call this method whatever you want but what I am looking for is a method or methods that reorders your list as appropriate based on the heuristic you are using. This method is typically called by find().

Count Heuristic: Size of list: 64
Number of compares: 2605
the-12 of-8 Front-5 is-4 record-4 it-4 list-2 move-2 a-2 to-2 whenever-2 access
ed-2 in-2 with-1 cost-1
Move to Front Heuristic: Size of list: 64
Number of compares: 2705
searching-1 of-8 number-1 the-12 heuristic-1 cost-1 it-4 front-5 in-2 record-4
with-1 accessed-2 is-4 whenever-2 to-2
Transpose Heuristic: Size of list: 64
Number of compares: 2824
the-12 assignment-0 implement-0 list-2_three-0 self-organizing-0 heuristics-0 w
henever-2 a-2 record-4 it-4 is-4 count-0 of-8 accessed-2
D:\Documents\NetBeans Projects\CSCI 215 Assignment 4
ebug\MinGW-Windows>
Self Ordered Lists\dist\D
--

Acceptable Outputs for Character List:
Characters A-H “added()" to the list before any calls to find() are made:
My starting list structure for all heuristics is:
A-0 B-0 C-0 D-0 E-0 F-0 G-0 H-0
Count Heuristic:
The number of compares is: 61
My final list structure with frequencies is:
F-4 G-3 D-2 E-2 A-1 H-1 B-0 C-0 I-0
My list size is: 9
Move-to-front heuristic:
The number of compares is: 70
My final list structure with frequencies is:
I-0 H-1 E-2 G-3 F-4 D-2 A-1 B-0 C-0
My list size is: 9
Transpose heuristic:
The number of compares is: 78
My final list structure with frequencies is:
A-1 B-0 F-4 D-2 G-3 E-2 H-1 C-0 I-0
My list size is: 9

Accepted Answer

Answer: main.cpp#include #include #include #include…