SEMESTERFIVE SUBJECT CODEMA1256 PROFESSORV.SUNDARARAJAN.

Slides:



Advertisements
Similar presentations
REPRESENTAÇÃO DO CONHECIMENTO Terças – 13 hs – sala 512 RDC.
Advertisements

CLASSICAL LOGIC and FUZZY LOGIC. CLASSICAL LOGIC In classical logic, a simple proposition P is a linguistic, or declarative, statement contained within.
CS128 – Discrete Mathematics for Computer Science
Computability and Complexity 8-1 Computability and Complexity Andrei Bulatov Logic Reminder.
1 Discrete Structures CS Johnnie Baker Comments on Early Term Test.
Relations. Binary Relations a relation between elements of two sets is a subset of their Cartesian product (of ordered pairs). Note the di ff erence between.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
CMSC 250 Discrete Structures Exam #1 Review. 21 June 2007Exam #1 Review2 Symbols & Definitions for Compound Statements pq p  qp  qp  qp  qp  q 11.
From Chapter 4 Formal Specification using Z David Lightfoot
1 Inference Rules and Proofs Z: Inference Rules and Proofs.
Discrete Mathematics Math 6A Instructor: M. Welling.
CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.
Chapter 2 Sets, Relations, and Functions SET OPERATIONS The union of A and B.
Adapted from Discrete Math
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
CSNB143 – Discrete Structure
Valid Arguments Decide if each argument is valid. If the stones are rolling, they are not gathering moss. If the stones are not gathering moss, they are.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
MATH 213 A – Discrete Mathematics for Computer Science Dr. (Mr.) Bancroft.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
Discrete Structures Review Presented by: Aaron Morales Tony Thi.
A Brief Summary for Exam 1 Subject Topics Propositional Logic (sections 1.1, 1.2) –Propositions Statement, Truth value, Proposition, Propositional symbol,
CSNB143 – Discrete Structure. Learning Outcomes – At the end of this course, students should be able to use all basic concepts of mathematical structures.
MATH 224 – Discrete Mathematics
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
DISCRETE COMPUTATIONAL STRUCTURES
Fundamentals of Logic 1. What is a valid argument or proof? 2. Study system of logic 3. In proving theorems or solving problems, creativity and insight.
 Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder notion, Recursive definition  , ,  
January 30, 2002Applied Discrete Mathematics Week 1: Logic and Sets 1 Let’s Talk About Logic Logic is a system based on propositions.Logic is a system.
1 IS 2150 / TEL 2810 Introduction to Security James Joshi Associate Professor, SIS Lecture 3 September 15, 2009 Mathematical Review Security Policies.
Mathematical Preliminaries
Chapter 1: The Foundations: Logic and Proofs
Discrete mathematics SEMESTERFIVE SUBJECT CODEMA1256 V.SUNDARARAJAN PROFESSOR CSE.
Lecture 1 Overview Topics 1. Proof techniques: induction, contradiction Proof techniques June 1, 2015 CSCE 355 Foundations of Computation.
Chapter 2 Fundamentals of Logic 1. What is a valid argument or proof?
Discrete Mathematics Mathematical reasoning: think logically; know how to prove Combinatorial analysis: know how to count Discrete structures: represent.
Symbolic Logic The Following slide were written using materials from the Book: The Following slide were written using materials from the Book: Discrete.
MATHEMATICAL FOUNDATION OF COMPUTER SCIENCE By, A.Kousar Nikhath, Asst.Professor, CSE Dpt.
CSCI 115 Course Review.
Thinking Mathematically Logic 3.4 Truth Tables for the Conditional and Biconditional.
Introduction to Predicates and Quantified Statements I Lecture 9 Section 2.1 Wed, Jan 31, 2007.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
DISCRETE COMPUTATIONAL STRUCTURES CSE 2353 Fall 2010 Most slides modified from Discrete Mathematical Structures: Theory and Applications by D.S. Malik.
CSE 20: Discrete Mathematics for Computer Science Prof. Shachar Lovett.
Review: Discrete Mathematics and Its Applications
Discrete Mathematics Margaret H. Dunham
CSCE 355 Foundations of Computation
2. The Logic of Compound Statements Summary
Unit-III Algebraic Structures
DISCRETE MATHEMATICS CHAPTER I.
COMP 1380 Discrete Structures I Thompson Rivers University
Lecture 03 Logic and Propositional Calculus Profs. Koike and Yukita
How do I show that two compound propositions are logically equivalent?
Paper Code : BCA-27 Paper Title : Discrete Mathematics.
CSCE 355 Foundations of Computation
IS 2150 / TEL 2810 Information Security & Privacy
Chapter 8 Logic Topics
Propositional Logic Defining Propositional Logic
A Brief Summary for Exam 1
IS 2150 / TEL 2810 Introduction to Security
Review: Discrete Mathematics and Its Applications
1 Chapter An Introduction to Problem Solving
1 Chapter An Introduction to Problem Solving
Discrete Mathematics Lecture 1: Introduction
Discrete Mathematics Lecture 1: Introduction
COMP 1380 Discrete Structures I Thompson Rivers University
Logic Logic is a discipline that studies the principles and methods used to construct valid arguments. An argument is a related sequence of statements.
IS 2150 / TEL 2810 Introduction to Security
IS 2150 / TEL 2810 Information Security & Privacy
Presentation transcript:

