Computer Science / Subcategory

Data Structures

Data structure calculators and formulas for hash tables, trees, and graph representations. Covers load factor, tree height, and graph density calculations used in software design.

9Formulas

All levels Difficulty

Updated Oct 2026

← All Computer Science (60) Data Structures (9)

Fundamental

RAID Storage Usable Capacity

RAID 0: N*S | RAID 1: S | RAID 5: (N-1)*S

Fundamental

Cache Hit Ratio

Hit Ratio = Cache Hits / Total Requests

Fundamental

Hash Collision Probability (Birthday Paradox Approximation)

P ≈ 1 - e^(-n²/(2*m))

Fundamental

Circular Buffer Index Calculation

next_index = (current_index + 1) % buffer_size

Fundamental

2D Array Index (Row-Major Order)

index = row * num_columns + column

Fundamental

Minimum Height of a Balanced Binary Tree

h_min = ceil(log2(n+1)) - 1

Fundamental

Complete Binary Tree Total Nodes

N = 2^(h+1) - 1

Fundamental

Binary Tree Maximum Nodes at a Level

N = 2^L

Fundamental

Hash Table Load Factor

α = n / k