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:
9780198065432
Publication date:
15/12/2010
Paperback
584 pages
243.0x185.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:
9780198065432
Publication date:
15/12/2010
Paperback
584 pages
243.0x185.0mm
Discrete Mathematics is designed as a textbook for undergraduate engineering students of computer science and postgraduate students of computer applications.
Suitable for: Discrete Mathematics is designed as a textbook for undergraduate engineering students of computer science and postgraduate students of computer applications.
Rights: World Rights
Description
The book seeks to introduce students to the mathematical concepts needed to develop logical reasoning, abstract thinking, and problem solving—important prerequisites for the study of computer science.
The book provides an exhaustive coverage of various concepts of discrete mathematics. Beginning with a detailed analysis of modern mathematical concepts such as sets, relations and functions, and matrices, the book delves into core concepts of discrete mathematics like combinatorics, mathematical logic and truth tables, groups, order relation and lattices, Boolean algebra, trees, and graphs. Special emphasis is also laid on certain advanced topics like complexity and formal languages and automata. Algorithms and programs have been used wherever required to illustrate the applications.
Written in a lucid style, the book helps students apply the mathematical tools to computer-related concepts.
Table of contents
Chapter 1. Sets, Relations, and Functions
Chapter 2. Combinatorics
Chapter 3. Mathematical Logic
Chapter 4. Algebraic Structures
Chapter 5. Matrix Algebra
Chapter 6. Order, Relation, and Lattices
Chapter 7. Boolean Algebra
Chapter 8. Complexity
Chapter 9. Graph Theory
Chapter 10. Tree
Chapter 11. Formal Language and Automata
Features
- Contains numerous solved examples and end-chapter exercises
- Lays emphasis on the applicability of mathematical structures to computer science
- Includes separate chapters on combinatorics and automata theory
- Includes additional topics on Boolean algebra and automata theory as well as an appendix on number theory
Description
The book seeks to introduce students to the mathematical concepts needed to develop logical reasoning, abstract thinking, and problem solving—important prerequisites for the study of computer science.
The book provides an exhaustive coverage of various concepts of discrete mathematics. Beginning with a detailed analysis of modern mathematical concepts such as sets, relations and functions, and matrices, the book delves into core concepts of discrete mathematics like combinatorics, mathematical logic and truth tables, groups, order relation and lattices, Boolean algebra, trees, and graphs. Special emphasis is also laid on certain advanced topics like complexity and formal languages and automata. Algorithms and programs have been used wherever required to illustrate the applications.
Written in a lucid style, the book helps students apply the mathematical tools to computer-related concepts.
Read MoreTable of contents
Chapter 1. Sets, Relations, and Functions
Chapter 2. Combinatorics
Chapter 3. Mathematical Logic
Chapter 4. Algebraic Structures
Chapter 5. Matrix Algebra
Chapter 6. Order, Relation, and Lattices
Chapter 7. Boolean Algebra
Chapter 8. Complexity
Chapter 9. Graph Theory
Chapter 10. Tree
Chapter 11. Formal Language and Automata
