CS201: Data Structures and Algorithms. Assignment 2. Version 1d

Transcription

1 CS201: Data Structure and Algorithm Aignment 2 Introduction Verion 1d You will compare the performance of green binary earch tree veru red-black tree by reading in a corpu of text, toring the word and phrae therein into a earch tree, and then performing operation on the reulting tree. A green tree i jut like a regular binary earch tree except that it can tore duplicate in an efficient way. Your red-black tree will efficiently tore duplicate a well. However, the plain binary earch tree module upon which your green and red-black tree are baed will not. The corpu will be tored in a file; phrae will be delineated by double quote while token will be equence of non-quote, non-whitepace character. Whitepace conit primarily of the character pace, tab, and newline. Command for manipulating the tree compoed of corpu entitie will be tored in a file a well. Here i a lit of command your application hould handle: i W d W f W r inert word or phrae W into the tree delete word or phrae W from the tree report the frequency of word or phrae W how the tree report tatitic All word that are inerted into a tree hould be compoed of letter from the ASCII character et [a-z]; phrae may poibly contain pace (no more than one in a row) a well. Both word and phrae hould be cleaned. In the cae of word, cleaning mean all undeirable character are to be removed and uppercae character tranlated to lowercae. For example, the word Joy'. would be rendered a joy. The ame i true for phrae, but after cleaning, any leading or trailing whitepace hould be removed and any contiguou whitepace in the interior hould be replaced by a ingle pace. For example, the phrae " by, and by" would become "by and by". Do not inert empty word or phrae or phrae with only pace into the tree. For green and red-black tree, inerting a word already in the tree would increae it frequency count by one. When deleting a word from the tree, it frequency count hould be reduced by one. If the frequency count goe to zero, the correponding node hould be removed from the tree. When howing the tree, diplay the node with a breadth-firt (left-firt) traveral. All node at a given level hould be on the ame line of output. The level number hould precede the diplay of the node at that level. Diplay each node according to the following format: an equal ign if the node i a leaf, followed by the node value, followed by * (if the color i red), followed by a frequency count (if the count i greater than one), followed by a parentheized diplay of the parent, followed by an X if the node i the root, an L if the node i a left child, and an R otherwie Your diplay function mut run in linear time. Your BST cla will render equal ign and X, L, and R deignator, while your GST cla will render the frequency count and your RBT will render the color deignator. Note alo that the parent of the root i itelf. Here i an example of a red-black tree: 0: beta(beta)x 1: =alpha*<2>(beta)l =gamma*(beta)r A green tree would look the ame, but have no color deignator. The corpu to generate uch a tree might look like:

2 beta alpha gamma alpha The word hould be ordered within a tree in cae-inenitive lexicographic ordering. Suppoe the corpu wa: The "quickity quick" brown fox jumped over the girl and her lazy, lazy dog. found in a file named data. Suppoe the file command hold the command: Then a diplay of a green tree generated by thi corpu would look like thi: $ tree -g data command 0: the<2>(the<2>)x 1: quickity quick(the<2>)l 2: brown(quickity quick)l 3: =and(brown)l fox(brown)r 4: =dog(fox)l jumped(fox)r 5: girl(jumped)l over(jumped)r 6: =her(girl)r =lazy<2>(over)l When the corpu i inerted into a red-black tree, the reulting tructure would look like thi: $ tree -r data command 0: jumped(jumped)x 1: fox*(jumped)l quickity quick*(jumped)r 2: brown(fox*)l girl(fox*)r over(quickity quick*)l =the<2>(quickity quick*)r 3: =and*(brown)l =dog*(brown)r =her*(girl)r =lazy*<2>(over)l The diplay of an empty tree hould generate the following line of output: EMPTY The tatitic to be reported are: the number of duplicate in the tree the number of node in the tree the minimum depth, which i the ditance from the root to the cloet node with a null child pointer the maximum depth, which i the ditance from the root to the furthet node with a null child pointer If the root had a null child, the minimum depth would be 0. Here i an example tatitic report: Duplicate: 2 Node: 11 Minimum depth: 2 Maximum depth: 3 Here i an example frequency report: Frequency of albatro: 5 All output mut be formatted a hown. Each line of output hould have no leading whitepace, no trailing whitepace (except the mandatory newline), no intertitial whitepace except pace, and no more than one pace in a row. 2

3 Command The command will be read from a free format text file; individual token may be eparated by arbitrary amount of whitepace. For example, thee three file content are all legal and equivalent: or or i pongebob i "Bikini Bottom" f Patrick i pongebob i "Bikini Bottom" f Patrick i pongebob i "Bikini Bottom" f Patrick Error handling You hould ignore, but report an attempt to delete omething that doe not exit in the tree. Thu you ought to be able to randomly generate a large number command and have your application run without failing. The error meage printed when attempting to delete a value not in the tree hould have the form: Value x not found. There hould be no quote around the value. Normally, one would print error meage to tderr, but for teting purpoe, print them to tdout. Program organization The tree portion of your code hould be compoed of four module: A GST object hould ue a BST object a a client, reuing a much of the BST method a poible. Likewie, an RBT object hould have a GST object a a client. A an example, the ize method for GST hould return the number of node via the BST ize method and the ize method for RBT hould ue the GST method. Another example i that a GST delete method hould imply make a call to deletebst. An RBT delete method, on the other hand, would make a call to waptoleafgst, followed by a call to a deletion fixup routine, and finally followed by a call to pruneleafgst. The GST will need it own value object to inert in a BST. Thi value object will hold the given generic value and a frequency count field. Likewie, the RBT will need to a value object to add in a color field. In addition to the extra field, thee pecialized value object may need to pointer to the diplay and freeing method of the generic object a well a the comparator. You hould ue my canner module to input your tring: wget troll.c.ua.edu/acp-c/canner.c wget troll.c.ua.edu/acp-c/canner.h Here i a typical ue, with fp et to a file opened for reading: if (tringpending(fp)) = readstring(fp); ele = readtoken(fp); //read a double quoted tring //read a whitepace delineated token 3

4 Compliance The waptoleafbst function hould prefer wapping with a predeceor over wapping with a ucceor. The pruneleafbst hould not decrement the ize of the BST. Only the deletebst method hould decrement the count. Therefore, the deleterbt method will need to adjut the BST ize. The inertgst and deletegst method hould jut ue inertbst and deletebst, repectively. The inertion and deletion fixup routine for RBT tree mut follow the peudocode found on the Beatie webite. If a newline i to be printed, there can be no preceding whitepace. No line of output are indented. Note that during ome tet, your BST, your GST, and your RBT module will be replaced. In other, your module will be teted in iolation, o do not add any additional public interface method or include. You are required to ue the tet2 drop box prior to ubmiion. Reue your code from previou aignment. Do not modify your library tructure unle explicitly intructed. Program invocation Your program will proce a free-format corpu of text and a free-format file containing an arbitrary number of command. The name of the corpu and the file of command will be paed to the interpreter a a command line argument. Switching between the two tree implementation i to be accomplihed by providing the command line option -g (green tree) and -r (RBT tree). Here i an example call to your interpreter: tree -g corpu command where corpu i a file of text and command i the name of a file which contain a equence of command. In executing thi call, you would read the word found in corpu, tore them into a imple binary earch tree, and the proce the equence of command found in command. Both the corpu and the command file may be empty. Your executable hould handle a -v option. With thi option, your executable hould print the author name and immediately exit with a zero error code, performing no other work. If no -g or -r function i given, you application hould aume an RBT tree. Either the corpu or the command may be empty, poibly both. Program output All output hould go to the conole (tdout). When proceing command, only the reult hould be echoed; the command hould not be echoed. The inert and delete command do not have a printable reult and therefore hould be proceed ilently. The exception i attempting to delete a non-exitent value. Documentation All code you hand in hould be attributed to the author. Comment paringly but well. Do explain the purpoe of your program. Do not explain obviou code. If code i not obviou, conider rewriting the code rather than explaining what i going on through comment. Project compilation You mut implement your module in C99. You mut provide a file named makefile, which repond properly to the command: make make tet make clean make valgrind The make command compile your program, which hould compile cleanly with no warning or error at the highet level of error checking (the -Wall and -Wextra option). The make tet command hould tet your program and the make clean command hould remove object file and the executable. 4

5 The compilation command mut name the executable tree (not tree.exe for you poor Cygwin uer). You may develop on any ytem you wih but your program will be compiled and teted on a Linux ytem. Only the mot foolih tudent would not thoroughly tet their implementation on a Linux ytem before ubmiion. Note: depending on where you develop your code, uninitialized variable may have a tendency to tart with a value of zero. Thu, a program with uninitialized variable may work on your ytem but fail when I run it. The correctne and efficiency of your makefile will be teted. You mut have the correct dependencie and your makefile hould not perform any unneceary compilation. Grading You mut pa all tet for your program to be graded. Handing in the application For preliminary teting, run a make clean and then end me all the file in your directory by running the command: ubmit c201 luth tet2 For your final ubmiion, run a make clean and ue the command: ubmit c201 luth aign2 Again, your implementation may be developed on other hardware and operating ytem, but it mut alo compile and run cleanly and correctly on a Linux ytem. Change log 1d 1c 1b 1a fixed ample diplay for red-black Fri Oct 26 11:15:38 CDT 2018 added link to the canner module for reading quoted tring corrected the quick brown fox example output for RBT corrected the wap-to-leaf preference 5