WGU C949 STUDY GUIDE MOST
IMPORTANT QUIZ QUESTIONS AND
ANSWERS DATA STRUCTURES AND
ALGORITHMS EXAM PREP PRACTICE TEST
| GRADED A+ | GUARANTEED SUCCESS
UPDATED QUESTIONS AND ANSWERS
100% VERIFIED EXAM PREP
[EXAM• STUDY GUIDE • SUMMARY • ASSIGNMENT]
A clean, organized resource designed for easy revision and reference.
QUICK • CLEAR • PROFESSIONAL
, Array A data structure that stores an ordered list of items, each item is directly accessible by a
positional index.
Linked List A data structure that stores ordered list of items in nodes, where each node stores data
and has a pointer to the next node.
Binary Search Tree 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 A data structure that stores unordered items by mapping (or hashing) each item to a
location in an array (or vector).
Hashing mapping each item to a location in an array (in a hash table).
Chaining handles hash table collisions by using a list for each bucket, where each list may store
multiple items that map to the same bucket.
Hash key value used to map an index
bucket Each array element in a hash table
(A 100 elements hash table has 100 buckets)
modulo hash function Computes a bucket index from the items key.
It will map (num_keys / num_buckets) keys to each bucket.
ie... keys range 0 to 49 will have 5 keys per bucket.
= 5
IMPORTANT QUIZ QUESTIONS AND
ANSWERS DATA STRUCTURES AND
ALGORITHMS EXAM PREP PRACTICE TEST
| GRADED A+ | GUARANTEED SUCCESS
UPDATED QUESTIONS AND ANSWERS
100% VERIFIED EXAM PREP
[EXAM• STUDY GUIDE • SUMMARY • ASSIGNMENT]
A clean, organized resource designed for easy revision and reference.
QUICK • CLEAR • PROFESSIONAL
, Array A data structure that stores an ordered list of items, each item is directly accessible by a
positional index.
Linked List A data structure that stores ordered list of items in nodes, where each node stores data
and has a pointer to the next node.
Binary Search Tree 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 A data structure that stores unordered items by mapping (or hashing) each item to a
location in an array (or vector).
Hashing mapping each item to a location in an array (in a hash table).
Chaining handles hash table collisions by using a list for each bucket, where each list may store
multiple items that map to the same bucket.
Hash key value used to map an index
bucket Each array element in a hash table
(A 100 elements hash table has 100 buckets)
modulo hash function Computes a bucket index from the items key.
It will map (num_keys / num_buckets) keys to each bucket.
ie... keys range 0 to 49 will have 5 keys per bucket.
= 5
