WGU C949 DATA TYPES STUDY
GUIDE (DATA STRUCTURES &
ALGORITHMS 1) WITH COMPLETE
SOLUTIONS
Array - ANSWER-A data structure that stores an ordered list of items, with
each item is directly accessible by a positional index.
Linked List - ANSWER-A data structure that stores ordered list of items in
nodes, where each node stores data and has a pointer to the next node.
Bianary Search Tree - ANSWER-A data structure in which each node stores
data and has up to two children, known as a left child and a right child.
Hash Table - ANSWER-A data structure that stores unordered items by
mapping (or hashing) each item to a location in an array (or vector).
,Abstract Data Type (ADT) - ANSWER-A data type described by predefined
user operations, such as "insert data at rear," without indicating how each
operation is implemented.
List - ANSWER-An ADT for holding ordered data. Dups ok
Sequence type: A mutable container with ordered elements.
Underlying data structures: Array, linked list
Array in Java - ANSWER-generic class that supports different data types.
declared as follows, where T is the data type.
Queue - ANSWER-An ADT in which items are inserted at the end of the queue
and removed from the front of the queue.
*first-in first-out ADT.
Underlying data structures: Linked list, Array, Vector
, The Queue class' push() method uses the LinkedList append() method to
insert elements in a queue.
Both the Stack and Queue pop() methods operate exactly the same by
removing the head element and returning the removed element.
Linked List - ANSWER-A linear data structure, much like an array, that
consists of nodes, where each node contains data as well as a link to the
next node, but that does not use contiguous memory.
Head and tail node
The LinkedList class implements the list data structure and contains two data
members, head and tail, which are assigned to nodes once the list is
populated. Initially the list has no nodes, so both data members are initially
assigned with None.
If the node has no next node, the next data member is assigned with None,
the Python term signifying the absence of a value.
Tuple - ANSWER-Sequence type: An immutable container with ordered
elements.
GUIDE (DATA STRUCTURES &
ALGORITHMS 1) WITH COMPLETE
SOLUTIONS
Array - ANSWER-A data structure that stores an ordered list of items, with
each item is directly accessible by a positional index.
Linked List - ANSWER-A data structure that stores ordered list of items in
nodes, where each node stores data and has a pointer to the next node.
Bianary Search Tree - ANSWER-A data structure in which each node stores
data and has up to two children, known as a left child and a right child.
Hash Table - ANSWER-A data structure that stores unordered items by
mapping (or hashing) each item to a location in an array (or vector).
,Abstract Data Type (ADT) - ANSWER-A data type described by predefined
user operations, such as "insert data at rear," without indicating how each
operation is implemented.
List - ANSWER-An ADT for holding ordered data. Dups ok
Sequence type: A mutable container with ordered elements.
Underlying data structures: Array, linked list
Array in Java - ANSWER-generic class that supports different data types.
declared as follows, where T is the data type.
Queue - ANSWER-An ADT in which items are inserted at the end of the queue
and removed from the front of the queue.
*first-in first-out ADT.
Underlying data structures: Linked list, Array, Vector
, The Queue class' push() method uses the LinkedList append() method to
insert elements in a queue.
Both the Stack and Queue pop() methods operate exactly the same by
removing the head element and returning the removed element.
Linked List - ANSWER-A linear data structure, much like an array, that
consists of nodes, where each node contains data as well as a link to the
next node, but that does not use contiguous memory.
Head and tail node
The LinkedList class implements the list data structure and contains two data
members, head and tail, which are assigned to nodes once the list is
populated. Initially the list has no nodes, so both data members are initially
assigned with None.
If the node has no next node, the next data member is assigned with None,
the Python term signifying the absence of a value.
Tuple - ANSWER-Sequence type: An immutable container with ordered
elements.
