QUESTION BANK. 4. State and prove De Morgan s law of set theory. (6m) May / jun 10

Size: px
Start display at page:

Download "QUESTION BANK. 4. State and prove De Morgan s law of set theory. (6m) May / jun 10"

Transcription

1 UNIT 1: Set Theory QUESTION BANK 1. In a survey of 120 passengers, an airline found that 48 enjoyed wine with their meals, 78 enjoyed mixed drinks, 66 enjoyed iced tea. In addition, 36 enjoyed any given pair of these beverages and 24 enjoyed them all. If two passengers are selected at random from these survey sample of 120, what is the probability that they both want only iced tea with their meals? (7m) may /jun Find the probability of getting a sum different from 10 or 12 after rolling two dice. (5m) may/jun Explain set operations: (8m) may /jun State and prove De Morgan s law of set theory. (6m) May / jun In a survey of 260 college students, the following data were obtained: 64 had taken a mathematics course, 94 had taken a computer science course, 58 had taken a business course, 28 had taken both a mathematics and a business course, 26 had taken both a mathematics and a computer science course, 22 had taken both a computer science and a business course, and 14 had taken all three types of courses. a. How many of these students had taken none of the three courses? b. How many had taken only a computer science courses (8m) jul / aug04 6. For any two sets A and B, prove the following (4m) jul 07 A (A B) = A B 7. Determine the sets A and B given that A B = {1, 2, 4}, B A = {7, 8} and AUB = {1, 2, 4, 5, 7, 8, 9} (4m) jul Let M, P and C be the sets of students taking Mathematics courses, Physics courses and Computer Science courses respectively in a university. Assume M = 300, P = 350, C = 450, M \ P = 100, M \ C = 150, P \ C = 75, M \ P \ C = 10. How many students are taking exactly one of those courses? (7m) Jan /feb For any three sets A,B and C prove that (A-B)-C =A (BUC) = (A-C) (B-C) (6m) Jul Explain the laws of set theory: (8m) dec 09 /jan Determine the sets A and B given that A B = {1, 3, 7, 11}, B A = {2, 6, 8} and A B = {4, 9} (5m) jul /aug Prove that: A B= (B 1 1 A) U (A B ) = (B-A) U (A-B). (4m) aug 03 Dept. of CSE, SJBIT 1

2 13. Using Venn diagram, prove the following property of the symmetric difference: A (B C) = (A B) C (4m) aug Thirty cars are assembled in a factory. The options available are a transistor, an air conditioner and power windows. It is known that 15 of the cars have transistor, 8 of them have conditioners and 6 of them have power windows. Moreover, 3 of them have all three options. Determine at least how many cars do not have any options at all. (5m) Jan / feb A survey on a sample of 25 new cars showed that the cars had the following a. 15 cars had air conditioners b. 12 cars had radios c. 11 cars had power windows d. 5 cars had air conditioners and power windows e. 9 cars had air conditioners and radios f. 4 cars had radios and power windows g. 3 cars had all the three options h. Find the number of cars that had i) only power windows ii) at least one option (7m) Jan / feb A survey of 500 television viewers of sports channel produced the following information: 285 watch cricket, 195 watch hockey, 115 watch foot ball, 45 watch cricket and foot ball, 70 watch cricket and hockey, 50 watch hockey and foot ball and 50 do not watch any of the three kinds of games i) How many viewers in survey watch all three kinds of games? ii) How many viewers watch exactly one sport? (8m) Jul /aug The freshman class of a private engineering college has 300 students. It is known that 180 can program in PASCAL, 120 in FORTRAN, 30 in c++, 12 in PASCAL and c++, 18 in FORTRAN and c++, 12 in PASCAL and FORTRAN, and 6 in all three languages If two students are selected at random, what is the probability that they can i) Both program in PASCAL? ii) Both program only in PASCAL? (6m) Jan / feb A compuer services company has 300 programmers. It is known that 180 of these can program pascal, 120 in FORTRAN, 30 in c++, 12 in pascal and c++, 18 in FORTRAN and c++, 12 in pascal and FORTRAN and 6 in all the three. a. If a programmer is selected at random what is the probability that she can program in exactly two languages? b. If two programmers are selected at random what is the probability that they can both program in pascal? (10m) Jul /aug Define power set of a set. Obtain all the power sets of A={1,2,3,4} (3m) Jul 05 Dept. of CSE, SJBIT 2

