Midterm Practice Problems

Advertisement


Advertisement
Similar documents
Basic Notions on Graphs. Planar Graphs and Vertex Colourings. Joe Ryan. Presented by

Discrete Mathematics Problems

Planarity Planarity

V. Adamchik 1. Graph Theory. Victor Adamchik. Fall of 2005

Notes for Recitation 5

Analysis of Algorithms, I

Combinatorics: The Fine Art of Counting

Homework 15 Solutions

Lecture 16 : Relations and Functions DRAFT

Graph Theory. Introduction. Distance in Graphs. Trees. Isabela Drămnesc UVT. Computer Science Department, West University of Timişoara, Romania

Graph Theory Problems and Solutions

Principle of (Weak) Mathematical Induction. P(1) ( n 1)(P(n) P(n + 1)) ( n 1)(P(n))

THE 0/1-BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER

Sample Problems in Discrete Mathematics

Induction Problems. Tom Davis November 7, 2005

The Pigeonhole Principle

Planar Tree Transformation: Results and Counterexample

Chapter 6: Colouring Graphs

(Vertex) Colorings. We can properly color W 6 with. colors and no fewer. Of interest: What is the fewest colors necessary to properly color G?

Simple Graphs Degrees, Isomorphism, Paths

MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

10. Graph Matrices Incidence Matrix

COLORED GRAPHS AND THEIR PROPERTIES

The positive minimum degree game on sparse graphs

2.3 Scheduling jobs on identical parallel machines

Lecture 3. Mathematical Induction

Solutions to Exercises 8

6.852: Distributed Algorithms Fall, Class 2

Mathematical Induction

Lecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002

Partitioning edge-coloured complete graphs into monochromatic cycles and paths

Math 443/543 Graph Theory Notes 4: Connector Problems

Graphs without proper subgraphs of minimum degree 3 and short cycles

Relations Graphical View

Class One: Degree Sequences

Lecture 17 : Equivalence and Order Relations DRAFT

DO NOT RE-DISTRIBUTE THIS SOLUTION FILE

Notes on Matrix Multiplication and the Transitive Closure

CSE 20: Discrete Mathematics for Computer Science. Prof. Miles Jones. Today s Topics: Graphs. The Internet graph

Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College

Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS

Introduction to Graph Theory

UNIVERSITETET I BERGEN Det matematisk-naturvitenskapelige fakultet. Obligatorisk underveisvurdering 2 i MNF130, vår 2010

Spring 2007 Math 510 Hints for practice problems

Chapter 4: Trees. 2. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:

Divisor graphs have arbitrary order and size

CSL851: Algorithmic Graph Theory Semester I Lecture 1: July 24

Labeling outerplanar graphs with maximum degree three

p 2 1 (mod 6) Adding 2 to both sides gives p (mod 6)

MIX-DECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3. University of Split, Croatia

WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology

1 Plane and Planar Graphs. Definition 1 A graph G(V,E) is called plane if

Planar Graph and Trees

vertex, 369 disjoint pairwise, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

Long questions answer Advanced Mathematics for Computer Application If P= , find BT. 19. If B = 1 0, find 2B and -3B.

Social Media Mining. Graph Essentials

Mathematical Induction

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

System Interconnect Architectures. Goals and Analysis. Network Properties and Routing. Terminology - 2. Terminology - 1

1. Relevant standard graph theory

Fall 2015 Midterm 1 24/09/15 Time Limit: 80 Minutes

Analysis MA131. University of Warwick. Term

Foundations of Logic and Mathematics

ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER

A Sublinear Bipartiteness Tester for Bounded Degree Graphs

Generalizing the Ramsey Problem through Diameter

1.1 Logical Form and Logical Equivalence 1

Every tree contains a large induced subgraph with all degrees odd

Mathematical Induction

Chapter I Logic and Proofs

1 Basic Definitions and Concepts in Graph Theory

1 Die hard, once and for all

136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

INCIDENCE-BETWEENNESS GEOMETRY

Chapter 4. Trees. 4.1 Basics

Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Graph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency.

Sum of Degrees of Vertices Theorem

CMPSCI611: Approximating MAX-CUT Lecture 20

HOMEWORK #3 SOLUTIONS - MATH 3260

Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902

Trees and Fundamental Circuits

Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, Chapter 7: Digraphs

CMPS 102 Solutions to Homework 1

Aztec Diamonds and Baxter Permutations

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

Chapter 6 Planarity. Section 6.1 Euler s Formula

N E W S A N D L E T T E R S

Geometry Unit 1. Basics of Geometry

Mathematics for Algorithm and System Analysis

Algorithm Design and Analysis Homework #6 Due: 1pm, Monday, January 9, === Homework submission instructions ===

A simple proof for the number of tilings of quartered Aztec diamonds

Theorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.

3. Equivalence Relations. Discussion

Examination paper for MA0301 Elementær diskret matematikk

The Clar Structure of Fullerenes

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

An Introduction to Combinatorics and Graph Theory. David Guichard

IMO Training 2010 Russian-style Problems Alexander Remorov

SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM

Advertisement
Transcription:

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator by itself can be used to write equivalent expressions for all other Boolean logical operators. We call such an operator universal. Another universal operator is nor, defined such that P norq (P Q). Show how to express P Q in terms of: nor, P, Q, and grouping parentheses. Solution. ( P ) nor ( Q) = (P nor P ) nor (Q nor Q). Problem 2. [5 points] We define the sequence of numbers if 0 n 3, a n = a n + a n 2 + a n 3 + a n 4 if n 4. Prove that a n (mod 3) for all n 0. Solution. Proof by strong induction. Let P (n) be the predicate that a n (mod 3). Base case: For 0 n 3, a n = and is therefore (mod 3). Inductive step: For n 4, assume P (k) for 0 k n in order to prove P (n + ). In particular, since each of a n 4, a n 3, a n 2 and a n is (mod 3), their sum must be 4 (mod 3). Therefore, a n (mod 3) and P (n + ) holds. Problem 3. [20 points] The Slipped Disc Puzzle consists of a track holding 9 circular tiles. In the middle is a disc that can slide left and right and rotate 80 to change the positions of exactly four tiles. As shown below, there are three ways to manipulate the puzzle: Shift Right: The center disc is moved one unit to the right (if there is space) Rotate Disc: The four tiles in the center disc are reversed Shift Left: The center disc is moved one unit to the left (if there is space)

2 shift right 2 3 4 5 6 7 8 9 rotate disc 2 3 4 5 6 7 8 9 2 6 5 4 3 7 8 9 shift left 2 3 4 5 6 7 8 9 Prove that if the puzzle starts in an initial state with all but tiles and 2 in their natural order, then it is impossible to reach a goal state where all the tiles are in their natural order. The initial and goal states are shown below: Initial State Goal State 2 3 4 5 6 7 8 9 2 3 4 5 6 7 8 9 Write your proof on the next page... Solution. Order the tiles from left to right in the puzzle. Define an inversion to be a pair of tiles that is out of their natural order (e.g. 4 appearing to the left of 3). Lemma. Starting from the initial state there is an odd number of inversions after any number of transitions. Proof. The proof is by induction. Let P (n) be the proposition that starting from the initial state there is an odd number of inversions after n transitions. Base case: After 0 transitions, there is one inversion, so P (0) holds. Inductive step: Assume P (n) is true. Say we have a configuration that is reachable after n + transitions.. Case : The last transition was a shift left or shift right In this case, the left-to-right order of the discs does not change and thus the number of inversions remains the same as in

3 2. The last transition was a rotate disc. In this case, six pairs of disks switch order. If there were x inversions among these pairs after n transitions, there will be 6 x inversions after the reversal. If x is odd, 6 x is odd, so after n + transitions the number of inversions is odd. Conclusion: Since all reachable states have an odd number of inversions and the goal state has an even number of inversions (specifically 0), the goal state cannot be reached.

4 Problem 4. [0 points] Find the multiplicative inverse of 7 modulo 72 in the range {0,,..., 7}. Solution. Since 7 and 72 = 2 3 3 2 are relatively prime, an inverse exists and can be found by either Euler s theorem or the Pulverizer. Solution : Euler s Theorem φ(72) = φ(2 3 3 2 ) = φ(2 3 ) φ(3 2 ) (since 2 3 and 3 2 are rel. prime) = (2 3 2 2 )(3 2 3 ) (since 2 and 3 are prime) = 4 6 = 24 Therefore, 7 φ(72) = 7 23 is an inverse of 7. To find the inverse in the range {0,,..., 7} we take the remainder using the method of repeated squaring: 7 = 7 7 2 = 289 (since 289 = 4 72 + ) 7 4 2 = 7 8... etc. Therefore the inverse of 7 in the range {0,,..., 7} is given by, Solution 2: The Pulverizer 7 23 = 7 6 7 4 7 2 7 7 = 7 x y rem xy = x q y 72 7 4 = 72 4 7 7 4 = 7 4 4 = 7 4 (72 4 7) = 7 7 4 72 4 0 Since 7 2 4 72 =, 7 2 (mod 72) and so 7 is self inverse.

5 Problem 5. [5 points] Consider a graph representing the main campus buildings at MIT. 7 0 8 5 3 4 6 2 (a) [3 pts] Is this graph bipartite? Provide a brief argument for your answer. Solution. No, there is an odd-length cycle (b) [4 pts] Does this graph have an Euler circuit? Provide a brief argument for your answer. Solution. This graph does not have an Euler circuit because there are vertices with odd degree

6 Problem 5 continued... Now suppose each building has separate mail collection and drop-off boxes and each collection box has a single package destined for a unique drop-off box (i.e. a permutation). We can model this as a permutation routing problem by treating the buildings as switches, attaching an input and output terminal to each of the nine buildings, and treating the existing edges as bidirectional as in the graph below: (c) [4 pts] Give the diameter of this graph: Solution. The diameter is 8, the length of a shortest path between the terminals for buildings and 2. (d) [4 pts] What is the max congestion of this graph? That is, in the worst case permutation, how many packages would need to pass through a single building? Provide a brief argument for your answer. Solution. The maximum congestion is 9. Consider a permutation where all the packages on the left side are destined for drop-offs on the right side and vice versa with the building 0 package destined for building 0. In this case, all 9 packages must pass through building 0, giving a congestion of 9, which is the maximum for a graph with nine input-output pairs.

7 Problem 6. [0 points] A tournament graph G = (V, E) is a directed graph such that there is either an edge from u to v or an edge from v to u for every distinct pair of nodes u and v. (The nodes represent players and an edge u v indicates that player u beats player v.) Consider the beats relation implied by a tournament graph. Indicate whether or not each of the following relational properties hold for all tournament graphs and briefly explain your reasoning. You may assume that a player never plays herself.. transitive Solution. The beats relation is not transitive because there could exist a cycle of length 3 where x beats y, y beats z and z beats x. By the definition of a tournament, x cannot then beat y in such a situation. 2. symmetric Solution. The beats relation is not symmetric by the definition of a tournament: if x beats y then y does not beat x. 3. antisymmetric Solution. The beats relation is antisymmetric since for any distinct players x and y, if x beats y then y does not beat x. 4. reflexive Solution. The beats relation is not reflexive since a tournament graph has no self-loops. Problem 7. [20 points] An outerplanar graph is an undirected graph for which the vertices can be placed on a circle in such a way that no edges (drawn as straight lines) cross each other. For example, the complete graph on 4 vertices, K 4, is not outerplanar but any proper subgraph of K 4 with strictly fewer edges is outerplanar. Some examples are provided below: Prove that any outerplanar graph is 3-colorable. A fact you may use without proof is that any outerplanar graph has a vertex of degree at most 2.

8 Solution. Proof. Proof by induction on the number of nodes n with the induction hypothesis P (n) = every outerplanar graph with n vertices is 3-colorable. Base case: For n = the single node graph with no edges is trivially outerplanar and 3-colorable. Inductive step: Assume P (n) holds and let G n+ be an outerplanar graph with n+ vertices. There must exist a vertex v in G n+ with degree at most 2. Removing v and all its incident edges leaves a subgraph G n with n vertices. Since G n+ could be drawn with its vertices on a circle and its edges drawn as straight lines without intersections, any subgraph can also be drawn in such a way and so G n is also an outerplanar graph. P (n) implies G n is 3-colorable. Therefore we can color all the vertices in G n+ other than v using only 3 colors and since deg(v) 2 we may color it a color different than the vertices adjacent to it using only 3 colors. Therefore, G n+ is 3-colorable and P (n + ) holds. Problem 8. [0 points] Give upper and lower bounds for the following expression which differ by at most. n i 3 Solution. To find upper and lower bounds, we use the integral method: i= n n i + dx 3 3 x i= n = x 2 2 3 = = 2 n 2 2 2n 2 n n i 3 n + 3 x dx 3 i= = n x 2 n 3 2 = n 3 2 n = 2 2 + n 3 2n 2 Problem 9. [5 points] Circle every symbol on the left that could correctly appear in the box to its right. For each of the six parts you may need to circle any number of symbols.

9 (a) O Ω Θ o ω 6n 2 2 + 7n 0 = O, Ω, Θ n (b) O Ω Θ o ω 6 n = Ω, ω n 6 (c) O Ω Θ o ω n! = O, o (n n ) (d) O Ω Θ o ω n j= j = O, Ω, Θ, (ln n) (e) O Ω Θ o ω ln(n 3 ) = O, Ω, Θ (ln n)

MIT OpenCourseWare http://ocw.mit.edu 6.042J / 8.062J Mathematics for Computer Science Fall 200 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.