SEARCH LAVACS

Find a topic across LavaCS

Search textbooks, study guides, six encyclopedias, experiments and comparisons.

541 results · page 3 of 23

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.

Intermediate

Algorithms and Data Structures · Algorithms and data structures

Choose each item once with 0–1 knapsack

Derive a take-or-skip table and recover items, then examine update direction, pseudopolynomial cost and changed problem variants.

Intermediate

Algorithms and Data Structures · Comparisons and explanations

Arrays versus linked lists

Compare arrays and linked lists by separating lookup from updates, then consider locality, allocation, stable handles and workload requirements.

Intermediate

Distributed Systems · Comparisons and explanations

At-most-once versus at-least-once delivery

Compare at-most-once and at-least-once delivery through acknowledgment loss, redelivery and idempotent business effects.

Intermediate

Computer Networks · Comparisons and explanations

Bandwidth versus latency

Distinguish transfer capacity from delay using serialization time, round trips, queueing and parallel-request examples.

Intermediate

Algorithms and Data Structures · Comparisons and explanations

Breadth-first versus depth-first search

Trace queue-based and stack-based graph exploration, separating reachability, shortest edge count, predecessor paths and frontier memory.

Intermediate

Databases · Comparisons and explanations

B-trees versus LSM trees

Compare B-tree and LSM storage designs through ordered access, buffering, compaction, tombstones and read/write/space amplification.

Intermediate

Concurrency · Comparisons and explanations

Cache coherence versus memory consistency

Distinguish per-location cache coherence from memory consistency across locations, including synchronization, false sharing and language-level rules.

Intermediate

Virtualization and Cloud Computing · Comparisons and explanations

Compare container and VM boundaries

Compare kernel sharing, permissions, resources, packaging and persistence for one workload, including containers inside VMs.

Intermediate

Algorithms and Data Structures · Comparisons and explanations

Dijkstra versus Bellman–Ford

Compare nonnegative-weight greedy finalization with repeated relaxation, including reachable negative cycles, early exit and implementation costs.

Intermediate

Transformers and Large Language Models · Comparisons and explanations

Encoder versus decoder models

Compare encoder-only, decoder-only, and encoder-decoder models by visibility, output construction, and task rather than assuming exclusive capabilities.

Intermediate

Operating Systems · Comparisons and explanations

fork versus exec

Follow process creation and program replacement, including return values, inherited descriptors, failed exec and child reaping.

Intermediate

Algorithms and Data Structures · Comparisons and explanations

Greedy methods versus dynamic programming

Use a coin-change counterexample and recurrence to distinguish irreversible local choices from reusing solutions to subproblems.

Intermediate

Databases · Comparisons and explanations

Hash indexes versus B-tree indexes

Compare PostgreSQL hash and B-tree indexes through equality, ranges, ordering, collisions and workload-dependent plan choices.

Intermediate

Computer Networks · Comparisons and explanations

HTTP/2 multiplexing versus QUIC streams

Compare HTTP/2 multiplexing over TCP with QUIC stream delivery, distinguishing layer boundaries, loss, flow control and shared resources.

Intermediate

Computer Architecture · Comparisons and explanations

Interrupts versus polling

Compare event notification with active checking, including idle CPU cost, observation delay, burst handling and hybrid network processing.

Intermediate

Computer Networks · Comparisons and explanations

IP addresses versus MAC addresses

Compare IP addressing and link-layer MAC addressing by tracing same-link delivery, router forwarding, neighbor discovery and observation boundaries.

Intermediate

Databases · Comparisons and explanations

Logical versus physical replication

Compare PostgreSQL physical and logical replication by replication unit, selectable data, schema handling and migration or failover requirements.

Intermediate

Operating Systems · Comparisons and explanations

mmap versus read

Compare file reads and mappings through page-cache behavior, copying, faults, lifetime and concurrent file changes.

Intermediate

Databases · Comparisons and explanations

MVCC versus two-phase locking

Compare version-based visibility with two-phase locking, including serialization guarantees, reader/writer interaction and implementation boundaries.

Intermediate

Databases · Comparisons and explanations

OLTP versus OLAP

Compare transactional and analytical workloads through access patterns, storage layout, indexes, concurrency and freshness requirements.

Intermediate

Operating Systems · Comparisons and explanations

Paging versus segmentation

Compare fixed-size pages with variable-size segments through translation examples, fragmentation, protection and architecture-specific combinations.

Intermediate