Bachelor s Degree Programme Discrete Mathematics (Valid from 1st January, 2013 to 31st December, 2013.)

Size: px
Start display at page:

Download "Bachelor s Degree Programme Discrete Mathematics (Valid from 1st January, 2013 to 31st December, 2013.)"

Transcription

1 MTE-13 ASSIGNMENT BOOKLET Bachelor s Degree Programme Discrete Mathematics (Valid from 1st January, 2013 to 31st December, 2013.) It is compulsory to submit the assignment before filling in the exam form. School of Sciences Indira Gandhi National Open University Maidan Garhi, New Delhi (For January, 2013 cycle)

2 Dear Student, Please read the section on assignments in the Programme Guide for elective Courses that we sent you after your enrolment. As you may know already from the programme guide, the continuous evaluation component has 30% weightage. This assignment is for the continuous evaluation component of the course. Instructions for Formating Your Assignments Before attempting the assignment please read the following instructions carefully. 1) On top of the first page of your answer sheet, please write the details exactly in the following format: ROLL NO : NAME : ADDRESS : COURSE CODE : COURSE TITLE : STUDY CENTRE : DATE PLEASE FOLLOW THE ABOVE FORMAT STRICTLY TO FACILITATE EVALUATION AND TO AVOID DELAY. 2) Use only foolscap size writing paper (but not of very thin variety) for writing your answers. 3) Leave a 4 cm margin on the left, top and bottom of your answer sheet. 4) Your answers should be precise. 5) While solving problems, clearly indicate which part of which question is being solved. 6) This assignment is valid only up to December, If you fail in this assignment or fail to submit it by December, 2013, then you need to get the assignment for the January 2014 cycle and submit it as per the instructions given in the Programme Guide. We strongly suggest that you retain a copy of your answer sheets. Wish you good luck. 2

3 Assignment (To be done after studying the Blocks) Course Code: MTE - 13 Assignment Code: MTE-13/TMA/2013 Maximum Marks: 100 1) Which of the following statements are true and which are false? Give reasons for your answer. i) The statement If x 2 + y 2 = 0 for any two positive integers x and y, then xy is a prime. is false. i iv) The sentence There is no smoke without fire. is a statement. The Boolean expression (x 1 x 2 ) (x 1 x 3 ) is in conjunctive normal form. If three students are to be allotted hostel rooms and there are four vacant rooms, this can be done in 20 ways. v) If 5 points are chosen at random inside a square of side 2 cm, then the distance between at least two of these points will be atmost 2 cm. vi) a n = a n 2 + n, a 1 = 0 where n is a power of 2 is a linear recurrence relation. v The generating function of the sequence {1,2,3,4,...,n...} is (1 z) 2. vi If g(x) is the generating function for {a n }, the (1 x)g(x) is the generating function for the sequence {b n } where b n = a n 1 n. ix) Any graph is isomorphic to its complement. x) Any bipartite graph is planar. (20) 2) a) Consider the propositions 2+3=5 and The Sun rises in the West. i) Write the disjunction of the statements and give its truth value. Write the conjunction of the statements and give its truth value. i Write the exclusive disjunction of the statements and give its truth value. (3) b) Rewrite the following statements using logical quantifiers. Also write down the negation of the statements, both using logical quantifiers and as mathematical statements. (3) i) The minimum temperature in Delhi was less than 17 in December this year. Every odd natural number is the sum of three odd primes. c) Write down the converse of each of the following statements: i) If p is a prime number and a and b are any two natural numbers and if p divides a or b, then p divides ab. In a triangle ABC if AB 2 + AC 2 = BC 2, then BAC = 90. (2) 3

