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

Size: px
Start display at page:

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

Transcription

1 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 of S has 2 n elements. 3. Explain de Morgan's laws. That is, how does one complement the union of sets? 4. Explain why if A B then B A. 5. Explain how to show that an argument is valid. 6. If a statement P is a tautology, how can one easily build from P a statement which is a contradiction? Why does this method work? 7. If A is true and B is false, list three compound statements using A and B whose truth value will be false. 8. Explain why A B = A B, then B must be the empty set. 9. Explain how to represent a set A as a bit string. 10. Is it ever true that A X B = B X A? Explain your answer. 11. Why is a set a subset of itself? Why is the empty set a subset of every set? 12. If the truth table were to be constructed for a statement S that is composed of simple statements p, q, r, and t, how many cases would need to be considered? Explain your answer. 13. How does one negate a quantified statement in the form xp(x)? In the form xp(x)? 14. How does one prove a statement that involves if and only if? 15. How does one construct a proof by contradiction? Chapter 2: Integers and Mathematical Induction 1. How does one use the Euclidean algorithm to find the greatest common divisor of two integers? 2. Explain how the greatest common divisor and the least common multiple of two integers are connected. 3. Does the well ordering principle apply to the entire set of integers? Why or why not? 4. Explain why 3 must divide n 3 -n for all integers n. 5. Explain why 3n+1 and 5n+2 are relatively prime for all integers n. 6. Explain how to represent an integer in two s complement. 7. Is there a convenient way to switch between binary and hexadecimal representations of the same integer? Explain your answer. 8. Explain how the first principle of mathematical induction works. 9. In proving that 64 divides 9 n -8n-1 for all integers n 0 by mathematical induction, a crucial step in the inductive step of the proof involves rewriting 9 n+1-8(n+1)-1 in what form? 10. Explain a simple way to determine whether a given integer is a prime.

2 11. What does the Fundamental Theorem of Arithmetic state? 12. Explain why if p is a prime and p divides ab then p divides a or p divides b. Give a counterexample to show this statement is not true in general if p is not a prime. 13. Why must there be an infinite number of primes of the form 6n+5? 14. In hexadecimal representation, why are A, B, C, used? 15. Under what conditions does the Diophantine equation ax + by = c have solutions? Chapter 3: Relations and Posets 1. Explain why the number of relations on a set with n elements is 2 (n2). 2. Explain how an equivalence relation on a set S gives rise to a partition of S. 3. Explain how a partition of a set S gives rise to an equivalence relation on S. 4. Explain a process to find the transitive closure of a relation on an n-element set. 5. If D is the digraph representation of a relation R, what property must D have if the relation R is reflexive? Explain. 6. If D is the digraph representation of a relation R, what property must D have if the relation R is symmetric? Explain. 7. If D is the digraph representation of a relation R, what property must D have if the relation R is antisymmetric? Explain. 8. Explain why the relation R = { (a,b) Z X Z 7 divides (a-b) } is an equivalence relation. 9. A relation R on a set A is called irreflexive if for all a A, (a, a) R. Give an example of a relation on Z that is irreflexive and transitive but not symmetric. 10. Explain why the number of reflexive relations on a set with n elements is 2 n2 n. 11. How do equivalence relations and partial order relations differ? 12. Explain why the digraph of a partial order relation cannot contain a closed path (other than a loop). 13. Explain how one obtains a linear ordering on a finite partially ordered set A. 14. What is a relational database? Explain. 15. What are SQL queries? Explain. Chapter 4: Matrices and Closures of Relations 1. How does one form the Boolean product of two Boolean matrices? 2. How does one transpose a matrix? 3. What is the matrix I n? 4. Suppose A is an nxn matrix. What does AxI n equal? What does A + I n equal? 5. What is the matrix 0 n? 6. Suppose A is an nxn matrix. What does Ax0 n equal? What does A + 0 n equal? 7. Is a diagonal matrix necessarily symmetric? Explain. 8. Is a symmetric matrix necessarily diagonal? Explain. 9. For Boolean Matrices A and B, is it ever possible for A B = A B? Explain. 10. Suppose M R is the matrix of a relation on a set A. From M R how can one determine if R is reflexive? From M R how can one determine if R is symmetric? 11. What is the definition of Warshalls' algorithm?