3 UNIT 2: Fundamentals of logic 1. Discuss the basic connectives that are used in logic. (6m) May/Jun Define converse,inverse and contra positive of a statement: (6m) Jun Given p and q statements, explain the following terms a)conjunction b) disjunction c) logically Equivalence d) tautology (8M) May/Jun S how that (p v q) (q v p) is a tautology. (5m) jul Find the truth value of p,q,r for the following using truth tables: (5m) jul Prove the following tautologies: (5m) dec 09 / jan Prove the following: (6m) dec 09 / jan Find the truth values for the following logical expressions: (4m) jul Write the truth table for the following: (8m) jul Simplify the following compound statements: (6m) aug Verify whether the following logical expressions are tautology or contradiction using truth tables: (6m) jan Prove the following logical statement is a tautology: (5m) jan Prove the following logical statement is a tautology: (5m) jan Prove the following logical statement is a tautology: (5m) jan Prove the following logical statement is a tautology 5m) jan10 UNIT 3: Fundamental logic 1. Find inverse, converse and contra positive of the following: (6m) (may/jun 12) (dec 9 /jan10) 2. Simplify the following with reasons: (6m) may/jun Prove the following primitive statements: (8m) may/jun Prove below open statements: (5m) aug Prove below quantifiers: (6m) dec 9 6. Write inverse, converse and contra-positive: (5m) jul Prove the below open statements: (7m) jul Check the validity of the following arguments: (3m) jul Prove the following quantifiers: (3m) jul Prove the following rules of inferences: (4m) dec Prove the following rules of inferences (4m) dec prove the following rules of inferences (4m) jul Verify the rules of inference from the following truth tables: (6m) jul Prove the following open statements: (5m) jul Find converse inverse and contra positive of the logical expressions given below: (4m) jul 07 Dept. of CSE, SJBIT 3

4 UNIT 4: Properties of the integers 1. For n>=0 let fn denote the nth Fibonacci number. Prove that F0+f1+f2+.+fn= Summation Fi= fn+2-1 (4M)(may/jun 12) 2. Prove, by mathematical induction (6m) (may/jun 12) n (n + 2) = n (n +1) (2n + 7)/ 6 3. By induction prove that n! 2 n-1 forall integers n 1 (10m) (may/jun 12) 4. For all positive integers n, prove that if n>=24, then n can be written as a sum of 5s and 7s. (6m) dec Prove by induction: (6m) aug (2n-1) =n (2n-1) (2n+1) 3 6. Prove by mathematical induction. (5m) dec A sequence a n is defined by a1=3, an=an-1+an+1, for n>=2, find an explicit form: (6m) dec 07 UNIT 5: Relations and Functions 1. Let A = {1, 2, 3} Rand S be relations on A whose matrices are, (8m) ( may/jun 12) i) M R = and Ms = 000 Dept. of CSE, SJBIT 4

5 Determine relations R, R U S, R n Sand S -l and their matrix representation. 2. Define 1) reflexive 2) symmetric 3) Irreflexive 4) Anti symmetric 5) transitive relations: (6m)(may/jun 12) 3. A set of 3 members is (A, B, C). Brotherhood is the relation among them. Discuss whether the relation is equivalence. (6m) (may/jun 12) 4. Let A= {1,2,3,4,5}. Define a relation R on AXA by (x1,y1)r(x2,y2) if and only if x1+y1=x2+y2 (7m) jul Let A= {1,2,3,4,6} and r be the relation on A defined by(a,b) belongs to R if and only if a is a multiple of b. write down R as a set of ordered pairs. (4m) Dec Define a relation R on B as (a, b) R (c, d) if a + b = c + d. show that R is an equivalence relations. (6m) Dec 09 /jan A = {1, 2, 3} find a. R 1 = {(1, 1) (2, 2) (3, 3)} b. R 2 = {(1, 2) (2, 1) (1, 3) (3, 1) (2, 3), (3, 2)} c. c. R 3 = A x A (7m)dec If R is a relation on I, set of integers such that, x R y holds true if (x - y) is divisible by 5, show that R is an equivalence relation. (6m) Jul If R 1 and R 2 are equivalence relations defined on the same set A. prove that R 1 n R 2 is an equivalence relation. (7m) Aug 05 a. Given: R 1 and R 2 are equivalence relations. b. Prove: R 1 n R 2 is also equivalence relations. 10. Let A = {I, 2, 3, 4} and B = (A x A). Define a Relation R on B as (a, b) R (c, d) if a + b = c +d. S.T. R is an equivalence relation and compute B/R. (4m) jul Let, A = {a, b, c}, B = {1, 2, 3}, R = {(a, 1) (b, 1) (c, 2) (c, 3)} i) S = {(a, 1), (a, 2) (b, 1) (b, 2)} (6m) dec 09 Compute R ~, S ~, R U S, R n S, R -1, S -1 where(r ~ is R compliment) 12. Let A = {a, b, c} and Rand S be relations on A whose matrices are given below. Find the composite relation S o R, R o R, R o S, S o S and their matrices. (8m) Aug Let R = {(1, 2) (3, 4) (2, 2)} and S = {(4, 2) (2, 5) (3, 1) (1, 3)} be relations on the set A {2, 3, 4, 5} find S o R, R o S, Ro(S o R), So(R o S), Ro(R o R), So(R o R), S(S o S) (5m) dec If A= {1,2,3,4} B={2,5} C= {3,4,7} Determine: 1) AXB 2) BXA 3) AU (BXC) 4) (AUB)XC 5) (AXC)U(BXC) Define reflexive transitive and symmetric relations with respect to quantifiers. (5m)Aug Draw the hasse diagram for the poset (p(u)) where u={1,2,3,4} (4m)/Aug 04 Dept. of CSE, SJBIT 5

