Home / Catalog / Discrete Mathematics
  
Discrete Mathematics  
Author(s): B Praba
Published by Vijay Nicole Imprints Private Limited
Publication Date:  Available in all formats
ISBN: 9789394681156

PAPERBACK

EBOOK (EPUB)

EBOOK (PDF)

ISBN: 9788182092259 Price: INR 350.00
Add to cart Buy Now

Description

Table of contents

Biographical note

Discrete Mathematics deals with mathematical structures that are not continuous and has wide applications in many areas of computer science. This book follows a step-by-step approach to learning theoretical concepts and reinforces learnt concepts through solved problems. The book is written primarily To suit the requirements of undergraduate engineering students of computer science and mathematics courses.

Rating
Description

Discrete Mathematics deals with mathematical structures that are not continuous and has wide applications in many areas of computer science. This book follows a step-by-step approach to learning theoretical concepts and reinforces learnt concepts through solved problems. The book is written primarily To suit the requirements of undergraduate engineering students of computer science and mathematics courses.

Table of contents
  • Cover
  • Title Page
  • Copyright Page
  • Dedication Page
  • Contents
  • Preface
  • 1. LOGIC
    • Introduction
    • Connectives
    • Functionally Complete Set of Connectives
    • Normal Forms
    • Theory of Inference
    • Predicate Calculus
    • Inference Theory Predicate Calculus
    • Exercise
  • 2. SETS AND RELATIONS
    • Introduction
    • Combination of Sets
    • Relations
    • Functions
    • Invertible Functions
    • Hash Function
    • Pigeon Hole Principle
    • Mathematical Induction
    • Principle of Inclusion and Exclusion
    • Exercise
  • 3. LATTICES AND BOOLEAN ALGEBRA
    • Introduction
    • Boolean Algebra and Its Applications
    • Stone’s Representation Theorem
    • Karnaugh Maps
    • Application of Boolean Algebra in Switching Circuits
    • Exercise
  • 4. RECURSIVE FUNCTIONS
    • Introduction
    • Recurrence Relation
    • Generating Functions
    • Multinomial Theorem
    • Exercise
  • 5. ALGEBRAIC STRUCTURES
    • Introduction
    • Groups
    • Subgroups
    • Legrange’s Theorem
    • Normal Subgroups
    • Permutation Group
    • Algebraic System with Two Binary Operation
    • Algebra of Formal Power Series
    • Coding Theory
    • Exercise
  • 6. GRAPH THEORY
    • Introduction
    • Matrix Representation of Graphs
    • Exercise
  • 7. FINITE AUTOMATA AND REGULAR LANGUAGES
    • Introduction
    • Grammars and Languages
    • Phrase Structure Grammar
    • Backus-Naur Form (BNF)
    • Chomsky-Normal Form
    • Exercise
    • Alphabets, Strings and Languages
    • Regular Expressions
    • Finite Automata
    • Pumping Lemma
    • Moore Machines
    • Decision Problems
    • Exercise
    • Push Down Automata (PDA)
    • Exercise
  • 8. TURING MACHINES
    • Introduction
    • Configuration of a TM
    • Multiple Tracks
    • Computing with Turing Machines
    • Recursive and Recursively Enumerable Languages
    • Recursively Enumerable Languages
    • Exercise
  • 9. MATRIX THEORY
    • Introduction
    • Determinants
    • Properties of Determinants
    • Matrices
    • Inverse of a Matrix
    • Eigen Values
    • Eigen Vectors
    • Properties of Eigen Values
    • Cayley-Hamilton Theorem
    • Exercise
  • PROBLEMS FOR PRACTICE
Biographical note

B Praba is presently Associate Professor, Department of Mathematics, SSN College of Engineering, Chennai. She has 22 years of research and teaching experience and has written books on Discrete Mathematics, Statistics, Random Process and Queuing Theory and Statistics for Management. She has obtained her Ph.D., from Ramanujan Institute for Advanced Study in Mathematics, Chennai.

User Reviews
Rating