COMPSCI 311 Midterm: CMPSCI 311 UMass Amherst mt1_Solutions utions
31 Jan 2019
School
Department
Course
Professor
Document Summary
Instructions: answer the questions directly on the exam pages, show all your work for each question. Providing more detail including comments and expla- nations can help with assignment of partial credit: if you need extra space, use the back of a page, no books, notes, calculators or other electronic devices are allowed. Any cheating will result in a grade of 0: if you have questions during the exam, raise your hand. Indicate whether each of the following statements is true or. A tree is a connected graph, but a tree on n vertices has n 1 edges. If g is a connected graph on n vertices, then it must have at least n edges. Pn i=1 pn i=1 pn j=1 ij = (n3). j=1 ij = pn i=1 i pn j=1 j = (pn i=1 i)2 = (n(n + 1)/2)2 = (n4).
