Scribd Logo
Upload

Welcome to Scribd!

  • 27 views

    Accessing Values in Dictionary

    Uploaded by

    Hunzala Shaukat
    The document discusses hashing and indexing in Python. It explains that hash tables store key-value pairs where the key is generated by a hashing function, allowing for fast access. In Python, dictionaries implement hash tables by using hashable keys. Dictionaries allow accessing, updating, and deleting elements by key.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Accessing Values in Dictionary

    Uploaded by

    Hunzala Shaukat
    27 views3 pages
    The document discusses hashing and indexing in Python. It explains that hash tables store key-value pairs where the key is generated by a hashing function, allowing for fast access. In Python, dictionaries implement hash tables by using hashable keys. Dictionaries allow accessing, updating, and deleting elements by key.

    Original Title

    02.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses hashing and indexing in Python. It explains that hash tables store key-value pairs where the key is generated by a hashing function, allowing for fast access. In Python, dictionaries implement hash tables by using hashable keys. Dictionaries allow accessing, updating, and deleting elements by key.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    27 views3 pages

    Accessing Values in Dictionary

    Uploaded by

    Hunzala Shaukat
    The document discusses hashing and indexing in Python. It explains that hash tables store key-value pairs where the key is generated by a hashing function, allowing for fast access. In Python, dictionaries implement hash tables by using hashable keys. Dictionaries allow accessing, updating, and deleting elements by key.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 3

    Hashing and Indexing

    Hash tables are a type of data structure in which the address or the index
    value of the data element is generated from a hash function. That makes
    accessing the data faster as the index value behaves as a key for the data
    value. In other words Hash table stores key-value pairs but the key is
    generated through a hashing function.

    So the search and insertion function of a data element becomes much


    faster as the key values themselves become the index of the array which
    stores the data.

    In Python, the Dictionary data types represent the implementation of hash


    tables. The Keys in the dictionary satisfy the following requirements.

     The keys of the dictionary are hashable i.e. the are generated by hashing
    function which generates unique result for each unique value supplied to the
    hash function.

     The order of data elements in a dictionary is not fixed.

    So we see the implementation of hash table by using the dictionary data


    types as below.

    Accessing Values in Dictionary


    To access dictionary elements, you can use the familiar square brackets
    along with the key to obtain its value.

    # Declare a dictionary

    dict = {'Name': 'Zara', 'Age': 7, 'Class': 'First'}

    # Accessing the dictionary with its key

    print "dict['Name']: ", dict['Name']

    print "dict['Age']: ", dict['Age']

    When the above code is executed, it produces the following result −


    dict['Name']: Zara
    dict['Age']: 7
    Updating Dictionary
    You can update a dictionary by adding a new entry or a key-value pair,
    modifying an existing entry, or deleting an existing entry as shown below in
    the simple example −

    # Declare a dictionary

    dict = {'Name': 'Zara', 'Age': 7, 'Class': 'First'}

    dict['Age'] = 8; # update existing entry

    dict['School'] = "DPS School"; # Add new entry

    print "dict['Age']: ", dict['Age']

    print "dict['School']: ", dict['School']

    When the above code is executed, it produces the following result −


    When the above code is executed, it produces the following result −
    dict['Age']: 8
    dict['School']: DPS School

    Delete Dictionary Elements


    You can either remove individual dictionary elements or clear the entire
    contents of a dictionary. You can also delete entire dictionary in a single
    operation. To explicitly remove an entire dictionary, just use the del
    statement. −

    dict = {'Name': 'Zara', 'Age': 7, 'Class': 'First'}

    del dict['Name']; # remove entry with key 'Name'

    dict.clear(); # remove all entries in dict

    del dict ; # delete entire dictionary

    print "dict['Age']: ", dict['Age']

    print "dict['School']: ", dict['School']

    This produces the following result. Note that an exception is raised because
    after del dict dictionary does not exist anymore −
    dict['Age']:
    Traceback (most recent call last):
    File "test.py", line 8, in
    print "dict['Age']: ", dict['Age'];
    TypeError: 'type' object is unsubscriptable

    Assignment

    https://runestone.academy/runestone/books/published/pythonds/SortSearch/Hashing.html

    https://www.ibrahimgabr.com/blog/2017/12/17/python-hashing-and-hash-tables

    You might also like