Metadata
Technology & Computer Science Graduate Apply Medium
View More
Metadata

  • Subject

    Technology & Computer Science

  • Education level

    Graduate

  • Cognitive goals

    Apply

  • Difficulty estimate

    Medium

  • Tags

    bloom filter, count-min sketch, distributed databases, approximate queries, memory optimization, probabilistic data structures

  • Number of questions

    5

  • Created on

  • Generation source

  • License

    CC0 Public domain

  • Prompt

    Assess students' ability to design, configure, and analyze Bloom filters and Count‑Min Sketches to reduce memory and support approximate set‑membership and frequency queries in large‑scale distributed databases, focusing on parameter tuning (size, hash functions, width/depth), error bounds, mergeability, distributed update/consistency strategies, and trade‑offs among latency, space, and accuracy.
Use
Remix
Export
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%

Mock data used for demo purposes.