WGU C949 STUDY GUIDE LATEST UPDATE WITH CERTIFIED SOLUTIONS

WGU C949 STUDY GUIDE LATEST UPDATE WITH CERTIFIED SOLUTIONS Array A data structure that stores an ordered list of items, with 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. Bianary 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 ie 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. 50 / 10 = 5 hash table searching Hash tables support fast search, insert, and remove. Requires on average O(1) Linear search requires O(N) modulo operator % common has function uses this. which computes the integer remainder when dividing two numbers. Ex: For a 20 element hash table, a hash function of key % 20 will map keys to bucket indices 0 to 19. Max-Heap A binary tree that maintains the simple