6 16. Let A={1,2,3,6,9,18} and define R on A by xry if x y. Draw hasse diagram of the poset. (4m) Aug Prove any R is a partial order. (4m) Jul 07 UNIT 6: Relations 1. Prove that 151 integers are selected from {1,2,3,.3000} then the selection must include two integers x,y where x y or y x. (4m) (may/jun 12) 2. Let f,g:z+->z+ where for all x belongs to Z+ f(x)=x+1 and g(x)=max{1,x-1} the maximum of 1 and x-1. State few properties. (10m) (may/jun 12) 3. Let f: Z->N be defined by f(x)= 2x-1 if x>0 and -2x for x<=0 (6m) (may/jun 12) Prove that f is one one and onto determine f-1 4. Find the nature of each of the function. (5m) Dec In each of the following cases sets A and B and a function f: A B are given. Determine (in each case) whether f is one to-one or onto (or both) (or neither) (5m) aug 03 i) 3. A = {I, 2, 3, 4} B = {a, b, c, d} ii) f = {(1, a), (2, a), (3, d), (4, c)} iii) 4. let A = {1,2,3,4} B = {a, b, c, d} f: A ( B is given as { (1, a), (2, b)} iv) f -1: B ( A = {( a, 1), (b, 2 )} v) f -1 is a function and hence f is invertible 6. let A,B,C be any three non-empty sets and A=B=C={set of real numbers} f: A ( B, g: f: B ( C be function defined by f(a) = a+1 and g(b) = b2 + 2, find a. gof (-2), b. fog (-2), c. gof(x), d. gog(x) (8m) aug Let X = {1, 2, 3} and f, g, h and s be function from X to x given by (8m) jul 07 f = {(1, 2), (2, 3), (3, 1)}, g = {(1, 2), (2, 1), (3, 3)}, h = {(1, 1), (2, 2), (3, 1)} s = {(1, 1), (2, 2), (3, 3)} 8. Let R denote the set of all real numbers. Let f: R ( R be a function defined by f(x) = x 2 Is f an invertible function? (5m) jul Find the inverse function f -1, of f: A B given by (6m) jul 08 A = B = {1, 2, 3, 4, 5} f = {(1, 3), (2, 2), (3, 4), (4, 5), (5, 1)} Dept. of CSE, SJBIT 6

7 10. Let A = {1, 2, 3, 4} and B = {a, b, c, d}. Determine whether the following functions from A to B are invertible or not f = {(1, a), (2, a), (3, c), (4, d)} g = {(1, a), (2, c), (3, d), ( 4, d)} (8m) jul Prove that the symmetric difference is associative on sets. (5m) jul Suppose the addresses of customers of a bank are recorded in 101 files on the basis of hashing function.with the account number. As keys, determine the file in which the address of the customer with the account no is recorded (6m) dec Determine whether f(a,b)=[a+b) is commutative or assosiative. (5m) jul Let f,g,h:z->z be defined by f(x)=x-1 and g(x)=3x h(x)= 0 even and 1 odd. Determine the following: (5m) jan 06 UNIT 7: Groups 1. State and prove lagranges theorem. (10m) (may/jun 12) 2. Define abelian group. P T a group is abelian if and only if for all a,b belongs to G. (a,b) -1 =a -1 b -1 (4m) (may/jun 12) 3. Define a cyclic group. P T every cyclic group is abelian but converse is not true. (6m) (may/jun 12) 4. Let f:g->h be a homomorhism from G to H. If G is abelian P T H is also abelian. (3m) jul P T every subgroup is a cyclic group of itself. (5m) jun Define homomorhism and isomorhism. (5m) Dec09 7. Define the binary operation on o on Z by x o y=x+y+1. Verify that (Z,o) is an abelian group. (4m) Dec For any group G pt G is abelian if and only if (ab) 2 =a 2 b 2 (5m) dec If a group G P T (a -1 ) -1 =a and (ab) -1 =b -1 a -1 (4m) dec 08 jan P T for all groups (ab) -1 =a -1 b -1 (4m) 11. Find every subgroup of S5 for all 2<=n<=5. (5m) Jan Let g= S4 for a=[ ][ ] Find a subgroup and all the left cosets. (8m) Jun 09 UNIT 8: Group Codes 1. Define a rind and integral domain. (5m) (may/jun 12) 2. Let r be a commutative ring with unity. Prove that if and only if for all a,b,c belongs to r where a=/ 0 1b=ac=b=c. (6m) (may/jun 12) 3. Prove that every field is an integral (5m) (may/ju domain(6m)(may/jun 4. Show that Z 5 is an integral 12) domain. 5. Prove that Zn is a field if and inly if n is prime. (may/ju (5m) n 12) n 12) (4m) 6. Define ring with an exapmle: (4m) aug 07 Aug06 Aug08

8 7. Define hamming meric with example: (7m) aug Explain decoding with coset leaders. (7m) Jul Define ring with unity and ring with zero divisor: (5m) aug S is a sibring of R if and only if for all a,b belongs to S we have a+b belongs to S and ab belongs to S (5m) jul If R is a ring wiyh unity and a,b are units of R, P T ab is a unit of R and (ab) - 1 =b -1 a -1 (5m) aug Prove that a unit in aring R cannot be a proper divisor of zero. (4m) Jan If a is a unit of ring R P T a is also a unit of ring R. (2m) dec Let S and T be subrings of a ring R. P T S intersection T is a subring of R. (3m) (may/jun 12)

Discrete mathematical Structures. Unit State and prove De Morgan s law of set theory..(dec. 09/Jan 10, dec. 07/Jan 08)

Discrete mathematical Structures. Unit State and prove De Morgan s law of set theory..(dec. 09/Jan 10, dec. 07/Jan 08) Unit-1 1. State and prove De Morgan s law of set theory..(dec. 09/Jan 10, dec. 07/Jan 08) 2.. In a survey of 260 college students, the following data were obtained: 64 had taken a mathematics course, 94

More information

MaanavaN.Com MA1256 DISCRETE MATHEMATICS. DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : MA1256 DISCRETE MATHEMATICS

MaanavaN.Com MA1256 DISCRETE MATHEMATICS. DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : MA1256 DISCRETE MATHEMATICS DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : UNIT I PROPOSITIONAL CALCULUS Part A ( Marks) Year / Sem : III / V. Write the negation of the following proposition. To enter into the country you

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

MTH202 Discrete Mathematics

MTH202 Discrete Mathematics LATSEST MCQS FROM MIDTERM PAPERS 10 MAY 011 MC10040185 moaaz.pk@gmail.com Moaaz siddiq MTH0 Discrete Mathematics Question No. 1: If p= It is raining q = She will go to college "It is raining and she will

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

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203. DEPARTMENT OF COMPUTER SCIENCE ENGINEERING SUBJECT QUESTION BANK : MA6566 \ DISCRETE MATHEMATICS SEM / YEAR: V / III year CSE. UNIT I -

More information

DEPARTMENT OF MATHEMATICS. MA1301 Discrete Mathematics

DEPARTMENT OF MATHEMATICS. MA1301 Discrete Mathematics SHRI ANGALAMMAN COLLEGE OF ENGINEERING AND TECHNOLOGY (An ISO 9001:2000 Certified Institution) SIRUGANOOR, TIRUCHIRAPPALLI 621 105 DEPARTMENT OF MATHEMATICS MA1301 Discrete Mathematics UNIT-I PART-A 1.Give

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

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

Unit I (Logic and Proofs)

Unit I (Logic and Proofs) SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : Part A questions : R2013 UPDATED ON : April-May 2018 (Scan the above QR code for the direct download of this material)

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

MTH202- Discrete Mathematics Latest Solved subjective from Midterm Papers. MIDTERM EXAMINATION Spring 2011 MTH202- Discrete Mathematics

MTH202- Discrete Mathematics Latest Solved subjective from Midterm Papers. MIDTERM EXAMINATION Spring 2011 MTH202- Discrete Mathematics MTH0- Discrete Mathematics Latest Solved subjective from Midterm Papers May 18,011 Lectures 1- Moaaz Siddiq Latest subjectives MIDTERM EXAMINATION Spring 011 MTH0- Discrete Mathematics Question no 1: marks

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

SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY MA DISCRETE MATHEMATICS

SRI VENKATESWARA COLLEGE OF ENGINEERING AND TECHNOLOGY MA DISCRETE MATHEMATICS 1 MA6566 - DISCRETE MATHEMATICS UNIT I - LOGIC AND PROOFS Propositional Logic Propositional equivalences-predicates and quantifiers-nested Quantifiers- Rules of inference-introduction to Proofs-Proof Methods

More information

Tutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement

Tutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement Tutorial - 1 1. Obtain the principal disjunctive normal form and principal conjunction form of the statement Let S P P Q Q R P P Q Q R A: P Q Q R P Q R P Q Q R Q Q R A S Minterm Maxterm T T T F F T T T

More information

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Fifth Semester. Computer Science and Engineering MA 2265 DISCRETE MATHEMATICS

B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Fifth Semester. Computer Science and Engineering MA 2265 DISCRETE MATHEMATICS B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010 Fifth Semester Computer Science and Engineering MA 2265 DISCRETE MATHEMATICS (Regulation 2008) Time : Three hours Maximum : 100 Marks Answer ALL

More information

Algebraic Structures Exam File Fall 2013 Exam #1

Algebraic Structures Exam File Fall 2013 Exam #1 Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write

More information

Simplification by Truth Table and without Truth Table

Simplification by Truth Table and without Truth Table Engineering Mathematics 2013 SUBJECT NAME SUBJECT CODE MATERIAL NAME MATERIAL CODE REGULATION UPDATED ON : Discrete Mathematics : MA2265 : University Questions : SKMA1006 : R2008 : August 2013 Name of

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

B B3B037 Total Pages:3

B B3B037 Total Pages:3 B B3B037 Total Pages:3 Reg. No. Name: APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JANUARY 2017 Course Code: CS 201 Course Name: DISCRETE COMPUTATIONAL STRUCTURES

More information

Algebraic structures I

Algebraic structures I MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one

More information

Announcements. Exam 1 Review

Announcements. Exam 1 Review Announcements Quiz today Exam Monday! You are allowed one 8.5 x 11 in cheat sheet of handwritten notes for the exam (front and back of 8.5 x 11 in paper) Handwritten means you must write them by hand,

More information

SET THEORY. 1. Roster or Tabular form In this form the elements of the set are enclosed in curly braces { } after separating them by commas.

SET THEORY. 1. Roster or Tabular form In this form the elements of the set are enclosed in curly braces { } after separating them by commas. SETS: set is a well-defined collection of objects. SET THEORY The objects in a set are called elements or members of the set. If x is an object of set, we write x and is read as x is an element of set

More information

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,

More information

BASIC MATHEMATICAL TECHNIQUES

BASIC MATHEMATICAL TECHNIQUES CHAPTER 1 ASIC MATHEMATICAL TECHNIQUES 1.1 Introduction To understand automata theory, one must have a strong foundation about discrete mathematics. Discrete mathematics is a branch of mathematics dealing

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

1. SETS AND FUNCTIONS. 4.If A = {4,6,7,8,9}, B = {2,4,6} and C = {1,2,3,4,5,6}, then find AU(B C).

1. SETS AND FUNCTIONS. 4.If A = {4,6,7,8,9}, B = {2,4,6} and C = {1,2,3,4,5,6}, then find AU(B C). 1. SETS AND FUNCTIONS Two marks: 1. If A C B show that A U B =B (use Venn diagram). 2. If AC B, then find A B and A\ B (use Venn diagram). 3. Let P = = {a, b c}, Q = {g, h, x, y} and R = {a, e, f, s}.

More information

QUESTION BANK II PUC SCIENCE

QUESTION BANK II PUC SCIENCE QUESTION BANK II PUC SCIENCE I. Very Short answer questions. (x9=9). Define Symmetric relation. Ans: A relation R on the set A is said to be symmetric if for all a, b, A, ar b Implies bra. i.e. (a, b)

More information

SETS. Chapter Overview

SETS. Chapter Overview Chapter 1 SETS 1.1 Overview This chapter deals with the concept of a set, operations on sets.concept of sets will be useful in studying the relations and functions. 1.1.1 Set and their representations

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

CLASS XII CBSE MATHEMATICS RELATIONS AND FUNCTIONS 1 Mark/2 Marks Questions

CLASS XII CBSE MATHEMATICS RELATIONS AND FUNCTIONS 1 Mark/2 Marks Questions CLASS XII CBSE MATHEMATICS RELATIONS AND FUNCTIONS 1 Mark/ Marks Questions (1) Let be a binary operation defined by a b = a + b 3. Find3 4. () The binary operation : R R R is defined as a b = a + b. Find

More information

Foundations Revision Notes

Foundations Revision Notes oundations Revision Notes hese notes are designed as an aid not a substitute for revision. A lot of proofs have not been included because you should have them in your notes, should you need them. Also,

More information

118 PU Ph D Mathematics

118 PU Ph D Mathematics 118 PU Ph D Mathematics 1 of 100 146 PU_2016_118_E The function fz = z is:- not differentiable anywhere differentiable on real axis differentiable only at the origin differentiable everywhere 2 of 100

More information

Chapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.

Chapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2. Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing

More information

Math 205 April 28, 2009 Final Exam Review

Math 205 April 28, 2009 Final Exam Review 1 Definitions 1. Some question will ask you to statea a definition and/or give an example of a defined term. The terms are: subset proper subset intersection union power set cartesian product relation

More information

PRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators.

PRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators. PRACTICE FINAL MATH 18.703, MIT, SPRING 13 You have three hours. This test is closed book, closed notes, no calculators. There are 11 problems, and the total number of points is 180. Show all your work.

More information

RELATIONS AND FUNCTIONS

RELATIONS AND FUNCTIONS Chapter 1 RELATIONS AND FUNCTIONS There is no permanent place in the world for ugly mathematics.... It may be very hard to define mathematical beauty but that is just as true of beauty of any kind, we

More information

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) (2011 Admission Onwards) I Semester Core Course FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK 1) If A and B are two sets

More information

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM

MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is

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

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws

586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,

More information

Notation Index. gcd(a, b) (greatest common divisor) NT-16

Notation Index. gcd(a, b) (greatest common divisor) NT-16 Notation Index (for all) B A (all functions) B A = B A (all functions) SF-18 (n) k (falling factorial) SF-9 a R b (binary relation) C(n,k) = n! k! (n k)! (binomial coefficient) SF-9 n! (n factorial) SF-9

More information

B Sc MATHEMATICS ABSTRACT ALGEBRA

B Sc MATHEMATICS ABSTRACT ALGEBRA UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc MATHEMATICS (0 Admission Onwards) V Semester Core Course ABSTRACT ALGEBRA QUESTION BANK () Which of the following defines a binary operation on Z

More information

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis

MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.

More information

MATH 433 Applied Algebra Lecture 22: Review for Exam 2.

MATH 433 Applied Algebra Lecture 22: Review for Exam 2. MATH 433 Applied Algebra Lecture 22: Review for Exam 2. Topics for Exam 2 Permutations Cycles, transpositions Cycle decomposition of a permutation Order of a permutation Sign of a permutation Symmetric

More information

Math 120 HW 9 Solutions

Math 120 HW 9 Solutions Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z

More information

Rings and Fields Theorems

Rings and Fields Theorems Rings and Fields Theorems Rajesh Kumar PMATH 334 Intro to Rings and Fields Fall 2009 October 25, 2009 12 Rings and Fields 12.1 Definition Groups and Abelian Groups Let R be a non-empty set. Let + and (multiplication)

More information

Intro to Logic and Proofs

Intro to Logic and Proofs Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington

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

cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska

cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to

More information

SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY COIMBATORE Discrete Mathematics Functions

SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY COIMBATORE Discrete Mathematics Functions 1 SRI RAMAKRISHNA INSTITUTE OF TECHNOLOGY COIMBATORE 641010 Discrete Mathematics Functions 1. Define function. Let X and Y be any two sets. A relation f from X to Y is called a function if for every x

More information

Written Homework # 4 Solution

Written Homework # 4 Solution Math 516 Fall 2006 Radford Written Homework # 4 Solution 12/10/06 You may use results form the book in Chapters 1 6 of the text, from notes found on our course web page, and results of the previous homework.

More information

Algebra Homework, Edition 2 9 September 2010

Algebra Homework, Edition 2 9 September 2010 Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.

More information

More Books At www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com

More information

HL Test 2018 Sets, Relations and Groups [50 marks]

HL Test 2018 Sets, Relations and Groups [50 marks] HL Test 2018 Sets, Relations and Groups [50 marks] The binary operation multiplication modulo 10, denoted by 10, is defined on the set T = {2, 4, 6, 8} and represented in the following Cayley table. 1a.

More information

CHAPTER 14. Ideals and Factor Rings

CHAPTER 14. Ideals and Factor Rings CHAPTER 14 Ideals and Factor Rings Ideals Definition (Ideal). A subring A of a ring R is called a (two-sided) ideal of R if for every r 2 R and every a 2 A, ra 2 A and ar 2 A. Note. (1) A absorbs elements

More information

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.

Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics Dr. Thomas Baird January 7, 2013 Contents 1 Logic 2 1.1 Statements.................................... 2 1.1.1 And, Or, Not.............................. 2 1.1.2 Implication...............................

More information

Subrings and Ideals 2.1 INTRODUCTION 2.2 SUBRING

Subrings and Ideals 2.1 INTRODUCTION 2.2 SUBRING Subrings and Ideals Chapter 2 2.1 INTRODUCTION In this chapter, we discuss, subrings, sub fields. Ideals and quotient ring. We begin our study by defining a subring. If (R, +, ) is a ring and S is a non-empty

More information

Math 451, 01, Exam #2 Answer Key

Math 451, 01, Exam #2 Answer Key Math 451, 01, Exam #2 Answer Key 1. (25 points): If the statement is always true, circle True and prove it. If the statement is never true, circle False and prove that it can never be true. If the statement

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

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

Quizzes for Math 401

Quizzes for Math 401 Quizzes for Math 401 QUIZ 1. a) Let a,b be integers such that λa+µb = 1 for some inetegrs λ,µ. Prove that gcd(a,b) = 1. b) Use Euclid s algorithm to compute gcd(803, 154) and find integers λ,µ such that

