CS502 Solved Quiz 3 by Iqra Azhar

1. A _____________ w is adjacent to vertex v if there is an edge from v to w. o a) Cycle o b) Acyclic o c) Loop o d) Vertex Correct

2. Brute-force is a simple strategy for computing

o a) Easiest path o b) Shortest path Correct o c) Longest path o d) Complete path

3. In an undirected graph, we say that an edge is _______________ on a vertex if the vertex is an endpoint of the edge.
4. Graphs can be represented by an _________ and____________. o a) Queue, Stack o b) Adjacency list, adjacency Matrix Correct o c) Binary, Linear o d) Adjacency Right, adjacency Left

7. For graph traversal, Breadth-first search strategy

o a) Can be both recursive and non-recursive Correct o b) Cannot be recursive o c) Cannot be non-recursive o d) Is always recursive

8. In a digraph, the number of edges coming in of a vertex is called the __________ of that vertex. o a) Complete degree o b) Out-degree o c) Node o d) In-degree Correct
9. __________________ data structure is used to perform the Breadth-first search. o a) Stack o b) Array o c) Queue Correct o d) Tree

10. In a digraph, the number of edges coming out of a vertex is called the ________ of that vertex. o a) In-degree o b) Complete degree o c) Node o d) Out-degree Correct