VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur
|
|
- Joel Snow
- 5 years ago
- Views:
Transcription
1 VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE ENGINEERING SUBJECT QUESTION BANK : MA6566 \ DISCRETE MATHEMATICS SEM / YEAR: V / III year CSE. UNIT I - LOGIC AND PROOFS Propositional Logic Propositional equivalences - Predicates and Quantifiers Nested Quantifiers Rules of inference - Introduction to proofs Proof methods and strategy. Q.No. Question Bloom s Taxonomy Level PART A Domain 1. Construct the truth table for the compound proposition (p q) ( p q). 2. Construct the truth table for the compound proposition (p q) (q p). 3. What are the contrapositive, the converse and the inverse of the conditional statement If you work hard then you will be rewarded. 4. Find the truth table for the statement p q. 5. Give the truth value of T T F. 6. Write the symbolic representation of If it rains today, then I buy an umbrella. 7. When do you say that two compound propositions are equivalent? 1
2 8. Show that ( p r) (q r)and (p q) r are logically equivalent. 9. Show that the propositions p q and p q are logically equivalent. 10. Without using truth table show that p (q p) p (p q). 11. Show that (p (q r)) ((p q) (p r)) is a tautology. 12. Is p (p q)) q a tautology? 13. Using the truth table, show that the proposition p (p q) is a tautology. 14. Given P = {2,3,4,5,6}, state the truth value of the statement ( x p)(x + 3 = 10 ). 15. Let E = { 1,0,1,2} denote the universe of discourse. If P(x, y) = x + y + 1, find the truth value of ( x)( y)p(x, y). Find a counter example, if possible, to these universally quantified statements, Whose the universe of discourse for all variables consists of all integers. 16. (a) x y (x 2 = y 2 x = y). (b) x y (xy x). 17. What are the negations of the statements x (x 2 > x) and x (x 2 = 2)? 18. Write the negation of the statement ( x)( y)p(x, y). 19. Give an indirect proof of the theorem If 3n + 2 is odd, then n is odd. 20. Prove that p, p q, q r r 2
3 PART B 1.(a) Prove that ((p q) ( p ( q r))) ( p q) ( p r) is a tautology 1. (b) Show that (p q) (r s), (q t) (s u), (t u)and (p r) p) 2. (a) Determine whether ( p (p q)) q is a tautology. 2.(b) 3. (a) Show that ( x)(p(x) Q(x)) ( x)p(x) ( x)q(x). Is the converse true? Show that x(p(x) Q(x)) xp(x) xq(x) 3.(b) 4. (a) Write the symbolic form and negate the following statements. 1. Everyone who is healthy can do all kinds of work. 2. Some people are not admired by everyone. 3. Everyone should help his neighbors or his neighbors will not help him. 4. Everyone agrees with someone and someone agrees with everyone Without constructing the truth tables, obtain the principle disjunctive normal form of ( p r) (q r) 4.(b) Show that r s can be derived from the premises p (q s), r p and q 5. (a) Establish this logical equivalences, where A is a proposition not involving any quantifiers. Show that ( xp(x)) A x(p(x) 5.(b) 6.(a) A)and ( xp(x)) A x(p(x) A) Show that xp(x) x Q(x) and x(p(x) Q(x)) are not logically equivalent Use the quantifiers and predicates to express the fact that lim x a f(x) does not exist. 6.(b) Show that xp(x) x Q(x) is equivalent to x y (P(x) Q(y)) 3
4 7. (a) 7. (b) Show that the hypothesis, It is not sunny this afternoon and it is colder than yesterday. We will go swimming only if it is sunny, If do not go swimming then we will take a canoe trip and If we take a canoe trip, then we will be home by sunset. Lead to the conclusion we will be home by sunset. Prove that 2 is irrational by giving a proof by contradiction. 8. (a) Prove that ( x)(p(x) q(x) x p(x) x q(x) 8.(b) 9. (a) Prove that (P Q) (R Q) (P R) Q) Show that x(p(x) Q(x)) xp(x) xq(x) by indirect method. 9.(b) Show that the statement Every positive integer is the sum of squares of three integers is false. 10.(a) Using indirect method of proof, derive P S from the premises P (Q R), Q P, S R and P. 10.(b) Without using truth table find PCNF and PDNF of P (Q P) ( P ( Q R)). 11. (a) Prove that the premises P Q, Q R, R S, S R and P S are inconsistent. 11. (b) Show that the premises One student in this class knows how to write program in JAVA, and Everyone who knows how to write the programme in JAVA can get a high paying job imply a conclusion someone in this class can get a high paying job. 12. (a) Show that ( P R) (Q P) = (P Q R) (P Q R) (P Q R) ( P Q R) ( P Q R). 12. (b) Use the quantifiers to express following statements. 1. there is a student in the class who can speak Hindi.2.every student in this class knows how to drive a car.3.some student in this class knows has visited Alaska but not visited Hawaii.4.all students in this class have learned at least one programming language. 13. (a) Prove that of (P Q) (Q R) (P R). 4
5 13.(b) Prove that A D is a conclusion from the premises A B C, B A and D C by using conditional proof. 14. (a) State and explain the proof methods. 14. (b) Show that that x P(x) x Q(x) x (P(x) Q(x)) UNIT II -COMBINATORICS Mathematical induction Strong induction and well ordering The basics of counting The pigeonhole principle Permutations and combinations Recurrence relations Solving linear recurrence relations Generating functions Inclusion and exclusion principle and its applications. Bloom s Q.No. Question Taxonomy Level Domain 1. State the principle of strong induction. 2 Use mathematical induction to show that n = n(n+1) 2 3 Use mathematical induction to show that n! 2 n+1, n = 1,2,3, 4 What is well ordering principle? 5 How many permutations are there in the word MISSISSIPPI? 6 State the Pigeonhole principle. 7 What is the number of arrangements of all the six letters in the word PEPPER? 8 How many permutations of {a,b,c,d,e,f,g} starting with a? 9 In how many ways can all the letters in MATHEMATICAL be arranged? 10 How many ways can a 2xn rectangular board be tiled using 1x2 and 2x2 pieces? 11 How many different bit strings are there of length seven? 5
6 Twelve students want to place order of different ice creams in a ice cream 12 parlor, which has six type of ice creams. Find the number of orders that the twelve students can place. 13 How many permutations are there in the word SACHIN? 14 Find the recurrence relation for the Fibonacci sequence. 15 Find the recurrence relation satisfying the equation y n = A(3) n + B( 4) n 16 Solve the recurrence relation y(k) 8y(k 1) + 16y(k 2) = 0, k 2, where y(2) = 16 and y(3) = Write the generating function for the sequence 1, a, a 2, a 3, 18 Find the number of non-negative integer solutions of the equation x 1 + x 2 + x 3 = 11 Determine whether the sequence {a 19 n } is a solution of the recurrence relation a n = 2a n 1 a n 2, n=2, 3, 4, where a n = 3n for every non negative integer n. 20 What is the solution of the recurrence relation a n = 6a n 1 9a n 2 with a 0 = 1, a 1 = 6 PART-B 1.(a) Using induction principle prove that n 3 + 2n is divisible by (b) 2. (a) Show that if n and k are positive integers then ( n+1 n ) = (n + 1)( k k 1 ) k. Use this identity to construct an inductive definition of the binomial coefficient. Prove that in a group of six people, at least three must be mutual friends or at least three must be mutual strangers. 2.(b) 3. (a) 3.(b) From a club consisting of six men and seven women, in how many ways we select a committee of (1) 3 men and 4 women? (2) 4 persons which has at least one woman? (3) 4 persons that has at most one man? (4) 4 persons that has both sexes? There are three files of identical red, blue and green balls, where each files contains at least 10 balls. In how many ways can 10 balls be selected. (1) If there is no restriction. (2) If at least 1 red ball must be selected. (3) If at least 1 red, at least 2 blue and at least 3green balls must be selected. (4) If at most 1 red ball is selected. Prove by mathematical induction that n 2 = n(n+1)(2n+1) 6 6
7 4. (a) State the strong induction (the second principle of mathematical induction). Prove that a positive integer >1 is either a prime number or it can be written as product of prime numbers. 4.(b) 5. (a) 5.(b) 6. (a) If n pigeonholes are occupied by (kn+1) pigeons, where k is a positive integer, prove that at least one pigeonhole is occupied by (k+1) or more pigeons. Hence, find the minimum number of m integers to be selected from S = {1, 2,3 9} so that the sum of two of m integers is even. Use mathematical induction to show that n > n, n 2 Find the number of integers between 1 and 250 both inclusive that are not divisible by any of the integers 2, 3, 5 and 7. Use the principle of inclusion exclusion to derive a formula for φ(n) when the prime factorization of n is n = p 1 α 1 p 2 α 2 p m α m 6.(b) A total of 1232 students have taken a course in Spanish, 879 have taken a course in French and 114 have taken a course in Russian. Further 103 have taken courses in both Spanish and French, 23 have taken courses in both Spanish and Russian and 14 have taken courses in both French and Russian. If 2092 students have taken at least one Spanish, French and Russian, how students have taken a course in all three languages? 7. (a) Let m be any odd positive integer. Then prove that there exist a positive integer n such that m divides 2 n 1 7. (b) Determine the number of positive integer n, 1 n 2000 that are not divisible by 2, 3 or 5 but are divisible by (a) Prove by mathematical induction that 6 n n+1 is divisible by 43, for each positive integer n. 8.(b) Prove that the number of subsets of a set having n elements is 2 n 9.(a) Solve the recurrence relation a n = 3a n 1 3a n 2 a n 3 with a 0 = 5, a 1 = 9 and a 2 = (b) Find the solution to the recurrence relation a n = 6a n 1 11a n 2 + 6a n 3 with initial conditions a 0 = 2, a 1 = 5 and a 2 = 15 7
8 10.(a) Solve the recurrence relation a n+1 a n = 3n 2 n, n 0, a 0 = 3 10.(b) Use the method of generating function to solve the recurrence relation a n = 4a n 1 4a n n ; n 2 given that a 0 = 2 and a 1 = (a) 11.(b) 12.(a) 12.(b) 13.(a) 13.(b) 14.(a) 14.(b) Solve the recurrence relation a n = 3a n 1 3a n 2 a n 3 given that a 0 = 5, a 1 = 9 and a 2 = 15 Solve the recurrence relation a n = 3a n 1 + 2, n 1, with a 0 = 1 by the method of generating function. Use the method of generating function to solve the recurrence relation a n = 3a n 1 + 1, n 1, with a 0 = 1 Use the method of generating function to solve the recurrence relation a n 5a n 1 + 6a n 2 = 0, where n 2, a 0 = 0, a 1 = 1 Use the method of generating function to solve the recurrence relation a n + 3a n 1 4a n 2 = 0, where n 2, a 0 = 3, a 1 = 2 Find the generating function of Fibonacci sequence. A factory makes custom sports cars at an increasing rate. In the 1 st Month only one car made, in the 2 nd month two cars are made, and so on with n cars made in the n th month.(1) Set up the recurrence relation for the number of cars produced in the first n month by this factory. (2) How many cars are produced in the 1 st year? Find all solutions of the recurrence relation a n = 2a n 1 + 2n 2 UNIT III -GRAPHS Graphs and graph models Graph terminology and special types of graphs Matrix representation of graphs and graph isomorphism Connectivity Euler and Hamilton paths. Q.No. Question Bloom s Taxonomy Level Domain PART - A 1. Define complete graph and give an example. 2. Define a regular graph. Can a complete graph be a regular graph? 8
9 3. How many edges are there in a graph with 10 vertices each of degree 6? 4. Define pseudo graphs. 5. Define strongly connected graph. 6. State the handshaking theorem. 7. Prove that the number of odd degree vertices is always even. Represent the given graph using an adjacency matrix Define isomorphism of two graphs. 10. Define connected graph and a disconnected graph with example. 11. Define pendant vertex in a graph. 12. How many edges does a graph have if it has vertices of degree 5, 2, 2, 2, 2, 1? Draw such a graph. Use an incidence matrix represents the graph Define Eular line, Eular graph. 15. Define a Hamilton path of G. 16. What should be the degree of each vertex of a graph G if it has Hamilton circuit? 17. Give an example of a non- Eulerian graph which is Hamiltonian. 18. State the necessary and sufficient conditions for the existence of an Eulerian path in a connected graph. 9
10 19. For which values of n do the graphs K n and C n have an Euler path but no Euler circuit? Does the graph have a Hamilton path? If so find such a path (a) Prove that the number of vertices of odd degree in a graph is always even. 1. (b) Prove that the maximum number of edges in a simple disconnected graph G with n vertices and k components is (n k)(n k 1) 2 2. (a) Prove that a connected graph G is Euler graph if and only if every vertex of G is of even degree. Consider the graph in the following figure. Find the path, simple path, circuit and cycle. 2.(b) 3. (a) Examine whether the following pair of graphs are isomorphic or not. Justify your answer. 10
11 Let δ(g)and (G) denotes minimum and maximum degrees of all 3.(b) the vertices of G respectively. Then show that for a non-directed graph G, δ(g) 2 E (G) V 4. (a) Let G be a graph with n vertices and n edges such that the vertices have K or K + 1, prove that if G has N k vertices of degree K and N k+1 vertices of degree K + 1 then N k = (K + 1)n 2n 4.(b) 5. (a) 5.(b) 6. (a) Show that isomorphism of that simple graphs is an equivalence relation. For any simple graph G, the number of edges of G is less than or equal to n(n 1), where n is the number of vertices in G. 2 Derive a connected graph has an Euler trail if and only if it has at most two vertices of odd degree. Prove that any undirected graph has an even number of vertices of odd degree. Show that the following graphs G and H are not isomorphic. 6.(b) 7. (a) Define 1. Adjacency matrix. 2. Incidence matrix of a graph with example. 11
12 7. (b) A simple graph with n vertices (n 3) in which each vertex has degree at least n 2 (δ n 2 ) has a Hamiltonian cycle. 8. (a) Define 1. Complete graph. 2. Complete bipartite graph with example. 8.(b) Show that the following graphs are isomorphic. 9. (a) Define 1. Euler graph 2. Hamiltonian graph with example. 9.(b) How many paths of length four are there from a to d in the simple graph G given below. 10.(a) Show that the complete graph K n contain n(n 1) different Hamilton cycle (b) Briefly explain about sub graph with example. 11.(a) Using adjacency matrix examine whether the following pairs of graphs G and G 1 given below are isomorphism or not. 12
13 11.(b) Briefly explain about walks with example. 12.(a) 12.(b) Draw the complete graph K 5 with vertices A, B, C, D, E. Draw all complete sub graph of K 5 with 4 vertices. The adjacency matrices of two pairs of graph as given below. Examine the isomorphism of G and H by finding a permutation matrix. A G = [ 0 0 1] A H = [ 1 0 0] (a) The sum of all vertex degree is equal to twice the number of edges (or) the sum of the degrees of the vertices of G is even. 13.(b) Write the adjacency matrix of the digraph G = { (v 1, v 3 ), (v 1, v 2 ), (v 2, v 4 ), (v 3, v 1 ), (v 2, v 3 ), (v 3, v 4 ), (v 4, v 1 ), }. (v 4, v 2 ), (v 4, v 3 ) Also draw the graph 14.(a) Prove that the following statements are equivalent for a simple connected graph.1.g is Eulerian. 2. Every vertex of G has even degree. 14.(b) Explain cut edges and cut vertices with suitable example. UNIT -IV ALGEBRAIC STRUCTURES Algebraic systems Semi groups and monoids - Groups Subgroups Homomorphism s Normal Subgroup and cosets Lagrange s theorem Definitions and examples of Rings and Fields. Q.No. Question Bloom s Domain Taxonomy Level PART - A 1. Define semigroup and monoid. Give an example of a semigroup which is not a monoid. 2. Give an example of sub semigroup. 3. Show that semi-group homomorphism preserves the property of idempotency. 13
14 4. What do you call a homomorphism of a semi-group into itself. 5. Prove that identity element in a group is unique Prove that monoid homomorphism preserves invertibility. State any two properties of a group. What is a group (G, ) called abelian? 9. Prove that if G is abelian group, then for all a, b G, (a b) 2 = a 2 b Show that every cyclic group is abelian. Prove or disprove: Every subgroup of an abelian is normal. 12. If a is a generator of a cyclic group G, then show that a 1 is also a generator of G. 13. Show that (Z 5, + 5 ) is a cyclic group. 14. Find the left cosets of {[0], [3]} in the addition modulo group (Z 6, + 6 ). 15. Define kernel of a homomorphism. 16. State Lagrange s theorem. 17. Define a ring. 18. Define a commutative ring. 19. Give an example of a ring which is not a field. 20. Define integral domain and give an example. 1.(a) Show that group homomorphism preserves identity, inverse, and sub group 1.(b) 2.(a) 2.(b) Obtain all the elements of (S 3, )and also construct the composition table with respect with respect to the operation. Prove that the intersection of two subgroups of a group G is again a subgroup of G Let G be a group and a G. Let f: G G be given by f(x) = axa 1, x G. Prove that f is an isomorphism of 14
15 3.(a) 3.(b) 4. (a) G onto G Show that M 2, the set of all 2X2 non singular matrices over R is a group under usual matrix multiplication. Is it abelian. Show that the union of two subgroups of a group G is again a subgroup of G if and only if one is contained in the other. State and prove Lagrange s theorem 4.(b) 5. (a) If S = NXN, the set of ordered pairs of positive integers with the operation defined by (a, b) (c, d) = (ad + bc, bd) and if f: (S, ) (Q, +) is defined by f(a, b) = a b, show that f is a semi group homomorphism. Prove that the intersection of two submonoids of a monoid is a monoid. 5.(b) Determine whether subgroups of Z 15. H 1 = {0, 5, 10} and H 2 = {0, 4, 8, 12} are 6. (a) Discuss Ring and Fields with suitable examples. 6.(b) State and prove the fundamental theorem of group homomorphism 7. (a) If G is an infinite cyclic group, then it is isomorphic to the additive group of integers. 7. (b) If G is a group of prime order, then G has no proper subgroups. 8. (a) Prove that the necessary and sufficient condition for a non-empty subset H of a group (G, )to be a subgroup is a, b H a b 1 H 8.(b) Let f: G, ) (H, ) be group homomorphism then show that Ker(f) is a normal subgroup. 9. (a) If f: G G is a group homomorphism then prove that f(a 1 ) = [f(a)] 1 9.(b) If (G, ) is an abelian group and if a, b G. Show that (a b) n = a n b n, for every integer n 10.(a) Define a cyclic group. Prove that any group of prime order is cyclic. 15
16 10.(b) 11.(a) 11.(b) 12.(a) 12.(b) Let (H, )be a subgroup of (G, ). Let N = {x /x G, xhx 1 = H}. Show that (N, ) is a subgroup of G. Prove that in a group G the equations a x = b and y a = b have unique solutions for the unknowns x and y as x = a 1 b, y = b a 1 when a, b G. Prove that the set of all matrices [ a b ]forms an abelian group b a with respect to matrix multiplication. If f: G G be a group homomorphism and H is a subgroup of G, then f 1 (H) is a subgroup of G Show that the set of all positive real numbers forms an group under the composition defined as a b = ab 4, a, b Q + 13.(a) Show that the group ({1, 2, 3, 4}, X 5 ) is cyclic. 13.(b) 14.(a) Prove that the order of an element a of a group G is the same as that of its inverse (a 1 ) Prove that the set {1, 1, i, i} is a finite abelian group with respect to the multiplication of complex numbers. 14.(b) State and prove Cayleys theorem. UNIT-V LATTICES AND BOOLEAN ALGEBRA Partial ordering Posets Lattices as posets Properties of lattices - Lattices as algebraic systems Sub lattices Direct product and homomorphism Some special lattices Boolean algebra. Q.No. Question Bloom s Taxonomy Level 1. Draw a Hasse diagram of X, where X = {2,4, 5, 10, 12, 20, 25} and relation be such that x y if x divides y 2. Show that the least upper bound of a subset B in a poset A, is unique if it exists. 3. Let A = {a, b, c} and ρ(a) be its power set, draw a Hasse diagram of ρ(a),. 4. State distributive lattice. 16
17 5. Check whether the posets {(1, 3, 6, 9), D} and {(1, 5, 25, 125), D}are lattices or not. Justify your claim. 6. Define lattice. Give suitable example. 7. Define sub lattice Define lattice homomorphism. Give an example of a lattice that is not complemented. In a lattice (L, ), prove that a (a b) = a, a, b L When is a lattice called complete? Give an example of a distributive lattice but not complete. Define Boolean Algebra. Show that in a Boolean Algebra ab + a b = 0 iff a = b 15. Prove the Boolean identity a. b + a. b = a Is a Boolean Algebra contains six elements? Justify your answer. What values of the Boolean variables x and y satisfy xy = x + y? 18. Is there a Boolean Algebra with five elements? Justify your answer. Find the values, if any, of the Boolean variable x that satisfy x. 1 = How many different Boolean functions are there of degree 7? 1.(a) Let D 30 = {1, 2, 3,5, 6, 10, 15, 30} and let the relation R be divisor on D 30. Find (1) All the lower bounds of 10 and 15. (2) The greatest lower bounds of 10 and 15. (3) All the upper bounds of 10 and 15. (4) The least upper bounds of 10 and 15. (5) Draw the Hasse diagram. 1. (b) Prove that in a Boolean Algebra(a b) = a b. 17
18 2. (a) Examine whether the lattice given in the following Hasse diagram is distributive or not? 2.(b) If P(S) is the power set of a non-empty set S, prove that {P(S),,,\, φ, S} is a Boolean Algebra. 3. (a) If S n is the set of all divisors of the positive integer n and D is the relation of division, prove that {S 30, D} is a lattice. Find also all the sub lattices of {S 30, D} that contain six or more elements. 3.(b) 4. (a) Show that every chain is a distributive lattice. State and prove De Morgan s law in a complemented distributive lattice. 4.(b) 5. (a) If a, b S, S = {1, 2, 3, 6} and a + b = LCM (a, b), a. b = GCD (a, b) and a = b a, show that {s, +,,, 1, 6} is a Boolean Algebra. Show that a complemented, distributive lattice is a Boolean Algebra. 5.(b) 6. (a) Show that De Morgan s laws hold in a Boolean Algebra that is show that for all x and y, (x ) y = x y and (x ) y = x y Show that every non empty subset of a lattice has a least upper bound and a greatest lower bound. 6.(b) Show that every totally ordered set is a lattice. 7. (a) Show that in a lattice if a b c, then (1) (a b) = b c and (2) (a b) (b c) = b = (a b) (a c). 18
19 7. (b) Show that in a Boolean algebra x x = x and x x = x 8. (a) Show that a lattice homomorphism on a Boolean Algebra which preserves 0 and 1 is a Boolean homomorphism. 8.(b) In a Boolean Algebra. Show that (a + b )(b + c )(c + a ) = (a + b)(b + c)(c + a) 9. (a) Let L be a lattice, where a b = glb(a, b), a b = lub(a, b), a, b L. Then both binary operators and defined as in L satisfy commutative law, associative law, absorption law and idempotent law. 9.(b) Show that in a distributive and complemented lattice satisfied De Morgan s law. 10.(a) Show that every chain is a lattice. 10.(b) 11.(a) Show that in a distributive and complemented lattice a b a b = 0 a b = 1 b a If P(S) is the power set of a set S and, are taken as join and meet, prove that P(S), is a lattice. Also, prove that the modular inequality of a lattice (L, ), For anya, b, c L, a c a (b c) (a b) c. 11.(b) In any Boolean algebra, show that ab + a b = 0 iff a = b. 12.(a) 12.(b) 13.(a) 13.(b) Prove that De Morgan s laws hold good for a complemented distributive lattice L,,, (a b) = a b and (a b) = a b In any Boolean algebra, prove that the following statements are equivalent: 1. a + b = b 2. a. b = a 3. a + b = 1 4. a. b = 0 Show that in a lattice if a b and c d, Then a c b d and a c b d. In a distributive lattice prove that a b = a c and a b = a c Imply b = c. 14.(a) Show that the distributive law x(y + z) = xy + xz is valid. 14.(b) Prove the absorption law x(x + y) = x using the the identities of Boolean algebra. 19
20 20
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 informationSimplification 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 informationMA Discrete Mathematics
MA2265 - Discrete Mathematics UNIT I 1. Check the validity of the following argument. If the band could not play rock music or the refreshments were not delivered on time, then the New year s party would
More information1. 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 informationUnit 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 informationSimplification 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 informationTutorial 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 informationAnna University, Chennai, November/December 2012
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2012 Fifth Semester Computer Science and Engineering MA2265 DISCRETE MATHEMATICS (Regulation 2008) Part - A 1. Define Tautology with an example. A Statement
More informationMaanavaN.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 informationSRI 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 informationB 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 informationDEPARTMENT 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 informationNORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S. B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION
NORTHERN INDIA ENGINEERING COLLEGE, LKO D E P A R T M E N T O F M A T H E M A T I C S B.TECH IIIrd SEMESTER QUESTION BANK ACADEMIC SESSION 011-1 DISCRETE MATHEMATICS (EOE 038) 1. UNIT I (SET, RELATION,
More informationB.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 informationsoftware design & management Gachon University Chulyun Kim
Gachon University Chulyun Kim 2 Outline Propositional Logic Propositional Equivalences Predicates and Quantifiers Nested Quantifiers Rules of Inference Introduction to Proofs 3 1.1 Propositional Logic
More informationREVIEW 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 informationMATH 363: Discrete Mathematics
MATH 363: Discrete Mathematics Learning Objectives by topic The levels of learning for this class are classified as follows. 1. Basic Knowledge: To recall and memorize - Assess by direct questions. The
More informationNotation 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 informationMATH1240 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 informationIntro 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 informationPacket #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 informationIVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS. 1. Combinatorics
IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS Combinatorics Go over combinatorics examples in the text Review all the combinatorics problems from homewor Do at least a couple of extra
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More informationSTUDY 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 informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More information3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations
Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element
More informationDISCRETE STRUCTURES AMIN WITNO
DISCRETE STRUCTURES AMIN WITNO p h i. w i t n o. c o m Discrete Structures Revision Notes and Problems Amin Witno Preface These notes were prepared for students as a revision workbook
More informationMAT2345 Discrete Math
Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview
More informationMATH 114 Fall 2004 Solutions to practice problems for Final Exam
MATH 11 Fall 00 Solutions to practice problems for Final Exam Reminder: the final exam is on Monday, December 13 from 11am - 1am. Office hours: Thursday, December 9 from 1-5pm; Friday, December 10 from
More informationEquivalence of Propositions
Equivalence of Propositions 1. Truth tables: two same columns 2. Sequence of logical equivalences: from one to the other using equivalence laws 1 Equivalence laws Table 6 & 7 in 1.2, some often used: Associative:
More informationECOM 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 informationLogic, 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 informationSTRATEGIES OF PROBLEM SOLVING
STRATEGIES OF PROBLEM SOLVING Second Edition Maria Nogin Department of Mathematics College of Science and Mathematics California State University, Fresno 2014 2 Chapter 1 Introduction Solving mathematical
More informationDISCRETE MATH: FINAL REVIEW
DISCRETE MATH: FINAL REVIEW DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? c. Is {3} {3}? c. Is {3} {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review
More informationChapter 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 informationPacket #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 informationLecture 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 informationCS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)
CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationLogic. 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 informationLECTURE 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 informationLogic 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 information586 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 informationLECTURE 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 informationDiscrete 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 informationQUESTION BANK. 4. State and prove De Morgan s law of set theory. (6m) May / jun 10
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
More informationCS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 Solutions
CS 70 Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Midterm 1 Solutions PRINT Your Name: Answer: Oski Bear SIGN Your Name: PRINT Your Student ID: CIRCLE your exam room: Dwinelle
More informationAlgebraic 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 information1. 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 informationCHAPTER 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 informationUnit 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 informationNotes 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 informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationDiscrete 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 informationWhy Learning Logic? Logic. Propositional Logic. Compound Propositions
Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional
More informationLogic Overview, I. and T T T T F F F T F F F F
Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical
More information0 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 informationCompound Propositions
Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth
More informationLogic and Proof. Aiichiro Nakano
Logic and Proof Aiichiro Nakano Collaboratory for Advanced Computing & Simulations Department of Computer Science Department of Physics & Astronomy Department of Chemical Engineering & Materials Science
More informationCounting Methods. CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo
Counting Methods CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo c Xin He (University at Buffalo) CSE 191 Discrete Structures 1 / 48 Need for Counting The problem of counting
More informationMATH 2200 Final LC Review
MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from
More informationMat 243 Exam 1 Review
OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for
More informationCS 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 informationCSE 1400 Applied Discrete Mathematics Proofs
CSE 1400 Applied Discrete Mathematics Proofs Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Axioms 1 Logical Axioms 2 Models 2 Number Theory 3 Graph Theory 4 Set Theory 4
More informationCSE 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 informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
More informationPropositional 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 information1 Predicates and Quantifiers
1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College
More informationPropositional Logic. What is discrete math? Tautology, equivalence, and inference. Applications
What is discrete math? Propositional Logic The real numbers are continuous in the senses that: between any two real numbers there is a real number The integers do not share this property. In this sense
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationCS Discrete Mathematics Dr. D. Manivannan (Mani)
CS 275 - Discrete Mathematics Dr. D. Manivannan (Mani) Department of Computer Science University of Kentucky Lexington, KY 40506 Course Website: www.cs.uky.edu/~manivann/cs275 Notes based on Discrete Mathematics
More informationFoundations 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 informationIntroduction 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 informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and
More informationCS/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 informationPart I: Propositional Calculus
Logic Part I: Propositional Calculus Statements Undefined Terms True, T, #t, 1 False, F, #f, 0 Statement, Proposition Statement/Proposition -- Informal Definition Statement = anything that can meaningfully
More informationDISCRETE MATHEMATICS BA202
TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( 명제 ) a declarative sentence that is either true or false, but not both nor neither letters denoting propositions p, q, r, s, T:
More informationDiscrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques
Discrete Mathematics & Mathematical Reasoning Predicates, Quantifiers and Proof Techniques Colin Stirling Informatics Some slides based on ones by Myrto Arapinis Colin Stirling (Informatics) Discrete Mathematics
More informationINTRODUCTION TO THE GROUP THEORY
Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc e-mail: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher
More informationAlgorithms: Background
Algorithms: Background Amotz Bar-Noy CUNY Amotz Bar-Noy (CUNY) Algorithms: Background 1 / 66 What is a Proof? Definition I: The cogency of evidence that compels acceptance by the mind of a truth or a fact.
More informationTribhuvan University Institute of Science and Technology Micro Syllabus
Tribhuvan University Institute of Science and Technology Micro Syllabus Course Title: Discrete Structure Course no: CSC-152 Full Marks: 80+20 Credit hours: 3 Pass Marks: 32+8 Nature of course: Theory (3
More information7.11 A proof involving composition Variation in terminology... 88
Contents Preface xi 1 Math review 1 1.1 Some sets............................. 1 1.2 Pairs of reals........................... 3 1.3 Exponentials and logs...................... 4 1.4 Some handy functions......................
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More information(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.
Math 231 Exam Practice Problem Solutions WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the
More informationPropositional 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 informationDiscrete Mathematics (CS503)
Discrete Mathematics (CS503) Module I Suggested Questions Day 1, 2 1. Translate the following statement into propositional logic using the propositions provided: You can upgrade your operating system only
More information(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 information1 The Foundation: Logic and Proofs
1 The Foundation: Logic and Proofs 1.1 Propositional Logic Propositions( ) a declarative sentence that is either true or false, but not both nor neither letters denoting propostions p, q, r, s, T: true
More informationMath 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 informationDiscrete Structures of Computer Science Propositional Logic III Rules of Inference
Discrete Structures of Computer Science Propositional Logic III Rules of Inference Gazihan Alankuş (Based on original slides by Brahim Hnich) July 30, 2012 1 Previous Lecture 2 Summary of Laws of Logic
More informationDo 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 informationSample 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 informationB.C.S.Part I Mathematics (Sem.- I & II) Syllabus to be implemented from June 2013 onwards.
B.C.S.Part I Mathematics (Sem.- I & II) Syllabus to be implemented from June 2013 onwards. 1. TITLE: Subject Mathematics 2. YEAR OF IMPLEMENTATION : Revised Syllabus will be implemented from June 2013
More informationReview CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.
CHAPTER 2 Review 2.1 Definitions in Chapter 2 2.1 Set; Element; Member; Universal Set 2.2 Subset 2.3 Proper Subset 2.4 The Empty Set, 2.5 Set Equality 2.6 Cardinality; Infinite Set 2.7 Complement 2.8 Intersection
More informationCSC 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 informationAN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH Jimmy T. Arnold
AN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH 3034 Jimmy T. Arnold i TABLE OF CONTENTS CHAPTER 1: The Structure of Mathematical Statements.............................1 1.1. Statements..................................................................
More informationWUCT121. 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