More information

Chapter 1 : The language of mathematics.

Chapter 1 : The language of mathematics. MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :

More information

MATH 145 LECTURE NOTES. Zhongwei Zhao. My Lecture Notes for MATH Fall

MATH 145 LECTURE NOTES. Zhongwei Zhao. My Lecture Notes for MATH Fall MATH 145 LECTURE NOTES Zhongwei Zhao My Lecture Notes for MATH 145 2016 Fall December 2016 Lecture 1, Sept. 9 Course Orientation and Organization About the Professor Stephen New MC 5419 Ext 35554 Email:

More information

Groups in Cryptography. Çetin Kaya Koç Winter / 13

Groups in Cryptography.   Çetin Kaya Koç Winter / 13 http://koclab.org Çetin Kaya Koç Winter 2017 1 / 13 A set S and a binary operation A group G = (S, ) if S and satisfy: Closure: If a, b S then a b S Associativity: For a, b, c S, (a b) c = a (b c) A neutral

More information

Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems

Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Group Theory Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Groups Definition : A non-empty set ( G,*)

More information

MATH 363: Discrete Mathematics

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

We want to show P (n) is true for all integers

We want to show P (n) is true for all integers Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to

More information

UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations

UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS 2013 MATH 122: Logic and Foundations Instructor and section (check one): K. Mynhardt [A01] CRN 12132 G. MacGillivray [A02] CRN 12133 NAME: V00#: Duration: 3

