Western Governors University D 333
WGU C949 - Data Structures And
Algorithms exam with question
and answer 100% correct
Terms in this set (163)
Algorithm Describes a sequence of steps to solve a
computational problem or perform a calculation.
Computational Problem Specifies an input, a question about the input that can
be answered using a computer, and the desired
output.
Longest Common Substring An algorithm that determines the longest common
substring that exists in two inputs strings.
Binary Search An efficient algorithm for searching a list. The list's
elements must be sorted and directly accessible
(such as an array).
Dijkstra's Shortest Path An algorithm that determines the shortest path from a
start vertex to each vertex in a graph.
NP-Complete A set of problems for which no known efficient
algorithm exists.
Polynomial time algorithm An algorithm whose execution time grows as a
polynomial of input size. An efficient algorithm is one
whose runtime increases no more than polynomially
with respect to the input size.
Data structure A way of organizing, storing, and performing
operations on data. Operations include accessing or
updating stored data, searching for specific data,
inserting new data, and removing data.
Record A data structure that stores subitems, with a name
associated with each subitem.
Array A data structure that stores subitems, with a name
associated with each subitem. May only store
homogeneous data elements.
Linked list A data structure that stores ordered list of items
in nodes, where each node stores data and has a
pointer to the next node.
Binary tree A data structure in which each node stores data and
, has up to two children, known as a left child and a
right child.
Hash table A data structure that stores unordered items by
mapping (or hashing) each item to a location in an
array.
Tree A non-linear data structure that organizes data in
a hierarchical way.
WGU C949 - Data Structures And
Algorithms exam with question
and answer 100% correct
Terms in this set (163)
Algorithm Describes a sequence of steps to solve a
computational problem or perform a calculation.
Computational Problem Specifies an input, a question about the input that can
be answered using a computer, and the desired
output.
Longest Common Substring An algorithm that determines the longest common
substring that exists in two inputs strings.
Binary Search An efficient algorithm for searching a list. The list's
elements must be sorted and directly accessible
(such as an array).
Dijkstra's Shortest Path An algorithm that determines the shortest path from a
start vertex to each vertex in a graph.
NP-Complete A set of problems for which no known efficient
algorithm exists.
Polynomial time algorithm An algorithm whose execution time grows as a
polynomial of input size. An efficient algorithm is one
whose runtime increases no more than polynomially
with respect to the input size.
Data structure A way of organizing, storing, and performing
operations on data. Operations include accessing or
updating stored data, searching for specific data,
inserting new data, and removing data.
Record A data structure that stores subitems, with a name
associated with each subitem.
Array A data structure that stores subitems, with a name
associated with each subitem. May only store
homogeneous data elements.
Linked list A data structure that stores ordered list of items
in nodes, where each node stores data and has a
pointer to the next node.
Binary tree A data structure in which each node stores data and
, has up to two children, known as a left child and a
right child.
Hash table A data structure that stores unordered items by
mapping (or hashing) each item to a location in an
array.
Tree A non-linear data structure that organizes data in
a hierarchical way.
