CSE331 HW3 - CSE 331 Introduction to Algorithm Analysis and...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE 331: Introduction to Algorithm Analysis and Design Fall 2011 Homework 3 Due Friday, September 30, 2011 by 1:15pm in class IMPORTANT: Please submit each problem separately, i.e. each problem should begin on a new page and only the pages for one problem should be stapled together. Failure to do so might result in some problem(s) not being graded. For general homework policies and our suggestions, please see the policy document. For this homework, you can assume that addition, subtraction, multiplication and division of two numbers can be done in O (1) time. (Side question: Is this assumption justified?) No collaboration is allowed on the first problem. 1. (40 points ) ( You must work on this problem on your own: NO collaboration is allowed ) A forest with c components is a graph that is the union of c disjoint trees. Note that a tree is a forest with 1 component. Prove that an n -vertex forest with c components has n - c edges. (Recall that we have proved the statement above for
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.

Page1 / 2

CSE331 HW3 - CSE 331 Introduction to Algorithm Analysis and...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online