1
2025
WGU C949 OBJECTIVE ASSESSMENT 2 LATEST VERSIONS NEWEST 2025
ACTUAL EXAM COMPLETE 350 QUESTIONS AND CORRECT DETAILED
ANSWERS (VERIFIED ANSWERS) |ALREADY GRADED A+
#here are some comments
#followed by some more
comments
Python multi-line comments
#and finally concluding
#with these comments right here
Python docstrings: 1. lets you write a long comment
(yeah, so?)
2. """this function checks if a value
is odd or even"""
1. What are they?
2. What do they look like?
3. How are they different
3. They can be written out at
from #comments?
runtime
4. When would you use
them?
4. Used to describe in detail what
a piece of code is doing *in a way
that can be displayed to the user
1
,2
at runtime*
1.Easy to read aloud
Naming Guidance: Identifiers (2)
2.Reflects the action or
responsibility of the item
1. Singular noun (eg, Member,
not Members)
Naming Classes (3) 2. Capitalized
3. CamelCase for multiple words;
each word is capitalized
1. lowercase
Naming Functions (2) 2. separate multiple words
with underscores
3. Naming individual objects
Should be lowercase nouns (eg,
grade)
(parameters, instance variables,
local variables, etc.)
Naming identifiers that represent 1. All caps
a constant (2)
2. Underscore to separate words
(eg, max weight for a bridge)
2
,3
MAX_GVW
What kind of error is a bug? Logic error
machine language 0's and 1's
two-character alphabet
translates human-readable
assembly language instructions (zB, Mul 97, #9, 98)
into an executable
compilers translate high-level languages into
assembly language
High-Level languages are
languages that are human-
readable with things like
declarations, statements,
operators, etc. so everything from
FORTRAN and COBOL to Python,
C++, Java, etc.
3
, 4
No efficient algorithm has
found been to solve an
NP-complete problem.
No one has proven that an
Three characteristics of a NP- efficient algorithm to
complete problem: solve an NP-complete
problem is impossible.
If an efficient algorithm
exists for one NP-
complete problem, then
all NP-complete problem
can be solved efficiently
Ordered list of items;
Array
Each item is accessible by a
Data Structure
positional index
Linked List
Ordered list of items stored
in nodes, where each node stores
data and has a pointer to the next
node
Data Structure
Binary Tree
Data is stored in nodes that have
up to two children, known as a left
child and a right child
Data Structure
4
2025
WGU C949 OBJECTIVE ASSESSMENT 2 LATEST VERSIONS NEWEST 2025
ACTUAL EXAM COMPLETE 350 QUESTIONS AND CORRECT DETAILED
ANSWERS (VERIFIED ANSWERS) |ALREADY GRADED A+
#here are some comments
#followed by some more
comments
Python multi-line comments
#and finally concluding
#with these comments right here
Python docstrings: 1. lets you write a long comment
(yeah, so?)
2. """this function checks if a value
is odd or even"""
1. What are they?
2. What do they look like?
3. How are they different
3. They can be written out at
from #comments?
runtime
4. When would you use
them?
4. Used to describe in detail what
a piece of code is doing *in a way
that can be displayed to the user
1
,2
at runtime*
1.Easy to read aloud
Naming Guidance: Identifiers (2)
2.Reflects the action or
responsibility of the item
1. Singular noun (eg, Member,
not Members)
Naming Classes (3) 2. Capitalized
3. CamelCase for multiple words;
each word is capitalized
1. lowercase
Naming Functions (2) 2. separate multiple words
with underscores
3. Naming individual objects
Should be lowercase nouns (eg,
grade)
(parameters, instance variables,
local variables, etc.)
Naming identifiers that represent 1. All caps
a constant (2)
2. Underscore to separate words
(eg, max weight for a bridge)
2
,3
MAX_GVW
What kind of error is a bug? Logic error
machine language 0's and 1's
two-character alphabet
translates human-readable
assembly language instructions (zB, Mul 97, #9, 98)
into an executable
compilers translate high-level languages into
assembly language
High-Level languages are
languages that are human-
readable with things like
declarations, statements,
operators, etc. so everything from
FORTRAN and COBOL to Python,
C++, Java, etc.
3
, 4
No efficient algorithm has
found been to solve an
NP-complete problem.
No one has proven that an
Three characteristics of a NP- efficient algorithm to
complete problem: solve an NP-complete
problem is impossible.
If an efficient algorithm
exists for one NP-
complete problem, then
all NP-complete problem
can be solved efficiently
Ordered list of items;
Array
Each item is accessible by a
Data Structure
positional index
Linked List
Ordered list of items stored
in nodes, where each node stores
data and has a pointer to the next
node
Data Structure
Binary Tree
Data is stored in nodes that have
up to two children, known as a left
child and a right child
Data Structure
4
