WGU C949 - Data Structures And Algorithms
Study online at https://quizlet.com/_9yecj8
1. Algorithm Describes a sequence of steps to solve a computational
problem or perform a calculation.
2. Computational Specifies an input, a question about the input that can be
Problem answered using a computer, and the desired output.
3. Longest Com- An algorithm that determines the longest common sub-
mon Substring string that exists in two inputs strings.
4. Binary Search An efficient algorithm for searching a list. The list's ele-
ments must be sorted and directly accessible (such as an
array).
5. Dijkstra's Short- An algorithm that determines the shortest path from a
est Path 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 An algorithm whose execution time grows as a polynomial
algorithm 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 asso-
ciated with each subitem.
10. Array A data structure that stores subitems, with a name asso-
ciated 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.
, WGU C949 - Data Structures And Algorithms
Study online at https://quizlet.com/_9yecj8
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 hier-
archical way.
15. Heap A complete binary tree-based data structure.
16. Max-heap A tree that maintains the simple property that a node's
key is greater than or equal to the node's childrens' keys.
17. Min-heap A tree that maintains the simple property that a node's
key is less than or equal to the node's childrens' keys.
18. Graph A data structure for representing connections among
items, and consists of vertices connected by edges.
19. Vertex Represents an item in a graph.
20. Edge Represents a connection between two vertices in a graph.
21. Abstract Data A data type described by predefined user operations,
Type (ADT) such as "insert data at rear," without indicating how each
operation is implemented.
22. List An ADT for holding ordered data. Duplicate items are
allowed.
23. Stack An ADT in which items are only inserted on or removed
from the top.
24. Queue An ADT in which items are inserted at the end and re-
moved from the front. referred to as a first-in first-out ADT.
25. Deque An ADT in which items can be inserted and removed at
both the front and back.
, WGU C949 - Data Structures And Algorithms
Study online at https://quizlet.com/_9yecj8
26. Bag An ADT for storing items in which the order does not
matter and duplicate items are allowed.
27. Set An ADT for a collection of distinct items.
28. Priority Queue A queue where each item has a priority, and items with
higher priority are closer to the front of the queue than
items with lower priority. Duplicates items are allowed.
29. Dictionary An ADT that associates (or maps) keys with values. Can
be used to describe associative relationships in Python.
30. Queue push Inserts an item at the end of the queue.
31. Queue pop Removes and returns the item at the front of the queue.
32. Queue peek Returns but does not remove item at the front of the queue
33. Assignment Assigns the name on the left side to reference the value
statement on the right side.
34. Mutability Indicates whether the object's value is allowed to change.
35. type() A Python function that returns the class type of the argu-
ment (object) passed as parameter.
36. id() A Python function that returns identity (unique integer) of
an object.
37. name/identifier A sequence of letters (a-z, A-Z, _) and digits (0-9), and
must start with a letter. Note that "_", called an under-
score, is considered to be a letter.
38. Reserved words Words that have special meaning and therefore cannot be
used as identifiers.
39. PEP 8 The Python style guide that outlines the basics of how to
write Python code neatly and consistently.
40.
Study online at https://quizlet.com/_9yecj8
1. Algorithm Describes a sequence of steps to solve a computational
problem or perform a calculation.
2. Computational Specifies an input, a question about the input that can be
Problem answered using a computer, and the desired output.
3. Longest Com- An algorithm that determines the longest common sub-
mon Substring string that exists in two inputs strings.
4. Binary Search An efficient algorithm for searching a list. The list's ele-
ments must be sorted and directly accessible (such as an
array).
5. Dijkstra's Short- An algorithm that determines the shortest path from a
est Path 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 An algorithm whose execution time grows as a polynomial
algorithm 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 asso-
ciated with each subitem.
10. Array A data structure that stores subitems, with a name asso-
ciated 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.
, WGU C949 - Data Structures And Algorithms
Study online at https://quizlet.com/_9yecj8
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 hier-
archical way.
15. Heap A complete binary tree-based data structure.
16. Max-heap A tree that maintains the simple property that a node's
key is greater than or equal to the node's childrens' keys.
17. Min-heap A tree that maintains the simple property that a node's
key is less than or equal to the node's childrens' keys.
18. Graph A data structure for representing connections among
items, and consists of vertices connected by edges.
19. Vertex Represents an item in a graph.
20. Edge Represents a connection between two vertices in a graph.
21. Abstract Data A data type described by predefined user operations,
Type (ADT) such as "insert data at rear," without indicating how each
operation is implemented.
22. List An ADT for holding ordered data. Duplicate items are
allowed.
23. Stack An ADT in which items are only inserted on or removed
from the top.
24. Queue An ADT in which items are inserted at the end and re-
moved from the front. referred to as a first-in first-out ADT.
25. Deque An ADT in which items can be inserted and removed at
both the front and back.
, WGU C949 - Data Structures And Algorithms
Study online at https://quizlet.com/_9yecj8
26. Bag An ADT for storing items in which the order does not
matter and duplicate items are allowed.
27. Set An ADT for a collection of distinct items.
28. Priority Queue A queue where each item has a priority, and items with
higher priority are closer to the front of the queue than
items with lower priority. Duplicates items are allowed.
29. Dictionary An ADT that associates (or maps) keys with values. Can
be used to describe associative relationships in Python.
30. Queue push Inserts an item at the end of the queue.
31. Queue pop Removes and returns the item at the front of the queue.
32. Queue peek Returns but does not remove item at the front of the queue
33. Assignment Assigns the name on the left side to reference the value
statement on the right side.
34. Mutability Indicates whether the object's value is allowed to change.
35. type() A Python function that returns the class type of the argu-
ment (object) passed as parameter.
36. id() A Python function that returns identity (unique integer) of
an object.
37. name/identifier A sequence of letters (a-z, A-Z, _) and digits (0-9), and
must start with a letter. Note that "_", called an under-
score, is considered to be a letter.
38. Reserved words Words that have special meaning and therefore cannot be
used as identifiers.
39. PEP 8 The Python style guide that outlines the basics of how to
write Python code neatly and consistently.
40.
