UNIVERSITY OF MASSACHUSETTS LOWELL Department of Electrical and Computer Engineering. Program 9 EECE.3220 Data Structures Fall 2017

Transcription

1 UNIVERSITY OF MASSACHUSETTS LOWELL Department of Electrical and Computer Engineering Program 9 EECE.3220 Data Structures Fall 2017 Heaps and Heap Sort Word Counter Application Revisited The object of this assignment is to write a program that will read a text file and count the number of occurrences of each word in the file. Your program will print a listing of the word counts in alphabetical order. Internally, the word list must be stored as an ordered array in which each element stores a word and its number of occurrences. This array will be sorted by the Heap Sort algorithm. The array is to be maintained as a heap until it needs to be sorted, after which it must be restored to a heap. The required main program module for this assignment is available on the class web page. Your job is to provide a module called Heap_T.h, which gives a definition of a class template for a generic heap class. The application is menu driven, supporting the following commands: Command A C D I O Q Description Sort the array with HeapSort(), show the word list on the screen in alphabetical order, and then restore the heap. Clear (erase) the entire word list. Delete the maximum entry in the list, i.e. delete the last word alphabetically. Insert word into the heap in heap order. Open and read the text file from filename, storing words and their number of occurrences in the list as a heap. The list is stored as a heap, sorted only when needed. After using the sorted list, it should be restored to a heap. Terminate the application. REQUIRED FILES The following source files are required. FILES Prog9.cpp Provided do not modify. Heap_T.h You supply this module. Member functions ShowTree() and RShowTree() are provided see below. Heap_T_Starter.h Provided. Rename this file Heap_T.h and complete the Heap class definition WordCounter.h Provided, do not change. CursorCntl.h Provided, do not CursorCntl.cpp change CONTENTS The main program file. Defines the class template for class template Heap. Use the file Heap_T_Starter.h as the basis for this header file. Contains the definitions of the heap class template and two heap class member functions ShowTree( ) and RShowTree( ) that display the heap on the screen as a binary tree. Rename this file Heap_T.h and add the missing member functions. Defines a class WordCount, whose objects store a word string along with an unsigned integer that counters the number of occurrences of that word. The CursorCntl module provides functions for controlling the cursor position in the console window.

2 Program 9 EECE.3220 Page 2 SAMPLE RUN Word: H Word: W Word: W Word: X Word: Z >A d=3 h=1 w=2 x=1 z=1 >D >D >C >O File Name: WORDFILE >A all=6 brown=3 come=10 doggie=9 for=5 fox=4 good=7 is=2 jumped=5 lazy=8 men=8 now=1 over=6 party=13 quick=2 the=23 time=4 to=20 >Q Press any key to continue...