4 d) Apply precedence rules to find the truth value of the statement p q r q if p is the statement 2+3=5, q is the statement The Sun rises in the East and r is the statement If x 2 +y 2 = 0 for x, y R, then x = 0, y = 0. (2) 3) a) If a second order linear recurrence with constant coefficients 4u n + au n 1 + bu n 2 = f(n),(n 2) has the solution u n = 1 2n n. Determine a, b and f(n). b) A bank pays you 4.5% interest per year. In addition, you receive Rs.100 as bonus at the end of the year(after the interest is paid). Find a recurrence for the amount of money after n years if you invest Rs (10) 4) a) Consider the number of words of length n made by using letters a and b that do not contain 2 consecutive a s. Denote this number by a n. i) What are the values of a 1, a 2, a 3 and a 4? Derive a recurrence relation for a n and solve it. b) Consider the graph given below: i) Write the degree sequence of the graph. i Exhibit a cycle of length 9 in this graph. Does this have any complete graph as its subgraph? If yes, exhibit one. iv) Find δ(g) and (G) for this graph. (10) 5) a) Write the expression x 1 x 2 x 3 x 4 in conjunctive normal form and disjunctive normal form. (6) b) Find the Boolean expressions that represent the output of the logical circuits in Fig. 1. (4) 6) a) Use( generating )( ) function ( to prove the identity r s r + s = k n k n n k=0 ). (5) b) Solve the recurrence relation (5) b n = b n 1 + n 2 + n(n + 1) 2 7) a) Show that a total of letter words can be formed with the letters of the word ABRA- CADABRA. 4

5 Figure 1: Figure for exercise 5(b) b) From a survey of 120 people, the following data was obtained: 90 owned a car, 35 owned a computer, 40 owned a house, 32 owned a car and a house, 21 owned a house and a computer, 26 owned a car and a computer, 17 owned all the three. i) How many people owned neither of the three? How many people owned only a car? i How many people owned only a computer? (10) 8) a) Consider the graph given below: i) Draw its complement. 5

6 Show that each of the graphs in Fig. 3 is isomorphic to one of the subgraphs of the graph in Fig. 2. For example, you can show that the graph in Fig. 4 is isomorphic to a subgraph of the graph in Fig. 2 by producing the subgraph H with V(H) = {f,b,d,c}, E(H) = {(f,b),(b,c),(c,d),(d,f)} and the isomorphism g(f) = a,g(b) = B,g(c) = D,g(d) = C. b) Is it possible to draw a 6 regular graph on 11 vertices? If yes, draw such a graph. If no, give reasons for your answer. (10) 9) a) Draw the Ferrar graph of the following partitions: i) 21 = = Also, write down the conjugate partitions of each of these partitions. (4) b) Using the recurrence relation S m n+1 = Sm 1 n + ms m n, calculate the values of S m n for 1 m,n 6. (6) 6

ASSIGNMENT BOOKLET. Bachelor's Degree Programme LINEAR ALGEBRA. It is compulsory to submit the assignment before filling in the exam form.

ASSIGNMENT BOOKLET. Bachelor's Degree Programme LINEAR ALGEBRA. It is compulsory to submit the assignment before filling in the exam form. ASSIGNMENT BOOKLET MTE- Bachelor's Degree Programme LINEAR ALGEBRA (Valid from st January, to st December, ) It is compulsory to submit the assignment before filling in the exam form. School of Sciences

More information

ASSIGNMENT BOOKLET. Numerical Analysis (MTE-10) (Valid from 1 st July, 2011 to 31 st March, 2012)

ASSIGNMENT BOOKLET. Numerical Analysis (MTE-10) (Valid from 1 st July, 2011 to 31 st March, 2012) ASSIGNMENT BOOKLET MTE-0 Numerical Analysis (MTE-0) (Valid from st July, 0 to st March, 0) It is compulsory to submit the assignment before filling in the exam form. School of Sciences Indira Gandhi National

More information

ASSIGNMENT BOOKLET. Mathematical Methods (MTE-03) (Valid from 1 st July, 2011 to 31 st March, 2012)

ASSIGNMENT BOOKLET. Mathematical Methods (MTE-03) (Valid from 1 st July, 2011 to 31 st March, 2012) ASSIGNMENT BOOKLET MTE-03 Mathematical Methods (MTE-03) (Valid from 1 st July, 011 to 31 st March, 01) It is compulsory to submit the assignment before filling in the exam form. School of Sciences Indira

More information

School of Sciences Indira Gandhi National Open University Maidan Garhi, New Delhi (For January 2012 cycle)

