MAD 3305 Midterm: MAD 3305 FIU Exam 1k
Document Summary
You should also have a separate sheet of paper showing some graphs you will need. [i may post this separately on my exam page if time permits] the exam should take about one hour, to be followed by a lecture. Most of the problems are worth 15 points each: apply the graphical sequence alg to show that the sequence 4, 4, 3, 3, 2, 2 is graphical, and nd a graph g that ts it. Your work should be well-organized, to show each step clearly. This will a ect your grade as much as your nal graph g: prove: if g is a nontrivial graph, then it has two vertices which are not cut-vertices, answer each with true or false: The breadth rst search algorithm (bfsa) is o(|v |). If g has no cycles and |e| = |v | 1, then g is a tree. Every nontrivial tree has at least two leaves.
