WGU C949 EXAM 3 QUESTIONS AND
CORRECT ANSWERS!!
What is an Record?
A record is the data structure that stores subitems, often called fields, with a name associated
with each subitem.
What is an Array?
An array is a data structure that stores an ordered list of items, where each item is directly
accessible by a positional Index
What is a Linked List?
A linked list is a data structure that stores an ordered list of items in nodes, where each node
stores data and has a pointer to the next node.
What is a Binary Tree?
A binary tree is a data structure in which each node stores data and has up to two children,
known as a left child and a right child.
What is Hash Table?
A hash table is a data structure that stores unordered items by mapping (or hashing) each item to
a location in an array.
What is a Heap?
A max-heap is a tree that maintains the simple property that a node's key is greater than or equal
to the node's childrens' keys. A min-heap is a tree that maintains the simple property that a node's
key is less than or equal to the node's childrens' keys.
What is a Graph?
A Graph is a data structure for representing connections among items, and consists of vertices
connected by edges. A vertex represents an item in a graph. An Edge represents a connection
between two vertices in a graph
, What are the Characteristics of an Algorithm
Well-Defined Inputs
Wel-Defined Outputs
Unambiguity
Finitness
Language Independent
Effectiveness and Feasibility
What Algorithm Characteristic is this: It allows the algorithm to be predictable, i.e., the
same input produces the same output, which makes debugging an implementation easier.
Unambiguity
What Algorithm Characteristic is this: Unambiguous inputs help prevent incorrect
implementations and misunderstanding of the algorithm's requirements.
Well-defined Inputs
What Algorithm Characteristic is this: It avoids ambiguity and guarantees that the
algorithm solves the problem correctly
Well-defined Outputs
What Algorithm Characteristic is this: The algorithm should end after a finite amount of
time, and it should have a limited number of instructions.
Finiteness
What Algorithm Characteristic is this: Makes it easier to compare the algorithm's
performance using different programming languages.
Language Independent
What Algorithm Characteristic is this: They are adopted easily for usage across different
fields due to its practical hardware requirements.
Effectiveness and Feasibility
What type of Algorithm is this: Tries all options
CORRECT ANSWERS!!
What is an Record?
A record is the data structure that stores subitems, often called fields, with a name associated
with each subitem.
What is an Array?
An array is a data structure that stores an ordered list of items, where each item is directly
accessible by a positional Index
What is a Linked List?
A linked list is a data structure that stores an ordered list of items in nodes, where each node
stores data and has a pointer to the next node.
What is a Binary Tree?
A binary tree is a data structure in which each node stores data and has up to two children,
known as a left child and a right child.
What is Hash Table?
A hash table is a data structure that stores unordered items by mapping (or hashing) each item to
a location in an array.
What is a Heap?
A max-heap is a tree that maintains the simple property that a node's key is greater than or equal
to the node's childrens' keys. A min-heap is a tree that maintains the simple property that a node's
key is less than or equal to the node's childrens' keys.
What is a Graph?
A Graph is a data structure for representing connections among items, and consists of vertices
connected by edges. A vertex represents an item in a graph. An Edge represents a connection
between two vertices in a graph
, What are the Characteristics of an Algorithm
Well-Defined Inputs
Wel-Defined Outputs
Unambiguity
Finitness
Language Independent
Effectiveness and Feasibility
What Algorithm Characteristic is this: It allows the algorithm to be predictable, i.e., the
same input produces the same output, which makes debugging an implementation easier.
Unambiguity
What Algorithm Characteristic is this: Unambiguous inputs help prevent incorrect
implementations and misunderstanding of the algorithm's requirements.
Well-defined Inputs
What Algorithm Characteristic is this: It avoids ambiguity and guarantees that the
algorithm solves the problem correctly
Well-defined Outputs
What Algorithm Characteristic is this: The algorithm should end after a finite amount of
time, and it should have a limited number of instructions.
Finiteness
What Algorithm Characteristic is this: Makes it easier to compare the algorithm's
performance using different programming languages.
Language Independent
What Algorithm Characteristic is this: They are adopted easily for usage across different
fields due to its practical hardware requirements.
Effectiveness and Feasibility
What type of Algorithm is this: Tries all options