SEMESTERFIVE SUBJECT CODEMA1256 PROFESSORV.SUNDARARAJAN

UNIT-IPROPOSITIONAL CALCULUS

 PROPOSITIONS  LOGICAL CONNECTIVES  COMPOUND PROPOSITIONS  CONDITIONAL & BI-CONDITIONAL TRUTH TABLES  TAUTOLOGY & CONTRADICTION  CONTRA+VE  LOGICAL EQUIVALENCE & IMPLICATION

 DEMORGAN’S LAW  NORMAL FORMS  PRINCIPAL NORMAL CONJUCTIVE & DISJUNCTIVE  RULES OF INFERENCE  ARGUMENTS  VALIDITY OF ARGUMENTS

UNIT-IIPREDICATE CALCULUS

 PREDICATES  STATEMENT FUNCTION  VARIABLES  FREE & BOUND VARIABLES  QUANTIFIERS  UNIVERSE OF DISCOURSE  LOGICAL EQUIVALENCE & IMPLICATION

 THEORY OF INFERENCE  RULES OF UNIVERSAL SPECIFICATION & GENERALISATION  VALIDITY OF ARGUMENTS

UNIT-III SET THEORY

 BASIC & NOTATIONS  SUBSETS  ALGEBRA OF SETS  POWER SET  ORDERED PAIR & CARTESIAN PRODUCT  SET RELATIONS & PROPERTIES  RELATIONAL MATRIX & GRAPH OF RELATION

 PARTITIONS  EQUIVALENCE RELATION  PARTIAL ORDERING  POSET  HASSE DIAGRAM  LATTICES  SUBLATTICES  BOOLEAN ALGEBRA  HOMOMORPHISM

UNIT-IV FUNCTIONS

 DEFINITIONS  CLASSIFICATIONS  TYPES  EXAMPLES  COMPOSITIONS  INVERSE FUNCTIONS  BINARY & n-ARY OPERATIONS

 CHARECTERISTICS FUNCTIONS  HASHING FUNCTIONS  RECURSIVE FUNCTIONS  PERMUTATION FUNCTIONS

UNIT-V GROUPS

 ALGEBRAIC SYSTEMS  DEFINITIONS  PROPERTIES  SEMIGRROUPS  MONOIDS  HOMOMORPHISM  SUB –SEMIGROUPS  SUB-MONOIDS

 LAGRANGE’S THEOREM  NORMAL SUBGROUPS  NORMAL ALGEBRAIC SYSTEM  CODES & GROUP CODES  BASIC NOTIONS FOR ERROR CORRECTION  ERROR RECOVERY IN GROUP CODES

UNIT NO. AS PER UNIVERSITY ORDER (IN HOURS) AS PER TEACHING PLAN (IN HOURS) TOTAL *********(+15)  TUTORIAL HOURS

 TREMBLY & MANOHAR-DISCRETE MATHEMATICAL STRUCTURES WITH COMPUTER APPLICATIONS – TMH Pub.Co.Ltd-2003  RALPH P. GRIMALDI- DISCRETE & COMBINATORIAL MATHEMATICS: AN APPLIED INTRODUCTION-4 th EDITION,PEARSON Education Asia-2002

 BERNARD KOLMAN, BUSBY R.C. AND SHARAN CUTLER ROSS-DISCRETE MATHEMATICAL STRUCTURES –4 TH INDIAN REPRINT-PEARSON EDUCATION Pvt.Ltd.  KENNETH H.ROSEN-DISCRETE MATHEMATICAL AND ITS APPLICATIONS – 5 TH EDITION –TMH PUBLISHING COMPANY.  RICHARD JOHNSONBAUGH- DISCRETE MATHEMATICS - 5 TH EDITION –PEARSON EDUCATION ASIA.