1. Give a definition of Graph and show examples of a directed and an undirected graphs in

roster set notation.

1. Give definition of Degree of a Node for directed and undirected graph. What is Total Degree

of a Graph?

1. What is the difference between Walk, Trail, and Path of a graph?
2. What is the difference between Circuit and Cycle of a graph?
3. Give a definition of a Complete graph and a Clique.
4. What are 2 main representations a graph in code? Represent the following graph using

those notations:

1. Give a definition of Graph Embedding, Planar Embedding. Is the following graph a planar

graph?

G={V,E} V={a,b,c,d} E={{a,b},{b,c},{c,d},{a,d},{a,c},{d,b}}

1. Show how BFS and DFS will work on the following directed graph and the order in which

nodes will be discovered starting with Node A. G=(V,E); V={A,B,C,D,F}; E={(A,B), (A,C),

(A,D), (C,D), (B,F),(D,F)}

1. What are 2 main differences between Free Tree and Rooted Tree?
2. What is the height of a tree with 65 nodes, N nodes?
3. What are types of recursive tree traversals?
4. Give a pseudo-code algorithm for printing node keys in ascending order using one of the

Sample Solution