CSC 2259 : Sample Final
Document Summary
Instructions: for combinatorial problems, please write the answer in (cid:0)n k(cid:1) or n! format. Name: (5) find the coe cient of x7 in the expansion of (cid:0)(1 x)(1 + x2)(cid:1)100. Note that a group can have no people in it. 3: (5) how many memory locations are needed to store all bit strings of length 8, (5)a deck of 52 cards is cut in half (26 cards each). If not, change one edge distance to make it satisfy the triangle inequality and write the edge and its new weight below. 5 (vi) assume the above graph (after your modi cation) is a complete graph. The distances on the edges not explicitly shown are all 10 units. What is the minimum number of edges you must add to the graph to make it an eulerian graph (having an. Is this number even, odd or cannot be determined.
