100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
WGU C949 STUDY GUIDE WITH COMPLETE SOLUTIONS $14.99   Add to cart
Quickly navigate to
Preview
  2.  
  3. WGU C949
  4.  
  5. WGU C949

Exam (elaborations)

WGU C949 STUDY GUIDE WITH COMPLETE SOLUTIONS
 7 views  0 purchase
  • Course
  • WGU C949
  • Institution
  • WGU C949

WGU C949 STUDY GUIDE WITH COMPLETE SOLUTIONSWGU C949 STUDY GUIDE WITH COMPLETE SOLUTIONSWGU C949 STUDY GUIDE WITH COMPLETE SOLUTIONSWGU C949 STUDY GUIDE WITH COMPLETE SOLUTIONS Array - ANSWER-A data structure that stores an ordered list of items, with each item is directly accessible by a position...

[Show more]

Preview 4 out of 31  pages

Document information

  • October 9, 2024
  • 31
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers

Subjects

  • wgu c949 study guide with complete solutions
  • wgu c949 study guide stuvia
  • array answer a data structure that stores an ord

Written for

  • WGU C949
  • WGU C949

Seller

avatar-seller
NursingTutor1

Reviews received

Content preview

WGU C949 STUDY GUIDE 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).




Hashing - ANSWER-mapping each item to a location in an array (in a hash

table).

,Max-Heap - 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 - 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.




Chaining - 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 - ANSWER-value used to map an index




bu

,Max-Heap - 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 - 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.

cket - ANSWER-each array element in a hash table

ie A 100 elements hash table has 100 buckets




modulo hash function - 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 - ANSWER-Hash tables support fast search, insert, and

remove.

Requires on average O(1)




Linear search requires O(N)




Heap - parent_index - ANSWER-parent_index = (node_index - 1) // 2

or node_index // 2 - 1




Heap - left_child_index - ANSWER-left_child_index = 2 * node_index + 1




Heap - right_child_index - ANSWER-right_child_index = 2 * node_index + 2




modulo operator % - 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.

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller NursingTutor1. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $14.99. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

81298 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling

Recently viewed by you

Package deal ·

(0)

Dental Hygiene Local Anesthesia
$14.99
  • (0)
  Add to cart