More information

Logic, Sets, and Proofs

Logic, Sets, and Proofs Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.

More information

Functions. Given a function f: A B:

Functions. Given a function f: A B: Functions Given a function f: A B: We say f maps A to B or f is a mapping from A to B. A is called the domain of f. B is called the codomain of f. If f(a) = b, then b is called the image of a under f.

More information

Math 4400, Spring 08, Sample problems Final Exam.

Math 4400, Spring 08, Sample problems Final Exam. Math 4400, Spring 08, Sample problems Final Exam. 1. Groups (1) (a) Let a be an element of a group G. Define the notions of exponent of a and period of a. (b) Suppose a has a finite period. Prove that

More information

To hand in: (a) Prove that a group G is abelian (= commutative) if and only if (xy) 2 = x 2 y 2 for all x, y G.

To hand in: (a) Prove that a group G is abelian (= commutative) if and only if (xy) 2 = x 2 y 2 for all x, y G. Homework #6. Due Thursday, October 14th Reading: For this homework assignment: Sections 3.3 and 3.4 (up to page 167) Before the class next Thursday: Sections 3.5 and 3.4 (pp. 168-171). Also review the

More information

SUBJECT : MATHS IMPORTANT 5 MARKS CLASS : X 1. SETS AND FUNCTIONS (2 X 5 =10)

