Exam (elaborations)
C949 WGU Terminology- Questions and Answers 100% Solved
- Course
- Institution
C949 WGU Terminology- Questions and Answers 100% Solved
[Show more]
Content preview
C949 WGU Terminology- Questions and Answers 100%Solved
min-heap CORRECT ANS-a tree that maintains the simple property that a node's key is less
than or equal to the node's childrens' keys
graph CORRECT ANS-data structure for representing connections among items, and
consists of vertices connected by edges
vertice CORRECT ANS-part of a graph the represents an item in a graph
edge CORRECT ANS-part of a graph that represents a connection between to vertices in a
graph
what is an advantage of a linked list over an array? CORRECT ANS-when inserting a new
item at the beginning it causes no shift to the data
ADT (Abstract data Type) CORRECT ANS-data type described by predefined user
operations, such as "insert data at rear", without indication how each operation is
implemented
list CORRECT ANS-ADT for holding ordered data
record CORRECT ANS-data structure that stores subitems, with a name associated with
each subitem
array CORRECT ANS-a data structure that stores an ordered list of items, with each item is
directly accessible by a positional index
homogeneous data elements
, C949 WGU Terminology- Questions and Answers 100%
Solved
linked list CORRECT ANS-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
binary tree CORRECT ANS-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
can have no children, single left or right, or both right and left
hash table CORRECT ANS-data structure that stores *unordered* items by mapping (or
hashing) each item to a location in an array
max-heap CORRECT ANS-a tree that maintains the simple property that a node's key is
greater than or equal to the node's childrens' keys
stack CORRECT ANS-ADT which items are only inserted on or removed from the top of a
stack
LIFO
Queue CORRECT ANS-ADT in which items are inserted at the end of the queue and
removed from the front of the queue
FIFO
deque ("deck") CORRECT ANS-ADT in which items can be removed at both the front and
back
The benefits of buying summaries with Stuvia:
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
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
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 TheeGrades. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $11.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
79373 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now