We are given a collection of n key-value pairs (k,m) in which k is a positive integer number in a range [0,N-1] for small enough N. Assume that we may have multiple values for the same keys. a) if m is a positive number in a range [0,M-1] for some small enough integer M, design a lookup table for storing these items such that the time complexity of search, insert and delete are constant. b) if m is an arbitrary integer number, design a lookup table for storing these items such that the time complexity of search is log n.
We are given a collection of n key-value pairs (k,m) in which k is a positive integer number in a range [0,N-1] for small enough N. Assume that we may have multiple values for the same keys. a) if m is a positive number in a range [0,M-1] for some small enough integer M, design a lookup table for storing these items such that the time complexity of search, insert and delete are constant. b) if m is an arbitrary integer number, design a lookup table for storing these items such that the time complexity of search is log n.
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
Related questions
Question
We are given a collection of n key-value pairs (k,m) in which k is a positive integer number in a
range [0,N-1] for small enough N. Assume that we may have multiple values for the same keys.
a) if m is a positive number in a range [0,M-1] for some small enough integer M, design a
lookup table for storing these items such that the time complexity of search, insert and delete
are constant.
b) if m is an arbitrary integer number, design a lookup table for storing these items
such that the time complexity of search is log n.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
Knowledge Booster
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
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education