CSE 101 -- Hwk 3

Due before midnight, Sunday, November 7, 2021.
Late submissions will not be accepted/graded.

Changelog:

• Nov 4, 2021 Updated Dictionary.h to print output format to "k1:v1 k2:v2 ... kn:vn \n" from "k: v\n". You don't need to change this inyour code fr hwk3, but will be the format expected in prog3.
• Nov 1, 2021 Updated Dictionary.c to use ListPtr *hash_table; instead of ListPtr hash_table[];

Objectives:

Description:

Details:

• Just as with previous assignments, input will be from stdin and output will be to stdout. You can assume that all input will be well formed, and do not need to do any error handling.

• Dictionary ADT:
  Your program will use a hash table implementation of a dictionary. Your hash table should be sized to use a 10 slot hash table.

  The function ht_string2int is provided for you. You will use this function in combination with the modulo operator (%) to generate your keys. You may use the provided List implementation to handle collisions among these keys.

• Application:
  You will make a simple application to accept input from stdin and calculate which word occurs most often within the input. You will then output the most common word to stdout. If two or more words would be most common, ouput all words separated by a comma in alphabetical order. You do not need to consider empty input.
  

  You will receive a single sentence, with no punctuation, and each word will be delimited by a space.
  You can ignore capitalization, so that "More" != "more".

  I.e. If word1 occurs x times, word2 occurs x-1 times and word3 occurs x times, then you should output:

  word1:word_1_freq, word3:word_3_freq

  
  

• Files for this program: The following files are provided to you, and should all be submitted with your work.
  
  
  • Makefile: This should be able to compile your submission on the unix server. Your program should be able to compile using `make hwk3`
  • hwk3.c: Use this file to create an application which utilizes your Dictionary implementation. Your application should read in text from stdin and print the most common words to stdout .
    
  • Dictionary.c: Where most of your work will be done. Implement the functions in Dictionary.h to complete your dictionary implementation.
  • Dictionary.h: Function headers for your Dictionary implementation. Includes a typedef for your key value pairs. You should not have to modify this file.
  • HashTable.c: An implementation of a hash table. You will have to complete the function to obtain an index associated with your dictionary key. You should not have to modify the function for hashing char*
  • HashTable.h: A header file for the provided hash table, you should not have to modify this file
  • List.c: A working implementation of a list, you should not have to edit this file, it is used within your Dictionary.c implementation, and by hwk3.c for sorting.
  • List.h: A header file for the provided list implementation. You should not have to modify this file.
  
  
• The following files are provided for the purposes of testing your application. You should be able to verify your program works correctly by running `./hwk3 < test1.in` and comparing it to the expected output. They do not need to be included in your submission.
  
  

  • Input: test1.in Expected output: test1.out

  • Input: test2.in Expected output: test2.out

  • Input: test3.in Expected output: test3.out

  Submission:

  • Make sure that you've compiled and tested your code on the campus unix timeshare before submitting. On the unix timeshare, put materials in a folder named hwk3 and zip it up. Note that you should not include any sample input or sample output files in your submission.

    Submit on unix timeshare. Use the command: submit cse101-ap.f21 hwk3 hwk3.zip

    You can submit as often as you want up until the deadline. We will only look at your most recent submission.

  ---

  Last modified: 10/23/2021