C949 WGU Terminology- Questions and Answers 100%
Solved
what is an advantage of a linked list over an array? CORRECT ANS-when inserting a new
item at the beginning it causes no shift to the data
ADT (Abstract data Type) CORRECT ANS-data type described by predefined user
operations, such as "insert data at rear", without indication how each operation is
implemented
list CORRECT ANS-ADT for holding ordered data
stack CORRECT ANS-ADT which items are only inserted on or removed from the top of a
stack
LIFO
Queue CORRECT ANS-ADT in which items are inserted at the end of the queue and
removed from the front of the queue
FIFO
deque ("deck") CORRECT ANS-ADT in which items can be removed at both the front and
back
Bag CORRECT ANS-ADT for stroing items in which the order does not matter and duplicate
items are allowed
Set CORRECT ANS-ADT for collection of distinct items
, C949 WGU Terminology- Questions and Answers 100%
Solved
common underlying DS: Binary search tree, hash table
Priority Queue CORRECT ANS-a queue in which the highest-priority elements are removed
first; within a priority value, the earliest arrival is removed first.
common underlying DS: heap
Dictionary (map) CORRECT ANS-ADT that associates (or maps) keys with values
common underlying DS: has table, binary search tree
List, Bag CORRECT ANS-ADTs with array, linked list as common underlying DS
Stack, Queue, Deque CORRECT ANS-ADTs with linked list as their only common underlying
DS
Peek CORRECT ANS-ADT operation for a queue that returns but does not remove item at
the front of the queue
identity CORRECT ANS-unique identifier that describes the object
// CORRECT ANS-symbol for floored division
tuple CORRECT ANS-behaves similar to a list but is immutable -- once created the els can
not be chagned
const array/list
Solved
what is an advantage of a linked list over an array? CORRECT ANS-when inserting a new
item at the beginning it causes no shift to the data
ADT (Abstract data Type) CORRECT ANS-data type described by predefined user
operations, such as "insert data at rear", without indication how each operation is
implemented
list CORRECT ANS-ADT for holding ordered data
stack CORRECT ANS-ADT which items are only inserted on or removed from the top of a
stack
LIFO
Queue CORRECT ANS-ADT in which items are inserted at the end of the queue and
removed from the front of the queue
FIFO
deque ("deck") CORRECT ANS-ADT in which items can be removed at both the front and
back
Bag CORRECT ANS-ADT for stroing items in which the order does not matter and duplicate
items are allowed
Set CORRECT ANS-ADT for collection of distinct items
, C949 WGU Terminology- Questions and Answers 100%
Solved
common underlying DS: Binary search tree, hash table
Priority Queue CORRECT ANS-a queue in which the highest-priority elements are removed
first; within a priority value, the earliest arrival is removed first.
common underlying DS: heap
Dictionary (map) CORRECT ANS-ADT that associates (or maps) keys with values
common underlying DS: has table, binary search tree
List, Bag CORRECT ANS-ADTs with array, linked list as common underlying DS
Stack, Queue, Deque CORRECT ANS-ADTs with linked list as their only common underlying
DS
Peek CORRECT ANS-ADT operation for a queue that returns but does not remove item at
the front of the queue
identity CORRECT ANS-unique identifier that describes the object
// CORRECT ANS-symbol for floored division
tuple CORRECT ANS-behaves similar to a list but is immutable -- once created the els can
not be chagned
const array/list
