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.
|
|
- Justin Fisher
- 5 years ago
- Views:
Transcription
1 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 of RSA Encryption, from the set {7, 8}. b.) Calculate the value, C, that you will transmit to the recipient. 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. 3.) There are 4237 Jovians and 3985 Martians in the park. It is impossible to tell the Jovians apart and it is impossible to tell the Martians apart. Four of the Jovians and three of the Martians are sitting around a circular table. In how many ways can the seven entities be seated. 4.) In a box there are eight red marbles, four blue marbles and seven plaid marbles. You take THREE marbles out of the box. a.) If each marble is returned to the box before the rest are pulled, what is the probability that all three marbles are blue? b.) If each marble is returned to the box before the rest are pulled, what is the probability that exactly two of the marbles are blue? c.) If no marbles are returned to the box, what is the probability that all three marbles are plaid? d.) If no marbles are returned to the box, what is the probability that all three are different? 5.) You roll two standard six-sided dice and MULTIPLY the numbers. a.) What is the probability that the product is less than 10? b.) What is the probability that the product is less than or equal to 30? c.) What is the probability that the product is prime? d.) What is the probability that the product is seven? 6.) Suppose a 1 = 4 and a n = 3a n-1 - n, for n > 1. Find the following. a.) a 1 b.) a 2 c.) a 3 d.) a 4 7.) Suppose a 1 = 4 and a n = 3a n-1, for n > 1. Find the following. a.) a 2 b.) a 3 c.) a n (closed, non-recursive form) d.) a 13 (simplified) Exam #2 1.) 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. [hint: Suppose not.]
2 2.) The Sierpinski Gasket is a fractal that comes from repeatedly removing portions of an equilateral triangle. Start with a triangle with each side length 1 (Figure 1). Then, in the middle, remove an equilateral triangle with vertices at the midpoints of the sides of the original triangle (Figure 2). Next, in each remaining triangular portion, remove an equilateral triangle with vertices at the midpoints of the sides of the remaining triangles (Figure 3). Continue.... a.) Find a recurrence relation for S n = number of shaded triangles in step n. Obviously S 1 = 1. b.) Find a closed form expression for S n = number of shaded triangles in step n. 3.) Solve the recurrence relation d n = 5d n-1-4d n-2 subject to the initial conditions d 0 = 2, d 1 = 1. 4.) If possible, draw the following graphs. If it is not possible, explain why not. a.) K 4 b.) 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 simple graph with degree sequence 5, 3, 2, 2. 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
3 D E F K 5 K 2,5 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 5 K 2,5 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. 8.) Draw a graph having six edges and eight vertices or explain why one does not exist.
4 9.) 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.) b.) Exam #3 1.) Use Kuratowski's Theorem to determine if the following graph is planar.
5 2.) Do the following: a.) Define a tree b.) (fill in the blank) If a tree has n vertices then it has edges. c.) (circle answer) True False - A tree contains an even number of cycles. d.) (circle answer) True False - A tree can have the following degree sequence. 3, 3, 2, 2, 1, 1, 1, 1. e.) If the answer to part d.) is "true," draw such a tree. If it is "false," draw your favorite superhero. 3.) Consider the following tree. Consider vertex "a" to be the root. a.) b.) Construct a spanning tree using the breadth-first algorithm. Construct a spanning tree using the depth-first algorithm. 4.) Using Prim's Algorithm, find a minimal spanning tree for the following tree. For #5-7, consider the following tree.
6 5.) Give the order of vertices for a preorder traversal of the above tree. 6.) Give the order of vertices for a inorder traversal of the above tree. 7.) Give the order of vertices for a postorder traversal of the above tree. 8.) Use Kuratowski's Theorem to explain why every tree is planar. 9.) Determine if the following pair of trees is isomorphic. If they are not, explain why not. If they are, label the vertices of the tree on the left using the letters A, B, C, D, E, F, G. Then label the vertices of the tree on the left using the letters a, b, c, d, e, f, g so that the isomorphism is f(a) = a, f(b) = b, etc. 10.) Determine if the following pair of trees is isomorphic. If they are not, explain why not. If they are, label the vertices of the tree on the left using the letters A, B, C, D, E, F, G, H. Then label the vertices of the tree on the right using the letters a, b, c, d, e, f, g, h so that the isomorphism is f(a) = a, f(b) = b, etc.
7 Exam #4 1.) Use the division method to approximate to 3 places to the right of the decimal. 2.) Use the Babylonian method to approximate to 3 places to the right of the decimal. 3.) Convert each number to the indicated base. You may use your calculator to help with arithmetic but ALL necessary work must be shown. a.) 6543 to base 5 b.) to base 10 c.) to base 4 (do enough places to the right of the decimal to be sure of the repeating pattern) 4.) Find the last two digits each of the following. You may use your calculator to help with the arithmetic in finding the pattern but you must show all work. a.) b.) ) Find the coefficient of a 4 b 3 c 2 d in the expansion of (a + b + c + d) ) Evaluate the following fraction (pay close attention to the numbers). Once you get to the polynomial that will solve the problem, give an exact answer for the answer and a decimal approximation using your calculator.
8 7.) Let n = maximum{7, number of letters in your last name}. Construct a primitive Pythagorean Triple using n and any m that you choose. 8.) Evaluate. Once you get to the polynomial Final Exam that will solve the problem, give an exact answer for the answer and a decimal approximation using your calculator. 1.) Prove is irrational. 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. 3.) Consider the number 354,638,838,122,712. WITHOUT USING YOUR CALCULATOR, determine if it is divisible by the following. Give reasons for your answers. a.) 2 b.) 3 c.) 4 d.) 5 e.) 6 f.) 7 g.) 8 h.) 9 i.) 10 j.) 11 k.) 12 l.) 13 4.) In a box there are eight red marbles, four blue marbles and seven plaid marbles. You take THREE marbles out of the box. a.) If each marble is returned to the box before the rest are pulled, what is the probability that all three marbles are blue? b.) If each marble is returned to the box before the rest are pulled, what is the probability that exactly two of the marbles are blue? c.) If no marbles are returned to the box, what is the probability that all three d.) marbles are plaid? If no marbles are returned to the box, what is the probability that all three are different? 5.) You roll two standard six-sided dice and MULTIPLY the numbers. a.) What is the probability that the product is less than 10? b.) What is the probability that the product is less than or equal to 30? c.) What is the probability that the product is prime? d.) What is the probability that the product is seven? 6.) Suppose a 1 = 4 and a n = 3a n-1 - n, for n > 1. Find the following. a.) a 1 b.) a 2 c.) a 3 d.) a 4 7.) Suppose a 1 = 4 and a n = 3a n-1, for n > 1. Find the following. a.) a 2 b.) a 3 c.) a n (closed, non-recursive form) d.) a 13 (simplified) 8.) If possible, draw the following graphs. If it is not possible, explain why not. a.) K 4 b.) 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 simple graph with degree sequence 5, 3, 2, 2. 1, 1
9 9.) Using Prim's Algorithm, find a minimal spanning tree for the following tree. 10.) Convert each number to the indicated base. You may use your calculator to help with arithmetic but ALL necessary work must be shown. a.) 6543 to base 5 b.) to base 10 c.) to base 4 (do enough places to the right of the decimal to be sure of the repeating pattern) 11.) A two-player game begins with 8 stones. Each player may remove one or two stones on each move with the one removing the last stone WINNING the game. Draw a graph that illustrates how this game can proceed and deduce a winning strategy, if possible, for the first player. 12.) 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. b.) w, x, y and z are positive. c.) w and x are positive, y and z are non-negative. 13.) 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.
10 14.) Solve the recurrence relation d n = 4(d n-1 - d n-2 ) subject to the initial conditions d 0 = d 1 = ) Use a system of equations (as in the recent homework) to show that. 16.) 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
Discrete Mathematics 2 Exam File Spring 2012
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
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 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 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 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 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 informationMathematics 350 Section 6.3 Introduction to Fractals
Mathematics 350 Section 6.3 Introduction to Fractals A fractal is generally "a rough or fragmented geometric shape that is self-similar, which means it can be split into parts, each of which is (at least
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 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 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 informationIn this lesson, students build fractals and track the growth of fractal measurements using tables and equations. Enduring Understanding
LessonTitle: Fractal Functions Alg 5.8 Utah State Core Standard and Indicators Algebra Standards 2, 4 Process Standards 1-5 Summary In this lesson, students build fractals and track the growth of fractal
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 informationCS1800 Discrete Structures Final Version A
CS1800 Discrete Structures Fall 2017 Profs. Aslam, Gold, & Pavlu December 11, 2017 CS1800 Discrete Structures Final Version A Instructions: 1. The exam is closed book and closed notes. You may not use
More informationDiscrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1
CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 PRINT Your Name:, (last) READ AND SIGN The Honor Code: As a member of the UC Berkeley community, I act with honesty,
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 informationMathematics Background
Finding Area and Distance Students work in this Unit develops a fundamentally important relationship connecting geometry and algebra: the Pythagorean Theorem. The presentation of ideas in the Unit reflects
More informationMath 574 Review Exam #1
Math 574 Review Exam 1 1. How many 8-card hands, dealt from a standard deck of 5, consist of: (a). 5 of one suit and 3 of another suit? (b). 4 each of two suits. (c). 3 of one suit, 3 of a second suit,
More informationUNIVERSITY OF MANITOBA. SIGNATURE: (in ink) (I understand that cheating is a serious offense)
DATE: Nov. 21, 2013 NAME: (Print in ink) STUDENT NUMBER: SIGNATURE: (in ink) (I understand that cheating is a serious offense) INSTRUCTIONS TO STUDENTS: This is a 90 minute exam. Cearly show all necessary
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 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 informationCOSC 2007 Data Structures II Final Exam. Part 1: multiple choice (1 mark each, total 30 marks, circle the correct answer)
COSC 2007 Data Structures II Final Exam Thursday, April 13 th, 2006 This is a closed book and closed notes exam. There are total 3 parts. Please answer the questions in the provided space and use back
More informationUnit 1, Lesson 1: Moving in the Plane
Unit 1, Lesson 1: Moving in the Plane Let s describe ways figures can move in the plane. 1.1: Which One Doesn t Belong: Diagrams Which one doesn t belong? 1.2: Triangle Square Dance m.openup.org/1/8-1-1-2
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 informationName Period Date. REAL NUMBER SYSTEM Student Pages for Packet 3: Operations with Real Numbers
Name Period Date REAL NUMBER SYSTEM Student Pages for Packet : Operations with Real Numbers RNS. Rational Numbers Review concepts of experimental and theoretical probability. a Understand why all quotients
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 informationMAA MD-DC-VA Section meeting, November Creative Approaches to Discrete Mathematics Brian Heinold Mount St. Mary s University
MAA MD-DC-VA Section meeting, November 2013 Creative Approaches to Discrete Mathematics Brian Heinold Mount St. Mary s University Reasoning question Consider the following statement: If G is Keplerian,
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 informationCSCI-401 Examlet #5. Name: Class: Date: True/False Indicate whether the sentence or statement is true or false.
Name: Class: Date: CSCI-401 Examlet #5 True/False Indicate whether the sentence or statement is true or false. 1. The root node of the standard binary tree can be drawn anywhere in the tree diagram. 2.
More informationMath 575 Exam 3. (t). What is the chromatic number of G?
Math 575 Exam 3 Name 1 (a) Draw the Grötsch graph See your notes (b) Suppose that G is a graph having 6 vertices and 9 edges and that the chromatic polynomial of G is given below Fill in the missing coefficients
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 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 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 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 informationGrade 8. Strand: Number Specific Learning Outcomes It is expected that students will:
8.N.1. 8.N.2. Number Demonstrate an understanding of perfect squares and square roots, concretely, pictorially, and symbolically (limited to whole numbers). [C, CN, R, V] Determine the approximate square
More informationIntroduction to Algorithms May 14, 2003 Massachusetts Institute of Technology Professors Erik Demaine and Shafi Goldwasser.
Introduction to Algorithms May 14, 2003 Massachusetts Institute of Technology 6.046J/18.410J Professors Erik Demaine and Shafi Goldwasser Practice Final Practice Final Do not open this exam booklet until
More informationUniversity of New Mexico Department of Computer Science. Final Examination. CS 561 Data Structures and Algorithms Fall, 2011
University of New Mexico Department of Computer Science Final Examination CS 561 Data Structures and Algorithms Fall, 2011 Name: Email: Nothing is true. All is permitted - Friedrich Nietzsche. Well, not
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 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 informationGrade 7/8 Math Circles Fall Nov.4/5 The Pythagorean Theorem
1 Faculty of Mathematics Waterloo, Ontario Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Fall 2014 - Nov.4/5 The Pythagorean Theorem Introduction A right triangle is any triangle
More informationANS:
Math 15-Spring 17-Final Exam Solutions 1. Consider the following definition of the symbol. Definition. Let x and y be integers. Write x y if 5x + 7y = 11k for some integer k. (a) Show that 1 4, 2 8, and
More informationDiscrete Mathematics and Probability Theory Fall 2015 Rao Midterm 1
CS 70 Discrete Mathematics and Probability Theory Fall 2015 Rao Midterm 1 PRINT Your Name:, (last) SIGN Your Name: (first) PRINT Your Student ID: CIRCLE your exam room: 2050 VLSB A1 Hearst Annex 120 Latimer
More informationCollege Algebra Exam File - Fall Test #1
College Algebra Exam File - Fall 010 Test #1 1.) For each of the following graphs, indicate (/) whether it is the graph of a function and if so, whether it the graph of one-to one function. Circle your
More information1. Consider the 62-element set X consisting of the twenty-six letters (case sensitive) of the English
MATH 3012 Final Exam, May 3, 2013, WTT Student Name and ID Number 1. Consider the 62-element set X consisting of the twenty-six letters (case sensitive) of the English alphabet and the ten digits {0, 1,
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 information( ) ( ) C. " 1 n. ( ) $ f n. ( ) B. " log( n! ) ( ) and that you already know ( ) ( ) " % g( n) ( ) " #&
CSE 0 Name Test Summer 008 Last 4 Digits of Mav ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. The time for the following code is in which set? for (i=0; i
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 informationCS220/MATH320 Applied Discrete Mathematics Instructor: Marc Pomplun Practice Exam. Sample Solutions
CS220/MATH320 Applied Discrete Mathematics Instructor: Marc Pomplun Practice Exam Sample Solutions Question 1: Cardinality How many distinct elements does the set S contain in each case? Check the appropriate
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 informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Midterm 1
CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Midterm 1 PRINT Your Name:, (last) SIGN Your Name: (first) PRINT Your Student ID: CIRCLE your exam room: 1 Pimentel 141 Mccone
More informationGTPS Curriculum Mathematics Grade 8
4.2.8.B2 Use iterative procedures to generate geometric patterns: Fractals (e.g., the Koch Snowflake); Self-similarity; Construction of initial stages; Patterns in successive stages (e.g., number of triangles
More informationChapter 4 Trees. Theorem A graph G has a spanning tree if and only if G is connected.
Chapter 4 Trees 4-1 Trees and Spanning Trees Trees, T: A simple, cycle-free, loop-free graph satisfies: If v and w are vertices in T, there is a unique simple path from v to w. Eg. Trees. Spanning trees:
More informationSubject : Mathematics Level B1 Class VII Lesson: 1 (Integers)
Subject : Mathematics Level B1 Class VII Lesson: 1 (Integers) Skill/Competency /Concept Computational Skill Properties of Addition and subtraction of integers Multiplication and division Operation on integer.
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 informationTotal Score /1 /20 /41 /15 /23 Grader
NAME: NETID: CS2110 Spring 2015 Prelim 2 April 21, 2013 at 5:30 0 1 2 3 4 Total Score /1 /20 /41 /15 /23 Grader There are 5 questions numbered 0..4 on 8 pages. Check now that you have all the pages. Write
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 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 informationIndirect measure the measurement of an object through the known measure of another object.
Indirect measure the measurement of an object through the known measure of another object. M Inequality a sentence that states one expression is greater than, greater than or equal to, less than, less
More informationPURPLE COMET MATH MEET April 2011 HIGH SCHOOL - PROBLEMS. The ratio of 3 to the positive number n is the same as the ratio of n to 192. Find n.
PURPLE COMET MATH MEET April 2011 HIGH SCHOOL - PROBLEMS Copyright Titu Andreescu and Jonathan Kane Problem 1 The ratio of 3 to the positive number n is the same as the ratio of n to 192. Find n. Problem
More informationf( x ), or a solution to the equation f( x) 0. You are already familiar with ways of solving
The Bisection Method and Newton s Method. If f( x ) a function, then a number r for which f( r) 0 is called a zero or a root of the function f( x ), or a solution to the equation f( x) 0. You are already
More informationAP Calculus BC Summer Assignment
AP Calculus BC Summer Assignment Name Due Date: First Day of School Welcome to AP Calculus BC! This is an exciting, challenging, fast paced course that is taught at the college level. We have a lot of
More informationVocabulary: Looking For Pythagoras
Vocabulary: Looking For Pythagoras Concept Finding areas of squares and other figures by subdividing or enclosing: These strategies for finding areas were developed in Covering and Surrounding. Students
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 informationAdjacent sides are next to each other and are joined by a common vertex.
Acute angle An angle less than 90. A Adjacent Algebra Angle Approximate Arc Area Asymmetrical Average Axis Adjacent sides are next to each other and are joined by a common vertex. Algebra is the branch
More information( ) + n. ( ) = n "1) + n. ( ) = T n 2. ( ) = 2T n 2. ( ) = T( n 2 ) +1
CSE 0 Name Test Summer 00 Last Digits of Student ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. Suppose you are sorting millions of keys that consist of three decimal
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 informationNumber/Computation. addend Any number being added. digit Any one of the ten symbols: 0, 1, 2, 3, 4, 5, 6, 7, 8, or 9
14 Number/Computation addend Any number being added algorithm A step-by-step method for computing array A picture that shows a number of items arranged in rows and columns to form a rectangle associative
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 informationApplications. 44 Stretching and Shrinking
Applications 1. Look for rep-tile patterns in the designs below. For each design, tell whether the small quadrilaterals are similar to the large quadrilateral. Explain. If the quadrilaterals are similar,
More information9. The expected time for insertion sort for n keys is in which set? (All n! input permutations are equally likely.)
CSE 0 Name Test Spring 006 Last 4 Digits of Student ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. Suppose f ( x) is a monotonically increasing function. Which of the
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 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 informationMultiple Choice. Write your answer to the LEFT of each problem. 3 points each
CSE 0-00 Test Spring 0 Name Last 4 Digits of Student ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. Suppose f ( x) is a monotonically increasing function. Which of the
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 informationStudent Name and ID Number. MATH 3012, Quiz 3, April 16, 2018, WTT
MATH 3012, Quiz 3, April 16, 2018, WTT Student Name and ID Number 1. A graph with weights on edges is shown below. In the space to the right of the figure, list in order the edges which make up a minimum
More informationPrime Time (Factors and Multiples)
CONFIDENCE LEVEL: Prime Time Knowledge Map for 6 th Grade Math Prime Time (Factors and Multiples). A factor is a whole numbers that is multiplied by another whole number to get a product. (Ex: x 5 = ;
More informationGrade 6 Math Circles. Shapeshifting
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Plotting Grade 6 Math Circles October 24/25, 2017 Shapeshifting Before we begin today, we are going to quickly go over how to plot points. Centre for Education
More informationn 2 ( ) ( ) + n is in Θ n logn
CSE Test Spring Name Last Digits of Mav ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. The time to multiply an m n matrix and a n p matrix is in: A. Θ( n) B. Θ( max(
More informationDISCRETE MATHEMATICS
DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The
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 informationSummer Math Packet for Rising 8 th Grade Students
Name This assignment provides a review of mathematical and algebraic skills that are required for success in 8 th grade accelerated math class. Students, please use the packets as a review to help you
More informationPITSCO Math Individualized Prescriptive Lessons (IPLs)
Orientation Integers 10-10 Orientation I 20-10 Speaking Math Define common math vocabulary. Explore the four basic operations and their solutions. Form equations and expressions. 20-20 Place Value Define
More information2017 SOLUTIONS (PRELIMINARY VERSION)
SIMON MARAIS MATHEMATICS COMPETITION 07 SOLUTIONS (PRELIMINARY VERSION) This document will be updated to include alternative solutions provided by contestants, after the competition has been mared. Problem
More informationFun with Fractals and Functions. CHAMP at University of Houston March 2, 2015 Houston, Texas
Fun with Fractals and Functions CHAMP at University of Houston March 2, 2015 Houston, Texas Alice Fisher afisher@rice.edu Director of Technology Applications & Integration at Rice University School Mathematics
More informationAnadarko Public Schools MATH Power Standards
Anadarko Public Schools MATH Power Standards Kindergarten 1. Say the number name sequence forward and backward beginning from a given number within the known sequence (counting on, spiral) 2. Write numbers
More informationHandling Data I. Collecting data and using two-way tables
Curriculum Long Term Planning Overview Key Stage 4 Subject Area: Maths Academic Year: 08-9 Year Year 9 Foundation Calculations I Numbers in words/figures, ordering decimals, negatives Rounding to the nearest
More information& ( D. " mnp ' ( ) n 3. n 2. ( ) C. " n
CSE Name Test Summer Last Digits of Mav ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. The time to multiply two n " n matrices is: A. " n C. "% n B. " max( m,n, p). The
More informationCS1800 Discrete Structures Final Version B
CS1800 Discrete Structures Fall 2017 Profs. Aslam, Gold, & Pavlu December 15, 2017 CS1800 Discrete Structures Final Version B Instructions: 1. The exam is closed book and closed notes. You may not use
More informationYEAR 12 Core 1 & 2 Maths Curriculum (A Level Year 1)
YEAR 12 Core 1 & 2 Maths Curriculum (A Level Year 1) Algebra and Functions Quadratic Functions Equations & Inequalities Binomial Expansion Sketching Curves Coordinate Geometry Radian Measures Sine and
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 informationMath 485, Graph Theory: Homework #3
Math 485, Graph Theory: Homework #3 Stephen G Simpson Due Monday, October 26, 2009 The assignment consists of Exercises 2129, 2135, 2137, 2218, 238, 2310, 2313, 2314, 2315 in the West textbook, plus the
More informationDraw a diagram of an empty circular queue and describe it to the reader.
1020_1030_testquestions.text Wed Sep 10 10:40:46 2014 1 1983/84 COSC1020/30 Tests >>> The following was given to students. >>> Students can have a good idea of test questions by examining and trying the
More informationD. Θ nlogn ( ) D. Ο. ). Which of the following is not necessarily true? . Which of the following cannot be shown as an improvement? D.
CSE 0 Name Test Fall 00 Last Digits of Mav ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. The time to convert an array, with priorities stored at subscripts through n,
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 informationMaths Assessment Framework Year 8
Success Criteria for all assessments: Higher Tier Foundation Tier 90% 9 80% 6 80% 8 70% 7 60% 5 60% 6 50% 5 40% 4 Please note the GCSE Mathematics is one of the first GCSEs which will be graded by number
More information) $ f ( n) " %( g( n)
CSE 0 Name Test Spring 008 Last Digits of Mav ID # Multiple Choice. Write your answer to the LEFT of each problem. points each. The time to compute the sum of the n elements of an integer array is: # A.
More informationThe transition: Each student passes half his store of candies to the right. students with an odd number of candies eat one.
Kate s problem: The students are distributed around a circular table The teacher distributes candies to all the students, so that each student has an even number of candies The transition: Each student
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 informationA triangle that has three acute angles Example:
1. acute angle : An angle that measures less than a right angle (90 ). 2. acute triangle : A triangle that has three acute angles 3. angle : A figure formed by two rays that meet at a common endpoint 4.
More informationProblem Set 1. Solution. CS4234: Optimization Algorithms. Solution Sketches
CS4234: Optimization Algorithms Sketches Problem Set 1 S-1. You are given a graph G = (V, E) with n nodes and m edges. (Perhaps the graph represents a telephone network.) Each edge is colored either blue
More information1. A busy airport has 1500 takeo s perday. Provetherearetwoplanesthatmusttake o within one minute of each other. This is from Bona Chapter 1 (1).
Math/CS 415 Combinatorics and Graph Theory Fall 2017 Prof. Readdy Homework Chapter 1 1. A busy airport has 1500 takeo s perday. Provetherearetwoplanesthatmusttake o within one minute of each other. This
More information