Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Function II below returns implements a hash table with line a) Complete the code to perf def H(a): return ('Jill'14, 'cha. * store (t, k, v) : stores I or after index H(k) 1 * stored, or -1 if no pla

Function II below returns implements a hash table with line a) Complete the code to perf def H(a): return ('Jill'14, 'cha. * store (t, k, v) : stores I or after index H(k) 1 * stored, or -1 if no pla

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

Use python

Function H (s) below returns hash values for the indicated strings, and store (t, k, v) implements a hash table with linear probing. 3. a) Complete the code to perform according to the description provided. def H(s): return ('Jill':4, 'chased' :2, 'Jack':20, 'up':9, 'the':5, 'hill':11 } [s] # store (t, k, v) : stores entry [ k, v] at first available location at, # or after index H(k) S len (t) in list t, and returns the index where # stored, or -1 if no place found. def store (t, k, v): * Pre-allocated table size * First place to try storing h for i in range ) : # Available location ? * Store entry if t[h] == None: * Report back: as spec'd else: * Try next spot # Report back: as spec'd The above functions are called as shown below: table = ( None ] * 7 # THE hash table text = "Jack chased Jill chased Jack up the hill" for w in text.split (): store (table, w, w.uPper ()) # Ex. < 'Jack', 'JACK'>
Transcribed Image Text:Function H (s) below returns hash values for the indicated strings, and store (t, k, v) implements a hash table with linear probing. 3. a) Complete the code to perform according to the description provided. def H(s): return ('Jill':4, 'chased' :2, 'Jack':20, 'up':9, 'the':5, 'hill':11 } [s] # store (t, k, v) : stores entry [ k, v] at first available location at, # or after index H(k) S len (t) in list t, and returns the index where # stored, or -1 if no place found. def store (t, k, v): * Pre-allocated table size * First place to try storing h for i in range ) : # Available location ? * Store entry if t[h] == None: * Report back: as spec'd else: * Try next spot # Report back: as spec'd The above functions are called as shown below: table = ( None ] * 7 # THE hash table text = "Jack chased Jill chased Jack up the hill" for w in text.split (): store (table, w, w.uPper ()) # Ex. < 'Jack', 'JACK'>
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Introduction to computer system
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS