Mathematics Masters Examination
|
|
- Jack Douglas
- 5 years ago
- Views:
Transcription
1 Mathematics Masters Examination OPTION 4 Fall 2015 MATHEMATICAL COMPUTER SCIENCE NOTE: Any student whose answers require clarification may be required to submit to an oral examination. Each of the twelve numbered questions is worth 20 points. All questions will be graded, but your score for the examination will be the sum of your scores on your eight best questions. Please observe the following: DO NOT answer two or more questions on the same sheet (not even on both sides of the same sheet). DO NOT write your name on any of your answer sheets. You will be given separate instructions on the use of these answer sheets. When you have completed a question, place it in the large envelope provided. Fall 15 MCS 1/7
2 Computer Algorithms 1. Consider a collection of n laptops on campus which each need to be connected to one of k possible Wi-Fi base stations. Each laptop and each base station is specified by an (x, y) coordinate in the plane. For each laptop, we wish to connect it to exactly one of the base stations. Our choice of connections is constrained in the following ways: There is a range parameter r: a laptop can only connect to a base station that is within distance r. There is a load parameter L: no more than L laptops can be connected to any single base station. Using network flows, design a polynomial time algorithm for the following problem: given the positions of the laptops and base stations and the parameters r and L as input, decide whether every laptop can be connected simultaneously to a base station, subject to the range and load conditions. You should both describe the algorithm and prove it is correct. The algorithm is as follows. Create a directed graph G, where the vertices of G are a source vertex s, vertices x 1,..., x n for the laptops, vertices y 1,..., y k for the stations, and a sink vertex t. For the edges, add sx i with capacity one for every i, add y j t with capacity L for every j, and for every 1 i n and 1 j k, add an edge x i y j with capacity one if the distance between laptop i and base station j is less than r. Now run Ford-Fulkerson to determine if there exists an integer flow of value n from the source to the sink. If such a flow exists, output assignment exists otherwise output no assignment exists. For the proof of correctness, it is obvious that if Ford-Fulkerson finds a flow of value n there is an assignment. Moreover, if there exists an assignment then such an assignment can be converted to an integer flow of value n in the digraph. An alternate proof could use a min-cut. 2. You are given an array A with n entries, each entry holding a distinct number. You are also told that the sequence of values A[1], A[2],..., A[n] is unimodal: for some index k between 1 and n, the values in the array increase up to position k and then decrease the remainder of the way until position n. Describe an algorithm to find the peak entry k, where the algorithm reads at most O(log n) entries of A. Prove your algorithm accesses only O(log n) entries of A by solving a recurrence. the algorithm is to look at A[ n 1], A[ n], A[ n + 1] to determine if n is on the upslope (before k), downslope (after k), or is the peak. If on the upslope, recurse on indices n n, and if on the downslope, recurse on indices 1... n Fall 15 MCS 2/7
3 The number of accesses of A is bounded by the recurrence T (n) T (n/2) + 3 for n 4 and T (3) 3. Substituting T (n) = 3 log 2 n 3 log 2 ( 3 ) solves the recurrence. 2 Combinatorics 3. Let T n be the set of strings of length n made up of 1s, 2s, and 3s that do not contain consecutive 1s. Let t n be the number of strings in T n. a. Find a recurrence for t n, along with initial conditions t 0 and t 1. (Define t 0 so that the recurrence holds for n 2.) b. Find a formula for t n as a function of n. a. There are three types of strings in T n : Type 1: those that end in 1. This type can be made from adding either 21 or 31 at the end of a string in T n 2, so there are 2 t n 2 of this type. Type 2: those that end in 2. This type can be built by adding 2 at the end of a string in T n 1, so there are t n 1 of this type. Type 3: those that end in 3. Similarly, this type can be built by adding 3 at the end of a string in T n 1, so there are t n 1 of this type. Thus t n = 2t n 1 + 2t n 2, n 2 Initial conditions: t 0 = 1, t 1 = 3. (Could check that this is the correct definition of t 0 by noting that t 2 = = 8. Thus 8 = t 2 = = 2t 1 + 2t 0.) b. The characteristic equation of this recurrence is x 2 2x 2, with solutions x = 1± 3. So t n = c 1 (1 + 3) n + c 2 (1 3) n. Use the initial conditions to solve for c 1 and c 2 : t 0 = 1 = c 1 + c 2, thus c 1 = 1 c 2. And t 1 = 3 = c 1 (1 + 3) + c 2 (1 3). Substituting gives c 2 = 1( ) and c 1 = 1( ). 4. In a small town, n married couples attend a town hall meeting. Each of these 2n people wants to speak exactly once. In how many ways can we schedule the 2n people to speak if no married couple takes two consecutive slots? Let S n be the set of permutations of 2n people. Let A i be the subset of permutations in which married couple i takes consecutive slots. We are looking for A 1 A 2 A n.to compute A i, think of the couple i as being one unit, giving a set of Fall 15 MCS 3/7
4 2n 1 units (the couple, and the 2n 2 other people) to arrange in (2n 1)! ways. There are two ways to arrange the people within the couple, so A i = 2(2n 1)!. Similarly, A i1 A i2 A ij = 2 j (2n j)!. Using the principle of Inclusion-Exclusion, the final answer is, n ( ) n A 1 A 2 A n = (2n)! ( 1) j 2 j (2n j)! j j=1 Graph Theory 5. For which values of r is K r,r a Hamiltonian? b Eulerian? c properly r-edge-colorable? a. It is Hamiltonian for every r 2, indeed, we can construct a Hamiltonian cycle by alternating between the parts. b. It is Eulerian iff r is even by Euler s theorem. c. By Konig s Theorem, χ (G) = (G) for every bipartite graph G. Since K r,r is bipartite and r-regular, it is properly r-edge-colorable for every r Prove Peterson s theorem, that every cubic bridgeless graph has a 1-factor We Apply Tutte s theorem. Take any vertex subset S V (G). An odd component of G S must have an odd number of edges to S since G is cubic, and it cannot have one edge to S as G is bridgeless. Hence every odd component of G S has at least 3 edges to S and we conclude, by counting edges between S and the odd components of G S, that 3o(G S) 3 S. Tutte s theorem now applies. Error-Correcting Codes and Cryptography 7. Given that α is a primitive root mod p, Fall 15 MCS 4/7
5 a. Prove that α x α y mod p if and only if x y mod p 1. b. Show that a = 3 is not a primitive root mod 13. a. One can clearly state definition of primitive root, then reduce to α k 0 mod p, and finally cite Fermat and definition to conclude that k 0 mod p b. One may compute powers of 3mod 13 to see that 3 3 = 1 1 mod Let p be a prime number. a. Suppose you encrypt a message, m, by computing c m e mod p. What numbers, e make good encryptions (i.e. m m e is injective.)? How can you find a decrypting exponent, d, such that c d m mod p? b. If p = 101 and e = 23, find d. Show your calculation steps and explain. a. Expectations are that the student knows that d is the multiplicative inverse mod p 1 and that one can find it using the extended Euclidean Algorithm. Not necesarily to prove the final step. b. Note that d is multiplicative inverse of e mod 100; then solve Diophantine equation: 23 d N = 1 using extended Euclidean Algorithm. Then one can correctly deduce d = 87 mod 100 from the previous calculation. Theory of Computation 9. Consider the language A over Σ = {(, )} of properly balanced parentheses. For example, (()) and (()(()))() are in A but )( is not. a. Show that A L. Remember L = SPACE(log n). b. Is A regular? Why or why not? Fall 15 MCS 5/7
6 a. Keep a counter that begins at 0, incrementing at each ( and decrementing at each ). If the counter ever reaches -1, reject. If the counter ends at 0, accept, otherwise reject. Correctness is clear. Since the counter only needs space logarithmic in the length of the input, this completes the proof. b. No. The language fails the pumping lemma at ( n ) n. 10. Consider the language A = {0 n 1 3n n 1}. a. Design a context free grammar for A. b. Write your grammar in Chomsky normal form. a. A BAC 0111 B 0 C 111. b. S BD BC A BD BC D AC C XY Y XX X 1 B 0 Numerical Analysis 11. Consider the equation x 4 + 6x x 2 + 8x = 0. a. For the solution x = 0 which will converge faster, the Bisection Method or Newton s Method? Justify your answer with explicit estimates of e i, the error after step i. b. For the solution x = 2 which will converge faster, the Bisection Method or Newton s Method? Justify your answer with explicit estimates of e i, the error after step i. Setting f(x) = x 4 + 6x x 2 + 8x our problem is to find its roots by Newton s Method and Bisection. First, the Bisection Method has error which always decays linearly satisfying the estimate e i+1 Se i with S = 1/2. Fall 15 MCS 6/7
7 a. Root r = 0: Given a root r, Newton s method will converge quadratically provided that f (r) 0. In this case e i+1 Me 2 i, M = f (r)/(2f (r)). We have f (x) = 4x x x + 8, f (x) = 12x x + 24, so that f (0) = 8 and f (0) = 24. Thus, for this root we have e i+1 (24/16)e 2 i Newton s Method will converge faster. and b. Root r = 2: If f (r) = 0 then Newton s Method will converge linearly satisfying the estimate e i+1 [(m 1)/m]e i where m is the multiplicity of the root r. Since we have f ( 2) = f ( 2) = 0 while f ( 2) = 12 0, r = 2 is a root of multiplicity three. In this case we know that e i+1 (2/3)e i and the Bisection Method will converge faster. 12. Consider the following cubic spline: { 3 9x + 4x 2 0 < x < 1 S(x) = 2 (x 1) + c(x 1) 2 1 < x < 2. a. Find c in the spline. b. Is this spline natural? Why or why not? c. Is this spline parabolically terminated? Why or why not? d. Is this spline not a knot? Why or why not? We note that S (x) = { 8 0 < x < 1 2c 1 < x < 2. a. To match the second derivative at x = 1 we choose c = 4. b. Since S (0) = 8 0, this is not natural. c. Since d 1 = d n 1 = d 2 = 0, this is parabolically terminated. d. Since d 1 = d 2, this is not a knot. Fall 15 MCS 7/7
Solutions to the Mathematics Masters Examination
Solutions to the Mathematics Masters Examination OPTION 4 Spring 2007 COMPUTER SCIENCE 2 5 PM NOTE: Any student whose answers require clarification may be required to submit to an oral examination. Each
More informationMATH 363: Discrete Mathematics
MATH 363: Discrete Mathematics Learning Objectives by topic The levels of learning for this class are classified as follows. 1. Basic Knowledge: To recall and memorize - Assess by direct questions. The
More informationName: Mathematics 1C03
Name: Student ID Number: Mathematics 1C03 Day Class Instructor: M. Harada Duration: 2.5 hours April 2018 McMaster University PRACTICE Final Examination This is a PRACTICE final exam. The actual final exam
More informationTwitter: @Owen134866 www.mathsfreeresourcelibrary.com Prior Knowledge Check 1) Simplify: a) 3x 2 5x 5 b) 5x3 y 2 15x 7 2) Factorise: a) x 2 2x 24 b) 3x 2 17x + 20 15x 2 y 3 3) Use long division to calculate:
More informationRegular Languages and Finite Automata
Regular Languages and Finite Automata Theorem: Every regular language is accepted by some finite automaton. Proof: We proceed by induction on the (length of/structure of) the description of the regular
More information(a) How many pairs (A, B) are there with A, B [n] and A B? (The inclusion is required to be strict.)
1 Enumeration 11 Basic counting principles 1 June 2008, Question 1: (a) How many pairs (A, B) are there with A, B [n] and A B? (The inclusion is required to be strict) n/2 ( ) n (b) Find a closed form
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 Final Exam Review Session Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Notes 140608 Review Things to Know has
More informationDiscrete Mathematics for CS Fall 2003 Wagner MT2 Soln
CS 70 Discrete Mathematics for CS Fall 2003 Wagner MT2 Soln PRINT your name:, (last) SIGN your name: (first) PRINT your username on cory.eecs: WRITE your section number (101 or 102): This exam is open-book,
More informationCS/MATH 111 Winter 2013 Final Test
CS/MATH 111 Winter 2013 Final Test The test is 2 hours and 30 minutes long, starting at 7PM and ending at 9:30PM There are 8 problems on the test. Each problem is worth 10 points. Write legibly. What can
More informationError Correcting Codes Questions Pool
Error Correcting Codes Questions Pool Amnon Ta-Shma and Dean Doron January 3, 018 General guidelines The questions fall into several categories: (Know). (Mandatory). (Bonus). Make sure you know how to
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationAlgorithms, Probability, and Computing Final Exam HS14
Institute of Theoretical Computer Science Thomas Holenstein, Emo Welzl, Peter Widmayer Algorithms, Probability, and Computing Final Exam HS14 Candidate First name:.........................................................
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Theorems Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationMASTERS EXAMINATION IN MATHEMATICS
MASTERS EXAMINATION IN MATHEMATICS PURE MATH OPTION, Spring 018 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth 0 points.
More informationName (please print) Mathematics Final Examination December 14, 2005 I. (4)
Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,
More informationCOMP/MATH 300 Topics for Spring 2017 June 5, Review and Regular Languages
COMP/MATH 300 Topics for Spring 2017 June 5, 2017 Review and Regular Languages Exam I I. Introductory and review information from Chapter 0 II. Problems and Languages A. Computable problems can be expressed
More informationName: Student ID: Instructions:
Instructions: Name: CSE 322 Autumn 2001: Midterm Exam (closed book, closed notes except for 1-page summary) Total: 100 points, 5 questions, 20 points each. Time: 50 minutes 1. Write your name and student
More informationCHINO VALLEY UNIFIED SCHOOL DISTRICT INSTRUCTIONAL GUIDE ALGEBRA II
CHINO VALLEY UNIFIED SCHOOL DISTRICT INSTRUCTIONAL GUIDE ALGEBRA II Course Number 5116 Department Mathematics Qualification Guidelines Successful completion of both semesters of Algebra 1 or Algebra 1
More informationMASTERS EXAMINATION IN MATHEMATICS
MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION FALL 2010 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth 20 points.
More informationSOLUTION: SOLUTION: SOLUTION:
Convert R and S into nondeterministic finite automata N1 and N2. Given a string s, if we know the states N1 and N2 may reach when s[1...i] has been read, we are able to derive the states N1 and N2 may
More informationAlgorithms Exam TIN093 /DIT602
Algorithms Exam TIN093 /DIT602 Course: Algorithms Course code: TIN 093, TIN 092 (CTH), DIT 602 (GU) Date, time: 21st October 2017, 14:00 18:00 Building: SBM Responsible teacher: Peter Damaschke, Tel. 5405
More informationElliptic Curves Spring 2015 Problem Set #2 Due: 02/20/2015
18.783 Elliptic Curves Spring 2015 Problem Set #2 Due: 02/20/2015 These problems are related to the material covered in Lectures 3-4. I have made every effort to proof-read the problems, but there may
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationCMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade.
More informationSolutions to Practice Final 3
s to Practice Final 1. The Fibonacci sequence is the sequence of numbers F (1), F (2),... defined by the following recurrence relations: F (1) = 1, F (2) = 1, F (n) = F (n 1) + F (n 2) for all n > 2. For
More information1 Acceptance, Rejection, and I/O for Turing Machines
1 Acceptance, Rejection, and I/O for Turing Machines Definition 1.1 (Initial Configuration) If M = (K,Σ,δ,s,H) is a Turing machine and w (Σ {, }) then the initial configuration of M on input w is (s, w).
More informationDiscrete Math Notes. Contents. William Farmer. April 8, Overview 3
April 8, 2014 Contents 1 Overview 3 2 Principles of Counting 3 2.1 Pigeon-Hole Principle........................ 3 2.2 Permutations and Combinations.................. 3 2.3 Binomial Coefficients.........................
More informationCSE 355 Test 2, Fall 2016
CSE 355 Test 2, Fall 2016 28 October 2016, 8:35-9:25 a.m., LSA 191 Last Name SAMPLE ASU ID 1357924680 First Name(s) Ima Regrading of Midterms If you believe that your grade has not been added up correctly,
More informationAlgebra III Chapter 2 Note Packet. Section 2.1: Polynomial Functions
Algebra III Chapter 2 Note Packet Name Essential Question: Section 2.1: Polynomial Functions Polynomials -Have nonnegative exponents -Variables ONLY in -General Form n ax + a x +... + ax + ax+ a n n 1
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation
More informationLecture 3: Miscellaneous Techniques
Lecture 3: Miscellaneous Techniques Rajat Mittal IIT Kanpur In this document, we will take a look at few diverse techniques used in combinatorics, exemplifying the fact that combinatorics is a collection
More informationSubject Area Algebra I Grade Level 9_
MVNTA COMMON CORE TEMPLATE Subject Area Algebra I Grade Level 9_ BUCKET ONE BIG ROCKS Reason quantitatively and use units to solve problems. Understand the concept of a function and use function notation.
More informationExam in Discrete Mathematics
Exam in Discrete Mathematics First Year at the Faculty of Engineering and Science and the Technical Faculty of IT and Design June 4th, 018, 9.00-1.00 This exam consists of 11 numbered pages with 14 problems.
More informationJohns Hopkins Math Tournament 2018 Proof Round: Sequences
Johns Hopkins Math Tournament 2018 Proof Round: Sequences February 17, 2018 Section Total Points Score 1 5 2 20 3 15 4 25 Instructions The exam is worth 60 points; each part s point value is given in brackets
More informationLecture Notes 20: Zero-Knowledge Proofs
CS 127/CSCI E-127: Introduction to Cryptography Prof. Salil Vadhan Fall 2013 Lecture Notes 20: Zero-Knowledge Proofs Reading. Katz-Lindell Ÿ14.6.0-14.6.4,14.7 1 Interactive Proofs Motivation: how can parties
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationQuiz 1 Solutions. Problem 2. Asymptotics & Recurrences [20 points] (3 parts)
Introduction to Algorithms October 13, 2010 Massachusetts Institute of Technology 6.006 Fall 2010 Professors Konstantinos Daskalakis and Patrick Jaillet Quiz 1 Solutions Quiz 1 Solutions Problem 1. We
More informationCS5371 Theory of Computation. Lecture 18: Complexity III (Two Classes: P and NP)
CS5371 Theory of Computation Lecture 18: Complexity III (Two Classes: P and NP) Objectives Define what is the class P Examples of languages in P Define what is the class NP Examples of languages in NP
More information1 Reductions and Expressiveness
15-451/651: Design & Analysis of Algorithms November 3, 2015 Lecture #17 last changed: October 30, 2015 In the past few lectures we have looked at increasingly more expressive problems solvable using efficient
More informationList of Theorems. Mat 416, Introduction to Graph Theory. Theorem 1 The numbers R(p, q) exist and for p, q 2,
List of Theorems Mat 416, Introduction to Graph Theory 1. Ramsey s Theorem for graphs 8.3.11. Theorem 1 The numbers R(p, q) exist and for p, q 2, R(p, q) R(p 1, q) + R(p, q 1). If both summands on the
More informationProblem Set 2. Assigned: Mon. November. 23, 2015
Pseudorandomness Prof. Salil Vadhan Problem Set 2 Assigned: Mon. November. 23, 2015 Chi-Ning Chou Index Problem Progress 1 SchwartzZippel lemma 1/1 2 Robustness of the model 1/1 3 Zero error versus 1-sided
More informationChapter 7 Matchings and r-factors
Chapter 7 Matchings and r-factors Section 7.0 Introduction Suppose you have your own company and you have several job openings to fill. Further, suppose you have several candidates to fill these jobs and
More informationALGEBRA I CCR MATH STANDARDS
RELATIONSHIPS BETWEEN QUANTITIES AND REASONING WITH EQUATIONS M.A1HS.1 M.A1HS.2 M.A1HS.3 M.A1HS.4 M.A1HS.5 M.A1HS.6 M.A1HS.7 M.A1HS.8 M.A1HS.9 M.A1HS.10 Reason quantitatively and use units to solve problems.
More informationMath.3336: Discrete Mathematics. Mathematical Induction
Math.3336: Discrete Mathematics Mathematical Induction Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
More informationBridge to Algebra II Standards for Mathematical Practice
Bridge to Algebra II Standards for Mathematical Practice The Standards for Mathematical Practices are to be interwoven and should be addressed throughout the year in as many different units and tasks as
More informationStudent#: CISC-462 Exam, December XY, 2017 Page 1 of 12
Student#: CISC-462 Exam, December XY, 2017 Page 1 of 12 Queen s University, Faculty of Arts and Science, School of Computing CISC-462 Final Exam, December XY, 2017 (Instructor: Kai Salomaa) INSTRUCTIONS
More informationare the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).
Lecture A jacques@ucsd.edu Notation: N, R, Z, F, C naturals, reals, integers, a field, complex numbers. p(n), S n,, b(n), s n, partition numbers, Stirling of the second ind, Bell numbers, Stirling of the
More informationDiscrete Mathematics (CS503)
Discrete Mathematics (CS503) Module I Suggested Questions Day 1, 2 1. Translate the following statement into propositional logic using the propositions provided: You can upgrade your operating system only
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More information1 ** The performance objectives highlighted in italics have been identified as core to an Algebra II course.
Strand One: Number Sense and Operations Every student should understand and use all concepts and skills from the pervious grade levels. The standards are designed so that new learning builds on preceding
More informationMathematics Exam Category A Practice Paper
Mathematics Exam Category A Practice Paper October 14, 2018 Rules and Regulations Marking Scheme 1. The question paper is divided in two parts: Objective and Subjective. 2. Each objective question is worth
More informationMATH 2200 Final LC Review
MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from
More informationSolution to Problem Set 3
YALE UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE CPSC 467a: Cryptography and Computer Security Handout #11 (rev. 2) Xueyuan Su October 27, 2008 Solution to Problem Set 3 Due on Wednesday, October 22, 2008.
More informationMATH c UNIVERSITY OF LEEDS Examination for the Module MATH2210 (May/June 2004) INTRODUCTION TO DISCRETE MATHEMATICS. Time allowed : 2 hours
This question paper consists of 5 printed pages, each of which is identified by the reference MATH221001 MATH221001 No calculators allowed c UNIVERSITY OF LEEDS Examination for the Module MATH2210 (May/June
More informationFibonacci numbers. Chapter The Fibonacci sequence. The Fibonacci numbers F n are defined recursively by
Chapter Fibonacci numbers The Fibonacci sequence The Fibonacci numbers F n are defined recursively by F n+ = F n + F n, F 0 = 0, F = The first few Fibonacci numbers are n 0 5 6 7 8 9 0 F n 0 5 8 55 89
More information452 FINAL- VERSION E Do not open this exam until you are told. Read these instructions:
1 452 FINAL- VERSION E Do not open this exam until you are told. Read these instructions: 1. This is a closed book exam, though one sheet of notes is allowed. No calculators, or other aids are allowed.
More informationMATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM
MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 10 February 19, 2013 CPSC 467b, Lecture 10 1/45 Primality Tests Strong primality tests Weak tests of compositeness Reformulation
More informationOrganization Team Team ID#
1. [4] A random number generator will always output 7. Sam uses this random number generator once. What is the expected value of the output? 2. [4] Let A, B, C, D, E, F be 6 points on a circle in that
More informationPLEASE DO ANY 6 of the following 8 problems. Work carefully
Ma2201/CS2022 Discrete Mathematics D Term, 2016 FINAL EXAM PRINT NAME NEATLY: SIGN : PLEASE DO ANY 6 of the following 8 problems. Work carefully and neatly. 1. (5 pts) A tech company currently has 5 programmers,
More informationM-saturated M={ } M-unsaturated. Perfect Matching. Matchings
Matchings A matching M of a graph G = (V, E) is a set of edges, no two of which are incident to a common vertex. M-saturated M={ } M-unsaturated Perfect Matching 1 M-alternating path M not M M not M M
More informationUpdated Jan SESSION 4 Permutations Combinations Polynomials
SESSION 4 Permutations Combinations Polynomials Mathematics 30-1 Learning Outcomes Permutations and Combinations General Outcome: Develop algebraic and numeric reasoning that involves combinatorics. Specific
More informationMidterm 1. Your Exam Room: Name of Person Sitting on Your Left: Name of Person Sitting on Your Right: Name of Person Sitting in Front of You:
CS70 Discrete Mathematics and Probability Theory, Fall 2018 Midterm 1 8:00-10:00pm, 24 September Your First Name: SIGN Your Name: Your Last Name: Your Exam Room: Name of Person Sitting on Your Left: Name
More informationLecture 2: Divide and conquer and Dynamic programming
Chapter 2 Lecture 2: Divide and conquer and Dynamic programming 2.1 Divide and Conquer Idea: - divide the problem into subproblems in linear time - solve subproblems recursively - combine the results in
More information1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n).
MATH 135: Randomized Exam Practice Problems These are the warm-up exercises and recommended problems taken from all the extra practice sets presented in random order. The challenge problems have not been
More informationMA Discrete Mathematics
MA2265 - Discrete Mathematics UNIT I 1. Check the validity of the following argument. If the band could not play rock music or the refreshments were not delivered on time, then the New year s party would
More informationCPSC 467b: Cryptography and Computer Security
CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 9 February 14, 2013 CPSC 467b, Lecture 9 1/42 Integer Division (cont.) Relatively prime numbers, Z n, and φ(n) Computing in Z n
More informationPractice Final Exam Winter 2017, CS 485/585 Crypto March 14, 2017
Practice Final Exam Name: Winter 2017, CS 485/585 Crypto March 14, 2017 Portland State University Prof. Fang Song Instructions This exam contains 7 pages (including this cover page) and 5 questions. Total
More informationCS383, Algorithms Spring 2009 HW1 Solutions
Prof. Sergio A. Alvarez http://www.cs.bc.edu/ alvarez/ 21 Campanella Way, room 569 alvarez@cs.bc.edu Computer Science Department voice: (617) 552-4333 Boston College fax: (617) 552-6790 Chestnut Hill,
More informationIVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS. 1. Combinatorics
IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS Combinatorics Go over combinatorics examples in the text Review all the combinatorics problems from homewor Do at least a couple of extra
More informationUniversity of Washington March 21, 2013 Department of Computer Science and Engineering CSEP 521, Winter Exam Solution, Monday, March 18, 2013
University of Washington March 21, 2013 Department of Computer Science and Engineering CSEP 521, Winter 2013 Exam Solution, Monday, March 18, 2013 Instructions: NAME: Closed book, closed notes, no calculators
More informationProb. 1 Prob. 2 Prob. 3 Total
EECS 70 Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai MT 1 Solution PRINT your student ID: PRINT AND SIGN your name:, (last) (first) (signature) PRINT your Unix account login: cs70-
More informationMASTERS EXAMINATION IN MATHEMATICS
MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION FALL 2007 Full points can be obtained for correct answers to 8 questions. Each numbered question (which may have several parts) is worth the same
More information1. The sides of a triangle are in the ratio 3 : 5 : 9. Which of the following words best describes the triangle?
UNIVERSITY OF NORTH CAROLINA CHARLOTTE 999 HIGH SCHOOL MATHEMATICS CONTEST March 8, 999 The sides of a triangle are in the ratio : 5 : 9 Which of the following words best describes the triangle? (A) obtuse
More informationMTH 167 Pre Calculus I (Spring 2015) 3 credits. Department of Mathematics at Cleveland State University
MTH 167 Pre Calculus I (Spring 2015) 3 credits Department of Mathematics at Cleveland State University Section 1 - MWF 12:25pm 1:15pm MC 304 or RT 403. Prof. Feister ALEKS course code: PHMDL-HHXJJ Financial
More information1 Recommended Reading 1. 2 Public Key/Private Key Cryptography Overview RSA Algorithm... 2
Contents 1 Recommended Reading 1 2 Public Key/Private Key Cryptography 1 2.1 Overview............................................. 1 2.2 RSA Algorithm.......................................... 2 3 A Number
More informationAttempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt additional questions.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2017 18 CRYPTOGRAPHY MTHD6025A Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. penalised if you attempt
More informationTrinity Christian School Curriculum Guide
Course Title: Calculus Grade Taught: Twelfth Grade Credits: 1 credit Trinity Christian School Curriculum Guide A. Course Goals: 1. To provide students with a familiarity with the properties of linear,
More informationHOMEWORK 8 SOLUTIONS MATH 4753
HOMEWORK 8 SOLUTIONS MATH 4753 In this homework we will practice taking square roots of elements in F p in F p 2, and study the encoding scheme suggested by Koblitz for use in elliptic curve cryptosystems.
More informationCMPSCI 311: Introduction to Algorithms Second Midterm Exam
CMPSCI 311: Introduction to Algorithms Second Midterm Exam April 11, 2018. Name: ID: Instructions: Answer the questions directly on the exam pages. Show all your work for each question. Providing more
More information12.1 Chromatic Number
12.1 Chromatic Number History of Graph Colorings Theorem The Four Color Theorem: Any planar graph can be colored in at most four colors. But, it wasn t always the Four Color Theorem... Four Color Conjecture
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationMath.3336: Discrete Mathematics. Primes and Greatest Common Divisors
Math.3336: Discrete Mathematics Primes and Greatest Common Divisors Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu
More informationTheory of RSA. Hiroshi Toyoizumi 1. December 8,
Theory of RSA Hiroshi Toyoizumi 1 December 8, 2005 1 E-mail: toyoizumi@waseda.jp 2 Introduction This is brief introduction of number theory related to the so-called RSA cryptography. This handout is based
More informationCounting. Spock's dilemma (Walls and mirrors) call it C(n,k) Rosen, Chapter 5.1, 5.2, 5.3 Walls and Mirrors, Chapter 3 10/11/12
Counting Rosen, Chapter 5.1, 5.2, 5.3 Walls and Mirrors, Chapter 3 Spock's dilemma (Walls and mirrors) n n planets in the solar system n can only visit k
More informationBook announcements. Sukumar Das Adhikari ASPECTS OF COMBINATORICS AND COMBINATORIAL NUMBER THEORY CRC Press, Florida, 2002, 156pp.
Discrete Mathematics 263 (2003) 347 352 www.elsevier.com/locate/disc Book announcements Sukumar Das Adhikari ASPECTS OF COMBINATORICS AND COMBINATORIAL NUMBER THEORY CRC Press, Florida, 2002, 156pp. Notations
More informationCpSc 421 Final Exam December 15, 2006
CpSc 421 Final Exam December 15, 2006 Do problem zero and six of problems 1 through 9. If you write down solutions for more that six problems, clearly indicate those that you want graded. Note that problems
More informationMath Fall Final Exam. Friday, 14 December Show all work for full credit. The problems are worth 6 points each.
Name: Math 50 - Fall 2007 Final Exam Friday, 4 December 2007 Show all work for full credit. The problems are worth 6 points each.. Find the number of subsets of S = {, 2,... 0} that contain exactly 5 elements,
More informationMath.3336: Discrete Mathematics. Chapter 9 Relations
Math.3336: Discrete Mathematics Chapter 9 Relations Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall 2018
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationDefinition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.
4 Functions Before studying functions we will first quickly define a more general idea, namely the notion of a relation. A function turns out to be a special type of relation. Definition: Let S and T be
More informationTime Complexity (1) CSCI Spring Original Slides were written by Dr. Frederick W Maier. CSCI 2670 Time Complexity (1)
Time Complexity (1) CSCI 2670 Original Slides were written by Dr. Frederick W Maier Spring 2014 Time Complexity So far we ve dealt with determining whether or not a problem is decidable. But even if it
More informationNORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION
NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION 011-1 DISCRETE MATHEMATICS (EOE 038) 1. UNIT I (SET, RELATION,
More informationDiscrete Structures, Final Exam
Discrete Structures, Final Exam Monday, May 11, 2009 SOLUTIONS 1. (40 pts) Short answer. Put your answer in the box. No partial credit. [ ] 0 1 (a) If A = and B = 1 0 [ ] 0 0 1. 0 1 1 [ 0 1 1 0 0 1 ],
More informationHigh School Algebra I Scope and Sequence by Timothy D. Kanold
High School Algebra I Scope and Sequence by Timothy D. Kanold First Semester 77 Instructional days Unit 1: Understanding Quantities and Expressions (10 Instructional days) N-Q Quantities Reason quantitatively
More informationPrimitive Digraphs with Smallest Large Exponent
Primitive Digraphs with Smallest Large Exponent by Shahla Nasserasr B.Sc., University of Tabriz, Iran 1999 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE
More informationDISCRETE STRUCTURES AMIN WITNO
DISCRETE STRUCTURES AMIN WITNO p h i. w i t n o. c o m Discrete Structures Revision Notes and Problems Amin Witno Preface These notes were prepared for students as a revision workbook
More informationPolynomial and Rational Functions. Copyright Cengage Learning. All rights reserved.
2 Polynomial and Rational Functions Copyright Cengage Learning. All rights reserved. 2.3 Real Zeros of Polynomial Functions Copyright Cengage Learning. All rights reserved. What You Should Learn Use long
More information