School of Sciences Indira Gandhi National Open University Maidan Garhi, New Delhi (For January 2012 cycle) MTE-0 ASSIGNMENT BOOKLET Bachelor's Degree Programme Numerical Analysis (MTE-0) (Valid from st January, 0 to st December, 0) School of Sciences Indira Gandhi National Open University Maidan Garhi, New

More information

ASSIGNMENT BOOKLET. M.Sc. (Mathematics with Applications in Computer Science) Differential Equations and Numerical Solutions (MMT-007)

ASSIGNMENT BOOKLET. M.Sc. (Mathematics with Applications in Computer Science) Differential Equations and Numerical Solutions (MMT-007) ASSIGNMENT BOOKLET MMT-007 M.Sc. (Mathematics with Applications in Computer Science) Differential Equations and Numerical Solutions (MMT-007) School of Sciences Indira Gandhi National Open University Maidan

More information

M.Sc.(Mathematics with Applications in Computer Science) Probability and Statistics

M.Sc.(Mathematics with Applications in Computer Science) Probability and Statistics MMT-008 Assignment Booklet M.Sc.(Mathematics with Applications in Computer Science) Probability and Statistics (Valid from 1 st July, 013 to 31 st May, 014) It is compulsory to submit the assignment before

More information

Bachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.)

Bachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.) AOR-01 ASSIGNMENT BOOKLET Bachelor s Degree Programme Operations Research (Valid from 1st January, 2012 to 30th November, 2012.) It is compulsory to submit the assignment before filling in the exam form.

More information

ASSIGNMENT BOOKLET. Organic Chemistry. Bachelor s Degree Programme (B.Sc.) Please Note

ASSIGNMENT BOOKLET. Organic Chemistry. Bachelor s Degree Programme (B.Sc.) Please Note CE-05 ASSIGNMENT BOOKLET Organic Chemistry Bachelor s Degree Programme (B.Sc.) (Valid from st July, 03 to 3 st March, 04) Please Note You can take electives (56 to 64 credits) from a minimum of TWO and

More information

ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc.) ORGANIC REACTION MECHANISM. Please Note

ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc.) ORGANIC REACTION MECHANISM. Please Note ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc.) ORGANIC REACTION MECHANISM CHE-06 Valid from 1 st January to 31 st December 2014 It is compulsory to submit the Assignment before filling in the Term-End

More information

ASSIGNMENT BOOKLET. Organic Chemistry. Bachelor s Degree Programme (B.Sc.) (Valid from July 1, 2011 to March 31, 2012) Please Note

ASSIGNMENT BOOKLET. Organic Chemistry. Bachelor s Degree Programme (B.Sc.) (Valid from July 1, 2011 to March 31, 2012) Please Note ASSIGNMENT BKLET HE-05 rganic hemistry Bachelor s Degree Programme (B.Sc.) (Valid from July 1, 2011 to March 31, 2012) It is compulsory to submit the assignment before filling in the exam form Please Note

More information

ASSIGNMENT BOOKLET Bachelor's Degree Programme (B.Sc.) ELEMENTARY MECHANICS. Please Note

ASSIGNMENT BOOKLET Bachelor's Degree Programme (B.Sc.) ELEMENTARY MECHANICS. Please Note ASSIGNMENT BOOKLET Bachelor's Degree Programme (B.Sc.) BPHE-101/PHE-01 PHE-01 ELEMENTARY MECHANICS Valid from January 1, 2013 to December 31, 2013 It is compulsory to submit the Assignment before filling

More information

Chapter 5: Section 5-1 Mathematical Logic

Chapter 5: Section 5-1 Mathematical Logic Chapter 5: Section 5-1 Mathematical Logic D. S. Malik Creighton University, Omaha, NE D. S. Malik Creighton University, Omaha, NE Chapter () 5: Section 5-1 Mathematical Logic 1 / 29 Mathematical Logic

More information

ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc./B.A./B.Com.) MATHEMATICAL MODELLING

ASSIGNMENT BOOKLET Bachelor s Degree Programme (B.Sc./B.A./B.Com.) MATHEMATICAL MODELLING ASSIGNMENT BOOKLET Bachelor s Degree Prograe (B.Sc./B.A./B.Co.) MTE-14 MATHEMATICAL MODELLING Valid fro 1 st January, 18 to 1 st Deceber, 18 It is copulsory to subit the Assignent before filling in the

More information

Test Bank Questions. (a) Is there an integer n such that n has? (b) Does there exist such that if n is divided by 4 the remainder is 1 and if?

Test Bank Questions. (a) Is there an integer n such that n has? (b) Does there exist such that if n is divided by 4 the remainder is 1 and if? Discrete Mathematics with Applications, 4th Edition by Susanna S. Epp Chapter 1 Test Bank Questions 1. Fill in the blanks to rewrite the following statement with variables: Is there an integer with a remainder

More information

CSC 125 :: Final Exam May 3 & 5, 2010

CSC 125 :: Final Exam May 3 & 5, 2010 CSC 125 :: Final Exam May 3 & 5, 2010 Name KEY (1 5) Complete the truth tables below: p Q p q p q p q p q p q T T T T F T T T F F T T F F F T F T T T F F F F F F T T 6-15. Match the following logical equivalences

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Fall 2017 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

DISCRETE STRUCTURES WEEK5 LECTURE1

DISCRETE STRUCTURES WEEK5 LECTURE1 DISCRETE STRUCTURES WEEK5 LECTURE1 Let s get started with... Logic! Spring 2010 CPCS 222 - Discrete Structures 2 Logic Crucial for mathematical reasoning Important for program design Used for designing

More information

ASSIGNMENT BOOKLET Bachelor's Degree Programme ASTRONOMY AND ASTROPHYSICS. Please Note

ASSIGNMENT BOOKLET Bachelor's Degree Programme ASTRONOMY AND ASTROPHYSICS. Please Note ASSIGNMENT BOOKLET Bachelor's Degree Programme PHE-15 ASTRONOMY AND ASTROPHYSICS Valid from July 1, 2011 to March 31, 2012 It is compulsory to submit the Assignment before filling in the Term-End Examination

More information

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction. Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent

More information

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the

More information

Mathematical Reasoning (Part I) 1

Mathematical Reasoning (Part I) 1 c Oksana Shatalov, Spring 2017 1 Mathematical Reasoning (art I) 1 Statements DEFINITION 1. A statement is any declarative sentence 2 that is either true or false, but not both. A statement cannot be neither

More information

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook) Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or

More information

MAT 101 Exam 2 Logic (Part I) Fall Circle the correct answer on the following multiple-choice questions.

MAT 101 Exam 2 Logic (Part I) Fall Circle the correct answer on the following multiple-choice questions. Name: MA 101 Exam 2 Logic (Part I) all 2017 Multiple-Choice Questions [5 pts each] Circle the correct answer on the following multiple-choice questions. 1. Which of the following is not a statement? a)

More information

CS1800 Discrete Structures Final Version A

CS1800 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 information

DISCRETE STRUCTURES AMIN WITNO

DISCRETE 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 information

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman.

Section A (not in the text) Which of the following are statements? Explain. 3. The President of the United States in 2089 will be a woman. Math 299 Homework Assignment, Chapter 2 Section 2.1 2.A (not in the text) Which of the following are statements? Explain. 1. Let x be a positive integer. Then x is rational. 2. Mathematics is fun. 3. The

More information

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The

More information

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

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 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 information

Connectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional

Connectives Name Symbol OR Disjunction And Conjunction If then Implication/ conditional If and only if Bi-implication / biconditional Class XI Mathematics Ch. 14 Mathematical Reasoning 1. Statement: A sentence which is either TRUE or FALSE but not both is known as a statement. eg. i) 2 + 2 = 4 ( it is a statement which is true) ii) 2

More information

Discrete Structures for Computer Science

Discrete Structures for Computer Science Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #4: Predicates and Quantifiers Based on materials developed by Dr. Adam Lee Topics n Predicates n

More information

1. a. Give the converse and the contrapositive of the implication If it is raining then I get wet.

