Algorithms and Data Structures · Algorithms and data structures
The Z algorithm: compute prefix-match lengths
Reuse an established prefix-match interval to build a Z array in linear time and locate a pattern with a safe separator.
IntermediateSEARCH LAVACS
Search textbooks, study guides, six encyclopedias, experiments and comparisons.
541 results · page 3 of 23
Algorithms and Data Structures · Algorithms and data structures
Reuse an established prefix-match interval to build a Z array in linear time and locate a pattern with a safe separator.
IntermediateAlgorithms and Data Structures · Algorithms and data structures
Derive a take-or-skip table and recover items, then examine update direction, pseudopolynomial cost and changed problem variants.
IntermediateAlgorithms and Data Structures · Comparisons and explanations
Compare arrays and linked lists by separating lookup from updates, then consider locality, allocation, stable handles and workload requirements.
IntermediateDistributed Systems · Comparisons and explanations
Compare at-most-once and at-least-once delivery through acknowledgment loss, redelivery and idempotent business effects.
IntermediateComputer Networks · Comparisons and explanations
Distinguish transfer capacity from delay using serialization time, round trips, queueing and parallel-request examples.
IntermediateDistributed Systems · Comparisons and explanations
Compare bounded input, first and final output, late events, correction and recovery effects under one shared requirement.
IntermediateAlgorithms and Data Structures · Comparisons and explanations
Trace queue-based and stack-based graph exploration, separating reachability, shortest edge count, predecessor paths and frontier memory.
IntermediateDatabases · Comparisons and explanations
Compare B-tree and LSM storage designs through ordered access, buffering, compaction, tombstones and read/write/space amplification.
IntermediateConcurrency · Comparisons and explanations
Distinguish per-location cache coherence from memory consistency across locations, including synchronization, false sharing and language-level rules.
IntermediateConcurrency · Comparisons and explanations
Compare overlapping work, actual simultaneous computation, I/O waiting, and the correctness of shared-state updates.
IntroductoryVirtualization and Cloud Computing · Comparisons and explanations
Compare kernel sharing, permissions, resources, packaging and persistence for one workload, including containers inside VMs.
IntermediateAlgorithms and Data Structures · Comparisons and explanations
Compare nonnegative-weight greedy finalization with repeated relaxation, including reachable negative cycles, early exit and implementation costs.
IntermediateTransformers and Large Language Models · Comparisons and explanations
Compare encoder-only, decoder-only, and encoder-decoder models by visibility, output construction, and task rather than assuming exclusive capabilities.
IntermediateOperating Systems · Comparisons and explanations
Follow process creation and program replacement, including return values, inherited descriptors, failed exec and child reaping.
IntermediateAlgorithms and Data Structures · Comparisons and explanations
Use a coin-change counterexample and recurrence to distinguish irreversible local choices from reusing solutions to subproblems.
IntermediateDatabases · Comparisons and explanations
Compare PostgreSQL hash and B-tree indexes through equality, ranges, ordering, collisions and workload-dependent plan choices.
IntermediateComputer Networks · Comparisons and explanations
Compare HTTP/2 multiplexing over TCP with QUIC stream delivery, distinguishing layer boundaries, loss, flow control and shared resources.
IntermediateComputer Architecture · Comparisons and explanations
Compare event notification with active checking, including idle CPU cost, observation delay, burst handling and hybrid network processing.
IntermediateComputer Networks · Comparisons and explanations
Compare IP addressing and link-layer MAC addressing by tracing same-link delivery, router forwarding, neighbor discovery and observation boundaries.
IntermediateDatabases · Comparisons and explanations
Compare PostgreSQL physical and logical replication by replication unit, selectable data, schema handling and migration or failover requirements.
IntermediateOperating Systems · Comparisons and explanations
Compare file reads and mappings through page-cache behavior, copying, faults, lifetime and concurrent file changes.
IntermediateDatabases · Comparisons and explanations
Compare version-based visibility with two-phase locking, including serialization guarantees, reader/writer interaction and implementation boundaries.
IntermediateDatabases · Comparisons and explanations
Compare transactional and analytical workloads through access patterns, storage layout, indexes, concurrency and freshness requirements.
IntermediateOperating Systems · Comparisons and explanations
Compare fixed-size pages with variable-size segments through translation examples, fragmentation, protection and architecture-specific combinations.
Intermediate