SUBJECT : MATHS IMPORTANT 5 MARKS CLASS : X 1. SETS AND FUNCTIONS (2 X 5 =10) SUBJECT : MATHS IMPORTANT 5 MARKS CLASS : X 1. SETS AND FUNCTIONS (2 X 5 =10) 1. Using venn diagram, verify A B = A B 2. Using venn diagram, verify (A B) ' = A B 3. Using venn diagram, verify A B C = A\B

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

Discrete Structures CRN Test 3 Version 1 CMSC 2123 Autumn 2013

Discrete Structures CRN Test 3 Version 1 CMSC 2123 Autumn 2013 . Print your name on your scantron in the space labeled NAME. 2. Print CMSC 223 in the space labeled SUBJECT. 3. Print the date 2-2-203, in the space labeled DATE. 4. Print your CRN, 786, in the space

More information

Automata Theory and Formal Grammars: Lecture 1

Automata Theory and Formal Grammars: Lecture 1 Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)

More information

RELATIONS AND FUNCTIONS

RELATIONS AND FUNCTIONS For more important questions visit : www.4ono.com CHAPTER 1 RELATIONS AND FUNCTIONS IMPORTANT POINTS TO REMEMBER Relation R from a set A to a set B is subset of A B. A B = {(a, b) : a A, b B}. If n(a)

