WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology

Advertisement


Advertisement
Similar documents
WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology

Mathematics for Algorithm and System Analysis

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Lecture Notes in Discrete Mathematics. Marcel B. Finan Arkansas Tech University c All Rights Reserved

= = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Answer: (a) Since we cannot repeat men on the committee, and the order we select them in does not matter, ( )

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

Every tree contains a large induced subgraph with all degrees odd

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

All trees contain a large induced subgraph having all degrees 1 (mod k)

Why? A central concept in Computer Science. Algorithms are ubiquitous.

PRE-CALCULUS GRADE 12

Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

Indiana State Core Curriculum Standards updated 2009 Algebra I

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

Graphs without proper subgraphs of minimum degree 3 and short cycles

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.

(0, 0) : order 1; (0, 1) : order 4; (0, 2) : order 2; (0, 3) : order 4; (1, 0) : order 2; (1, 1) : order 4; (1, 2) : order 2; (1, 3) : order 4.

CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

INTRODUCTORY SET THEORY

136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

Labeling outerplanar graphs with maximum degree three

SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

Check Digit Schemes and Error Detecting Codes. By Breanne Oldham Union University

1 Definitions. Supplementary Material for: Digraphs. Concept graphs

Predicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal.

Lecture 13 of 41. More Propositional and Predicate Logic

Discrete Mathematics. Hans Cuypers. October 11, 2007

Lecture Notes on Discrete Mathematics

Exponential time algorithms for graph coloring

Discrete Math for Computer Science Students

Applied Liberal Arts Mathematics MAT-105-TE

Abstract Algebra Theory and Applications. Thomas W. Judson Stephen F. Austin State University

Introduction to Modern Algebra

List the elements of the given set that are natural numbers, integers, rational numbers, and irrational numbers. (Enter your answers as commaseparated

Math/Stats 425 Introduction to Probability. 1. Uncertainty and the axioms of probability

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

A TurĂ¡n Type Problem Concerning the Powers of the Degrees of a Graph

Odd induced subgraphs in graphs of maximum degree three

The Mathematics of GIS. Wolfgang Kainz

FACTORING. n = fall in the arithmetic sequence

MA651 Topology. Lecture 6. Separation Axioms.

Equations. #1-10 Solve for the variable. Inequalities. 1. Solve the inequality: Solve the inequality: 4 0

CS510 Software Engineering

The positive minimum degree game on sparse graphs


A Course in Discrete Structures. Rafael Pass Wei-Lung Dustin Tseng

On the number of lines of theorems in the formal system MIU

Primality - Factorization

Book of Proof. Richard Hammack Virginia Commonwealth University

FACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY

A 2-factor in which each cycle has long length in claw-free graphs

Topology-based network security

Beyond Propositional Logic Lukasiewicz s System

Solutions for Practice problems on proofs


GENERATING SETS KEITH CONRAD

GREEN CHICKEN EXAM - NOVEMBER 2012

ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE

The program also provides supplemental modules on topics in geometry and probability and statistics.

COURSE SYLLABUS

Propositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.

Mathematics Review for MS Finance Students

CSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi

A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

(Refer Slide Time: 01.26)

Solutions to In-Class Problems Week 4, Mon.

ROCHESTER INSTITUTE OF TECHNOLOGY COURSE OUTLINE FORM COLLEGE OF SCIENCE. School of Mathematical Sciences

The Set Data Model CHAPTER What This Chapter Is About

EVERY DAY COUNTS CALENDAR MATH 2005 correlated to

Integer Factorization using the Quadratic Sieve

An Introductory Course in Elementary Number Theory. Wissam Raji

MATH 241: DISCRETE MATHEMATICS FOR COMPUTER SCIENCE, Winter CLASSROOM: Alumni Hall 112 Tuesdays and Thursdays, 6:00-8:15 pm

Extra Credit Assignment Lesson plan. The following assignment is optional and can be completed to receive up to 5 points on a previously taken exam.

Predicate Logic Review

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

A single minimal complement for the c.e. degrees

Degree Hypergroupoids Associated with Hypergraphs

South Carolina College- and Career-Ready (SCCCR) Probability and Statistics

Large induced subgraphs with all degrees odd

UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE

This chapter is all about cardinality of sets. At first this looks like a

Primality Testing and Factorization Methods

Computer Algorithms. NP-Complete Problems. CISC 4080 Yanjun Li

Introducing Formal Methods. Software Engineering and Formal Methods

Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes)

Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

