WGU D426 OBJECTIVE ASSESSEMENT FINAL
EXAM 2025 WITH ACTUAL CORRECT
QUESTIONS AND VERIFIED DETAILED
ANSWERS |FREQUENTLY TESTED
QUESTIONS AND SOLUTIONS |ALREADY
GRADED A+| |GUARANTEED PASS|LATEST
UPDATE
A ____ automatically allocates more blocks to the table, creates additional buckets, and distributes rows
across all buckets. With more buckets, fewer rows are assigned to each bucket and, on average, buckets
contain fewer linked blocks.
Dynamic hash function
____, also called ____, interleave rows of two or more tables in the same storage area.
Table clusters; multi-tables
Table clusters have a ____, a column that is available in all interleaved tables.
Cluster key
A ____ is a file containing column values, along with pointers to rows containing the column value.
Single-level index
In a ____ index, each index entry is a composite of values from all indexed columns. In all other respects,
these indexes behave exactly like indexes on a single column.
Multi-column
A ____ is a database operation that reads table blocks directly, without accessing an index.
Table scan
An ____ is a database operation that reads index blocks sequentially, in order to locate the needed table
blocks.
, Index scan
____, also called ____ or _____, is the percentage of table rows selected by a query.
Hit ratio; filter factor; selectivity
In a ____, the database repeatedly splits the index in two until it finds the entry containing the search
value.
Binary search
A ____, also called a ____ index, is an index on a sort column.
Primary index; clustering
A ____, also called a ____ index, is an index that is not on the sort column.
Secondary index; nonclustering
A ____ contains an entry for every table row.
Dense index
A ____ contains an entry for every table block.
Sparse index
A ____ stores column values and row pointers in a hierarchy.
Multi-level index
The number of index entries per block is called the ____ of a multi-level index.
Fan-out
Each path from the top-level block to a bottom-level block is called a ____.
Branch
Multi-level indexes are called ____ when all branches are the same length and ____ when branches are
different lengths.
Balanced; imbalanced
All indexed values appear in the bottom level. Pointers to table blocks appear only in the bottom level.
Since some indexed values also appear in higher levels, values are occasionally repeated in the index.
B+Tree
If an indexed values appears in a higher level, the value is not repeated at lower levels. Instead, a
pointer to the corresponding table block appears in the higher level along with the value.
B-Tree
In a ____, index entries are assigned to buckets.
EXAM 2025 WITH ACTUAL CORRECT
QUESTIONS AND VERIFIED DETAILED
ANSWERS |FREQUENTLY TESTED
QUESTIONS AND SOLUTIONS |ALREADY
GRADED A+| |GUARANTEED PASS|LATEST
UPDATE
A ____ automatically allocates more blocks to the table, creates additional buckets, and distributes rows
across all buckets. With more buckets, fewer rows are assigned to each bucket and, on average, buckets
contain fewer linked blocks.
Dynamic hash function
____, also called ____, interleave rows of two or more tables in the same storage area.
Table clusters; multi-tables
Table clusters have a ____, a column that is available in all interleaved tables.
Cluster key
A ____ is a file containing column values, along with pointers to rows containing the column value.
Single-level index
In a ____ index, each index entry is a composite of values from all indexed columns. In all other respects,
these indexes behave exactly like indexes on a single column.
Multi-column
A ____ is a database operation that reads table blocks directly, without accessing an index.
Table scan
An ____ is a database operation that reads index blocks sequentially, in order to locate the needed table
blocks.
, Index scan
____, also called ____ or _____, is the percentage of table rows selected by a query.
Hit ratio; filter factor; selectivity
In a ____, the database repeatedly splits the index in two until it finds the entry containing the search
value.
Binary search
A ____, also called a ____ index, is an index on a sort column.
Primary index; clustering
A ____, also called a ____ index, is an index that is not on the sort column.
Secondary index; nonclustering
A ____ contains an entry for every table row.
Dense index
A ____ contains an entry for every table block.
Sparse index
A ____ stores column values and row pointers in a hierarchy.
Multi-level index
The number of index entries per block is called the ____ of a multi-level index.
Fan-out
Each path from the top-level block to a bottom-level block is called a ____.
Branch
Multi-level indexes are called ____ when all branches are the same length and ____ when branches are
different lengths.
Balanced; imbalanced
All indexed values appear in the bottom level. Pointers to table blocks appear only in the bottom level.
Since some indexed values also appear in higher levels, values are occasionally repeated in the index.
B+Tree
If an indexed values appears in a higher level, the value is not repeated at lower levels. Instead, a
pointer to the corresponding table block appears in the higher level along with the value.
B-Tree
In a ____, index entries are assigned to buckets.
