Paper Code : BCA-27 Paper Title : Discrete Mathematics.

Slides:



Advertisements
Similar presentations
SIMPLIFY using a Venn Digram or Laws of Set Algebra Pamela Leutwyler.
Advertisements

Polynomial dynamical systems over finite fields, with applications to modeling and simulation of biological networks. IMA Workshop on Applications of.
Chapter 2 Logic Circuits.
Logic Functions Logical functions can be expressed in several ways: ▫ Truth table ▫ Logical expressions ▫ Graphical form prepared by:eng.Rula Amjed.
Math443/543 Mathematical Modeling and Optimization
CTIS154-01,02,03 Discrete Mathematics II Kadir A. Peker Tel: x5406.
Computing Fundamentals 2 Overview Lecturer: Patrick Browne Room [KA] , Lab [KA] Based on Chapter 19. A Logical approach to Discrete Math.
Fall 2002CMSC Discrete Structures1 Yes, No, Maybe... Boolean Algebra.
Final Exam Review Cummulative Chapters 0, 1, 2, 3, 4, 5 and 7.
Section Section Summary Introduction to Boolean Algebra Boolean Expressions and Boolean Functions Identities of Boolean Algebra Duality The Abstract.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
Applications of discrete mathematics: Formal Languages (computer languages) Compiler Design Data Structures Computability Automata Theory Algorithm Design.
Discrete Mathematics Transparency No. 0-1 Discrete Mathematics Cheng-Chia Chen September 2009.
Relationships Between Structures “→” ≝ “Can be defined in terms of” Programs Groups Proofs Trees Complex numbers Operators Propositions Graphs Real.
1 Section 10.2 Boolean Algebra Motivation: Notice the list of corresponding properties for the algebra of sets and the algebra of propositional wffs. These.
Discrete Math Unit 6 Set Theory Number Theory Graph Theory.
Algorithms  Al-Khwarizmi, arab mathematician, 8 th century  Wrote a book: al-kitab… from which the word Algebra comes  Oldest algorithm: Euclidian algorithm.
CS/EE 3700 : Fundamentals of Digital System Design Chris J. Myers Lecture 2: Intro. to Logic Circuits Chapter 2.
Boolean Algebra and Computer Logic Mathematical Structures for Computer Science Chapter 7.1 – 7.2 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Boolean.
DISCRETE COMPUTATIONAL STRUCTURES CS Fall 2005.
1 Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 1 Adaptation to this.
MATH 224 – Discrete Mathematics
1 Introduction to Abstract Mathematics Sets Section 2.1 Basic Notions of Sets Section 2.2 Operations with sets Section 2.3 Indexed Sets Instructor: Hayk.
Figure 2.6. A truth table for the AND and OR operations. 2.3 Truth Tables 1.
Unit II Discrete Structures Relations and Functions SE (Comp.Engg.)
MTH221 November 6, /6/ DISCRETE MATHEMATICS FOR IT PROFESSIONALS Pair the class Set dates See students progress Assignments Final Exam Quizzes.
Lecture 1 Overview Topics 1. Proof techniques: induction, contradiction Proof techniques June 1, 2015 CSCE 355 Foundations of Computation.
Discrete Mathematics Set.
SEMESTERFIVE SUBJECT CODEMA1256 PROFESSORV.SUNDARARAJAN.
CSCI 115 Course Review.
Thinking Mathematically Venn Diagrams and Subsets.
Notes Over 3.1 Solving a System Graphically Graph the linear system and estimate the solution. Then check the solution algebraically.
Boolean Algebra.
Thinking Mathematically Venn Diagrams and Set Operations.
Introductory Lecture. What is Discrete Mathematics? Discrete mathematics is the part of mathematics devoted to the study of discrete (as opposed to continuous)
CS 2130 Computational Structures (Discrete Mathematics for Computing)
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)
MATHEMATICS B.A./B.Sc. (GENERAL) THIRD YEAR EXAMINATION, 2012.
Review: Discrete Mathematics and Its Applications
Chapter 4 Introduction to Set Theory
“<Fill in your definition here.>”
CSCE 355 Foundations of Computation
Lecture 04 Set Theory Profs. Koike and Yukita
Chapter 11 (Part 1): Boolean Algebra
Formal Methods in software development
MATH 224 – Discrete Mathematics
… and now for the Final Topic:
ALGEBRA MODELLING ACTIVITY ONE.
Principles of Computing – UFCFA Lecture-1
CSCE 355 Foundations of Computation
Discrete Mathematics and Its Applications
Design and Analysis of Algorithms (07 Credits / 4 hours per week)
Set Operations Section 2.2.
CMSC Discrete Structures
Lecture 20: Combinatorial Circuits I
A Brief Summary for Exam 1
Chapter 2 Introduction to Logic Circuits
Linear Algebra Lecture 3.
Review: Discrete Mathematics and Its Applications
Chapter 2: Rational Numbers
Discrete Mathematics Lecture 6: Set and Function
Formal Methods in software development
Chapter 4 Gates and Circuits.
Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007
Principles of Computing – UFCFA Week 1
Warm Up Simplify 3(x + 2) -2(2y + 3) -4(-3p + 4) 3(-5z – 1)
Simplify by combining like terms
Design and Analysis of Algorithms (04 Credits / 4 hours per week)
CMSC Discrete Structures
Presentation transcript:

Paper Code : BCA-27 Paper Title : Discrete Mathematics

SECTION-A Set Theory : Relations and Functions : Set Notation and Description, subset, basic set operations, Venn Diagrams, laws of set theory, partitions of sets, min sets, duality principle, basic definitions of relations and functions, graphics of relations, properties of relations: injective, surjective and bijective functions, compositions. Recurrence : Recurrence Relations and Recursive Algorithms – Linear-Recurrence Relations with Constant Coefficients; Homogeneous Solutions : Particular Solution, Total Solution, Solution by the Method of Generating functions.

SECTION-B Graph Theory : Graph and planar graphs – Basic Terminology, Multi-graphs, Weighted Graphs, Paths and Circuits, Shortest Paths, Eulerian Paths and Circuits. Travelling Salesman Problem, Planar Graphs.

SECTION-C Automata Theory : Finite State Machines–Equivalent Machines, Finite State Machines as language Recognizers; Analysis of Algorithms - Time Complexity, Complexity of Problems. Boolean Algebra : Lattices and Algebraic Structures; Duality. Distributive and Complemented Lattices, Boolean Lattices and Boolean Algebra.

SECTION-D Boolean Functions and Expressions, Propositional Calculus, Design and Implementation of Digital Networks, Switching Circuits.