WGU C949 EXAM GUIDE WITH GUARANTEED CORRECT ANSWERS
20 keer bekeken 0 keer verkocht
Vak
WGU C949
Instelling
WGU C949
Array - correct answer A data structure that stores an ordered list of items, with each item is directly accessible by a positional index.
Linked List - correct 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.
...
wgu c949 exam guide with guaranteed correct answer
Geschreven voor
WGU C949
WGU C949
Verkoper
Volgen
GRADEUNITS
Ontvangen beoordelingen
Voorbeeld van de inhoud
WGU C949 EXAM GUIDE WITH GUARANTEED CORRECT ANSWERS
Array - correct answer ✔✔A data structure that stores an ordered list of items, with each item is directly accessible by a positional index.
Linked List - correct 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 - correct 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 - correct answer ✔✔A data structure that stores unordered items by mapping (or hashing) each item to a location in an array (or vector).
Hashing - correct answer ✔✔mapping each item to a location in an array (in a hash table).
Chaining - correct answer ✔✔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 - correct answer ✔✔value used to map an index
bucket - correct answer ✔✔each array element in a hash table
ie A 100 elements hash table has 100 buckets
modulo hash function - correct answer ✔✔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 hash table searching - correct answer ✔✔Hash tables support fast search, insert, and remove.
Requires on average O(1)
Linear search requires O(N)
modulo operator % - correct answer ✔✔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 - correct answer ✔✔A binary tree that maintains the simple property that a node's key is greater than or equal to the node's childrens' keys. (Actually, a max-heap may be any tree, but is commonly a binary tree).
*a max-heap's root always has the maximum key in the entire tree.
Heap storage - correct answer ✔✔Heaps are typically stored using arrays. Given a tree representation of a heap, the heap's array form is produced by traversing the tree's levels from left to right and top to bottom. The root node is always the entry at index 0 in the array, the root's left child is the entry at index
1, the root's right child is the entry at index 2, and so on.
Max-heap insert - correct answer ✔✔An insert into a max-heap starts by inserting the node in the tree's last level, and then swapping the node with its parent until no max-heap property violation occurs.
The upward movement of a node in a max-heap is sometime called percolating.
Complexity O(logN)
Max-heap remove - correct answer ✔✔Always a removal of the root, and is done by replacing the root with the last level's last node, and swapping that node with its greatest child until no max-heap property violation occurs.
Complexity O(logN)
Percolating - correct answer ✔✔The upward movement of a node in a max-heap Min-Heap - correct answer ✔✔Similar to a max-heap, but a node's key is less than or equal to its children's keys.
Heap - Parent and child indices - correct answer ✔✔Because heaps are not implemented with node structures and parent/child pointers, traversing from a node to parent or child nodes requires referring to nodes by index. The table below shows parent and child index formulas for a heap.
ie
1) parent index for node at index 12? 5
*** ((12-1) // 2) = 5 or 12 //2 -1 = 5
2) child indices for a node at index 6? 13 & 14
*** 2 * 6 + 1 = 13 and 2 * 6 + 2 = 14
**Double# and add 1, double# and add 2
Node index Parent Index Child Indices
0 N/A 1, 2
1 0 3, 4
2 0 5, 6
3 1 7, 8
4 1 9, 10
5 2 11, 12
Heap - parent_index - correct answer ✔✔parent_index = (node_index - 1) // 2
or node_index // 2 - 1
Heap - left_child_index - correct answer ✔✔left_child_index = 2 * node_index + 1
Heap - right_child_index - correct answer ✔✔right_child_index = 2 * node_index + 2
Voordelen van het kopen van samenvattingen bij Stuvia op een rij:
Verzekerd van kwaliteit door reviews
Stuvia-klanten hebben meer dan 700.000 samenvattingen beoordeeld. Zo weet je zeker dat je de beste documenten koopt!
Snel en makkelijk kopen
Je betaalt supersnel en eenmalig met iDeal, creditcard of Stuvia-tegoed voor de samenvatting. Zonder lidmaatschap.
Focus op de essentie
Samenvattingen worden geschreven voor en door anderen. Daarom zijn de samenvattingen altijd betrouwbaar en actueel. Zo kom je snel tot de kern!
Veelgestelde vragen
Wat krijg ik als ik dit document koop?
Je krijgt een PDF, die direct beschikbaar is na je aankoop. Het gekochte document is altijd, overal en oneindig toegankelijk via je profiel.
Tevredenheidsgarantie: hoe werkt dat?
Onze tevredenheidsgarantie zorgt ervoor dat je altijd een studiedocument vindt dat goed bij je past. Je vult een formulier in en onze klantenservice regelt de rest.
Van wie koop ik deze samenvatting?
Stuvia is een marktplaats, je koop dit document dus niet van ons, maar van verkoper GRADEUNITS. Stuvia faciliteert de betaling aan de verkoper.
Zit ik meteen vast aan een abonnement?
Nee, je koopt alleen deze samenvatting voor €14,32. Je zit daarna nergens aan vast.
