Free Practice Questions for NVIDIA NCA-GENM Exam

Answer : A

A histogram bins a continuous variable into contiguous intervals and plots the frequency (or density) of observations falling into each bin, making it the standard tool for visualizing the shape of a continuous distribution --- skewness, modality, spread, and outliers are all immediately visible. This distinguishes it from a bar chart (B), which is designed for discrete or categorical variables where bars are separated and ordering is often arbitrary; applying a bar chart to continuous data loses the notion of a numeric scale between categories.

A line chart (C) is appropriate for showing trends of a variable across an ordered sequence, typically time, not for summarizing the overall shape of a value distribution. A pie chart (D) shows proportions of a whole across categorical segments and becomes visually unreadable and statistically meaningless for continuous data with many possible values.

In practice, histogram bin width is a critical hyperparameter: too few bins oversmooth the distribution and hide multimodality, while too many bins introduce noise. Tools like Freedman-Diaconis or Sturges' rule provide principled starting points, and kernel density estimates (KDE) are often overlaid as a smoothed alternative when bin-width sensitivity is a concern.

Answer : D

GANs are purpose-built generative models: as covered in the previous question, the generator component learns the underlying distribution of a training dataset and produces new synthetic samples that resemble it --- new images, audio, or other data types that did not exist in the original dataset but are statistically consistent with it. This generative capability is GAN's defining characteristic and the reason it is the correct answer among the options given, distinguishing it from the other three algorithms, all of which are fundamentally discriminative or unsupervised techniques rather than generative ones.

Decision trees (A) and support vector machines (B) are supervised discriminative algorithms --- they learn a decision boundary or a set of rules to classify or predict outputs from inputs, with no mechanism for producing novel data samples resembling a training distribution. K-means clustering (C) is unsupervised but serves a partitioning function, grouping existing data points into clusters based on similarity --- it identifies structure in data that already exists rather than synthesizing new data points that didn't exist before.

It's worth noting GANs are one of several generative model families (alongside variational autoencoders and diffusion models, both covered elsewhere in this set) --- among the four options presented here, however, GAN is the only one designed for generation at all, making this a comparatively direct elimination once the discriminative-vs-generative distinction is applied.

Answer : B

The standard ML project lifecycle proceeds: data collection first, since you need raw data before anything else can happen; data preprocessing next, to clean, transform, and prepare that raw data (handling missing values, normalization, encoding, splitting into train/validation/test sets) into a form a model can consume; model training next, where the algorithm learns patterns from the preprocessed training data; and model evaluation last, where the trained model's performance is measured on held-out data it did not see during training. Each stage depends on the output of the one before it --- you cannot preprocess data you haven't collected, train on data that hasn't been cleaned and split, or evaluate a model that hasn't been trained --- which is what makes B the only internally consistent ordering among the four options.

Options A, C, and D each place a downstream step before its prerequisite: A attempts preprocessing before collection (nothing to preprocess yet); C and D both place evaluation before training and, in D's case, before data even exists --- evaluation requires a trained model to assess, so it cannot logically precede training or the data-collection/preprocessing steps that training itself depends on.

In practice this pipeline is iterative rather than strictly linear --- evaluation results often send you back to preprocessing (feature engineering) or even data collection (targeted collection to address weak subgroups) --- but the canonical forward sequence for a first pass remains collection preprocessing training evaluation.

Answer : D, E

Option D captures the general, task-agnostic definition of contrastive learning: given pairs of inputs labeled as similar (positive pairs) or dissimilar (negative pairs), the training objective pulls positive pairs' representations closer together in embedding space while pushing negative pairs' representations further apart --- typically implemented via losses like InfoNCE, triplet loss, or contrastive loss with a margin. This is the mechanism underlying self-supervised representation learning broadly, not only in multimodal settings.

Option E correctly applies this general principle to the multimodal case: for the *same* object described across modalities (e.g., an image of a dog and the caption 'a dog'), the model should increase representational similarity, since they refer to the same underlying entity; for *different* objects across modalities (an image of a dog paired with the caption 'a cat'), the model should decrease similarity. This is exactly CLIP's training objective, tested elsewhere in this set --- matching image-text pairs pulled together, mismatched pairs pushed apart.

Options B and C both invert this relationship --- B increases similarity for *different* objects and decreases it for *same* objects, and C similarly reverses the correct direction --- describing the opposite of what contrastive learning is designed to achieve, making both clearly incorrect distractors that test careful reading of directionality. Option A is too vague and mischaracterizes contrastive learning as a generative/manipulation technique rather than a representation-learning objective.

Answer : C

CPU-GPU data transfer over the PCIe (or NVLink) bus is frequently a throughput bottleneck in ML pipelines, particularly when small, frequent transfers dominate rather than large batched ones --- each transfer incurs fixed overhead independent of data size, so many small transfers waste a disproportionate amount of time on overhead rather than useful data movement. Memory pooling techniques --- pre-allocating and reusing pinned (page-locked) host memory buffers rather than repeatedly allocating and freeing memory for each transfer --- reduce this overhead and enable faster, more predictable DMA transfers between host and device. Related software-level techniques include using CUDA streams to overlap data transfer with computation (so the GPU keeps computing while the next batch transfers in the background), and batching transfers to amortize fixed per-transfer overhead across more data.

Options A, B, and D each propose hardware upgrades that address a different bottleneck than the one described: increasing CPU clock speed (A) or core count (B) improves CPU-side compute throughput, not the data-transfer bandwidth or latency between CPU and GPU specifically. Upgrading the GPU (D) increases GPU compute capability but does nothing to address a PCIe/interconnect bandwidth limitation --- a faster GPU sitting idle waiting for data across the same bottlenecked bus would not see meaningfully improved end-to-end throughput. The question specifically asks about *throughput between* CPU and GPU, which points to interconnect/transfer-management optimization rather than raw compute upgrades on either side.