WGU D486 COMPREHENSIVE STUDY GUIDE
2026 FULL QUESTIONS AND SOLUTIONS
GRADED A+
◍ Unmatched data from either table is included. Will result in empty fields..
Answer: Full Outer Join
◍ Nonvolatile Memory.
Answer: A form of memory that retains data even in the absence of a power
source and that is used to store programs between runs. A DVD disk is
nonvolatile.
◍ Correlating predictor.
Answer: A branch predictor that combines local behavior of a particular
branch and global information about the behavior of some recent number of
executed branches.
◍ A conceptual framework for database systems with three parts: Data
Structures (prescribe how data is organized), Operations (manipulates data
structures), Rules (govern valid data)..
Answer: Database Model
◍ system software.
Answer: The set of programs that enables a computer's hardware devices
and application software to work together; it includes the operating system
and utility programs.
◍ Rejects an insert, update, or delete that violates referential integrity..
Answer: RESTRICT
◍ An unordered collection of elements enclosed in braces..
Answer: Set
,◍ Instruction set architecture.
Answer: Also called architecture. An abstract interface between the
hardware and the lowest-level software that encompasses all the information
necessary to write a machine language program that will run correctly,
including instructions, registers, memory access, I/O, and so on.
◍ Minimum number of entity instances that must participate in a relationship
instance. These values typically assume a value of zero (optional) or one
(mandatory)..
Answer: Minimum Cardinality
◍ Checks each query for syntax errors and converts valid queries to an internal
representation..
Answer: Query Parser
◍ Relates an entity to itself.
Answer: Reflexive Relationship
◍ A software layer that emulates a complete, independent computing
environment..
Answer: Virtual Machine
◍ Accesses data on storage media. Data stored on storage media and organized
in files. Contains 3 types of data: - User data (tables & indexes) - Log files
(record of any changes) - Data dictionary (aka: catalog directory of tables,
columns, keys, indexes in a relational database). One row for each database
object..
Answer: File System
◍ Execute (EX).
Answer: ALU is used to perform the instruction's operation or to compute an
address, or an adder is used for branches; both are depicted using an ALU
symbol.
◍ Represents an intersection of the data sets.
Answer: AND
,◍ An attribute that can be used to find the value of another attribute in the
relation..
Answer: Determinant
◍ Amdahl's Law.
Answer: A formula used to find the maximum improvement possible by
improving a particular part of a system. In parallel computing, Amdahl's law
is mainly used to predict the theoretical maximum speedup for program
processing using multiple processors
◍ Aliasing.
Answer: A situation in which two addresses access the same object; it can
occur in the virtual memory when there are two virtual addresses for the
same physical page
◍ STUR.
Answer: store register
◍ L2 cache.
Answer: A cache for main memoryIt is faster than memory, but tends to be
larger and slower than the L1 cache
◍ Smaller is faster.
Answer: A very large number of registers may increase the clock cycle time
simply because it takes electronic signals longer when they must travel
farther.Guidelines such as "smaller is faster" are not absolutes; 31 registers
may not be faster than 32. Even so, the truth behind such observations
causes computer designers to take them seriously. In this case, the designer
must balance the craving of programs for more registers with the designer's
desire to keep the clock cycle fast. Another reason for not using more than
32 is the number of bits it would take in the instruction format.
◍ Seymour Cray.
Answer: American inventor of the Cray supercomputer.
◍ The table specified in the view query's FROM clause..
, Answer: Base Table
◍ snooping.
Answer: a popular cache coherence protocol.Each cache contains a copy of
data from a block of physical memory along with a copy of the sharing
status of that block. Each cache contains a controller that monitors, or
snoops, activity on a shared communication medium to determine if any
action is needed to ensure cache coherence.
◍ rising clock edge.
Answer: 0 to 1
◍ Depicted with square corners.
Answer: Tables
◍ Volatile- Used to conduct daily business -Changes in real time -Detailed
Designed for specific business function -Concerned primarily with current
data.
Answer: Operational Data
◍ No partial dependencies. All non-key columns depend on the whole primary
key..
Answer: Second Normal Form
◍ Architectural registers.
Answer: The instruction set of visible registers of a processor; for example,
in MIPS, these are the 32 integer and 16 floating point registers
◍ Branch prediction buffer.
Answer: Also called branch history table. A small memory that is indexed
by the lower portion of the address of the branch instruction and that
contains one or more bits indicating whether the branch was recently taken
or not.
◍ Weak scaling.
Answer: Speed-up achieved on a multiprocessor while increasing the size of
the problem proportionally to the increase in the number of processors.Not
2026 FULL QUESTIONS AND SOLUTIONS
GRADED A+
◍ Unmatched data from either table is included. Will result in empty fields..
Answer: Full Outer Join
◍ Nonvolatile Memory.
Answer: A form of memory that retains data even in the absence of a power
source and that is used to store programs between runs. A DVD disk is
nonvolatile.
◍ Correlating predictor.
Answer: A branch predictor that combines local behavior of a particular
branch and global information about the behavior of some recent number of
executed branches.
◍ A conceptual framework for database systems with three parts: Data
Structures (prescribe how data is organized), Operations (manipulates data
structures), Rules (govern valid data)..
Answer: Database Model
◍ system software.
Answer: The set of programs that enables a computer's hardware devices
and application software to work together; it includes the operating system
and utility programs.
◍ Rejects an insert, update, or delete that violates referential integrity..
Answer: RESTRICT
◍ An unordered collection of elements enclosed in braces..
Answer: Set
,◍ Instruction set architecture.
Answer: Also called architecture. An abstract interface between the
hardware and the lowest-level software that encompasses all the information
necessary to write a machine language program that will run correctly,
including instructions, registers, memory access, I/O, and so on.
◍ Minimum number of entity instances that must participate in a relationship
instance. These values typically assume a value of zero (optional) or one
(mandatory)..
Answer: Minimum Cardinality
◍ Checks each query for syntax errors and converts valid queries to an internal
representation..
Answer: Query Parser
◍ Relates an entity to itself.
Answer: Reflexive Relationship
◍ A software layer that emulates a complete, independent computing
environment..
Answer: Virtual Machine
◍ Accesses data on storage media. Data stored on storage media and organized
in files. Contains 3 types of data: - User data (tables & indexes) - Log files
(record of any changes) - Data dictionary (aka: catalog directory of tables,
columns, keys, indexes in a relational database). One row for each database
object..
Answer: File System
◍ Execute (EX).
Answer: ALU is used to perform the instruction's operation or to compute an
address, or an adder is used for branches; both are depicted using an ALU
symbol.
◍ Represents an intersection of the data sets.
Answer: AND
,◍ An attribute that can be used to find the value of another attribute in the
relation..
Answer: Determinant
◍ Amdahl's Law.
Answer: A formula used to find the maximum improvement possible by
improving a particular part of a system. In parallel computing, Amdahl's law
is mainly used to predict the theoretical maximum speedup for program
processing using multiple processors
◍ Aliasing.
Answer: A situation in which two addresses access the same object; it can
occur in the virtual memory when there are two virtual addresses for the
same physical page
◍ STUR.
Answer: store register
◍ L2 cache.
Answer: A cache for main memoryIt is faster than memory, but tends to be
larger and slower than the L1 cache
◍ Smaller is faster.
Answer: A very large number of registers may increase the clock cycle time
simply because it takes electronic signals longer when they must travel
farther.Guidelines such as "smaller is faster" are not absolutes; 31 registers
may not be faster than 32. Even so, the truth behind such observations
causes computer designers to take them seriously. In this case, the designer
must balance the craving of programs for more registers with the designer's
desire to keep the clock cycle fast. Another reason for not using more than
32 is the number of bits it would take in the instruction format.
◍ Seymour Cray.
Answer: American inventor of the Cray supercomputer.
◍ The table specified in the view query's FROM clause..
, Answer: Base Table
◍ snooping.
Answer: a popular cache coherence protocol.Each cache contains a copy of
data from a block of physical memory along with a copy of the sharing
status of that block. Each cache contains a controller that monitors, or
snoops, activity on a shared communication medium to determine if any
action is needed to ensure cache coherence.
◍ rising clock edge.
Answer: 0 to 1
◍ Depicted with square corners.
Answer: Tables
◍ Volatile- Used to conduct daily business -Changes in real time -Detailed
Designed for specific business function -Concerned primarily with current
data.
Answer: Operational Data
◍ No partial dependencies. All non-key columns depend on the whole primary
key..
Answer: Second Normal Form
◍ Architectural registers.
Answer: The instruction set of visible registers of a processor; for example,
in MIPS, these are the 32 integer and 16 floating point registers
◍ Branch prediction buffer.
Answer: Also called branch history table. A small memory that is indexed
by the lower portion of the address of the branch instruction and that
contains one or more bits indicating whether the branch was recently taken
or not.
◍ Weak scaling.
Answer: Speed-up achieved on a multiprocessor while increasing the size of
the problem proportionally to the increase in the number of processors.Not