3 Program 9 EECE.3220 Page 3 REQUIRED CLASS TEMPLATE DEFINITION Heap_T.h (Incomplete) template <typename ElemData, unsigned Capacity> class Heap { public: // Constructor Heap() : size(0), current(0) { } // Return the number of elements in the array. unsigned Size() { return size; } // Return true if the array is empty. bool Empty() { return size == 0; } // Return true if the array is full. bool Full() { return size >= Capacity; } // Insert a new element into the array properly stored in ascending order.. void Insert(ElemData &data); // Perform Heap Sort to sort the array into ascending order. void Sort(); // Call "BinSearch()" to search the sorted array for the entry "data". // If found, make this the current entry and return true; // otherwise, return false. bool Search(ElemData &data); // Perform a binary search for "data". Search the index range from // "start" to "end". If found, make it the current item and return true. // Otherwise, return false. bool BinSearch(unsigned start, unsigned end, ElemData &data); // Output the array to the stream "os". void Output(ostream &os); // Show the heap on the right side of the screen. void ShowTree() const; // Return the current entry. ElemData CurrentEntry() { return heap[current]; } // Update the current en void Update() { assert(current!= 0); heap[current].update(); } // Standard heap operations void PercolateUp(); void DeleteMax(); void PercolateDown(unsigned r, unsigned n); void Heapify(); private: unsigned size; // The number of items in the heap unsigned current; // The index of the entry found by the last search ElemData heap[capacity+1]; // The heap array }; // Recursive function to show the tree graphics void RShowTree(unsigned r, int x, int y) const; // Y O U R M E M B E R F U N C T I O N D E F I N I T I O N S G O H E R E.

4 Program 9 EECE.3220 Page 4 PROVIDED CLASS TEMPLATE DEFINITION WordCount.h class WordCount { public: // Constructors WordCount() : word(""), count(0) { } WordCount(string theword) : word(theword), count(1) { } // Accessors string Word() const { return word; } unsigned Count() const { return count; } // Mutator void Update() { ++count; } // Output a Word to a stream. void Show(ostream &os) { os << word << "=" << count;} // Overloaded relational operators bool operator<(wordcount &rhs) { return word < rhs.word; } bool operator<=(wordcount &rhs) { return word <= rhs.word; } bool operator>(wordcount &rhs) { return word > rhs.word; } bool operator>=(wordcount &rhs) { return word >= rhs.word; } bool operator==(wordcount &rhs) { return word == rhs.word; } bool operator!=(wordcount &rhs) { return word!= rhs.word; } private: string word; // The word to be counted unsigned count; // The number of occurrences };

5 Program 9 EECE.3220 Page 5 GENERAL REQUIREMENTS 1. Your heap class must be implemented as class template, and must be completely generic, having no knowledge of the structure of the data part of an entry. Use the incomplete class template above as your starting point. 2. You may not define any additional data members. 3. Use the provided modules Prog9.cpp, WordCount.h, CursorCntl.h and CursorCntl.cpp without change. 4. Your program's output must appear exactly as shown in the sample run, producing exactly the same output format. 5. Be sure to protect against any heap operation that could fail due to either the heap being full or empty. Should this occur, your program should display an error message and terminate. 6. Use const definitions to define symbolic constants rather than hard-coding constants into your program. For example specify the array dimensions (size) with a symbolic constant. Then, it is easy to change the sizes of all of the arrays. Do not use #define to name constants. 7. Use descriptive names throughout your program. Strive to make your code so readable that is selfexplanatory. 8. Use a consistent indentation scheme to help show the structure of your program. 9. Use a consistent capitalization convention to distinguish variables from constants. The preferred convention is that constant names, type names, class names, and function names have the first letter of each word capitalized (e.g., MaxCurvePoints). Variable names, data members, and parameter names, have the first letter of every word except the first capitalized (e.g., thepoint, numpoints). Using this convention, names representing values that may change (L-values) start with lower case. If a name starts with a capital, its value cannot be changed. 10. Include a sufficient number of comments to explain your program. 11. Do not use goto statements. 12. Do not use global variables. 13. No function definition may be longer than one page (60 lines). 14. Do not use redundant code. If you need the same procedure in more than one place, make it a function. 15. Keep your functions simple. If your program seems overly complex, it probably is. This means that you did not spend enough time designing, before you started typing code. KEEP IT SIMPLE! 16. Eliminate all warning messages. 17. Do not use C-style input-output functions (stdio) such as printf(), scanf(), getchar(), putchar(), etc. Hand in the following items: 1. A computer printout of your header file, Heap_T.h. SUBMISSION REQUIREMENTS 2. A computer printout of 2 test runs of your using showing several examples of your program s operation. Make sure that you include the sample run shown above. 3. Zip up the source files that make up your program. Include: Prog9.cpp (unchanged), CursorCntl.h (unchanged), CursorCntl.cpp (unchanged), WordCount.h (unchanged), and your file Heap_T.h. Name the zip file LASTNAME.zip, and submit it via blackboard. The source file Heap_T.h submitted must be identical to the printout from item 1. If you make changes, then submit the changed version. Your latest attempt is what will be graded. Make sure that your zip file includes only the requested files and no folders. 4. NOTE: Programs received after 1:00 PM on the due date will be considered late.