Exam (elaborations)
WGU C949 - Data Structures and Algorithms Questions with Solutions
- Course
- Institution
WGU C949 - Data Structures and Algorithms
[Show more]
Content preview
WGU C949 - Data Structures andAlgorithms
Algorithm - answerDescribes a sequence of steps to solve a computational problem or
perform a calculation.
Computational Problem - answerSpecifies an input, a question about the input that can
be answered using a computer, and the desired output.
Longest Common Substring - answerAn algorithm that determines the longest common
substring that exists in two inputs strings.
Binary Search - answerAn efficient algorithm for searching a list. The list's elements
must be sorted and directly accessible (such as an array).
Dijkstra's Shortest Path - answerAn algorithm that determines the shortest path from a
start vertex to each vertex in a graph.
NP-Complete - answerA set of problems for which no known efficient algorithm exists.
Polynomial time algorithm - answerAn algorithm whose execution time grows as a
polynomial of input size. An efficient algorithm is one whose runtime increases no more
than polynomially with respect to the input size.
Data structure - answerA way of organizing, storing, and performing operations on data.
Operations include accessing or updating stored data, searching for specific data,
inserting new data, and removing data.
Record - answerA data structure that stores subitems, with a name associated with
each subitem.
Array - answerA data structure that stores subitems, with a name associated with each
subitem. May only store homogeneous data elements.
Linked list - answerA data structure that stores ordered list of items in nodes, where
each node stores data and has a pointer to the next node.
Binary tree - answerA 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 - answerA data structure that stores unordered items by mapping (or
hashing) each item to a location in an array.
Tree - answerA non-linear data structure that organizes data in a hierarchical way.
Heap - answerA complete binary tree-based data structure.
Max-heap - answerA tree that maintains the simple property that a node's key is greater
than or equal to the node's childrens' keys.
Min-heap - answerA tree that maintains the simple property that a node's key is less
than or equal to the node's childrens' keys.
Graph - answerA data structure for representing connections among items, and consists
of vertices connected by edges.
Vertex - answerRepresents an item in a graph.
Edge - answerRepresents a connection between two vertices in a graph.
Abstract Data Type (ADT) - answerA data type described by predefined user
operations, such as "insert data at rear," without indicating how each operation is
implemented.
List - answerAn ADT for holding ordered data. Duplicate items are allowed.
Stack - answerAn ADT in which items are only inserted on or removed from the top.
Queue - answerAn ADT in which items are inserted at the end and removed from the
front. referred to as a first-in first-out ADT.
Deque - answerAn ADT in which items can be inserted and removed at both the front
and back.
Bag - answerAn ADT for storing items in which the order does not matter and duplicate
items are allowed.
Set - answerAn ADT for a collection of distinct items.
Priority Queue - answerA queue where each item has a priority, and items with higher
priority are closer to the front of the queue than items with lower priority. Duplicates
items are allowed.
Dictionary - answerAn ADT that associates (or maps) keys with values. Can be used to
describe associative relationships in Python.
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 Dreamer252. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $17.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