3 Chapter 5: Functions 1. What is the key idea that separates a function from a general relation? 2. What does it mean to say a function f: A -> B is i. one-to-one? ii. onto B? 3. Provide a counterexample to the statement that function composition is commutative. 4. Suppose that what is the largest subset of the real numbers that could serve as the domain of f, if f is to be real valued? 5. Suppose f is a function from A into B. Is the relation f -1 always a function? Explain. 6. Provide a counterexample to the statement if : X -> Y and A and B are nonempty subsets of X then f(a B) = f(a) (B). 7. Is it ever true that [x] + [x] = 2x? Is it always true? 8. What does it mean to say a set is countable? 9. Are there sets that are not countable? 10. Explain how to find the sum of the first n terms of an arithmetic progression: a, a+d, a+2d, 11. Explain how to find the sum of the first n terms of a geometric progression: a, ar, ar2, 12. What would be the product of the first n terms of a geometric progression: a, ar, ar 2, 13. i. How can you determine if a sequence is an arithmetic progression? ii. How can you determine if a sequence is a geometric progression? 14. Given a Cayley table how can one determine if the operation is commutative? 15. Would the integers with the operation multiplication form a monoid? Explain. Chapter 6: Congruences 1. What does it mean to say that a is congruent to b modulo m? 2. Explain why an integer n is divisible by 9 if and only if the sum of the digits of n is divisible by 9 3. Consider the system Z 6 with addition, is this system a monoid? Explain. 4. What common error are ISBN's designed to detect? 5. When checking out of a grocery store what could be a reason why the clerk repeatedly passes an item under the scanner? 6. If two digits are interchanged in a UPC is the error detected? Explain. 7. Does the congruence ax b (mod m) always have a solution x? Explain. 8. Explain the Chinese Remainder Theorem. 9. When using a hash function what problem may arise? 10. What is the purpose of linear probing and double hashing? 11. Is it always possible to play a round robin tournament with n teams in n rounds? Explain. 12. Explain why if you know (p n )for every prime p, then you know for every positive integer n. ( is the Euler phi function.) 13. Suppose the gcd(n, 180) =1. Explain why 18 divides n What difficult problem makes the RSA code seem safe?

4 Chapter 7: Counting Principles 1. When would one use the addition principle for counting with two tasks T 1 and T 2? 2. When would one use the multiplication principle for counting with two tasks T 1 and T 2? 3. What is the number of ways of performing T 1 OR T 2, if n(t I ) is the number of ways of performing T I? 4. What is the pigeonhole principle? 5. How many arrangements are there of a set with 35 elements? Explain. 6. How many arrangements are there of 8 elements from a 35 element set? 7. What is the difference between an r-permutation of n letters and an r-combination of n letters? 8. Explain why C(n,r) = C(n,n-r). 9. Explain why the number of ways to arrange 5 A's and 7 B's is 10. Explain why the number of ways to arrange 5 A s, 7 B s and 9 C s is. C(21,5) C(16,7) C(9,9) =. 11. What is the number of ways to select r objects from n with repetitions allowed? 12. Explain why 2n =. 13. What is the identity used to generate Pascal's triangle? 14. How does one find the next largest permutation? Chapter 8: Discrete Probability 1. How does the probability of an event make a comparison between the events which are more likely to occur and the events which are less likely to occur? 2. When are two events said to be mutually exclusive? 3. Find the size of the event that a head and an odd face are turned up in an experiment of tossing a die and throwing a die together. 4. You have a weighted coin. Give examples of some possible probability assignments to head and tail. 5. Discuss about the idea behind the defining criterion of probability assignment. 6. A card is drawn from a well-shuffled deck of 52 cards. Find the odds in favor of drawing a queen or a black card. 8. Discuss the practical meaning of conditional probability and start with this point to come into the concept of independent events. 9. Find the probability of not getting 2 of throwing a die, given that the face turned up is even. 10. Which problems are of Bayesian type? 11. Discuss about the events of some random experiment which should be considered as F 1, F 2,., F k and E. 12. What happens if E is independent to each of F 1, F 2,., F k? 13. The events F 1, F 2,., F k are exhaustive means that either of F 1, F 2,., F k happens.

5 14. If we throw a fair die, there are six possible outcomes. Still some problems concerning this experiment can be solved by Bernoulli trial technique. Discuss the type of these problems. 15. A fair coin is tossed 50 times. We are to find the probability of getting exactly 16 heads. Compare this problem with the above. 16. The probability that a computer remains trouble-free during the warrantee period is 0.8. What is the probability that 8 of our newly purchased 10 computers will give us no trouble during the warrantee period? Chapter 9: Recurrence Relations 1. What is a recurrence relation for a sequence a 0, a 1, a 2,..., a n,...? 2. What are the initial conditions for a recurrence relation? 3. What is the Fibonacci sequence? 4. What is the iteration method for solving a recurrence relation? 5. Verify that s n = 7n +1 is a solution for the recurrence relation a n = a n where a 0 = Verify that sn = 2 n+1-1 is a solution for the recurrence relation a n = 3a n-1-2 an-2 where a 1 = 3 and a 0 = Suppose that a n = d a n-1 where n = 1 and a 0 = A. Verify that s n = Ad n is a solution. 8. What is a linear homogeneous recurrence relation of order k with constant coefficients? 9. What is the characteristic equation of the recurrence relation a n = c 1 a n-1 + c 2 a n-2? 10. For the recurrence relation a n = c 1 a n-1 + c 2 a n-2 what is the form of the solution if the characteristic equation has distinct roots r 1 and r 2? 11. For the recurrence relation a n = c 1 a n-1 + c 2 a n-2 what is the form of the solution if the characteristic equation has a root r 1 of multiplicity two? 12. What is a linear nonhomogeneous recurrence relation of order k with constant coefficients? 13. For the recurrence relation a n - da n-1 = b n u where d, b, u are constant and b and u are nonzero, what is the form of the solution if b d? 14. For the recurrence relation a n - da n-1 = b n u where d, b, u are constant and b and u are nonzero, what is the form of the solution if b = d? 15. For the recurrence relation a n = da n-1 + b n (un + v) where d, b, u, and v are constant and b and u are nonzero, what is the form of the solution if b = d? Chapter 10: Algorithms and Time Complexity 1. What does it mean to say that the function f(x) is big-o of g(x)? 2. If f(n) = a m n m + a m-1 n m-1 + a m-2 n m a 1 n + a 0 with a m 0, then f(n) is big-o of what function? 3. What does it mean to say that the function f(x) is omega of g(x)? 4. What does it mean to say that the function f(x) is theta of g(x)? 5. If f(n) = a m n m + a m-1 n m-1 + a m-2 n m a 1 n + a 0 with am 0, then f(n) is theta of what function?

6 6. If the function f(n) is O(g(n)) and (g(n)), then what can be said about f(n)? 7. What does it mean to say a real valued function f is nondecreasing? 8. What does it mean to say that a function f(x) is smooth? 9. In a sequential search of n elements the average number of comparisons is: 10. In a binary search of n elements the average number of comparisons is: 11. If selection sort is used to sort a list of n elements then the number of key comparisons is: 12. If insertion sort is used to sort a list of n elements then the number of key comparisons is: 13. If merge sort is used to sort a list of n elements then the number of comparisons in the worst case is: 14. In Strassen s algorithm to multiply two n x n matrices, the time complexity is: 15. What is the purpose of the Chained Matrix Multiplication algorithm? Chapter 11: Graph Theory 1. Explain why the sum of the degrees of the vertices of a graph is equal to twice the number of edges. 2. Explain why in a graph the number of vertices of odd degree is even. 3. What does it mean to say a graph is bipartite? 4. What are Ramsey numbers? 5. What is the difference between a walk and a path? 6. What is the difference between a cycle and a circuit? 7. What is a perfect matching in a graph? 8. What is an adjacency matrix of a graph G with n vertices? 9. What is an incidence matrix of a graph G with n vertices and m edges? 10. If a connected graph is Eulerian then the degree of each vertex is even. What is the basic idea in the proof of this statement? 11. Define the relation R on the sets of graphs by G R H if and only if G is isomorphic to H. Then what type of relation is R? 12. What is the fundamental idea in Dijkstra s shortest path algorithm? 13. What is a topological ordering for a directed graph G? 14. If a graph can be colored in 4 or fewer colors does it follow that the graph is planar? 15. Let G be a connected planar graph with v vertices, e edges, and f faces. What equation relates these variables? Chapter 12: Trees and Networks 1. In a tree T can there be more than one path from a vertex u to a vertex v? Explain. 2. In a tree T must there be at least one path from a vertex u to a vertex v? Explain. 3. What does it mean to say that the tree T 1 is isomorphic to T 2? 4. What does it mean to say that a graph is acyclic? 5. Is a graph with 8 vertices and 7 edges necessarily a tree? Explain. 6. What is a leaf in a rooted tree? 7. What is a descendant in a rooted tree?

