WGU C949 - DATA
STRUCTURES AND
ALGORITHMS
[Document subtitle]
[DATE]
[COMPANY NAME]
[Company address]
,Certainly! Here are all the questions and answers numbered for you:
1. **Algorithm**
Describes a sequence of steps to solve a computational problem or perform a calculation.
2. **Computational Problem**
Specifies an input, a question about the input that can be answered using a computer, and
the desired output.
3. **Longest Common Substring**
An algorithm that determines the longest common substring that exists in two input strings.
4. **Binary Search**
An efficient algorithm for searching a list. The list's elements must be sorted and directly
accessible (such as an array).
5. **Dijkstra's Shortest Path**
An algorithm that determines the shortest path from a start vertex to each vertex in a graph.
6. **NP-Complete**
A set of problems for which no known efficient algorithm exists.
7. **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.
8. **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.
9. **Record**
A data structure that stores subitems, with a name associated with each subitem.
10. **Array**
A data structure that stores subitems, with a name associated with each subitem. May only
store homogeneous data elements.
11. **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.
12. **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.
13. **Hash table**
A data structure that stores unordered items by mapping (or hashing) each item to a
location in an array.
14. **Tree**
A non-linear data structure that organizes data in a hierarchical way.
15. **Heap**
A complete binary tree-based data structure.
16. **Max-heap**
STRUCTURES AND
ALGORITHMS
[Document subtitle]
[DATE]
[COMPANY NAME]
[Company address]
,Certainly! Here are all the questions and answers numbered for you:
1. **Algorithm**
Describes a sequence of steps to solve a computational problem or perform a calculation.
2. **Computational Problem**
Specifies an input, a question about the input that can be answered using a computer, and
the desired output.
3. **Longest Common Substring**
An algorithm that determines the longest common substring that exists in two input strings.
4. **Binary Search**
An efficient algorithm for searching a list. The list's elements must be sorted and directly
accessible (such as an array).
5. **Dijkstra's Shortest Path**
An algorithm that determines the shortest path from a start vertex to each vertex in a graph.
6. **NP-Complete**
A set of problems for which no known efficient algorithm exists.
7. **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.
8. **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.
9. **Record**
A data structure that stores subitems, with a name associated with each subitem.
10. **Array**
A data structure that stores subitems, with a name associated with each subitem. May only
store homogeneous data elements.
11. **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.
12. **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.
13. **Hash table**
A data structure that stores unordered items by mapping (or hashing) each item to a
location in an array.
14. **Tree**
A non-linear data structure that organizes data in a hierarchical way.
15. **Heap**
A complete binary tree-based data structure.
16. **Max-heap**
