Solutions to Homework One
1. Exercise 0.1. (a) ; (b) O; (c) ; (d) ; (l) O; (m) O; (n) ; (o) ; (p) O. 2. Exercise 0.3.
CSE 101
(a) Base cases n = 6 and n = 7 are easy to check individually. Now assume the statement holds upto some value of n greater than 6
Solutions to Homework Three
3.24. Given: a directed acyclic graph G = (V, E)
CSE 101
Topologically sort G (Gives an ordering v1 , v2 , . . . , vn of the nodes V , where n = |V |) For i = 1 to n 1: if (vi , vi+1 ) E: output no Output yes A path touching al
CSE 101 Homework 1
Spring 2016
Question 1 (Airport placement, 35 points). The nation of Graphia, has a number of cities, some pairs of
which are connected by roads (all of which are two-way). Unfortunately, due to various hazardous terrain,
not all cities