7 8. What is a binary tree? 9. What is the left subtree of a vertex v in a binary tree? 10. How can one describe a preorder traversal? 11. What is a minimal spanning tree of a graph G? 12. Describe the idea behind Prim s algorithm. 13. What is a transport network? 14. What is a flow? 15. What is the max-flow min-cut theorem? Chapter 13: Boolean Algebra and Combinatorial Circuits 1. What is a two element Boolean algebra? 2. What is a Boolean expression over B in the variables x 1, x 2, x 3,..., x n? 3. Are the Boolean expressions (x 1 x 2 ) and x 1 + x 2 equal? 4. What do the idempotent laws state? 5. What do the absorption laws state? 6. How does one form the dual of a Boolean expression? 7. What is the duality principle? 8. Is it true that a Boolean expression is equal to its dual? If not provide a counterexample. 9. If one has the truth table for a Boolean expression how does one determine the disjunctive normal form? 10. If one has the truth table for a Boolean expression how does one determine the conjunctive normal form? 11. What is an atom in a Boolean algebra? 12. How many Boolean algebras are there with 28 elements? 13. What is the purpose of a Karnaugh map? 14. How many cells are required for a K-map for six variables? 15. Draw the circuit that corresponds to the Boolean expression (x + z)y. Chapter 14: Finite Automata and Languages 1. What is a language on? 2. What is the Kleene star of X? 3. What is a deterministic finite automaton? 4. Let M be the DFA given by Q = {q 0, q 1, q 2 }, = {0, 1}, q0 is the initial state, F = {q 2 }, and is given by What is the transition diagram for M? 5. Let M be the DFA (Q,, q 0,, F). What is the extended transition function *? 6. What is the purpose of the extended transition function *? 7. What is a regular language? 8. Is every language a regular language? Explain.

8 9. How can one determine whether the language A accepted by a DFA with n states is infinite? 10. With what operations does R, the set of all regular languages on, form a Boolean algebra? 11. What is the difference between a DFA and a NDFA? 12. How does a FSM differ from a DFA? 13. Let G = (V N,, P, S) be a context free grammar. What does it mean to say that L is the language generated by G? 14. Let G = (V N,, P, S) be a context free grammar. What is a derivation tree in G? What is a regular grammar?

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

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

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

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

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

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

Tribhuvan University Institute of Science and Technology Micro Syllabus

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

Propositional Logic. What is discrete math? Tautology, equivalence, and inference. Applications

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

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

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

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

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

Name (please print) Mathematics Final Examination December 14, 2005 I. (4)

Name (please print) Mathematics Final Examination December 14, 2005 I. (4) Mathematics 513-00 Final Examination December 14, 005 I Use a direct argument to prove the following implication: The product of two odd integers is odd Let m and n be two odd integers Since they are odd,

More 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

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

7.11 A proof involving composition Variation in terminology... 88

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

CS Discrete Mathematics Dr. D. Manivannan (Mani)

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

COMP1002 exam study sheet

COMP1002 exam study sheet COMP1002 exam study sheet Propositional statement: expression that has a truth value (true/false). It is a tautology if it is always true, contradiction if always false. Logic connectives: negation ( not

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

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

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

Discrete Math. Background Knowledge/Prior Skills Commutative and associative properties Solving systems of equations

Discrete Math. Background Knowledge/Prior Skills Commutative and associative properties Solving systems of equations Discrete Math Numbers and Operations Standard: Understands and applies concepts of numbers and operations. Power 1: Understands numbers, ways of representing numbers, relationships among numbers, and number

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

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

MATH 2200 Final LC Review

MATH 2200 Final LC Review MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from

More information

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

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

More information

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).

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

CMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005

CMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 CMSC-37110 Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade.

More information

Sets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth

Sets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth Sets We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth century. Most students have seen sets before. This is intended

More information

Review 3. Andreas Klappenecker

Review 3. Andreas Klappenecker Review 3 Andreas Klappenecker Final Exam Friday, May 4, 2012, starting at 12:30pm, usual classroom Topics Topic Reading Algorithms and their Complexity Chapter 3 Logic and Proofs Chapter 1 Logic and Proofs

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

Logic. Facts (with proofs) CHAPTER 1. Definitions

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

More information

Discrete Structures, Final Exam

Discrete Structures, Final Exam Discrete Structures, Final Exam Monday, May 11, 2009 SOLUTIONS 1. (40 pts) Short answer. Put your answer in the box. No partial credit. [ ] 0 1 (a) If A = and B = 1 0 [ ] 0 0 1. 0 1 1 [ 0 1 1 0 0 1 ],

More information

DISCRETE MATH: FINAL REVIEW

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

McGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60

McGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60 McGill University Faculty of Science Solutions to Practice Final Examination Math 40 Discrete Structures Time: hours Marked out of 60 Question. [6] Prove that the statement (p q) (q r) (p r) is a contradiction

More information

Exam Practice Problems

Exam Practice Problems Math 231 Exam Practice Problems 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 topics.

More information

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

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

More information

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

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

More information

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

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability Lecture Notes 1 Basic Probability Set Theory Elements of Probability Conditional probability Sequential Calculation of Probability Total Probability and Bayes Rule Independence Counting EE 178/278A: Basic

More information

CS1800 Discrete Structures Final Version A

CS1800 Discrete Structures Final Version A CS1800 Discrete Structures Fall 2017 Profs. Aslam, Gold, & Pavlu December 11, 2017 CS1800 Discrete Structures Final Version A Instructions: 1. The exam is closed book and closed notes. You may not use

More information

MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM

MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through

More information

Anna University, Chennai, November/December 2012

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

Discrete Structures for Computer Science: Counting, Recursion, and Probability

Discrete Structures for Computer Science: Counting, Recursion, and Probability Discrete Structures for Computer Science: Counting, Recursion, and Probability Michiel Smid School of Computer Science Carleton University Ottawa, Ontario Canada michiel@scs.carleton.ca December 18, 2017

More information

BOOLEAN ALGEBRA INTRODUCTION SUBSETS

BOOLEAN ALGEBRA INTRODUCTION SUBSETS BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations

More information

Part IA Numbers and Sets

Part IA Numbers and Sets Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)

More 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

UNIVERSITY OF PUNE, PUNE BOARD OF STUDIES IN MATHEMATICS SYLLABUS. F.Y.BSc (Computer Science) Paper-I Discrete Mathematics First Term

UNIVERSITY OF PUNE, PUNE BOARD OF STUDIES IN MATHEMATICS SYLLABUS. F.Y.BSc (Computer Science) Paper-I Discrete Mathematics First Term UNIVERSITY OF PUNE, PUNE 411007. BOARD OF STUDIES IN MATHEMATICS SYLLABUS F.Y.BSc (Computer Science) Paper-I Discrete Mathematics First Term 1) Finite Induction (4 lectures) 1.1) First principle of induction.

More information

CSCE 222 Discrete Structures for Computing. Review for the Final. Hyunyoung Lee

