dsa prefi

Unordered Set

Type of set implemented using a hash table

Vertices

Represent objects in the graph data structure

Load Factor

Factor that measures how full a hash table is

Map

Data structure that stores elements as key-value pairs

Ordered Set

Type of set implemented using a binary search tree

Graph Data Structure

Collection of interconnected nodes

Directed Graph

Graph where each edge has a direction

Unweighted Graph

Graph in which all edges have equal weight

Hash Funcion

Mathematical function that produces a fixed-size output

Hashing

Process of converting a key into another value

Edges

Represent connection between graph objects

containsKey

Operation that checks if key exists in hash table

Tree Map

Map that stores elements in sorted order

Set

Data structure that stores unique elements

Chaining

Technique where multiple keys share one bucket using linked list

Tree-based Set

Set represented as binary search tree

Linked List Map

Structure to process configuration keys in order

Choosing a prime number table size

Minimizing clustering in division-based hash

Load factor exceeded threshold

Retrieval slows after many inserts

Undirected Graph

Graph showing mutual friendships

Hashmap

Best structure for frequently changing IDs

Linear Probing

Open addressing method for next available index

Queue becomes empty

BFS traversal visits all vertices when

Chaining

Collision-handling using linked list

Set

Track unique visitors

Collision

Different keys produce same index

Cyclic Graph

Road network with loops

Bipartite Graph

Students connected to courses

Weighted Graph

Calculate least costly route

Perform BFS across each disconnected component

Identify isolated users in graph

Use a prime-numbered table size

Avoid clustering in hashing

Load factor exceeds 0.85

Rehash the table to a larger size

Run BFS on each disconnected component

BFS visits only some nodes

Restore efficiency when collisions increase

Rehash the table to a larger size