WGU C949 QUESTIONS AND DETAILED
CORRECT ANSWERS; A+ GRADE
Abstract Data Type (ADT) - correct answer- Data type
described by predefined user operations, without indicating how
each operation is implemented.
Array - correct answer- An array is a data structure
that stores an ordered list of items, where each item is directly
accessible by a positional index.
Bag - correct answer- A bag is an ADT for storing
items in which the order does not matter and duplicate items
are allowed.
Common underlying data structures:
Array, linked list
Binary tree - correct answer- 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.
, Binary tree - correct answer- Each node has up to
two children, known as a left child and a right child. "Binary"
means two, referring to the two children.
Chaining - correct answer- Chaining is a collision
resolution technique where each bucket has a list of items that
creates a chain (so bucket 5's list would become 55, 75)
Computational problem - correct answer- Specifies
an input, a question about the input that can be answered using
a computer, and the desired output.
Deque - correct answer- A deque (pronounced
"deck" and short for double-ended queue) is an ADT in which
items can be inserted and removed at both the front and back.
Common underlying data structures:
Linked list
Dequeue(queue) - correct answer- Returns and
removes item at front of queue
CORRECT ANSWERS; A+ GRADE
Abstract Data Type (ADT) - correct answer- Data type
described by predefined user operations, without indicating how
each operation is implemented.
Array - correct answer- An array is a data structure
that stores an ordered list of items, where each item is directly
accessible by a positional index.
Bag - correct answer- A bag is an ADT for storing
items in which the order does not matter and duplicate items
are allowed.
Common underlying data structures:
Array, linked list
Binary tree - correct answer- 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.
, Binary tree - correct answer- Each node has up to
two children, known as a left child and a right child. "Binary"
means two, referring to the two children.
Chaining - correct answer- Chaining is a collision
resolution technique where each bucket has a list of items that
creates a chain (so bucket 5's list would become 55, 75)
Computational problem - correct answer- Specifies
an input, a question about the input that can be answered using
a computer, and the desired output.
Deque - correct answer- A deque (pronounced
"deck" and short for double-ended queue) is an ADT in which
items can be inserted and removed at both the front and back.
Common underlying data structures:
Linked list
Dequeue(queue) - correct answer- Returns and
removes item at front of queue
