Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

in python please this is the chainging dictionary mentioned above Objective: To gain experience using a hash-table based dictionary by implementing a movie search. To

image text in transcribed

in python please this is the chainging dictionary mentioned above

image text in transcribed

image text in transcribed

Objective: To gain experience using a hash-table based dictionary by implementing a movie search. To start the project: Download hw4 . zip file and extract it. The hw4 directory contains the lecture 15 ChainingDict dictionary implementation (in chaining dictionary py) which you The Assignment: Pro file movieData.txt which contains the names and yearts) a movie was made (and remade) fessor Bob is a movie buff, but like most professors he is absent-minded. He has an old text A Tailor Made Man A Tale of Two Cities A Talent for Murder A Talk in the Dark A Tall Man Executes a Jig by Irving Layton Bob would like to be able to interactively search for all movies containing specified words) in the title or made during a specific year. The program's main menu should contain the following options (see sample interaction on bottom of next page) . start a new search- allows the user to enter one or more words in the title to search and/or year of the movie. This should just report the number of movies that match (he might not want to see 100s of movie titles). Multiple search words ALL must appear in the titles found. refine the search- allows the user to enter one or more additional words to refine the search. This should also report the number of movies that match. display to the screen the results of the current search: complete movie titles and the year(s) they were made save the results of the current search to a user-specified text file At the start of the program, you should create an empty ChainingDict dictionary and fill it by reading movie entries from the movieData.txt file. Each dictionary entry will have a word for its key and a list of movie entries containing that word in their titles. (There are 34083 unique words if you split the movie titles on white-space, so having 40000 slots in the hash table should be about right, i.e., Chain ingDict ( 40000) .) NOTE MAC USERS: You'll want to open the movieData.txt file using Objective: To gain experience using a hash-table based dictionary by implementing a movie search. To start the project: Download hw4 . zip file and extract it. The hw4 directory contains the lecture 15 ChainingDict dictionary implementation (in chaining dictionary py) which you The Assignment: Pro file movieData.txt which contains the names and yearts) a movie was made (and remade) fessor Bob is a movie buff, but like most professors he is absent-minded. He has an old text A Tailor Made Man A Tale of Two Cities A Talent for Murder A Talk in the Dark A Tall Man Executes a Jig by Irving Layton Bob would like to be able to interactively search for all movies containing specified words) in the title or made during a specific year. The program's main menu should contain the following options (see sample interaction on bottom of next page) . start a new search- allows the user to enter one or more words in the title to search and/or year of the movie. This should just report the number of movies that match (he might not want to see 100s of movie titles). Multiple search words ALL must appear in the titles found. refine the search- allows the user to enter one or more additional words to refine the search. This should also report the number of movies that match. display to the screen the results of the current search: complete movie titles and the year(s) they were made save the results of the current search to a user-specified text file At the start of the program, you should create an empty ChainingDict dictionary and fill it by reading movie entries from the movieData.txt file. Each dictionary entry will have a word for its key and a list of movie entries containing that word in their titles. (There are 34083 unique words if you split the movie titles on white-space, so having 40000 slots in the hash table should be about right, i.e., Chain ingDict ( 40000) .) NOTE MAC USERS: You'll want to open the movieData.txt file using

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

JDBC Database Programming With J2ee

Authors: Art Taylor

1st Edition

0130453234, 978-0130453235

More Books

Students also viewed these Databases questions