1 | Page
WGU D684 Introduction To Computer Science Objective Assessment
Final Exam Questions And Correct Answers Already Graded A+
26
Single Contiguous Memory Management - CORRECT ANSWER=amemory management method
where all processes are loaded into a single contiguous block of memory
20
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
am
-well-suited for batch processing
Ex
Worst use cases:
-cannot handle unpredictable workloads
-can lead to internal fragmentation
s
-limited flexability
rt
pe
dynamic partition technique - CORRECT ANSWER=The memory management technique in which
memory is divided into partitions as needed to accommodate programs
Best uses:
Ex
-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
,2 | Page
Single-partition allocation - CORRECT ANSWER=allstorage 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)
2 6
Round Robin - CORRECT ANSWER=aCPUscheduling algorithm where each process is
20
assigned a fixed time slice in1 a rotating order
Nonpreemptive Scheduling -CORRECTANSWER = P1 rocesses run to completion
without interruption.
am
Process life cycle stages - CORRECT ANSWER=Hint: 5 total processes
Ex
-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
ts
-Waiting: Process is temporarily paused, awaiting an event like input/output or the
completion of a resource request
r
-Terminated: The process has completed its execution and is being removed from the system.
pe
what does the // mean in pseudocode? - CORRECT ANSWER=Round/ Int
Ex
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" wvay.
Downside is this requires space for two complete decks (Arrays). Not optimal for storage space.
,3 | Page
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.
26
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
20
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. am
Sequential/linear search - CORRECT ANSWER=Straigh forward concept. Look at each item in
Ex
turn and compare it to the one for which we are searching. if it matches, we have 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.
s
-does not need to be sorted.
rt
Count-controlled loop - CORRECT ANSWER=Repeats a process a specified number of times.The
pe
looping mechanism counts each time the process is repeated and tests whether it has finished
before beginning the process again.
Ex
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.
, 4 |Page
Camel Casing - CORRECT ANSWER=myVariableName; Snake Casing - myvariablename.
Control Structures - CORRECT ANSWER=Loops (while, for), conditionals (if, else).
6
Arithmetic Operators -CORRECTANSWER=+,-,*,/.
2
20
Function/Subprogram -CORRECT ANSWER=Reusable block of code.
Parameters vs Arguments -CORRECTANSWER=arameters are placeholders; arguments are
actual values.
am
Strong Typing -CORRECT ANSWER=Enforces consistent data type usage.
Ex
Data Structures - CORRECT ANSWER=Array, Stack, Queue, Linked List, Record.
ts
Algorithm - CORRECT ANSWER=Step-by-step process for solving a task.
r
Pseudocode - CORRECT ANSWER=High-level outline of code logic.
pe
Sequential Search vs Binary Search - CORRECT ANSWER=Linear vs divided search.
Ex
Sorting Algorithms - CORRECT ANSWER=Bubble, Insertion, Selection sort.
Composite Variable -CORRECTANSWER=Canstore multiple values.
Flowchart Symbols- CORRECT ANSWER=Terminal (oval), Process (rectangle), Input/Output
(parallelogram).
WGU D684 Introduction To Computer Science Objective Assessment
Final Exam Questions And Correct Answers Already Graded A+
26
Single Contiguous Memory Management - CORRECT ANSWER=amemory management method
where all processes are loaded into a single contiguous block of memory
20
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
am
-well-suited for batch processing
Ex
Worst use cases:
-cannot handle unpredictable workloads
-can lead to internal fragmentation
s
-limited flexability
rt
pe
dynamic partition technique - CORRECT ANSWER=The memory management technique in which
memory is divided into partitions as needed to accommodate programs
Best uses:
Ex
-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
,2 | Page
Single-partition allocation - CORRECT ANSWER=allstorage 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)
2 6
Round Robin - CORRECT ANSWER=aCPUscheduling algorithm where each process is
20
assigned a fixed time slice in1 a rotating order
Nonpreemptive Scheduling -CORRECTANSWER = P1 rocesses run to completion
without interruption.
am
Process life cycle stages - CORRECT ANSWER=Hint: 5 total processes
Ex
-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
ts
-Waiting: Process is temporarily paused, awaiting an event like input/output or the
completion of a resource request
r
-Terminated: The process has completed its execution and is being removed from the system.
pe
what does the // mean in pseudocode? - CORRECT ANSWER=Round/ Int
Ex
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" wvay.
Downside is this requires space for two complete decks (Arrays). Not optimal for storage space.
,3 | Page
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.
26
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
20
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. am
Sequential/linear search - CORRECT ANSWER=Straigh forward concept. Look at each item in
Ex
turn and compare it to the one for which we are searching. if it matches, we have 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.
s
-does not need to be sorted.
rt
Count-controlled loop - CORRECT ANSWER=Repeats a process a specified number of times.The
pe
looping mechanism counts each time the process is repeated and tests whether it has finished
before beginning the process again.
Ex
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.
, 4 |Page
Camel Casing - CORRECT ANSWER=myVariableName; Snake Casing - myvariablename.
Control Structures - CORRECT ANSWER=Loops (while, for), conditionals (if, else).
6
Arithmetic Operators -CORRECTANSWER=+,-,*,/.
2
20
Function/Subprogram -CORRECT ANSWER=Reusable block of code.
Parameters vs Arguments -CORRECTANSWER=arameters are placeholders; arguments are
actual values.
am
Strong Typing -CORRECT ANSWER=Enforces consistent data type usage.
Ex
Data Structures - CORRECT ANSWER=Array, Stack, Queue, Linked List, Record.
ts
Algorithm - CORRECT ANSWER=Step-by-step process for solving a task.
r
Pseudocode - CORRECT ANSWER=High-level outline of code logic.
pe
Sequential Search vs Binary Search - CORRECT ANSWER=Linear vs divided search.
Ex
Sorting Algorithms - CORRECT ANSWER=Bubble, Insertion, Selection sort.
Composite Variable -CORRECTANSWER=Canstore multiple values.
Flowchart Symbols- CORRECT ANSWER=Terminal (oval), Process (rectangle), Input/Output
(parallelogram).