More information

Section Summary. Definition of a Function.

Section Summary. Definition of a Function. Section 2.3 Section Summary Definition of a Function. Domain, Codomain Image, Preimage Injection, Surjection, Bijection Inverse Function Function Composition Graphing Functions Floor, Ceiling, Factorial

More information

Logic Synthesis and Verification

Logic Synthesis and Verification Logic Synthesis and Verification Boolean Algebra Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 2014 1 2 Boolean Algebra Reading F. M. Brown. Boolean Reasoning:

More information

At least one of us is a knave. What are A and B?

At least one of us is a knave. What are A and B? 1. This is a puzzle about an island in which everyone is either a knight or a knave. Knights always tell the truth and knaves always lie. This problem is about two people A and B, each of whom is either

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

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 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9

Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Section 0. Sets and Relations Subset of a set, B A, B A (Definition 0.1). Cartesian product of sets A B ( Defintion 0.4). Relation (Defintion 0.7). Function,

More information

Section 1.1: Propositions and Connectives

Section 1.1: Propositions and Connectives Section 1.1: Propositions and Connectives Definition : Proposition: A statement that has exactly one truth value, i.e., either true (T) or false (F). Axiom (or Postulate): A statement about the primitive

More information

Propositional Logic, Predicates, and Equivalence

Propositional Logic, Predicates, and Equivalence Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If

