Discrete Mathematics

Price: 1050.00 INR

We sell our titles through other companies
Disclaimer :You will be redirected to a third party website.The sole responsibility of supplies, condition of the product, availability of stock, date of delivery, mode of payment will be as promised by the said third party only. Prices and specifications may vary from the OUP India site.

ISBN:

9780199452798

Publication date:

18/03/2015

Paperback

628 pages

241.0x159.0mm

Price: 1050.00 INR

We sell our titles through other companies
Disclaimer :You will be redirected to a third party website.The sole responsibility of supplies, condition of the product, availability of stock, date of delivery, mode of payment will be as promised by the said third party only. Prices and specifications may vary from the OUP India site.

ISBN:

9780199452798

Publication date:

18/03/2015

Paperback

628 pages

241.0x159.0mm

First Edition

R.K. Bisht & H.S. Dhami

Suitable for: Discrete Mathematics is a textbook designed for the students of computer science engineering, information technology, and computer applications

Rights:  World Rights

First Edition

R.K. Bisht & H.S. Dhami

Description

Discrete Mathematics is a textbook designed for the students of computer science engineering, information technology, and computer applications to help them develop the foundation of theoretical computer science.

With a detailed introduction to propositional logic, set theory, and relations, the book goes on to explore the mathematical notions of functions, integers, counting techniques, probability, discrete numeric functions and generating functions, recurrence relations, algebraic structures, and posets and lattices. The discussion ends with chapters on the theory of formal and finite automata, graph theory, and applications of discrete mathematics in various domains.

Adopting a solved problems approach to explain the concepts, the book presents numerous theorems, proofs, practice exercises, and multiple-choice questions.

First Edition

R.K. Bisht & H.S. Dhami

Table of contents

Chapter 1: Introduction to Discrete Mathematics and Propositional Logic
Chapter 2: Set Theory
Chapter 3: Relations
Chapter 4: Functions
Chapter 5: Properties of Integers
Chapter 6: Counting Techniques
Chapter 7: Fundamentals of Probability
Chapter 8: Discrete Numeric Functions and Generating Functions
Chapter 9: Recurrence Relations
Chapter 10: Algebraic Structures
Chapter 11: Posets and Lattices
Chapter 12: Formal Languages and Finite Automata
Chapter 13: Graph Theory
Chapter 14: Applications of Discrete Mathematical Structures

First Edition

R.K. Bisht & H.S. Dhami

Features

  • Presents mid-chapter boxed items, 'check your progress' sections, and chapter-end multiple-choice questions with answers.
  • Provides numerous solved examples and exercises grouped under different themes within every chapter.
  • Presents truth table values for conditional statements in context with an example.
  • Discusses an exclusive section on coding theory and digital logic.
  • Presents 'related research work' and 'application in brief' sections at the end of every chapter
  • Online resources:
  • For faculty:
  • Solutions manual
  • PowerPoint presentations
  • For students:
  • Test generator"

First Edition

R.K. Bisht & H.S. Dhami

First Edition

R.K. Bisht & H.S. Dhami

Description

Discrete Mathematics is a textbook designed for the students of computer science engineering, information technology, and computer applications to help them develop the foundation of theoretical computer science.

With a detailed introduction to propositional logic, set theory, and relations, the book goes on to explore the mathematical notions of functions, integers, counting techniques, probability, discrete numeric functions and generating functions, recurrence relations, algebraic structures, and posets and lattices. The discussion ends with chapters on the theory of formal and finite automata, graph theory, and applications of discrete mathematics in various domains.

Adopting a solved problems approach to explain the concepts, the book presents numerous theorems, proofs, practice exercises, and multiple-choice questions.

Read More

Table of contents

Chapter 1: Introduction to Discrete Mathematics and Propositional Logic
Chapter 2: Set Theory
Chapter 3: Relations
Chapter 4: Functions
Chapter 5: Properties of Integers
Chapter 6: Counting Techniques
Chapter 7: Fundamentals of Probability
Chapter 8: Discrete Numeric Functions and Generating Functions
Chapter 9: Recurrence Relations
Chapter 10: Algebraic Structures
Chapter 11: Posets and Lattices
Chapter 12: Formal Languages and Finite Automata
Chapter 13: Graph Theory
Chapter 14: Applications of Discrete Mathematical Structures

Read More