WGU C949 Data Structure and Algorithm Prerequisite pretest Exam training Questions with Rated A + Marking Scheme Latest 2024/2025
4 views 0 purchase
Module
WGU C949 Data Structure and Algorithm
Institution
WGU C949 Data Structure And Algorithm
WGU C949 Data Structure and Algorithm Prerequisite pretest Exam training Questions with Rated A + Marking Scheme Latest 2024/2025
Vertex - correct answer a node that represents an item in a graph.
Edge - correct answer a line that represents a connection between two vertices in a graph.
Ad...
WGU C949 Data Structure and Algorithm
Prerequisite pretest Exam training Questions
with Rated A + Marking Scheme Latest
2024/2025
Vertex - correct answer a node that represents an item in a
graph.
Edge - correct answer a line that represents a connection
between two vertices in a graph.
Adjacent (general) - correct answer two vertices are this if
connected by an edge.
Path (general) - correct answer a sequence of edges leading
from a source (starting) vertex to a destination (ending) vertex.
Path length (general) - correct answer the number of edges in
the path.
Distance - correct answer the number of edges on the
shortest path between two vertices, typically from the start
vertex to the current (end) vertex.
Adjacency list - correct answer in this graph representation,
each vertex has a list of adjacent vertices, each list item
representing an edge.
,Sparse graph - correct answer a graph that has far fewer
edges than the maximum possible.
Adjacency matrix - correct answer in this graph
representation, each vertex is assigned to a matrix row and
column, and a matrix element is 1 if the corresponding two
vertices have an edge or is 0 otherwise.
Graph traversal - correct answer when an algorithm visits
every vertex in a graph in some order.
Breadth-first search (bfs) - correct answer a graph traversal
that visits a starting vertex, then all vertices of distance 1 from
that vertex, then of distance 2, and so on, without revisiting a
vertex.
Discovered - correct answer when the bfs algorithm first
encounters a vertex, that vertex is said to have been this.
Frontier - correct answer in the bfs algorithm, the vertices in
the queue are called this, being vertices thus far discovered but
not yet visited.
Depth-first search (dfs) - correct answer a graph traversal
that visits a starting vertex, then visits every vertex along each
path starting from that vertex to the path's end before
backtracking.
, Directed graph (digraph) - correct answer a type of graph
that consists of vertices connected by directed edges.
Directed edge - correct answer a type of edge that creates a
one-way connection between a starting vertex and a terminating
vertex.
Adjacent (directed graph) - correct answer in a directed
graph, a vertex y is this to a vertex x, if there is an edge from x to
y.
Path (directed graph) - correct answer a sequence of directed
edges leading from a source (starting) vertex to a destination
(ending) vertex.
Cycle - correct answer a path that starts and ends at the
same vertex.
Cyclic / acyclic - correct answer first term: a directed graph
is this if the graph contains a cycle.
Second term: a directed graph is this if the graph does not
contain a cycle.
Weight - correct answer a graph edge's cost, which
represents some numerical value between vertex items, such as
flight cost between airports, connection speed between
computers, or travel time between cities.
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 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 KieranKent55. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for £9.36. You're not tied to anything after your purchase.
