CompTIA DataX DY0-001 (V1) Practice Question

Your team is building a real-time recommendation service that must match a shopper's free-text query against more than 10 million product descriptions in under 50 ms. The catalog can be processed offline, and several gigabytes of pre-computed representations may be kept in memory, but the online request path should perform at most one neural-network forward pass per query. Relevance should be judged by semantic rather than purely lexical similarity. Which modelling strategy best satisfies the latency, scale, and semantic-matching requirements?

  • Represent each text as a sparse TF-IDF vector and rank candidates with BM25 scoring over an inverted index.

  • Compute the Levenshtein edit distance between the query string and every item title, selecting the smallest distances.

  • Pre-encode all item descriptions with a Siamese/bi-encoder transformer, store the vectors in an ANN index, and encode the query once at inference to retrieve nearest neighbours.

  • Run a transformer cross-encoder that concatenates the query with every candidate description and scores each pair on-the-fly.

CompTIA DataX DY0-001 (V1)
Specialized Applications of Data Science
Your Score:
Settings & Objectives
Random Mixed
Questions are selected randomly from all chosen topics, with a preference for those you haven’t seen before. You may see several questions from the same objective or domain in a row.
Rotate by Objective
Questions cycle through each objective or domain in turn, helping you avoid long streaks of questions from the same area. You may see some repeat questions, but the distribution will be more balanced across topics.

Check or uncheck an objective to set which questions you will receive.

SAVE $64
$529.00 $465.00
Bash, the Crucial Exams Chat Bot
AI Bot