Latest Definitions — Page 53 of 60
Showing entries 313–318 of 360, ordered newest first.
Newest Computer and Technology Definitions
Page 53 of 60-
Adjacency List
noun · 1 definition · #48A graph representation that maps each vertex to a collection of its adjacent vertices or outgoing edges.
-
Directed Acyclic Graph
noun · 1 definition · #47A directed graph data structure of vertices and one-way edges that contains no cycles, enabling unambiguous dependency resolution and topological ordering.
-
Skip List
noun · 1 definition · #46A probabilistic, multi-layered linked data structure that maintains sorted elements and supports average logarithmic-time search, insertion, and deletion.
-
Bloom Filter
noun · 1 definition · #45A space-efficient probabilistic data structure that tests set membership, allowing occasional false positives while guaranteeing no false negatives.
-
Trie
noun · 1 definition · #44A tree-based data structure that stores strings or sequences by sharing common prefix paths for fast prefix and exact-key lookups.
-
Priority Queue
noun · 1 definition · #43An abstract data type that stores elements with assigned priorities and serves the highest- or lowest-priority item before all others.