More information

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

More information

RED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam

RED. Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam RED Name: Instructor: Pace Nielsen Math 290 Section 1: Winter 2014 Final Exam Note that the first 10 questions are true-false. Mark A for true, B for false. Questions 11 through 20 are multiple choice

More information

Foundations of Cryptography

Foundations of Cryptography Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 7 1 of 18 Cosets Definition 2.12 Let G be a

More information

NATIONAL INSTITUTE OF HOTEL MANAGEMENT, KOLKATA BUSINESS MATHEMATICS 3 rd Semester

NATIONAL INSTITUTE OF HOTEL MANAGEMENT, KOLKATA BUSINESS MATHEMATICS 3 rd Semester NATIONAL INSTITUTE OF HOTEL MANAGEMENT, KOLKATA BUSINESS MATHEMATICS 3 rd Semester Choose (tick) the appropriate from the following options given below. 1. Find the number of subsets of a set {x : x is

More information

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Packet #1: Logic & Proofs. Applied Discrete Mathematics Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should

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

Math 230 Final Exam, Spring 2008

Math 230 Final Exam, Spring 2008 c IIT Dept. Applied Mathematics, May 15, 2008 1 PRINT Last name: Signature: First name: Student ID: Math 230 Final Exam, Spring 2008 Conditions. 2 hours. No book, notes, calculator, cell phones, etc. Part

More information

MATH1240 Definitions and Theorems

MATH1240 Definitions and Theorems MATH1240 Definitions and Theorems 1 Fundamental Principles of Counting For an integer n 0, n factorial (denoted n!) is defined by 0! = 1, n! = (n)(n 1)(n 2) (3)(2)(1), for n 1. Given a collection of n

More information

Discrete Mathematics (CS503)

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

Definition: 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.

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

Exam 2. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one, since for c A, g(b) = g(c) = c. g is not onto, since a / g(a).

Exam 2. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one, since for c A, g(b) = g(c) = c. g is not onto, since a / g(a). Discrete Structures: Exam 2 Solutions to Sample Questions, 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,

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

Solutions to Assignment 3

Solutions to Assignment 3 Solutions to Assignment 3 Question 1. [Exercises 3.1 # 2] Let R = {0 e b c} with addition multiplication defined by the following tables. Assume associativity distributivity show that R is a ring with

More information