Topic Library

B

Binary
basics_of_computer_science Binary is the base-2 number system that uses only 0 and 1. Computers store and process data as bits, which combine into bytes and larger units. Understanding binary explains how numbers, text, images,...

C

Central Processing Unit (CPU)
basics_of_computer_science test
Combinatorics
algorithms basics_of_computer_science Combinatorics studies how to count, arrange, and select objects in discrete settings. Core tools include permutations, combinations, pigeonhole principle, inclusion-exclusion, recurrences, and generat...
Computer Science
basics_of_computer_science

G

Graph Cost
algorithms data_structures basics_of_computer_science Graph cost captures how we measure and optimize over weighted graphs, usually by minimizing or maximizing sums of edge weights. Core problems include building minimum spanning trees, finding shortest ...
Greedy Algorithm
algorithms data_structures basics_of_computer_science python A greedy algorithm builds a solution step by step by always taking the locally best option available. It is fast and simple, often relying on sorting or priority queues to repeatedly pick the next bes...

H

Hardware
basics_of_computer_science Hardware is the physical layer of computing: processors, memory, storage, networking, and I/O that execute and move bits. It sets the limits for performance, reliability, and energy use, and it shapes...
Hexadecimal
basics_of_computer_science Hexadecimal is a base-16 numeral system that uses digits 0–9 and letters A–F to represent values compactly. It maps cleanly to binary because one hex digit equals four bits, making it ideal for readin...

I

Introduction to Data Structures
data_structures algorithms basics_of_computer_science memory software_engineering Data structures are ways to organize data so operations like access, insert, delete, and search are efficient. The right structure can turn a slow program into a fast one by shaping how data is stored...

P

Pagerank
algorithms basics_of_computer_science PageRank is a link analysis algorithm that assigns importance scores to nodes in a directed graph using the random surfer model. It models a Markov chain where a surfer follows links with probability ...
Pseudocode
algorithms basics_of_computer_science Pseudocode is a language-agnostic way to describe algorithms and program logic using plain, structured steps. It removes syntax details so you can focus on thinking clearly about the procedure. Teams ...

S

Shortest Path Problem (SSP)
data_structures algorithms basics_of_computer_science Shortest path problems ask for the minimum-cost route between nodes in a graph. Cost can mean hops, time, distance, or any additive weight on edges. Different constraints call for different algorithms...

T

Token
basics_of_computer_science apis_&_frameworks A token is a small, meaningful unit used to represent information in computing. In code, lexers convert raw text into tokens that parsers can understand. In security and APIs, tokens carry identity an...