IN-TREEISH-TABLE(T, k) p= T[HASH(T, k)] while p * NIL ifkp.key p=p.right else 1a. return TRUE return FALSE IN-TREEISH-TABLE takes a hash table T and a key k as its parameters. The table T resolves collisions by chaining, but instead of using linked lists in its buckets, it uses binary search trees. In the trees, each node p has three slots. The slot p.key is a key. The slots p.left and p.left point to p's left and right subtrees, respectively. IN-TREEISH-TABLE first uses a hash function HASH to find a tree in the table, then searches that tree for k. If it finds k, then it returns TRUE, otherwise it returns FALSE. In the best case, how many key comparisons will IN-TREEISH-TABLE perform? Briefly explain your answer. 1b In the average case, how many key comparisons will IN-TREEISH-TABLE perform? Briefly explain your answer. Hint: assume simple uniform hashing is in effect. 1c. In the worst case, how many key comparisons will IN-TREEISH-TABLE perform? Briefly explain your answer. Hint: assume simple uniform hashing fails. #2
IN-TREEISH-TABLE(T, k) p= T[HASH(T, k)] while p * NIL ifkp.key p=p.right else 1a. return TRUE return FALSE IN-TREEISH-TABLE takes a hash table T and a key k as its parameters. The table T resolves collisions by chaining, but instead of using linked lists in its buckets, it uses binary search trees. In the trees, each node p has three slots. The slot p.key is a key. The slots p.left and p.left point to p's left and right subtrees, respectively. IN-TREEISH-TABLE first uses a hash function HASH to find a tree in the table, then searches that tree for k. If it finds k, then it returns TRUE, otherwise it returns FALSE. In the best case, how many key comparisons will IN-TREEISH-TABLE perform? Briefly explain your answer. 1b In the average case, how many key comparisons will IN-TREEISH-TABLE perform? Briefly explain your answer. Hint: assume simple uniform hashing is in effect. 1c. In the worst case, how many key comparisons will IN-TREEISH-TABLE perform? Briefly explain your answer. Hint: assume simple uniform hashing fails. #2
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Question #01 (b)
Please provide justified answer asap to get a upvote must for 1(b) or for all parts please
![Questions la through Ie are about the procedure IN-TREEISH-TABLE, which is shown below.
IN-TREEISH-TABLE(T, k)
p = T[HASH(T, k)]
while p # NIL
if k< p.key
p = p.left
else if k > p.key
p = p.right
else
return TRUE
return FALSE
IN-TREEISH-TABLE takes a hash table T and a key k as its parameters. The table T resolves collisions by chaining, but instead of using
linked lists in its buckets, it uses binary search trees. In the trees, each node p has three slots. The slot p.key is a key. The slots p.left
and p.left point to p's left and right subtrees, respectively. IN-TREEISH-TABLE first uses a hash function HASH to find a tree in the
table, then searches that tree for k. If it finds k, then it returns TRUE, otherwise it returns FALSE.
In the best case, how many key comparisons will IN-TREEISH-TABLE perform? Briefly explain your answer.
1a.
1b
In the average case, how many key comparisons will IN-TREEISH-TABLE perform? Briefly explain your answer. Hint:
assume simple uniform hashing is in effect.
1c.
In the worst case, how many key comparisons will IN-TREEISH-TABLE perform? Briefly explain your answer. Hint:
assume simple uniform hashing fails.
#2
CS Scanned with CamScanner](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F646885a1-f269-4207-b50d-e8a8057fa9b9%2F060b3bdc-af96-45fb-a84e-b63e298332a1%2Fj371lzy_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Questions la through Ie are about the procedure IN-TREEISH-TABLE, which is shown below.
IN-TREEISH-TABLE(T, k)
p = T[HASH(T, k)]
while p # NIL
if k< p.key
p = p.left
else if k > p.key
p = p.right
else
return TRUE
return FALSE
IN-TREEISH-TABLE takes a hash table T and a key k as its parameters. The table T resolves collisions by chaining, but instead of using
linked lists in its buckets, it uses binary search trees. In the trees, each node p has three slots. The slot p.key is a key. The slots p.left
and p.left point to p's left and right subtrees, respectively. IN-TREEISH-TABLE first uses a hash function HASH to find a tree in the
table, then searches that tree for k. If it finds k, then it returns TRUE, otherwise it returns FALSE.
In the best case, how many key comparisons will IN-TREEISH-TABLE perform? Briefly explain your answer.
1a.
1b
In the average case, how many key comparisons will IN-TREEISH-TABLE perform? Briefly explain your answer. Hint:
assume simple uniform hashing is in effect.
1c.
In the worst case, how many key comparisons will IN-TREEISH-TABLE perform? Briefly explain your answer. Hint:
assume simple uniform hashing fails.
#2
CS Scanned with CamScanner
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY