Discrete Mathematics 2 Exam File Spring 2012
|
|
- Linda Lambert
- 5 years ago
- Views:
Transcription
1 Discrete Mathematics 2 Exam File Spring 2012 Exam #1 1.) Suppose f : X Y and A X. a.) Prove or disprove: f -1 (f(a)) A. Prove or disprove: A f -1 (f(a)). 2.) A die is rolled four times. What is the probability that it comes up 3 at least once? 3.) Prove that is irrational. 4.) A box contains eight red apples, six green apples and five plaid apples. a.) You reach into the box and pull out an apple at random. What is the probability the apple is plaid? You reach into the box and pull out an apple at random. You then pull out another apple. What is the probability that both apples are green? c.) You reach into the box and pull out an apple at random. You then pull out another apple. What is the probability that both apples are the same color? 5.) Suppose w, x, y and z are integers. Find the number of ways we can have w + x + y + z = 10 if: a.) w, x, y and z are non-negative. w, x, y and z are positive. c.) w and x are positive, y and z are non-negative. 6.) A class has 12 girls and 10 boys. a.) If a five person committee is chosen at random, how many committees are possible? If a five person committee is chosen at random, how many committees are possible if the committee must have three girls and two boys? 7.) Ignoring years and February 29, what is the probability that, in a group of 6 people, two people share the same birth date? 8.) Three dice are tossed. What is the probability that the sum is greater than 5? 9.) Suppose f: A B and g:b C are one-to-one functions. Prove that g f is one-toone. Exam #2 1.) An inventory consists of a numbered list of 89 items, each marked "available" or "unavailable." There are 50 available items. Show that there are at least two available items in the list exactly nine items apart on the list. (For example, available items at positions 13 and 22 or positions 69 and 78 satisfy the condition.) 2.) The Koch Snowflake is a fractal that comes from repeated iterations of a construction on an equilateral triangle. Start with a triangle with each side length 1 (Figure 1). Then, in the middle of each side, put an equilateral triangle with side length 1/3 (Figure 2). Next, on each edge, insert an equilateral triangle of length 1/9 (Figure 3). Continuing, on each edge insert an equilateral triangle of length 1/27. Continue.... Find a recurrence relation for S n = number of edges in step n. Obviously S 1 = 3.
2 3.) Solve the recurrence relation d n = 4(d n-1 - d n-2 ) subject to the initial conditions d 0 = d 1 = 1. 4.) If possible, draw the following graphs. If it is not possible, explain why not. a.) K 5 K 3,5 c.) a bipartite graph with 3 red vertices and 4 white vertices that is not K 3,4 d.) a simple graph with degree sequence 3, 2, 2, 2, 1, 1, 0 e.) a tree with degree sequence 3, 3, 1, 1, 1, 1, 1, 1 5.) For each of the following graphs, indicate whether it contains an Eulerian path and whether or not it contains an Eulerian cycle? Give reasons for your answers A B C D E F K 6 K 3,4
3 6.) For each of the following graphs, indicate whether it contains a Hamilton path and whether or not it contains a Hamilton cycle? Give reasons for your answers A B C D E F K 6 K 3,4 7.) Redraw the first graph in #6 and label the vertices. Construct the adjacency matrix for the graph. Label the rows and columns of the matrix with the vertex labels. Exam #3 1.) Obviously the following graph is planar. Count the numbers of edges, vertices and faces and verify that Euler's formula holds. (in case it is hard to see, everywhere lines intersect a vertex exists)
4 2.) Using the graph from #1, use a breadth-first approach to finding a spanning tree. 3.) Using the graph from #1, use a depth-first approach to finding a spanning tree. 4.) Draw a graph having six edges and eight vertices or explain why one does not exist. 5.) Draw a graph that is acyclic with four edges and six vertices or explain why one does not exist. 6.) Use Prim's algorithm to find a minimal spanning tree. 7.) Show ALL solutions to the four queens problem. Exam #4 1.) For each pair of graphs, define an isomorphism, if possible, between the two graphs. If it is not possible, give a reason why not. a.)
5 2.) Use a system of equations (as in the recent homework) to show that. 3.) A game begins with 8 stones. Each player may remove one or two stones on each move with the one removing the last stone LOSING the game. Draw a graph that illustrates how this game can proceed and deduce a winning strategy, if possible, for the first player. 4.) Another game involved a queen on a chessboard (8 rows, 8 columns). The first player places the queen anywhere in the topmost row. The two players then alternate moves. A legal move is moving the queen any number of moves down or to the left. The queen may NOT be moved up or to the right. The winner is the player who places the queen on the bottom left square. Draw a graph that illustrates how this game can proceed and deduce a winning strategy, if possible, for the first player. 5.) Prove that the union of two countably infinite sets is countable. 6.) Prove that is irrational. 7.) Consider the following rooted tree. a.) c.) Give the preorder traversal of the tree. Give the inorder traversal of the tree. Give the postorder traversal of the tree. Final Exam 1.) For each of the following numbers, determine, with proof, whether the number is rational or irrational. a.) 12
6 2.) For each pair of graphs, define an isomorphism, if possible, between the two graphs. If it is not possible, give a reason why not. a.) 3.) Suppose w, x, y and z are integers. Find the number of ways we can have w + x + y + z = 14 if: a.) w, x, y and z are non-negative. w, x, y and z are positive. c.) w, x and y are positive and z is non-negative. 4.) A class has 12 girls and 10 boys. a.) If a five person committee is chosen at random, how many committees are possible? If a five person committee is chosen at random, how many committees are possible if the committee must have three girls and two boys? 5.) If possible, draw the following graphs. If it is not possible, explain why not. a.) K 5 K 3,5 c.) a bipartite graph with 3 red vertices and 4 white vertices that is not K 3,4 d.) a simple graph with degree sequence 3, 2, 2, 2, 1, 1, 0 e.) a tree with degree sequence 3, 3, 1, 1, 1, 1, 1, 1 6.) Suppose f: A B and g:b C are one-to-one functions. Prove that g f is one-toone. 7.) A game involves a queen on a chessboard (8 rows, 8 columns). The first player places the queen anywhere in the topmost row. The two players then alternate moves. A legal move is moving the queen any number of moves down or to the
7 left. The queen may NOT be moved up or to the right. The loser is the player who places the queen on the bottom left square. Deduce a winning strategy, if possible, for the first player. 8.) What is the probability that in a group of six people, two will have birthdays in the same month? (Assume all months are equally likely) 9.) In your drawer you have 11 identical plaid socks, six identical blue socks, two identical green socks and five identical red socks. You grab socks out of the drawer without looking. a.) How many socks must be pulled from the drawer to be certain of having a matching pair of socks? How many socks must be pulled from the drawer to be certain of having four matching socks (my dog will be wearing them)? c.) How many socks must be pulled from the drawer to be certain of having a matching pair of green or plaid socks? 10.) a.) Prove that for every connected graph, G, if G has no cycles, then for every pair of vertices a and b in G, there is only one path from a to b in G. Prove that, in a simple, connected graph, two vertices must have the same degree.
2.) From the set {A, B, C, D, E, F, G, H}, produce all of the four character combinations. Be sure that they are in lexicographic order.
Discrete Mathematics 2 - Test File - Spring 2013 Exam #1 1.) RSA - Suppose we choose p = 5 and q = 11. You're going to be sending the coded message M = 23. a.) Choose a value for e, satisfying the requirements
More informationNANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION MH 1301 DISCRETE MATHEMATICS TIME ALLOWED: 2 HOURS
NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION 2015-2016 MH 1301 DISCRETE MATHEMATICS May 2016 TIME ALLOWED: 2 HOURS INSTRUCTIONS TO CANDIDATES 1. This examination paper contains FIVE (5) questions
More informationPacket #6: Counting & Graph Theory. Applied Discrete Mathematics
Packet #6: Counting & Graph Theory Applied Discrete Mathematics Table of Contents Counting Pages 1-8 Graph Theory Pages 9-16 Exam Study Sheet Page 17 Counting Information I. Product Rule: A B C = A * B
More informationDiscrete Mathematics Exam File Fall Exam #1
Discrete Mathematics Exam File Fall 2015 Exam #1 1.) Which of the following quantified predicate statements are true? Justify your answers. a.) n Z, k Z, n + k = 0 b.) n Z, k Z, n + k = 0 2.) Prove that
More informationElements of Graph Theory
Elements of Graph Theory Quick review of Chapters 9.1 9.5, 9.7 (studied in Mt1348/2008) = all basic concepts must be known New topics we will mostly skip shortest paths (Chapter 9.6), as that was covered
More informationMathematics and Statistics, Part A: Graph Theory Problem Sheet 1, lectures 1-4
1. Draw Mathematics and Statistics, Part A: Graph Theory Problem Sheet 1, lectures 1-4 (i) a simple graph. A simple graph has a non-empty vertex set and no duplicated edges. For example sketch G with V
More informationDiscrete Math: Selected Homework Problems
Discrete Math: Selected Homework Problems 2006 2.1 Prove: if d is a common divisor of a and b and d is also a linear combination of a and b then d is a greatest common divisor of a and b. (5 3.1 Prove:
More informationDiscrete Mathematics Course Review 3
21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has
More informationSTUDENT NUMBER: MATH Final Exam. Lakehead University. April 13, Dr. Adam Van Tuyl
Page 1 of 13 NAME: STUDENT NUMBER: MATH 1281 - Final Exam Lakehead University April 13, 2011 Dr. Adam Van Tuyl Instructions: Answer all questions in the space provided. If you need more room, answer on
More informationWeek 12: Trees; Review. 22 and 24 November, 2017
(1/24) MA284 : Discrete Mathematics Week 12: Trees; Review http://www.maths.nuigalway.ie/~niall/ma284/ 22 and 24 November, 2017 C C C C 1 Trees Recall... Applications: Chemistry Applications: Decision
More information1. The following graph is not Eulerian. Make it into an Eulerian graph by adding as few edges as possible.
1. The following graph is not Eulerian. Make it into an Eulerian graph by adding as few edges as possible. A graph is Eulerian if it has an Eulerian circuit, which occurs if the graph is connected and
More informationChapter 1: Number and Operations
Chapter 1: Number and Operations 1.1 Order of operations When simplifying algebraic expressions we use the following order: 1. Perform operations within a parenthesis. 2. Evaluate exponents. 3. Multiply
More informationGraphs Introduction and Depth first algorithm
Graphs Introduction and Depth first algorithm Carol Zander Introduction to graphs Graphs are extremely common in computer science applications because graphs are common in the physical world. Everywhere
More informationWUCT121. Discrete Mathematics. Graphs
WUCT121 Discrete Mathematics Graphs WUCT121 Graphs 1 Section 1. Graphs 1.1. Introduction Graphs are used in many fields that require analysis of routes between locations. These areas include communications,
More informationCS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, CS1800 Discrete Structures Final
CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, 2016 Instructions: CS1800 Discrete Structures Final 1. The exam is closed book and closed notes. You may
More informationScheduling, Map Coloring, and Graph Coloring
Scheduling, Map Coloring, and Graph Coloring Scheduling via Graph Coloring: Final Exam Example Suppose want to schedule some ;inal exams for CS courses with following course numbers: 1007, 3137, 3157,
More informationFigure 2.1: A bipartite graph.
Matching problems The dance-class problem. A group of boys and girls, with just as many boys as girls, want to dance together; hence, they have to be matched in couples. Each boy prefers to dance with
More information3. According to universal addressing, what is the address of vertex d? 4. According to universal addressing, what is the address of vertex f?
1. Prove: A full m-ary tree with i internal vertices contains n = mi + 1 vertices. 2. For a full m-ary tree with n vertices, i internal vertices, and l leaves, prove: (i) i = (n 1)/m and l = [(m 1)n +
More informationGraph theory. Po-Shen Loh. June We begin by collecting some basic facts which can be proved via bare-hands techniques.
Graph theory Po-Shen Loh June 013 1 Basic results We begin by collecting some basic facts which can be proved via bare-hands techniques. 1. The sum of all of the degrees is equal to twice the number of
More information7.1 Introduction. A (free) tree T is A simple graph such that for every pair of vertices v and w there is a unique path from v to w
Chapter 7 Trees 7.1 Introduction A (free) tree T is A simple graph such that for every pair of vertices v and w there is a unique path from v to w Tree Terminology Parent Ancestor Child Descendant Siblings
More informationDiscrete Structures. Fall Homework3
Discrete Structures Fall 2015 Homework3 Chapter 5 1. Section 5.1 page 329 Problems: 3,5,7,9,11,15 3. Let P(n) be the statement that 1 2 + 2 2 + +n 2 = n(n + 1)(2n + 1)/6 for the positive integer n. a)
More informationPart II. Graph Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 53 Paper 3, Section II 15H Define the Ramsey numbers R(s, t) for integers s, t 2. Show that R(s, t) exists for all s,
More informationAssignment 1 Introduction to Graph Theory CO342
Assignment 1 Introduction to Graph Theory CO342 This assignment will be marked out of a total of thirty points, and is due on Thursday 18th May at 10am in class. Throughout the assignment, the graphs are
More informationStudy Guide and Review
Choose the term that best matches the statement or phrase. a square of a whole number A perfect square is a square of a whole number. a triangle with no congruent sides A scalene triangle has no congruent
More informationMath 15 - Spring Homework 5.2 Solutions
Math 15 - Spring 2017 - Homework 5.2 Solutions 1. (5.2 # 14 (not assigned)) Use Prim s algorithm to construct a minimal spanning tree for the following network. Draw the minimal tree and compute its total
More informationCHAPTER 11 Trees. 294 Chapter 11 Trees. f) This is a tree since it is connected and has no simple circuits.
294 Chapter 11 Trees SECTION 11.1 Introduction to Trees CHAPTER 11 Trees 2. a) This is a tree since it is connected and has no simple circuits. b) This is a tree since it is connected and has no simple
More informationIt is important that you show your work. There are 134 points available on this test.
Math 1165 Discrete Math Test April 4, 001 Your name It is important that you show your work There are 134 points available on this test 1 (10 points) Show how to tile the punctured chess boards below with
More informationCS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, CS1800 Discrete Structures Final
CS1800 Discrete Structures Fall 2016 Profs. Aslam, Gold, Ossowski, Pavlu, & Sprague December 16, 2016 Instructions: CS1800 Discrete Structures Final 1. The exam is closed book and closed notes. You may
More informationWorksheet for the Final Exam - Part I. Graphs
Worksheet for the Final Exam - Part I. Graphs Date and Time: May 10 2012 Thursday 11:50AM~1:50PM Location: Eng 120 Start with the Self-Test Exercises (pp.816) in Prichard. 1. Give the adjacency matrix
More informationThe Game of Criss-Cross
Chapter 5 The Game of Criss-Cross Euler Characteristic ( ) Overview. The regions on a map and the faces of a cube both illustrate a very natural sort of situation: they are each examples of regions that
More informationTWO CONTRIBUTIONS OF EULER
TWO CONTRIBUTIONS OF EULER SIEMION FAJTLOWICZ. MATH 4315 Eulerian Tours. Although some mathematical problems which now can be thought of as graph-theoretical, go back to the times of Euclid, the invention
More informationSolutions to First Exam, Math 170, Section 002 Spring 2012
Solutions to First Exam, Math 170, Section 002 Spring 2012 Multiple choice questions. Question 1. You have 11 pairs of socks, 4 black, 5 white, and 2 blue, but they are not paired up. Instead, they are
More informationCS 280 Problem Set 10 Solutions Due May 3, Part A
CS 280 Problem Set 10 Due May 3, 2002 Part A (1) You are given a directed graph G with 1000 vertices. There is one weakly connected component of size 800 and several other weakly connected components of
More informationGRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS
GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS DR. ANDREW SCHWARTZ, PH.D. 10.1 Graphs and Graph Models (1) A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes)
More informationSenior Math Circles November 25, 2009 Graph Theory II
University of Waterloo Faculty of Mathematics Centre for Education in Mathematics and Computing Senior Math Circles November 5, 009 Graph Theory II Planar Graphs A graph that can be drawn in R without
More informationv V Question: How many edges are there in a graph with 10 vertices each of degree 6?
ECS20 Handout Graphs and Trees March 4, 2015 (updated 3/9) Notion of a graph 1. A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of pairs of elements of V called edges.
More informationExtra Practice Problems 2
CS103 Handout 31 Fall 2018 October 29, 2018 Extra Practice Problems 2 Here's a set of a bunch of practice problems you can work through to solidify your understanding of the topics from Problem Sets Three,
More informationReview for Midterm Exam
Review for Midterm Exam 1 Policies and Overview midterm exam policies overview of problems, algorithms, data structures overview of discrete mathematics 2 Sample Questions on the cost functions of algorithms
More informationMatching and Planarity
Matching and Planarity Po-Shen Loh June 010 1 Warm-up 1. (Bondy 1.5.9.) There are n points in the plane such that every pair of points has distance 1. Show that there are at most n (unordered) pairs of
More informationThe Size of the Cantor Set
The Size of the Cantor Set Washington University Math Circle November 6, 2016 In mathematics, a set is a collection of things called elements. For example, {1, 2, 3, 4}, {a,b,c,...,z}, and {cat, dog, chicken}
More informationCPS 102: Discrete Mathematics. Quiz 3 Date: Wednesday November 30, Instructor: Bruce Maggs NAME: Prob # Score. Total 60
CPS 102: Discrete Mathematics Instructor: Bruce Maggs Quiz 3 Date: Wednesday November 30, 2011 NAME: Prob # Score Max Score 1 10 2 10 3 10 4 10 5 10 6 10 Total 60 1 Problem 1 [10 points] Find a minimum-cost
More information1 Introduction. Counting with Cubes. Barringer Winter MathCamp, 2016
1 Introduction Consider a large cube made from unit cubes 1 Suppose our cube is n n n Look at the cube from a corner so that you can see three faces How many unit cubes are in your line of vision? Build
More informationLattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis 1 Warm-Up to Ponder
Lattice Polygon s and Pick s Theorem From Dana Paquin and Tom Davis http://www.geometer.org/mathcircles/pick.pdf 1 Warm-Up to Ponder 1. Is it possible to draw an equilateral triangle on graph paper so
More informationTopic 10 Part 2 [474 marks]
Topic Part 2 [474 marks] The complete graph H has the following cost adjacency matrix Consider the travelling salesman problem for H a By first finding a minimum spanning tree on the subgraph of H formed
More informationProposition 1. The edges of an even graph can be split (partitioned) into cycles, no two of which have an edge in common.
Math 3116 Dr. Franz Rothe June 5, 2012 08SUM\3116_2012t1.tex Name: Use the back pages for extra space 1 Solution of Test 1.1 Eulerian graphs Proposition 1. The edges of an even graph can be split (partitioned)
More informationSolutions to Quiz 1. (a) (3 points) Vertices x and y are in the same connected component. Solution. P (x, y)
Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science October 17 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised October 18, 2005, 125 minutes Solutions
More informationMT365 Examination 2007 Part 1. Q1 (a) (b) (c) A
MT6 Examination Part Solutions Q (a) (b) (c) F F F E E E G G G G is both Eulerian and Hamiltonian EF is both an Eulerian trail and a Hamiltonian cycle. G is Hamiltonian but not Eulerian and EF is a Hamiltonian
More informationModule 2: NETWORKS AND DECISION MATHEMATICS
Further Mathematics 2017 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,
More informationExam 3 Practice Problems
Exam 3 Practice Problems HONOR CODE: You are allowed to work in groups on these problems, and also to talk to the TAs (the TAs have not seen these problems before and they do not know the solutions but
More informationr=1 The Binomial Theorem. 4 MA095/98G Revision
Revision Read through the whole course once Make summary sheets of important definitions and results, you can use the following pages as a start and fill in more yourself Do all assignments again Do the
More informationChapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:
Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have
More information4.1.2 Merge Sort Sorting Lower Bound Counting Sort Sorting in Practice Solving Problems by Sorting...
Contents 1 Introduction... 1 1.1 What is Competitive Programming?... 1 1.1.1 Programming Contests.... 2 1.1.2 Tips for Practicing.... 3 1.2 About This Book... 3 1.3 CSES Problem Set... 5 1.4 Other Resources...
More informationUCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis
UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 16 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 16 Notes Goals for this week Graph basics Types
More informationFurther Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks
Further Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,
More informationFinnish National High School Mathematics Competition
Finnish National High School Mathematics Competition Final Rounds 997 008 The Finnish National High School Mathematics Competition is organized by MAOL, the The Finnish Association of Teachers of Mathematics,
More information5 Graphs
5 Graphs jacques@ucsd.edu Some of the putnam problems are to do with graphs. They do not assume more than a basic familiarity with the definitions and terminology of graph theory. 5.1 Basic definitions
More informationDiscrete Mathematics SECOND EDITION OXFORD UNIVERSITY PRESS. Norman L. Biggs. Professor of Mathematics London School of Economics University of London
Discrete Mathematics SECOND EDITION Norman L. Biggs Professor of Mathematics London School of Economics University of London OXFORD UNIVERSITY PRESS Contents PART I FOUNDATIONS Statements and proofs. 1
More informationGraph Theory. 1 Graphs and Subgraphs
1 Graphs and Subgraphs Graph Theory Definition 1.1. A multigraph or just graph is an ordered pair G = (V, E) consisting of a nonempty vertex set V of vertices and an edge set E of edges such that each
More informationTrees : Part 1. Section 4.1. Theory and Terminology. A Tree? A Tree? Theory and Terminology. Theory and Terminology
Trees : Part Section. () (2) Preorder, Postorder and Levelorder Traversals Definition: A tree is a connected graph with no cycles Consequences: Between any two vertices, there is exactly one unique path
More informationLecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
More informationCSE 21 Summer 2017 Homework 4
CSE 21 Summer 201 Homework Key Concepts Minimum Spanning Trees, Directed Acyclic Graphs, Topological Sorting, Single source shortest paths, Counting, Basic probability principles, Independence, Linearity
More informationDiscovering. Algebra. An Investigative Approach. Condensed Lessons for Make-up Work
Discovering Algebra An Investigative Approach Condensed Lessons for Make-up Work CONDENSED L E S S O N 0. The Same yet Smaller Previous In this lesson you will apply a recursive rule to create a fractal
More informationScope and Sequence for the New Jersey Core Curriculum Content Standards
Scope and Sequence for the New Jersey Core Curriculum Content Standards The following chart provides an overview of where within Prentice Hall Course 3 Mathematics each of the Cumulative Progress Indicators
More information8.NS.1 8.NS.2. 8.EE.7.a 8.EE.4 8.EE.5 8.EE.6
Standard 8.NS.1 8.NS.2 8.EE.1 8.EE.2 8.EE.3 8.EE.4 8.EE.5 8.EE.6 8.EE.7 8.EE.7.a Jackson County Core Curriculum Collaborative (JC4) 8th Grade Math Learning Targets in Student Friendly Language I can identify
More informationComputational Discrete Mathematics
Computational Discrete Mathematics Combinatorics and Graph Theory with Mathematica SRIRAM PEMMARAJU The University of Iowa STEVEN SKIENA SUNY at Stony Brook CAMBRIDGE UNIVERSITY PRESS Table of Contents
More informationInstructor: Paul Zeitz, University of San Francisco
Berkeley Math Circle Graph Theory and Ramsey Theory Instructor: Paul Zeitz, University of San Francisco (zeitz@usfca.edu) Definitions 1 A graph is a pair (V,E), where V is a finite set and E is a set of
More informationAn Introduction to Combinatorics and Graph Theory. David Guichard
An Introduction to Combinatorics and Graph Theory David Guichard This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-sa/3.0/
More informationMC 302 GRAPH THEORY 10/1/13 Solutions to HW #2 50 points + 6 XC points
MC 0 GRAPH THEORY 0// Solutions to HW # 0 points + XC points ) [CH] p.,..7. This problem introduces an important class of graphs called the hypercubes or k-cubes, Q, Q, Q, etc. I suggest that before you
More information<The von Koch Snowflake Investigation> properties of fractals is self-similarity. It means that we can magnify them many times and after every
Jiwon MYP 5 Math Ewa Puzanowska 18th of Oct 2012 About Fractal... In geometry, a fractal is a shape made up of parts that are the same shape as itself and are of
More informationPick s Theorem and Lattice Point Geometry
Pick s Theorem and Lattice Point Geometry 1 Lattice Polygon Area Calculations Lattice points are points with integer coordinates in the x, y-plane. A lattice line segment is a line segment that has 2 distinct
More informationDiscrete Mathematics, Spring 2004 Homework 8 Sample Solutions
Discrete Mathematics, Spring 4 Homework 8 Sample Solutions 6.4 #. Find the length of a shortest path and a shortest path between the vertices h and d in the following graph: b c d a 7 6 7 4 f 4 6 e g 4
More informationMath 15 - Spring Homework 2.6 Solutions 1. (2.6 # 20) The following graph has 45 vertices. In Sagemath, we can define it like so:
Math 15 - Spring 2017 - Homework 2.6 Solutions 1. (2.6 # 20) The following graph has 45 vertices. In Sagemath, we can define it like so: dm = {0: [1,15], 1: [2,16,31], 2: [3,17,32], 3: [4,18,33], 4: [5,19,34],
More informationDS UNIT 4. Matoshri College of Engineering and Research Center Nasik Department of Computer Engineering Discrete Structutre UNIT - IV
Sr.No. Question Option A Option B Option C Option D 1 2 3 4 5 6 Class : S.E.Comp Which one of the following is the example of non linear data structure Let A be an adjacency matrix of a graph G. The ij
More informationINTRODUCTION TO GRAPH THEORY. 1. Definitions
INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident with
More informationMath 101 Final Exam Study Notes:
Math 101 Final Exam Study Notes: *Please remember there is a large set of final exam review problems in Doc Sharing (under Course Tools in MLP). Highlighted are what might be considered formulas* I. Graph
More informationTILING PROBLEMS: FROM DOMINOES, CHECKERBOARDS, AND MAZES TO DISCRETE GEOMETRY
TILING PROBLEMS: FROM DOMINOES, CHECKERBOARDS, AND MAZES TO DISCRETE GEOMETRY BERKELEY MATH CIRCLE 1. Looking for a number Consider an 8 8 checkerboard (like the one used to play chess) and consider 32
More informationCS1800 Discrete Structures Spring 2017 Profs. Gold & Schnyder April 28, CS1800 Discrete Structures Final
S1800 Discrete Structures Spring 2017 Profs. Gold & Schnyder pril 28, 2017 S1800 Discrete Structures Final Instructions: 1. The exam is closed book and closed notes. You may not use a calculator or any
More information2 hours THE UNIVERSITY OF MANCHESTER. 23 May :45 11:45
2 hours MAT20902 TE UNIVERSITY OF MANCESTER DISCRETE MATEMATICS 23 May 2018 9:45 11:45 Answer ALL TREE questions in Section A (30 marks in total). Answer TWO of the TREE questions in Section B (50 marks
More informationBasic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions
Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc
More informationModule 7. Independent sets, coverings. and matchings. Contents
Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................
More informationCourse Code : MCS-033 Course Title : Advanced Discrete Mathematics Assignment Number : MCA(III)/033/Assignment/2018-19 Maximum Marks : 100 Weightage : 25% Last Dates for Submission : 15th October, 2018
More informationDiscrete mathematics II. - Graphs
Emil Vatai April 25, 2018 Basic definitions Definition of an undirected graph Definition (Undirected graph) An undirected graph or (just) a graph is a triplet G = (ϕ, E, V ), where V is the set of vertices,
More information2009 Fall Startup Event Thursday, September 24th, 2009
009 Fall Startup Event This test consists of 00 problems to be solved in 0 minutes. All answers must be exact, complete, and in simplest form. To ensure consistent grading, if you get a decimal, mixed
More information1. [1 pt] What is the solution to the recurrence T(n) = 2T(n-1) + 1, T(1) = 1
Asymptotics, Recurrence and Basic Algorithms 1. [1 pt] What is the solution to the recurrence T(n) = 2T(n-1) + 1, T(1) = 1 1. O(logn) 2. O(n) 3. O(nlogn) 4. O(n 2 ) 5. O(2 n ) 2. [1 pt] What is the solution
More informationCS70 - Lecture 6. Graphs: Coloring; Special Graphs. 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs:
CS70 - Lecture 6 Graphs: Coloring; Special Graphs 1. Review of L5 2. Planar Five Color Theorem 3. Special Graphs: Trees: Three characterizations Hypercubes: Strongly connected! Administration You need
More informationStudent Name and ID Number. MATH 3012 Final Exam, December 11, 2014, WTT
MATH 3012 Final Exam, December 11, 2014, WTT Student Name and ID Number 1. Consider the 11-element set X consisting of the three capital letters {A, B, C} and the eight digits {0, 1, 2,..., 7}. a. How
More informationCombinatorics MAP363 Sheet 1. Mark: /10. Name. Number. Hand in by 19th February. date marked: / /2007
Turn over Combinatorics MAP6 Sheet Hand in by 9th February Name Number Year Mark: /0 date marked: / /200 Please attach your working, with this sheet at the front. Guidance on notation: graphs may have
More informationMath Summer 2012
Math 481 - Summer 2012 Final Exam You have one hour and fifty minutes to complete this exam. You are not allowed to use any electronic device. Be sure to give reasonable justification to all your answers.
More informationFinal Exam May 6, 2015
CSC 1300 - Discrete Structures Final Exam May 6, 2015 Name: Question Value Score 1 15 2 25 3 20 4 15 5 20 6 20 7 10 8 10 9 10 10 20 11 15 12 20 TOTAL 200 No calculators or any reference except your one
More informationUsing Euler s Theorem
Using Euler s Theorem Suppose that a connected, planar graph has 249 vertices and 57 faces. How many edges does it have? A: 106 B: 194 C: 304 D: 306 E: We don t have enough information Using Euler s Theorem
More information1 Some Solution of Homework
Math 3116 Dr. Franz Rothe May 30, 2012 08SUM\3116_2012h1.tex Name: Use the back pages for extra space 1 Some Solution of Homework Proposition 1 (Counting labeled trees). There are n n 2 different labeled
More informationA Survey of Mathematics with Applications 8 th Edition, 2009
A Correlation of A Survey of Mathematics with Applications 8 th Edition, 2009 South Carolina Discrete Mathematics Sample Course Outline including Alternate Topics and Related Objectives INTRODUCTION This
More informationTrail Making Game. Hyun Sung Jun Jaehoon Kim Sang-il Oum Department of Mathematical Sciences KAIST, Daejeon, , Republic of Korea.
Trail Making Game Hyun Sung Jun Jaehoon Kim Sang-il Oum Department of Mathematical Sciences KAIST, Daejeon, 305-701, Republic of Korea. May 7, 2009 Abstract Trail Making is a game played on a graph with
More informationCHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism
CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented
More informationSchool of Distance Education University of Kerala M.Sc Computer Science Assignment Topics
School of Distance Education University of Kerala M.Sc Computer Science Assignment Topics 2017-2018 DCS11 Computer Architecture 1. Explain the following terms a) Memory Organization b) Memory system considerations
More informationarxiv: v1 [math.co] 17 Jan 2014
Regular matchstick graphs Sascha Kurz Fakultät für Mathematik, Physik und Informatik, Universität Bayreuth, Germany Rom Pinchasi Mathematics Dept., Technion Israel Institute of Technology, Haifa 2000,
More informationγ(ɛ) (a, b) (a, d) (d, a) (a, b) (c, d) (d, d) (e, e) (e, a) (e, e) (a) Draw a picture of G.
MAD 3105 Spring 2006 Solutions for Review for Test 2 1. Define a graph G with V (G) = {a, b, c, d, e}, E(G) = {r, s, t, u, v, w, x, y, z} and γ, the function defining the edges, is given by the table ɛ
More informationUNC Charlotte 2010 Comprehensive
00 Comprehensive with solutions March 8, 00. A cubic equation x 4x x + a = 0 has three roots, x, x, x. If x = x + x, what is a? (A) 4 (B) 8 (C) 0 (D) (E) 6 Solution: C. Because the coefficient of x is
More informationComputer Science 280 Fall 2002 Homework 10 Solutions
Computer Science 280 Fall 2002 Homework 10 Solutions Part A 1. How many nonisomorphic subgraphs does W 4 have? W 4 is the wheel graph obtained by adding a central vertex and 4 additional "spoke" edges
More informationCombinatorics Summary Sheet for Exam 1 Material 2019
Combinatorics Summary Sheet for Exam 1 Material 2019 1 Graphs Graph An ordered three-tuple (V, E, F ) where V is a set representing the vertices, E is a set representing the edges, and F is a function
More information