WGU C949 DATA STRUCTURES AND ALGORITHMS EXAM | 80 COMPLETE
QUESTIONS WITH EXPERT SOLUTIONS | 2026 LATEST UPDATED | GET A+
1. An algorithm with a polynomial runtime is considered efficient?: True: An
efficient
algorithm is generally one whose runtime increases no more than
polynomially with respective to the input size. In contrast, an algorithm with
an exponential runtime is not efficient.
2. An efficient algorithm exists for all computational problems.: False: Many
compu-
tational problems exist for which an efficient algorithm is unknown. Such
problems are often encountered in real applications.
3. An efficient algorithm to solve an NP-complete may exist.: True: Whether
or not an
,efficient algorithm exists for NP-complete problems is an open research
question. However, the current consensus is that such an algorithm is
unlikely.
4. Record: A record is the data structure that stores subitems, often called
fields, with a name associated with each subitem.
5. Array: An array is a data structure that stores an ordered list of items,
where each item is directly accessible by a positional index.
6. 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.
7. 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.
8. 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
9. 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.
10. 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
11. A linked list stores items in an unspecified order.: False: A linked list
stores an ordered list of items. The links in each node define the order in
which items are stored.
12. A node in binary tree can have zero, one, or two children.: True: A
binary tree node can have no children, a single left or right child, or both
a left and right child.
13. A list node's data can store a record with multiple subitems.: True: The
data stored
in a list node can be a record with multiple subitems. Ex: A linked list storing
employee data might use a record containing the employee's name, title,
QUESTIONS WITH EXPERT SOLUTIONS | 2026 LATEST UPDATED | GET A+
1. An algorithm with a polynomial runtime is considered efficient?: True: An
efficient
algorithm is generally one whose runtime increases no more than
polynomially with respective to the input size. In contrast, an algorithm with
an exponential runtime is not efficient.
2. An efficient algorithm exists for all computational problems.: False: Many
compu-
tational problems exist for which an efficient algorithm is unknown. Such
problems are often encountered in real applications.
3. An efficient algorithm to solve an NP-complete may exist.: True: Whether
or not an
,efficient algorithm exists for NP-complete problems is an open research
question. However, the current consensus is that such an algorithm is
unlikely.
4. Record: A record is the data structure that stores subitems, often called
fields, with a name associated with each subitem.
5. Array: An array is a data structure that stores an ordered list of items,
where each item is directly accessible by a positional index.
6. 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.
7. 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.
8. 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
9. 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.
10. 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
11. A linked list stores items in an unspecified order.: False: A linked list
stores an ordered list of items. The links in each node define the order in
which items are stored.
12. A node in binary tree can have zero, one, or two children.: True: A
binary tree node can have no children, a single left or right child, or both
a left and right child.
13. A list node's data can store a record with multiple subitems.: True: The
data stored
in a list node can be a record with multiple subitems. Ex: A linked list storing
employee data might use a record containing the employee's name, title,
