100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
WGU - C949 - Study Sets Questions with Solutions $13.49   Add to cart

Exam (elaborations)

WGU - C949 - Study Sets Questions with Solutions

 3 views  0 purchase
  • Course
  • WGU C949
  • Institution
  • WGU C949

WGU - C949 - Study Sets

Preview 2 out of 9  pages

  • August 10, 2024
  • 9
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers
  • WGU C949
  • WGU C949
avatar-seller
Dreamer252
WGU - C949 - Study Sets

An ADT for holding ordered data.

Common underlying data structures:
Array, linked list - answer List

An ADT in which items are only inserted on or removed from the top of a stack.

Common underlying data structures:
Linked list - answerStack

An ADT in which items are inserted at the end of the queue and removed from the front
of the queue.

Common underlying data structures:
Linked list - answerQueue

An ADT in which items can be inserted and removed at both the front and back.

Common underlying data structures:
Linked list - answerDeque

An ADT for storing items in which the order does not matter and duplicate items are
allowed.

Common underlying data structures:
Array, linked list - answerBag

An ADT for a collection of distinct items.

Common underlying data structures:
Binary search tree, hash table - answerSet

A queue where each item has a priority, and items with a higher priority are closer to the
front of the queue than items with a lower priority.

Common underlying data structures:
Heap - answerPriority queue

An ADT that associates (or maps) keys with values.

, Common underlying data structures:
Hash table, binary search tree - answerDictionary (Map)

Data structure that stores subitems, often called fields, with a name associated with
each subitem. - answerRecord

Data structure that stores an ordered list of items, where each item is directly accessible
by a positional index. - answerArray

Data structure that structure that stores an ordered list of items in nodes, where each
node stores data and has a pointer to the next node. - answerLinked list

Data structure in which each node stores data and has up to two children, known as a
left child and a right child. - answerBinary tree

Data structure that stores unordered items by mapping(or hashing) each item to a
location in an array. - answerHash table

A tree that maintains the sumple property that node's key is greater than or equal to the
node's childrens keys. - answerMax-heap

A tree that maintains the simple property that a node's key is less than or equal to the
node's children's keys. - answerMin-heap

Data structure for representing connections among items, and consists of vertices
connected by edges. - answerGraph

Represents an item in a graph. - answerVertex

Rerpresents a connection between two vertices in a graph. - answerEdge

Abstract Data Type:

Add: adds an item
Remove: removes an item
Get: Retrieves an item from the list - answerList

A data type is described by predefined user operations, such as "insert data at rear,"
without indication of how each operation is implemented. - answerAbstract Data Type

A data structure for implementing a list ADT, where each node has data and a pointer to
the next node. - answerSingly-linked list

Singly-linked list's first node. - answerHead

Singly-linked list's last node. - answerTail

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

Will I be stuck with a subscription?

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

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

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