The Goldberg Rao Algorithm for the Maximum Flow Problem

Digital Signatures. (Note that authentication of sender is also achieved by MACs.) Scan your handwritten signature and append it to the document?

LAKE ELSINORE UNIFIED SCHOOL DISTRICT

KEANSBURG SCHOOL DISTRICT KEANSBURG HIGH SCHOOL Mathematics Department. HSPA 10 Curriculum. September 2007

1 The Concept of a Mapping

The Open University s repository of research publications and other research outputs

DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS

SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Revised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)

Advertisement
Transcription:

First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Final Examination Spring Session 2008 WUCT121 Discrete Mathematics This exam represents 60% of the total subject marks Reading Time: 5 minutes Time allowed: 3 Hours DIRECTIONS TO CANDIDATES Refer to Page 2 ITC Education Ltd trading as Wollongong College Australia CRICOS 02723D ABN 14105312329 WCA-WUCT121-EXSF Page 1 of 9

DIRECTIONS TO CANDIDATES 1. Total number of questions: 6. 2. All questions are to be attempted. 3. All answers must be written in the Examination Answer Booklet supplied. 4. Questions are of equal value. 5. All working must be clearly shown. 6. Non-programmable calculators may be used. 7. No other examination aids are permitted. 8. Electronic dictionaries are not allowed. 9. Non-English speaking background students may use an approved English to Foreign language translation dictionary 10. The examination paper must not be removed from the examination room and must be submitted with the examination answer booklet. 11. During the 5 minutes reading time, you may make notes on the examination paper only. Answer Booklets must remain closed. WCA-WUCT121-EXSF Page 2 of 9

START OF EXAM Question 1 (a) Using the quick method, prove that the following statement is a tautology: (~ p ~ q) ~ ( p q) (b) Using full truth tables, determine whether the following statement is a tautology, a contradiction, or is contingent: ~ (( q ~ p) ( p ~ q)) ~ (~ p ~ q) [12 marks] (c) Write the following statement in predicate calculus notation using quantifiers and variables: Some students cannot correctly answer all questions in this exam. [8 marks] (d) Write in simple English without using quantifiers or variables: "x Π+, $y Π+, (y < x), where + is the set of positive Real numbers. (e) Write down, then simplify, the negations of each of the statements in parts (c) and (d) using; (i) Predicate calculus notation using quantifiers and variables. (ii) Simple English without using quantifiers and variables. (f) For the following sentence: The statement that all statements are sentences but not all sentences are statements is false. (i) Determine if it is a statement; and explain why or why not. (ii) If it is a statement, determine whether it is true or false, giving reasons for your answer. WCA-WUCT121-EXSF Page 3 of 9

Question 2 (a) Using a direct proof, prove the following statement: 2 + For any real number x, 20( x 1) 4 x 5 (b) Briefly explain how the following tautologies may be used in the method of proof by contradiction: (i) (~ p ( q ~ q)) p (ii) ( p q) (~ q ~ p) (c) Using proof by contradiction or otherwise, prove the following statements: (i) For all integers n, if n 3 is even then n is even. (ii) There is no largest even integer. [8 marks] [8 marks] (d) Consider the following statements: P : Q : R : 2x + 1 = 3 2x = 2 x = 1 If we assume that P is a true statement, explain how these statements, together with Modus Ponens and the Law of Syllogism, can be used to prove that R is also a true statement. [10 marks] (e) Complete the following tautology, which is used in the method of proof by cases: K KKKKKKKK (( p r) KK( q r)) (f) Using proof by cases or otherwise, prove the following statement: For all integers n, 2 n 2 1 is odd. [10 marks] WCA-WUCT121-EXSF Page 4 of 9

Question 3 (a) Use Mathematical Induction to prove that 5 n 1 is divisible by 4 for all n Œ Õ. (b) (i) Use the Euclidean Algorithm to find gcd(126, 39). (ii) Find m, n Œ Ÿ such that 126m 39n = gcd(126, 39). (c) (i) Showing all steps clearly, use the Sieve of Eratosthenes to find all the prime numbers between 2 and 52. [8 marks] (ii) Write down all the twin primes between 2 and 52. (d) Use the Generalized Pigeonhole Principle to justify your answer to the following question: In a group of 2000 students, must at least five have the same day of the year as their birthday? (e) Find a value of x such that x = 5 7 (mod) 17 and 0 x < 17. (f) Write down the complete set of residue classes modulo 11, Ÿ 11. (g) Express each of the elements [ 3], [7], [44] Œ Ÿ 11 as [x] Œ Ÿ 11, 0 x < 11. (h) Let S Ÿ 11 be given by S = {[1], [4], [7]}. (i) Construct the multiplication table for S. [6marks] (ii) Using this table, or otherwise, determine the identity for multiplication and the multiplicative inverses of all the elements in S which have them. WCA-WUCT121-EXSF Page 5 of 9

Question 4 (a) Let = {d, i, s, c, r, e, t, e, m, a, t, h, e, m, a, t, i, c, s} be the Universal set. Let S = {x Œ x Œ {s, e, c, r, e, t, s}}, T = {x Œ x Œ {t, h, e, m, e, s}} and C = {x Œ x Œ {t, a, c, t, i, c, s}} be subsets of the Universal set. (i) Draw a Venn diagram showing S, T, C and. (ii) Write down the following sets: a) S «T c) S C b) T S d) C» T [8 marks] (iii) Which of the following are false? Give reasons. a) c Õ C c) Œ P(S) b) {c} Õ C d) Õ P(S) [8 marks] (b) Briefly explain what is meant by the term Singleton set. (c) Let A = {1} and B = {4, 3, 2}. Write down the following sets: (i) ( A B) (ii) P ( A B) (d) State the Axiom of Specification and the Axiom of Extent. (e) Using (d), and the definitions of Intersection, Difference, and Complement, prove the following statement using a typical element argument: X Y = X Y [12 marks] WCA-WUCT121-EXSF Page 6 of 9

Question 5 (a) Explain what is meant by an ordered pair. (b) Explain what is meant by a binary relation. (c) Explain what is meant by a function from A to B. (d) Explain what is meant by a permutation. (e) Let T be a relation on {1, 2, 3, 4, 5} defined as follows: T = {( x, y) x > y x + y is odd and prime}. (i) Write down the domain and range of T. (ii) Write down the elements and sketch the graph of T. (iii) Write down the elements and sketch the graph of T. (iv) Are either T or T functions? Give a brief explanation why or why not. (v) Are either T or not. T onto {1, 2, 3, 4, 5}? Give a brief explanation why or why (f) Simplify the following permutations: (i) ( 1 2) (4 3) ( 2 5) (ii) ((1 3 5) (4 3 5)) WCA-WUCT121-EXSF Page 7 of 9

Question 6 (a) Explain what is meant by the following terms: (i) A graph (ii) A simple graph (iii) A simple path (b) (i) Draw a graph that is simple and connected. (ii) Draw a graph that is connected but not simple. (c) Draw a graph with the specified properties or explain why no such graph exists: (i) Graph with three vertices of degrees 1, 2, and 3 respectively. (ii) Graph with four vertices of degrees 1, 2, 3, and 4 respectively. (iii) Graph with five vertices of degrees 0, 1, 1, 1, and 5 respectively. (d) Let G = {V, E} be the graph given below: e 1 e 2 v 1 e 4 e 5 e 6 v 3 v 2 e 3 v 4 e 7 (i) Draw the subgraph H 1 or explain why no such subgraph exists. Subgraph H 1 = {{ v1, v2, v4},{ e3, e5, e6}}. (ii) Starting at v 1, write down any circuit of graph G. (iii) Is graph G an Eulerian graph? Explain. (iv) Does an Eulerian path exist in G? Explain. WCA-WUCT121-EXSF Page 8 of 9

(e) For the graph G given in question (d) above, either write down a path with the specified properties, or explain why no such path exists. (i) A simple path of length 3 from v 1 to v 2. (ii) A path of length 4 from v 1 to v 3. (f) Is the graph G given in question (d) above connected? If so, what is the least number of edges you must remove to make the graph disconnected? Give an example. (g) If the edges in graph G have the following weightings, use Kruskal s Algorithm to find a minimum spanning tree for G: e =, e = 7, e = 9, e = 2, e = 6, e = 3, e 1. 1 4 2 3 4 5 6 7 = (h) Label the vertices and edges of the following graphs in any convenient way and show whether or not they are isomorphic. END OF EXAM WCA-WUCT121-EXSF Page 9 of 9