Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Dictionary Operations

Description

This lecture covers the operations and methods related to dictionaries in Python, including creating dictionaries, setting key-value pairs, updating dictionaries, and handling key errors. It also explains the concepts of hash values, immutable objects, and the uniqueness of keys. The instructor demonstrates how to create, update, and manipulate dictionaries using various methods and functions.

Official source

Related concepts (32)

Dictionary

A dictionary is a listing of lexemes from the lexicon of one or more specific languages, often arranged alphabetically (or by consonantal root for Semitic languages or radical and stroke for logographic languages), which may include information on definitions, usage, etymologies, pronunciations, translation, etc. It is a lexicographical reference that shows inter-relationships among the data. A broad distinction is made between general and specialized dictionaries.

Chinese dictionary

Chinese dictionaries date back over two millennia to the Han dynasty, which is a significantly longer lexicographical history than any other language. There are hundreds of dictionaries for the Chinese language, and this article discusses some of the most important. The general term císhū (辭書, "lexicographic books") semantically encompasses "dictionary; lexicon; encyclopedia; glossary". The Chinese language has two words for dictionary: zidian (character/logograph dictionary) for written forms, that is, Chinese characters, and cidian (word/phrase dictionary), for spoken forms.

Hash table

In computing, a hash table, also known as hash map, is a data structure that implements an associative array or dictionary. It is an abstract data type that maps keys to values. A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets or slots, from which the desired value can be found. During lookup, the key is hashed and the resulting hash indicates where the corresponding value is stored.

Universal hashing

In mathematics and computing, universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below). This guarantees a low number of collisions in expectation, even if the data is chosen by an adversary. Many universal families are known (for hashing integers, vectors, strings), and their evaluation is often very efficient.

Hash function

A hash function is any function that can be used to map data of arbitrary size to fixed-size values, though there are some hash functions that support variable length output. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. The values are usually used to index a fixed-size table called a hash table. Use of a hash function to index a hash table is called hashing or scatter storage addressing.

Related lectures (38)

Functions in Python

Introduces functions in Python, covering predefined and user-defined functions, formal and effective parameters, and the importance of docstrings.

Mutable and Immutable Objects

Explains the differences between mutable and immutable objects in Python and covers native container types.

Python Lists: Manipulation and Comprehension

Covers Python list manipulation and comprehension, emphasizing memory representation and mutability.

Python Programming: Data Structures and Functions

Covers advanced Python programming concepts, including data structures and functions.

String Operations: Basics and Methods