100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
WGU C949 Problem set Exam Questions with all answers Correctly provided Latest 2024/2025 $11.49   Add to cart

Exam (elaborations)

WGU C949 Problem set Exam Questions with all answers Correctly provided Latest 2024/2025

 1 view  0 purchase
  • Course
  • WGU C949 Data Structure and Algorithm
  • Institution
  • WGU C949 Data Structure And Algorithm

WGU C949 Problem set Exam Questions with all answers Correctly provided Latest 2024/2025 Deque - correct answer double ended queue where elements can be added or removed at either end Bag - correct answer adt where the order doesn't matter and duplicate items are allowed. (underlying ds: arra...

[Show more]

Preview 3 out of 24  pages

  • November 12, 2024
  • 24
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers
  • WGU C949 Data Structure and Algorithm
  • WGU C949 Data Structure and Algorithm
avatar-seller
KieranKent55
WGU C949 Problem set Exam Questions with
all answers Correctly provided Latest
2024/2025

Deque - correct answer double ended queue where elements
can be added or removed at either end


Bag - correct answer adt where the order doesn't matter and
duplicate items are allowed. (underlying ds: array, linked list)


Set - correct answer adt for a collection of distinct items
(binary search tree, hash table)


Priority queue - correct answer queue where highest priority
elements are removed first. (underlying ds: heap)


Dictionary (map) - correct answer adt that associates keys
with values. (underlying ds: hash table, binary search tree)


Garbage collection in python - correct answer reference
count is an integer that represents how many variables reference
an object. When an object reference count == 0, the object is
sent to ________.


Garbage collection - correct answer it reclaims memory from
data structures implemented using linked allocations.

,Takes a value out of a dictionary - correct answer
my_dict[key].remove(value)


Preorder traversal - correct answer root, left, right (from top
to bottom) - for copying a tree


Postorder traversal - correct answer left, right, root (from
bottom to top) - for deleting a tree


Inorder traversal - correct answer left, root, right (smallest to
largest value)


Any(my_dictionary) - correct answer returns true if any key of
the dictionary is true (in python)


10 buckets - correct answer how many buckets are needed
for radix sort?


Binary search - correct answer o(logn) . Checks the middle
value, then recursively checks the lower or upper half to find the
value. (searching through a phone book)


Reads bytes from a standard file in java - correct answer
java.io.fileinputstream


Bubble sort big o - correct answer o(n^2)

, Array - correct answer a data structure that stores an
ordered list of items, 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.


Binary 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
(a 100 elements hash table has 100 buckets)

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 KieranKent55. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

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

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

78252 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
$11.49
  • (0)
  Add to cart