100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
C949 WGU Containing 122 Terms & Definitions 2024. $20.99
Add to cart

Exam (elaborations)

C949 WGU Containing 122 Terms & Definitions 2024.

1 review
 5 purchases
  • Course
  • C949 WGU Containing 122 Terms & Definitions 2024.
  • Institution
  • C949 WGU Containing 122 Terms & Definitions 2024.

C949 WGU Containing 122 Terms & Definitions 2024. Q & A Record - Answer: Data structure that stores subitems, often called fields, with a name associated with each subitem.

Preview 3 out of 22  pages

  • January 2, 2024
  • 22
  • 2023/2024
  • Exam (elaborations)
  • Questions & answers
  • C949 WGU Containing 122 Terms & Definitions 2024.
  • C949 WGU Containing 122 Terms & Definitions 2024.

1  review

review-writer-avatar

By: Benzo • 2 days ago

avatar-seller
docmickey
C949 WGU Terms




C949 WGU Containing 122 Terms &
Definitions 2024.
Record - Answer: Data structure that stores subitems, often called fields, with a
name associated with each subitem.


Array - Answer: A data structure that stores an ordered list of items, with each
item is directly accessible by a positional index.


homogeneous data elements


linked list - Answer: Data structure that stores *ordered* list of items in nodes,
where each node stores data and has a pointer to the next node; can have
multiple subitems.

, C949 WGU Terms


Binary tree - Answer: A data structure that consists of nodes, with one root node
at the base of the tree, and two nodes (left child and right child) extending from
the root, and from each child node.


Each node can have only 0, 1 or 2 leaf nodes. All left nodes and all of its
descendants have smaller values that the root node, while all right nodes and all
of its descendants have larger values than the root node.


Hash table - Answer: Data structure that stores *unordered* items by mapping
each item to a location in an array.


max-heap - Answer: A tree that maintains the simple property that a node's key is
greater than or equal to the node's children's keys.


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


graph - Answer: data structure for representing connections among items, and
consists of vertices connected by edges.


vertice - Answer: part of a graph the represents an item in a graph.


edge - Answer: Part of a graph that represents a connection between to vertices
in a graph. (Line between nodes)

, C949 WGU Terms


what is an advantage of a linked list over an array? - Answer: When inserting a
new item at the beginning, the data does not shift.


ADT (Abstract data Type) - Answer: data type described by predefined user
operations, such as "insert data at rear", without indication how each operation is
implemented


list - Answer: ADT for holding ordered data.
Common data structures: array, linked list


stack - Answer: ADT in which items are only inserted or removed from the top.
Common data structures: linked list
LIFO


Queue - Answer: ADT in which items are inserted at the end and removed from
the front.
Common data structures: linked list
FIFO


Deque ("deck") - Answer: ADT in which items can be removed at both the front
and back.
Common data structures: linked list


Bag - Answer: ADT for storing items in which the order does not matter and
duplicate items are allowed.

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

Will I be stuck with a subscription?

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

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

69252 documents were sold in the last 30 days

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

Start selling
$20.99  5x  sold
  • (1)
Add to cart
Added