WGU C918 CERTIFICATION EVALUATION
COMPLETE QUESTIONS WITH ACCURATE
ANSWERS
●● array
Answer: a data structure that stores an ordered list of items, with each
item is directly accessible by a positional index
homogeneous data elements
●● linked list
Answer: data structure that stores *ordered* list of items in nodes, where
each node stores data and has a pointer to the next node; can have
multiple subitems
●● binary tree
Answer: A data structure that consists of nodes, with one root node at the
base of the tree, and two nodes (left child and right child) extending
from the root, and from each child node
can have no children, single left or right, or both right and left
●● hash table
,Answer: data structure that stores *unordered* items by mapping (or
hashing) each item to a location in an array
●● max-heap
Answer: a tree that maintains the simple property that a node's key is
greater than or equal to the node's childrens' keys
●● min-heap
Answer: a tree that maintains the simple property that a node's key is
less than or equal to the node's childrens' keys
●● graph
Answer: data structure for representing connections among items, and
consists of vertices connected by edges
●● vertice
Answer: part of a graph the represents an item in a graph
●● edge
Answer: part of a graph that represents a connection between to vertices
in a graph
●● what is an advantage of a linked list over an array?
, Answer: when inserting a new item at the beginning it causes no shift to
the data
●● ADT (Abstract data Type)
Answer: data type described by predefined user operations, such as
"insert data at rear", without indication how each operation is
implemented
●● list
Answer: ADT for holding ordered data
●● stack
Answer: ADT which items are only inserted on or removed from the top
of a stack
LIFO
●● Queue
Answer: ADT in which items are inserted at the end of the queue and
removed from the front of the queue
FIFO
COMPLETE QUESTIONS WITH ACCURATE
ANSWERS
●● array
Answer: a data structure that stores an ordered list of items, with each
item is directly accessible by a positional index
homogeneous data elements
●● linked list
Answer: data structure that stores *ordered* list of items in nodes, where
each node stores data and has a pointer to the next node; can have
multiple subitems
●● binary tree
Answer: A data structure that consists of nodes, with one root node at the
base of the tree, and two nodes (left child and right child) extending
from the root, and from each child node
can have no children, single left or right, or both right and left
●● hash table
,Answer: data structure that stores *unordered* items by mapping (or
hashing) each item to a location in an array
●● max-heap
Answer: a tree that maintains the simple property that a node's key is
greater than or equal to the node's childrens' keys
●● min-heap
Answer: a tree that maintains the simple property that a node's key is
less than or equal to the node's childrens' keys
●● graph
Answer: data structure for representing connections among items, and
consists of vertices connected by edges
●● vertice
Answer: part of a graph the represents an item in a graph
●● edge
Answer: part of a graph that represents a connection between to vertices
in a graph
●● what is an advantage of a linked list over an array?
, Answer: when inserting a new item at the beginning it causes no shift to
the data
●● ADT (Abstract data Type)
Answer: data type described by predefined user operations, such as
"insert data at rear", without indication how each operation is
implemented
●● list
Answer: ADT for holding ordered data
●● stack
Answer: ADT which items are only inserted on or removed from the top
of a stack
LIFO
●● Queue
Answer: ADT in which items are inserted at the end of the queue and
removed from the front of the queue
FIFO
