1 | Page
WGU D684 INTRODUCTION TO COMPUTER SCIENCE
OBJECTIVE ASSESSMENT FINAL EXAM
PREPARATION MATERIAL 2025 2026 COMPLETE
QUESTIONS AND CORRECT ANSWERS ALREADY
GRADED A+ HIGH YIELD STUDY GUIDE ACTUAL
UPDATED PRACTICE QUESTIONS COMPUTER
SCIENCE EXAM PREPARATION SUCCESS REVIEW
BRAND NEW VERSION
Single Contiguous Memory Management - CORRECT ANSWER=a memory management
method where all processes are loaded into a single contiguous block of memory
fixed partition technique - CORRECT ANSWER=Main memory is divided into a fixed
number of partitions into which programs can be loaded.
Best uses:
-Fixed workloads
-well-suited for batch processing
Worst use cases:
-cannot handle unpredictable workloads
-can lead to internal fragmentation
-limited flexability
dynamic partition technique - CORRECT ANSWER=The memory management technique
in which memory is divided into partitions as needed to accommodate programs
,2 | Page
Best uses:
-Handling large unpredictable data
-Data that grows over time
Worst Cases:
Small sized data- hindering performace from unncessary complexity
-added complexity of managing the system
Single-partition allocation - CORRECT ANSWER=all storage space is allocated to a single
partition, often used for the operating system, applications, and user data.
First Come, First Served - CORRECT ANSWER=CPU-scheduling algorithm that processes
tasks in the order they arrive, similar to a queue
(Disk scheduling)
Round Robin - CORRECT ANSWER=a CPU scheduling algorithm where each process is
assigned a fixed time slice in a rotating order
Nonpreemptive Scheduling - CORRECT ANSWER=Processes run to completion without
interruption.
Process life cycle stages - CORRECT ANSWER=Hint: 5 total processes
-New: A process initially created and enters the system in this state
-Ready: The process is prepared to execute and is waiting for the cpu to become available
-Running: Process is currently being executed by the CPU
-Waiting: Process is temporarily paused, awaiting an event like input/output or the
completion of a resource request
,3 | Page
-Terminated: The process has completed its execution and is being removed from the
system.
what does the // mean in pseudocode? - CORRECT ANSWER=Round/ Int
Example of converting integer to a floating point number - CORRECT ANSWER=myFloat
x=a/1.0
Stack sorting - CORRECT ANSWER=Sorting in a "Stack of flashcards" way.
Downside is this requires space for two complete decks (Arrays). Not optimal for storage
space.
Bubble Sort - CORRECT ANSWER=Starting with the last array element, we compare pairs
of elements, swapping them whenever the bottom element of the pair is smaller than the one
above it.
The smallest element "Bubbles up" to the top of an array.
Insertion sort - CORRECT ANSWER=builds the final sorted array one item at a time.
EX. Sorting a hand of playing cards- pick up one at a time and insert into correct spot in
your already sorted hand.
Binary Search - CORRECT ANSWER=Items need to be sorted. it either finds the item or
eliminates half the array with one comparison. The algorithm starts searching in the middle
of an array in a binary search.
Sequential/linear search - CORRECT ANSWER=Straigh forward concept. Look at each
item in turn and compare it to the one for which we are searching. if it matches, we have
, 4 | Page
found the item. If not it continues searching for the item. We either stop when finding the
item or we have looked at all the items and not found a match. The search repeats
depending on the conditions in the expression.
-does not need to be sorted.
Count-controlled loop - CORRECT ANSWER=Repeats a process a specified number of
times. The looping mechanism counts each time the process is repeated and tests whether
it has finished before beginning the process again.
Data Types - CORRECT ANSWER=Define the kind of data a variable can hold: integers,
floats, characters, Booleans.
Variables - CORRECT ANSWER=Named memory locations that store data.
Assignment Operator - CORRECT ANSWER=`=` assigns values.
Camel Casing - CORRECT ANSWER=myVariableName; Snake Casing -
my_variable_name.
Control Structures - CORRECT ANSWER=Loops (while, for), conditionals (if, else).
Arithmetic Operators - CORRECT ANSWER=+, -, *, /.
Function/Subprogram - CORRECT ANSWER=Reusable block of code.
WGU D684 INTRODUCTION TO COMPUTER SCIENCE
OBJECTIVE ASSESSMENT FINAL EXAM
PREPARATION MATERIAL 2025 2026 COMPLETE
QUESTIONS AND CORRECT ANSWERS ALREADY
GRADED A+ HIGH YIELD STUDY GUIDE ACTUAL
UPDATED PRACTICE QUESTIONS COMPUTER
SCIENCE EXAM PREPARATION SUCCESS REVIEW
BRAND NEW VERSION
Single Contiguous Memory Management - CORRECT ANSWER=a memory management
method where all processes are loaded into a single contiguous block of memory
fixed partition technique - CORRECT ANSWER=Main memory is divided into a fixed
number of partitions into which programs can be loaded.
Best uses:
-Fixed workloads
-well-suited for batch processing
Worst use cases:
-cannot handle unpredictable workloads
-can lead to internal fragmentation
-limited flexability
dynamic partition technique - CORRECT ANSWER=The memory management technique
in which memory is divided into partitions as needed to accommodate programs
,2 | Page
Best uses:
-Handling large unpredictable data
-Data that grows over time
Worst Cases:
Small sized data- hindering performace from unncessary complexity
-added complexity of managing the system
Single-partition allocation - CORRECT ANSWER=all storage space is allocated to a single
partition, often used for the operating system, applications, and user data.
First Come, First Served - CORRECT ANSWER=CPU-scheduling algorithm that processes
tasks in the order they arrive, similar to a queue
(Disk scheduling)
Round Robin - CORRECT ANSWER=a CPU scheduling algorithm where each process is
assigned a fixed time slice in a rotating order
Nonpreemptive Scheduling - CORRECT ANSWER=Processes run to completion without
interruption.
Process life cycle stages - CORRECT ANSWER=Hint: 5 total processes
-New: A process initially created and enters the system in this state
-Ready: The process is prepared to execute and is waiting for the cpu to become available
-Running: Process is currently being executed by the CPU
-Waiting: Process is temporarily paused, awaiting an event like input/output or the
completion of a resource request
,3 | Page
-Terminated: The process has completed its execution and is being removed from the
system.
what does the // mean in pseudocode? - CORRECT ANSWER=Round/ Int
Example of converting integer to a floating point number - CORRECT ANSWER=myFloat
x=a/1.0
Stack sorting - CORRECT ANSWER=Sorting in a "Stack of flashcards" way.
Downside is this requires space for two complete decks (Arrays). Not optimal for storage
space.
Bubble Sort - CORRECT ANSWER=Starting with the last array element, we compare pairs
of elements, swapping them whenever the bottom element of the pair is smaller than the one
above it.
The smallest element "Bubbles up" to the top of an array.
Insertion sort - CORRECT ANSWER=builds the final sorted array one item at a time.
EX. Sorting a hand of playing cards- pick up one at a time and insert into correct spot in
your already sorted hand.
Binary Search - CORRECT ANSWER=Items need to be sorted. it either finds the item or
eliminates half the array with one comparison. The algorithm starts searching in the middle
of an array in a binary search.
Sequential/linear search - CORRECT ANSWER=Straigh forward concept. Look at each
item in turn and compare it to the one for which we are searching. if it matches, we have
, 4 | Page
found the item. If not it continues searching for the item. We either stop when finding the
item or we have looked at all the items and not found a match. The search repeats
depending on the conditions in the expression.
-does not need to be sorted.
Count-controlled loop - CORRECT ANSWER=Repeats a process a specified number of
times. The looping mechanism counts each time the process is repeated and tests whether
it has finished before beginning the process again.
Data Types - CORRECT ANSWER=Define the kind of data a variable can hold: integers,
floats, characters, Booleans.
Variables - CORRECT ANSWER=Named memory locations that store data.
Assignment Operator - CORRECT ANSWER=`=` assigns values.
Camel Casing - CORRECT ANSWER=myVariableName; Snake Casing -
my_variable_name.
Control Structures - CORRECT ANSWER=Loops (while, for), conditionals (if, else).
Arithmetic Operators - CORRECT ANSWER=+, -, *, /.
Function/Subprogram - CORRECT ANSWER=Reusable block of code.
