Computer Science

Algorithms

An algorithm is a finite, well-defined sequence of steps used to solve a problem or perform a computation, forming the logical foundation of all software.

Data Structures

Data structures are specific ways of organizing, storing, and accessing data in memory — such as arrays, linked lists, trees, and hash tables — chosen to optim…

Operating System

An operating system (OS) is the foundational software layer that manages a computer's hardware resources and provides common services to application programs,…

DBMS

A Database Management System (DBMS) is software that provides an interface for creating, storing, querying, and managing data in databases, handling concerns l…

Computer Networks

Computer networks are interconnected systems of devices that communicate by exchanging data over shared communication links, using standardized protocols to ad…

Compiler

A compiler is a program that translates source code written in a high-level programming language into a lower-level form, such as machine code or bytecode, tha…

Tree

A tree is a hierarchical, non-linear data structure consisting of nodes connected by edges, with one node designated as the root and every other node having ex…

Graph

A graph is a data structure consisting of a set of nodes (vertices) connected by edges, which may be directed or undirected and weighted or unweighted, used to…

Heap

A heap is a specialized tree-based data structure that satisfies the heap property: in a min-heap, every parent node is less than or equal to its children; in…

Queue

A queue is a linear data structure that follows First-In-First-Out (FIFO) ordering: elements are added at the rear (enqueue) and removed from the front (dequeu…

Stack

A stack is a linear data structure that follows Last-In-First-Out (LIFO) ordering: elements are added and removed from the same end, called the top, so the mos…

Arduino

Arduino is an open-source hardware and software platform combining simple microcontroller boards with an easy-to-use IDE, letting hobbyists, students, and engi…

Kernel

The kernel is the core component of an Operating System that has direct control over hardware resources — CPU, memory, and devices — and mediates access to the…

Process Scheduling

Process scheduling is the operating system mechanism that decides which of the many runnable processes or threads gets access to the CPU at any given moment, a…

Virtual Memory

Virtual memory is an operating system technique that gives each process the illusion of a large, contiguous, private address space, while the Kernel transparen…

File System

A file system is the method and data structure an Operating System uses to organize, name, store, and retrieve data on persistent storage devices such as hard…

TCP/IP

TCP/IP is the foundational suite of networking protocols that governs how data is addressed, transmitted, routed, and reliably delivered across the internet an…

UDP

UDP (User Datagram Protocol) is a lightweight, connectionless transport-layer protocol that sends data packets, called datagrams, without establishing a connec…

DNS Resolution

DNS resolution is the process of translating a human-readable domain name, like example.com, into the numerical IP address that computers use to locate and con…

Subnetting

Subnetting is the practice of dividing a larger IP network into smaller, logically separate sub-networks (subnets) to improve address allocation efficiency, ro…

IPv6

IPv6 (Internet Protocol version 6) is the most recent version of the Internet Protocol, designed to replace IPv4 by providing a vastly larger address space and…

Network Topology

Network topology refers to the arrangement and interconnection pattern of devices, links, and nodes in a computer network, describing both the physical layout…

Client-Server Architecture

Client-server architecture is a computing model in which client programs request services or resources, and server programs listen for those requests and respo…

Peer-to-Peer Network

A peer-to-peer (P2P) network is a decentralized architecture in which participating nodes, called peers, act as both clients and servers, sharing resources and…

What is Dijkstra’s Algorithm?

Dijkstra’s algorithm finds the shortest path from a single source vertex to every other vertex in a weighted graph with non-negative edge weights, using a gree…

What is a Red-Black Tree?

A red-black tree is a self-balancing binary search tree that colors each node red or black and enforces balancing rules so the longest root-to-leaf path is nev…

Greedy vs Dynamic Programming: What is the Difference?

Greedy algorithms make the locally optimal choice at each step and never reconsider it, while dynamic programming explores overlapping subproblems and combines…

What is Backtracking?

Backtracking is a systematic search technique that builds a solution incrementally, one choice at a time, and abandons ("backtracks" from) any partial path as…

What is a Hash Collision?

A hash collision occurs when two different keys are mapped by a hash function to the same bucket or index in a hash table, which is mathematically inevitable o…

What is the Overlay Technique in Memory Management?

The overlay technique is a memory management method that lets a program larger than available physical memory run by keeping only the currently needed portion…