1. a. Give the converse and the contrapositive of the implication If it is raining then I get wet. VALLIAMMAI ENGINEERING COLLEGE DEPARTMENT OF MATHEMATICS SUB CODE/ TITLE: MA6566 DISCRETE MATHEMATICS QUESTION BANK Academic Year : 015-016 UNIT I LOGIC AND PROOFS PART-A 1. Write the negation of the following

More information

MATH 2200 Final LC Review

MATH 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 information

CSC Discrete Math I, Spring Propositional Logic

CSC Discrete Math I, Spring Propositional Logic CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)

More information

Unit i) 1)verify that [p->(q->r)] -> [(p->q)->(p->r)] is a tautology or not? 2) simplify the Boolean expression xy+(x+y) + y

Unit i) 1)verify that [p->(q->r)] -> [(p->q)->(p->r)] is a tautology or not? 2) simplify the Boolean expression xy+(x+y) + y Unit i) 1)verify that [p->(q->r)] -> [(p->q)->(p->r)] is a tautology or not? 2) simplify the Boolean expression xy+(x+y) + y 3)find a minimal sum of product representation f(w,x,y)= m(1,2,5,6) 4)simplify

More information

MATH 2200 Final Review

MATH 2200 Final Review MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics

More information

Introduction to Sets and Logic (MATH 1190)

Introduction to Sets and Logic (MATH 1190) Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition

More information

Math 13, Spring 2013, Lecture B: Midterm

Math 13, Spring 2013, Lecture B: Midterm Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.

More information

(c) Give a proof of or a counterexample to the following statement: (3n 2)= n(3n 1) 2

(c) Give a proof of or a counterexample to the following statement: (3n 2)= n(3n 1) 2 Question 1 (a) Suppose A is the set of distinct letters in the word elephant, B is the set of distinct letters in the word sycophant, C is the set of distinct letters in the word fantastic, and D is the

More information

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic

CHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic CHAPER 1 MAHEMAICAL LOGIC 1.1 undamentals of Mathematical Logic Logic is commonly known as the science of reasoning. Some of the reasons to study logic are the following: At the hardware level the design

More information

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement

More information

UNIVERSITI TENAGA NASIONAL. College of Information Technology

UNIVERSITI TENAGA NASIONAL. College of Information Technology UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours

More information

Midterm Preparation Problems

Midterm Preparation Problems Midterm Preparation Problems The following are practice problems for the Math 1200 Midterm Exam. Some of these may appear on the exam version for your section. To use them well, solve the problems, then

More information

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional Logical Operators Conjunction Disjunction Negation Exclusive Or Implication Biconditional 1 Statement meaning p q p implies q if p, then q if p, q when p, q whenever p, q q if p q when p q whenever p p

More information

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION COURSE II. Wednesday, August 16, :30 to 11:30 a.m.

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION COURSE II. Wednesday, August 16, :30 to 11:30 a.m. The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION THREE-YEAR SEQUENCE FOR HIGH SCHOOL MATHEMATICS COURSE II Wednesday, August 16, 000 8:30 to 11:30 a.m., only Notice... Scientific

More information

Section L.1- Introduction to Logic

Section L.1- Introduction to Logic Section L.1- Introduction to Logic Definition: A statement, or proposition, is a declarative sentence that can be classified as either true or false, but not both. Example 1: Which of the following are

More information

Chapter 2: The Logic of Quantified Statements. January 22, 2010

Chapter 2: The Logic of Quantified Statements. January 22, 2010 Chapter 2: The Logic of Quantified Statements January 22, 2010 Outline 1 2.1- Introduction to Predicates and Quantified Statements I 2 2.2 - Introduction to Predicates and Quantified Statements II 3 2.3

More information

CSE 20. Final Review. CSE 20: Final Review

CSE 20. Final Review. CSE 20: Final Review CSE 20 Final Review Final Review Representation of integers in base b Logic Proof systems: Direct Proof Proof by contradiction Contraposetive Sets Theory Functions Induction Final Review Representation

More information

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus

More information

1.1 P, NP, and NP-complete