CSCE 222 Discrete Structures for Computing. Review for the Final. Hyunyoung Lee CSCE 222 Discrete Structures for Computing Review for the Final! Hyunyoung Lee! 1 Final Exam Section 501 (regular class time 8:00am) Friday, May 8, starting at 1:00pm in our classroom!! Section 502 (regular

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

Logic and Boolean algebra

Logic and Boolean algebra Computer Mathematics Week 7 Logic and Boolean algebra College of Information Science and Engineering Ritsumeikan University last week coding theory channel coding information theory concept Hamming distance

More information

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland

Discrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................

More information

Review Sheet for the Final Exam of MATH Fall 2009

Review Sheet for the Final Exam of MATH Fall 2009 Review Sheet for the Final Exam of MATH 1600 - Fall 2009 All of Chapter 1. 1. Sets and Proofs Elements and subsets of a set. The notion of implication and the way you can use it to build a proof. Logical

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

Discrete Math Notes. Contents. William Farmer. April 8, Overview 3

Discrete Math Notes. Contents. William Farmer. April 8, Overview 3 April 8, 2014 Contents 1 Overview 3 2 Principles of Counting 3 2.1 Pigeon-Hole Principle........................ 3 2.2 Permutations and Combinations.................. 3 2.3 Binomial Coefficients.........................

More information

D I S C R E T E M AT H E M AT I C S H O M E W O R K

D I S C R E T E M AT H E M AT I C S H O M E W O R K D E PA R T M E N T O F C O M P U T E R S C I E N C E S C O L L E G E O F E N G I N E E R I N G F L O R I D A T E C H D I S C R E T E M AT H E M AT I C S H O M E W O R K W I L L I A M S H O A F F S P R

More information

MATH 114 Fall 2004 Solutions to practice problems for Final Exam

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

MATH 2200 Final Review

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

More information

Module 1. Probability

Module 1. Probability Module 1 Probability 1. Introduction In our daily life we come across many processes whose nature cannot be predicted in advance. Such processes are referred to as random processes. The only way to derive

More information

Discrete mathematics , Fall Instructor: prof. János Pach

Discrete mathematics , Fall Instructor: prof. János Pach Discrete mathematics 016-017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations, 1.7.

More information

FINAL EXAM CHEAT SHEET/STUDY GUIDE. You can use this as a study guide. You will also be able to use it on the Final Exam on

FINAL EXAM CHEAT SHEET/STUDY GUIDE. You can use this as a study guide. You will also be able to use it on the Final Exam on FINAL EXAM CHEAT SHEET/STUDY GUIDE You can use this as a study guide. You will also be able to use it on the Final Exam on Tuesday. If there s anything else you feel should be on this, please send me email

More information

Equational Logic. Chapter Syntax Terms and Term Algebras

Equational Logic. Chapter Syntax Terms and Term Algebras Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from

More information

2.2: Logical Equivalence: The Laws of Logic

2.2: Logical Equivalence: The Laws of Logic Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q

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

MATH 310 Course Objectives

MATH 310 Course Objectives MATH 310 Course Objectives Upon successful completion of MATH 310, the student should be able to: Apply the addition, subtraction, multiplication, and division principles to solve counting problems. Apply

More information

Automata Theory for Presburger Arithmetic Logic

Automata Theory for Presburger Arithmetic Logic Automata Theory for Presburger Arithmetic Logic References from Introduction to Automata Theory, Languages & Computation and Constraints in Computational Logic Theory & Application Presented by Masood

More information

Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.

Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B. Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination III (Spring 2007) Problem 1: Suppose A, B, C and D are finite sets

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

(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.

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

1 Basic Combinatorics

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

CS 455/555: Mathematical preliminaries

CS 455/555: Mathematical preliminaries CS 455/555: Mathematical preliminaries Stefan D. Bruda Winter 2019 SETS AND RELATIONS Sets: Operations: intersection, union, difference, Cartesian product Big, powerset (2 A ) Partition (π 2 A, π, i j

More information

CSE 1400 Applied Discrete Mathematics Proofs

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

Chapter 9: Relations Relations

Chapter 9: Relations Relations Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair

More information

3. Abstract Boolean Algebras

3. Abstract Boolean Algebras 3. ABSTRACT BOOLEAN ALGEBRAS 123 3. Abstract Boolean Algebras 3.1. Abstract Boolean Algebra. Definition 3.1.1. An abstract Boolean algebra is defined as a set B containing two distinct elements 0 and 1,

More information

Discrete Mathematics: Midterm Test with Answers. Professor Callahan, section (A or B): Name: NetID: 30 multiple choice, 3 points each:

Discrete Mathematics: Midterm Test with Answers. Professor Callahan, section (A or B): Name: NetID: 30 multiple choice, 3 points each: Discrete Mathematics: Midterm Test with Answers Professor Callahan, section (A or B): Name: NetID: 30 multiple choice, 3 points each: 1. If f is defined recursively by: f (0) = -2, f (1) = 1, and for n

More information

CSE 1400 Applied Discrete Mathematics Definitions

CSE 1400 Applied Discrete Mathematics Definitions CSE 1400 Applied Discrete Mathematics Definitions Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Arithmetic 1 Alphabets, Strings, Languages, & Words 2 Number Systems 3 Machine

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

Preliminaries. Graphs. E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)}

Preliminaries. Graphs. E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)} Preliminaries Graphs G = (V, E), V : set of vertices E : set of edges (arcs) (Undirected) Graph : (i, j) = (j, i) (edges) 1 2 3 5 4 V = {1, 2, 3, 4, 5}, E = {(1, 3), (3, 2), (2, 4)} 1 Directed Graph (Digraph)

