데이터구조 - HW5 - Literary Hashing - 연세대학교 최정윤 교수님

소개

연세대 최정윤 교수님 HW5 입니다
Literary Hashing
보고서첨부되어있습니다

컴파일 실행환경

Microsoft Visual C++ 6

본문내용

EEE2020-01 Data Structures 2011 Fall term Jeung-Yoon Choi

Homework 5
Literary Hashing
(assigned 11/10/11, due 11/17/11)


Recall the list of titles from Homework 4. This time, the book list will be implemented using a hash table. A sample representation is shown below.

Hash value Key
…
7 Ringworld
…
13 Ringworld Engineers
…

For this sample hash table, the hash function is Key_Value (word) % N, where Key_Value is a weighted sum of the ASCII values of all the letters in each word. ASCII values for lowercase letters are: a = 97, b = 98, c = 99, … , z = 122. These values can be found using the int( ) function in C. Using a hashed book list, let’s compare performance with the lexical tree in Homework 4. In your report, discuss the pros and cons of this method over the lexical tree method, such as Big-Oh running time, space requirements, etc.

You may use code related to hash tables from the textbook.

( You may not use code related to this homework from the internet or your friend. ^^ )

The report should be written in English, and should not exceed 3 pages (excluding code).

The report should include
(1) Brief explanation of the problem
(2) Your view as to how it ties in with what we covered in class
(3) Discussion of your results
(4) Short explanation of your code
(5) Your code

Grades will not be based on English fluency or writing style.
Grades will be based on correctness of implementation and sincerity of effort.

Good luck!

참고자료

· 없음