WGU C949, Data Structures And Algorithms EXPECTED
QUESTIONS WITH VERIFIED ANSWERS
Question 1.
Algorithm
ANSWER
Describes a sequence of steps to solve a computational problem or perform a calculation.
Question 2.
Computational Problem
ANSWER
Specifies an input, a question about the input that can be answered using a computer, and the
desired output.
Question 3.
Longest Common Substring
ANSWER
An algorithm that determines the longest common substring that exists in two inputs strings.
Question 4.
Binary Search
ANSWER
An efficient algorithm for searching a list. The list's elements must be sorted and directly
accessible (such as an array).
Question 5.
Dijkstra's Shortest Path
ANSWER
An algorithm that determines the shortest path from a start vertex to each vertex in a graph.
,Question 6.
NP-Complete
ANSWER
A set of problems for which no known efficient algorithm exists.
Question 7.
Polynomial time algorithm
ANSWER
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.
Question 8.
Data structure
ANSWER
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.
Question 9.
Record
ANSWER
A data structure that stores subitems, with a name associated with each subitem.
Question 10.
Array
ANSWER
A data structure that stores subitems, with a name associated with each subitem. May only
store homogeneous data elements.
,Question 11.
Linked list
ANSWER
A data structure that stores ordered list of items in nodes, where each node stores data and
has a pointer to the next node.
Question 12.
Binary tree
ANSWER
A data structure in which each node stores data and has up to two children, known as a left
child and a right child.
Question 13.
Hash table
ANSWER
A data structure that stores unordered items by mapping (or hashing) each item to a location
in an array.
Question 14.
Tree
ANSWER
A non-linear data structure that organizes data in a hierarchical way.
Question 15.
Heap
ANSWER
A complete binary tree-based data structure.
, Question 16.
Max-heap
ANSWER
A tree that maintains the simple property that a node's key is greater than or equal to the
node's childrens' keys.
Question 17.
Min-heap
ANSWER
A tree that maintains the simple property that a node's key is less than or equal to the node's
childrens' keys.
Question 18.
Graph
ANSWER
A data structure for representing connections among items, and consists of vertices connected
by edges.
Question 19.
Vertex
ANSWER
Represents an item in a graph.
Question 20.
Edge
ANSWER
Represents a connection between two vertices in a graph.
QUESTIONS WITH VERIFIED ANSWERS
Question 1.
Algorithm
ANSWER
Describes a sequence of steps to solve a computational problem or perform a calculation.
Question 2.
Computational Problem
ANSWER
Specifies an input, a question about the input that can be answered using a computer, and the
desired output.
Question 3.
Longest Common Substring
ANSWER
An algorithm that determines the longest common substring that exists in two inputs strings.
Question 4.
Binary Search
ANSWER
An efficient algorithm for searching a list. The list's elements must be sorted and directly
accessible (such as an array).
Question 5.
Dijkstra's Shortest Path
ANSWER
An algorithm that determines the shortest path from a start vertex to each vertex in a graph.
,Question 6.
NP-Complete
ANSWER
A set of problems for which no known efficient algorithm exists.
Question 7.
Polynomial time algorithm
ANSWER
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.
Question 8.
Data structure
ANSWER
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.
Question 9.
Record
ANSWER
A data structure that stores subitems, with a name associated with each subitem.
Question 10.
Array
ANSWER
A data structure that stores subitems, with a name associated with each subitem. May only
store homogeneous data elements.
,Question 11.
Linked list
ANSWER
A data structure that stores ordered list of items in nodes, where each node stores data and
has a pointer to the next node.
Question 12.
Binary tree
ANSWER
A data structure in which each node stores data and has up to two children, known as a left
child and a right child.
Question 13.
Hash table
ANSWER
A data structure that stores unordered items by mapping (or hashing) each item to a location
in an array.
Question 14.
Tree
ANSWER
A non-linear data structure that organizes data in a hierarchical way.
Question 15.
Heap
ANSWER
A complete binary tree-based data structure.
, Question 16.
Max-heap
ANSWER
A tree that maintains the simple property that a node's key is greater than or equal to the
node's childrens' keys.
Question 17.
Min-heap
ANSWER
A tree that maintains the simple property that a node's key is less than or equal to the node's
childrens' keys.
Question 18.
Graph
ANSWER
A data structure for representing connections among items, and consists of vertices connected
by edges.
Question 19.
Vertex
ANSWER
Represents an item in a graph.
Question 20.
Edge
ANSWER
Represents a connection between two vertices in a graph.