More information

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

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

More information

Discrete Mathematics for M.Sc.CS

Discrete Mathematics for M.Sc.CS Discrete Mathematics Page 1 CONTENTS UNIT-1 : SETS & RELATIONS 4-11 1. Discrete Mathematics Introduction... 4 2. Sets Set Definition... 4 Representation of a Set... 4 Cardinality of a Set... 5 Types of

More information

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

IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS. 1. Combinatorics IVA S STUDY GUIDE FOR THE DISCRETE FINAL EXAM - SELECTED SOLUTIONS Combinatorics Go over combinatorics examples in the text Review all the combinatorics problems from homewor Do at least a couple of extra

More information

CSE 321 Solutions to Practice Problems

CSE 321 Solutions to Practice Problems CSE 321 Solutions to Practice Problems Instructions: Feel free NOT to multiply out binomial coefficients, factorials, etc, and feel free to leave answers in the form of a sum. No calculators, books or

More information

Mathematical Preliminaries. Sipser pages 1-28

Mathematical Preliminaries. Sipser pages 1-28 Mathematical Preliminaries Sipser pages 1-28 Mathematical Preliminaries This course is about the fundamental capabilities and limitations of computers. It has 3 parts 1. Automata Models of computation

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

Foundations of Mathematics

Foundations of Mathematics Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object

More information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is 1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,

More information

1. (B) The union of sets A and B is the set whose elements belong to at least one of A

1. (B) The union of sets A and B is the set whose elements belong to at least one of A 1. (B) The union of sets A and B is the set whose elements belong to at least one of A or B. Thus, A B = { 2, 1, 0, 1, 2, 5}. 2. (A) The intersection of sets A and B is the set whose elements belong to

More information

BASIC GRAPH THEORY. SUB CODE: 09MAT01 Total hours 52

BASIC GRAPH THEORY. SUB CODE: 09MAT01 Total hours 52 SYLLABUS For the course work syllabus recommended by the Guide for doing Ph.D in the Department of Mathematics, Sri Siddhartha Institute of Technology under SSU, Tumkur. BASIC GRAPH THEORY SUB CODE: 09MAT01

More information

Relations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples.

Relations. We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations We have seen several types of abstract, mathematical objects, including propositions, predicates, sets, and ordered pairs and tuples. Relations use ordered tuples to represent relationships among

More information

Relations. Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations. Reading (Epp s textbook)

Relations. Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations. Reading (Epp s textbook) Relations Relations of Sets N-ary Relations Relational Databases Binary Relation Properties Equivalence Relations Reading (Epp s textbook) 8.-8.3. Cartesian Products The symbol (a, b) denotes the ordered

More information

Boolean Algebra CHAPTER 15

Boolean Algebra CHAPTER 15 CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an

More information

Discrete Mathematics. Benny George K. September 22, 2011

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

Preliminaries and Complexity Theory

Preliminaries and Complexity Theory Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra

More information

Chapter 0 Introduction. Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin

Chapter 0 Introduction. Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin Chapter 0 Introduction Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin October 2014 Automata Theory 2 of 22 Automata theory deals

More information