1.1 P, NP, and NP-complete CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Introduction to NP-complete Problems Date: 11/01/2008 Lecturer: Lap Chi Lau Scribe: Jerry Jilin Le This lecture gives a general introduction

More information

Logic and Propositional Calculus

Logic and Propositional Calculus CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know

More information

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class

CSCI Homework Set 1 Due: September 11, 2018 at the beginning of class CSCI 3310 - Homework Set 1 Due: September 11, 2018 at the beginning of class ANSWERS Please write your name and student ID number clearly at the top of your homework. If you have multiple pages, please

More information

Logic. Def. A Proposition is a statement that is either true or false.

Logic. Def. A Proposition is a statement that is either true or false. Logic Logic 1 Def. A Proposition is a statement that is either true or false. Examples: Which of the following are propositions? Statement Proposition (yes or no) If yes, then determine if it is true or

More information

Course Staff. Textbook

Course Staff. Textbook Course Staff CS311H: Discrete Mathematics Intro and Propositional Logic Instructor: Işıl Dillig Instructor: Prof. Işıl Dillig TAs: Jacob Van Geffen, Varun Adiga, Akshay Gupta Class meets every Monday,

More information

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction

More information

ECOM Discrete Mathematics

ECOM Discrete Mathematics ECOM 2311- Discrete Mathematics Chapter # 1 : The Foundations: Logic and Proofs Fall, 2013/2014 ECOM 2311- Discrete Mathematics - Ch.1 Dr. Musbah Shaat 1 / 85 Outline 1 Propositional Logic 2 Propositional

More information

Do not start until you are given the green signal

Do not start until you are given the green signal SOLUTIONS CSE 311 Winter 2011: Midterm Exam (closed book, closed notes except for 1-page summary) Total: 100 points, 5 questions. Time: 50 minutes Instructions: 1. Write your name and student ID on the

More information

REVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms

REVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms REVIEW QUESTIONS Chapter 1: Foundations: Sets, Logic, and Algorithms 1. Why can t a Venn diagram be used to prove a statement about sets? 2. Suppose S is a set with n elements. Explain why the power set

More information

Proofs. Joe Patten August 10, 2018

Proofs. Joe Patten August 10, 2018 Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Describe and use algorithms for integer operations based on their expansions Relate algorithms for integer

More information

JULY EXAMINATION 2015 MATHEMATICS GRADE 12 PAPER 1: LO 1, LO 2 PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY

JULY EXAMINATION 2015 MATHEMATICS GRADE 12 PAPER 1: LO 1, LO 2 PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY JULY EXAMINATION 015 MATHEMATICS GRADE 1 PAPER 1: LO 1, LO Time: hours Total: 150 PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY 1. This question paper consists of 6 pages, graph paper, and a separate

More information

CSC 125 :: Final Exam December 14, 2011

CSC 125 :: Final Exam December 14, 2011 1-5. Complete the truth tables below: CSC 125 :: Final Exam December 14, 2011 p q p q p q p q p q p q T T F F T F T F (6 9) Let p be: Log rolling is fun. q be: The sawmill is closed. Express these as English

More information

CSC 125 :: Final Exam December 15, 2010

CSC 125 :: Final Exam December 15, 2010 1-5. Complete the truth tables below: CSC 125 :: Final Exam December 15, 2010 p q p q p q p q p q p q T T F F T F T F 6-13. Fill in the missing portion of each of the rules of inference named below: 6.

More information

Discrete Math I Exam II (2/9/12) Page 1

Discrete Math I Exam II (2/9/12) Page 1 Discrete Math I Exam II (/9/1) Page 1 Name: Instructions: Provide all steps necessary to solve the problem. Simplify your answer as much as possible. Additionally, clearly indicate the value or expression

More information

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel

LECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is

More information

~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~

~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~ MAT 101 Solutions Exam 2 (Logic, Part I) Multiple-Choice Questions 1. D Because this sentence contains exactly ten words, it is stating that it is false. But if it is taken to be false, then it has to

More information

CS/IT OPERATING SYSTEMS

