Scribd Logo
Upload

Welcome to Scribd!

  • Problem Set 4

    Uploaded by

    RonaldMartinez
    7 views2 pages
    Kim designed a hash function for a hash table that calculates the hash value by summing all integers from 1 to the key. [1] This hash function has a time complexity of O(n) since it performs a linear operation based on the key value. [2] The hash function could be modified to take constant time O(1) by using a different approach than summation. [3] If Kim uses this hash function, to ensure no collisions the space requirements would be O(n) since the hash table would need to be the same size as the largest possible key value.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Kim designed a hash function for a hash table that calculates the hash value by summing all integers from 1 to the key. [1] This hash function has a time complexity of O(n) since it performs a linear operation based on the key value. [2] The hash function could be modified to take constant time O(1) by using a different approach than summation. [3] If Kim uses this hash function, to ensure no collisions the space requirements would be O(n) since the hash table would need to be the same size as the largest possible key value.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    7 views2 pages

    Problem Set 4

    Uploaded by

    RonaldMartinez
    Kim designed a hash function for a hash table that calculates the hash value by summing all integers from 1 to the key. [1] This hash function has a time complexity of O(n) since it performs a linear operation based on the key value. [2] The hash function could be modified to take constant time O(1) by using a different approach than summation. [3] If Kim uses this hash function, to ensure no collisions the space requirements would be O(n) since the hash table would need to be the same size as the largest possible key value.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    (/learn)

    Problem Set 4
    Question 1

    Kim is new to programming and designs the following hash function for her
    hash table.

    int computeHash(int key) {

    int hash = 0;
    for (int i = 1; i <= key; i++) {
    hash += i;
    }

    return hash;
    }

    a- What is the time complexity of the hash function?

    b- Can we make the hash function take constant time?

    c- What is the space requirements/complexity if Kim chooses to stick with


    her hash function and wants to ensure no collisions happen?

    ←    Back Next    →
    (/courses/big- (/courses/big-
    MARK AS COMPLETED
    o- o-
    notation- notation-
    for- for-
    interviews- interviews-
    Tree Structures Solution Set 4
    and- and-
    beyond/qVlxqvG4E33) beyond/RMLzWp8G2WO)

    Ask a Question
    Report
    (https://discuss.educative.io/c/big-o-for-coding-interviews-and-beyond-c-h-
    an Issue
    afzal/data-structures-problem-set-4)
    (/learn)

    You might also like