CS/IT OPERATING SYSTEMS CS/IT 5 (CR) Total No. of Questions :09] [Total No. of Pages : 0 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 06 CS/IT OPERATING SYSTEMS. a) System Boot Answer Question No. Compulsory. Answer One Question

More information

Basic Logic and Proof Techniques

Basic Logic and Proof Techniques Chapter 3 Basic Logic and Proof Techniques Now that we have introduced a number of mathematical objects to study and have a few proof techniques at our disposal, we pause to look a little more closely

More information

IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS. 1. Combinatorics

IVA 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 information

8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2

8. Given a rational number r, prove that there exist coprime integers p and q, with q 0, so that r = p q. . For all n N, f n = an b n 2 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 information

MA Discrete Mathematics

MA 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 information

MAT 243 Test 1 SOLUTIONS, FORM A

MAT 243 Test 1 SOLUTIONS, FORM A t MAT 243 Test 1 SOLUTIONS, FORM A 1. [10 points] Rewrite the statement below in positive form (i.e., so that all negation symbols immediately precede a predicate). ( x IR)( y IR)((T (x, y) Q(x, y)) R(x,

More information

Sample Copy. Not For Distribution.

Sample Copy. Not For Distribution. A Text Book of 'Logic and Sets' (Skill Enhancement Course) CBCS Pattern i Publishing-in-support-of, EDUCREATION PUBLISHING RZ 94, Sector - 6, Dwarka, New Delhi - 110075 Shubham Vihar, Mangla, Bilaspur,

More information

Chapter 1: The Logic of Compound Statements. January 7, 2008

Chapter 1: The Logic of Compound Statements. January 7, 2008 Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive

More information

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements. 1. Find the truth tables of each of the following compound statements. (a) ( (p q)) (p q), p q p q (p q) q p q ( (p q)) (p q) 0 0 0 1 1 1 1 0 1 0 1 0 0 0 1 0 0 1 1 1 1 1 1 1 0 0 1 0 (b) [p ( p q)] [( (p

More information

University of California, San Diego Department of Computer Science and Engineering CSE 20. Solutions to Midterm Exam Winter 2018

University of California, San Diego Department of Computer Science and Engineering CSE 20. Solutions to Midterm Exam Winter 2018 University of California, San Diego Department of Computer Science and Engineering CSE 20 Solutions to Midterm Exam Winter 2018 Problem 1 (30 points) a. The boolean function f(p, q) = (q p) ( q p) is specified

More information

Simplification by Truth Table and without Truth Table

Simplification by Truth Table and without Truth Table SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : June 2017 (Scan the above Q.R code for the direct download of this material)

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION COURSE I. Tuesday, June 19, :15 to 4:15 p.m., only

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION COURSE I. Tuesday, June 19, :15 to 4:15 p.m., only The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION THREE-YEAR SEQUENCE FOR HIGH SCHOOL MATHEMATICS COURSE I Tuesday, June 19, 2001 1:15 to 4:15 p.m., only Notice... Scientific calculators

More information

*Final Exam* EECS 203 Spring 2015

*Final Exam* EECS 203 Spring 2015 *Final Exam* EECS 203 Spring 2015 Name (Print): uniqname (Print): Instructions. You have 120 minutes to complete this exam. You may have one page of notes (8.5x11.5 two-sided) but may not use any other

More information

Logic. Facts (with proofs) CHAPTER 1. Definitions

Logic. Facts (with proofs) CHAPTER 1. Definitions CHAPTER 1 Logic Definitions D1. Statements (propositions), compound statements. D2. Truth values for compound statements p q, p q, p q, p q. Truth tables. D3. Converse and contrapositive. D4. Tautologies

More information

Simplification by Truth Table and without Truth Table

Simplification by Truth Table and without Truth Table SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : April-May 2018 BOOK FOR REFERENCE To buy the book visit : Sri Hariganesh

More information

CS 250/251 Discrete Structures I and II Section 005 Fall/Winter Professor York

CS 250/251 Discrete Structures I and II Section 005 Fall/Winter Professor York CS 250/251 Discrete Structures I and II Section 005 Fall/Winter 2013-2014 Professor York Practice Quiz March 10, 2014 CALCULATORS ALLOWED, SHOW ALL YOUR WORK 1. Construct the power set of the set A = {1,2,3}

More information

Math 10850, fall 2017, University of Notre Dame

Math 10850, fall 2017, University of Notre Dame Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need

More information

CS1800 Discrete Structures Fall 2016 Profs. Gold & Schnyder April 25, CS1800 Discrete Structures Final

CS1800 Discrete Structures Fall 2016 Profs. Gold & Schnyder April 25, CS1800 Discrete Structures Final CS1800 Discrete Structures Fall 2016 Profs. Gold & Schnyder April 25, 2017 CS1800 Discrete Structures Final Instructions: 1. The exam is closed book and closed notes. You may not use a calculator or any

More information

https://vu5.sfc.keio.ac.jp/slide/

https://vu5.sfc.keio.ac.jp/slide/ 1 FUNDAMENTALS OF LOGIC NO.2 PROPOSITION AND TRUTH VALUE Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ Proposition A Proposition is a statement of which truth does

More information

Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here.

Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. Chapter 2 Mathematics and Logic Before you get started, make sure you ve read Chapter 1, which sets the tone for the work we will begin doing here. 2.1 A Taste of Number Theory In this section, we will

More information

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.

Chapter Summary. Propositional Logic. Predicate Logic. Proofs. The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1. Chapter 1 Chapter Summary Propositional Logic The Language of Propositions (1.1) Applications (1.2) Logical Equivalences (1.3) Predicate Logic The Language of Quantifiers (1.4) Logical Equivalences (1.4)

More information

Propositional Logic Not Enough

Propositional Logic Not Enough Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks

More information

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION COURSE I. Tuesday, June 20, :15 to 4:15 p.m., only

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION COURSE I. Tuesday, June 20, :15 to 4:15 p.m., only The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION THREE-YEAR SEQUENCE FOR HIGH SCHOOL MATHEMATICS COURSE I Tuesday, June 0, 000 :5 to :5 p.m., only Notice... Scientific calculators

More information

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives Logic Logic is study of abstract reasoning, specifically, concerned with whether reasoning is correct. Logic focuses on relationship among statements as opposed to the content of any particular statement.

More information

Recitation 4: Quantifiers and basic proofs

Recitation 4: Quantifiers and basic proofs Math 299 Recitation 4: Quantifiers and basic proofs 1. Quantifiers in sentences are one of the linguistic constructs that are hard for computers to handle in general. Here is a nice pair of example dialogues:

More information

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION INTEGRATED ALGEBRA. Tuesday, August 13, :30 to 11:30 a.m.

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION INTEGRATED ALGEBRA. Tuesday, August 13, :30 to 11:30 a.m. INTEGRATED ALGEBRA The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION INTEGRATED ALGEBRA Tuesday, August 13, 2013 8:30 to 11:30 a.m., only Student Name: School Name: The possession

More information

1. Given the public RSA encryption key (e, n) = (5, 35), find the corresponding decryption key (d, n).

1. 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 information

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical

More information

STUDY GUIDE FOR THE WRECKONING. 1. Combinatorics. (1) How many (positive integer) divisors does 2940 have? What about 3150?

STUDY GUIDE FOR THE WRECKONING. 1. Combinatorics. (1) How many (positive integer) divisors does 2940 have? What about 3150? STUDY GUIDE FOR THE WRECKONING. Combinatorics Go over combinatorics examples in the text. Review all the combinatorics problems from homework. Do at least a couple of extra problems given below. () How

More information

1 FUNDAMENTALS OF LOGIC NO.10 HERBRAND THEOREM Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 So Far Propositional Logic Logical connectives (,,, ) Truth table Tautology

More information

CLASS XI Maths : Sample Paper-1

CLASS XI Maths : Sample Paper-1 CLASS XI Maths : Sample Paper-1 Allotted Time : 3 Hrs Max. Marks : 100 Instructions 1. This questionnaire consists of 30 questions divided in four sections. Please verify before attempt. 2. Section I consists

More information