Fundamentals of Discrete mathematical structures K. R. Chowdhary
Material type: TextLanguage: English Publication details: New Delhi : PHI Learning, 2015.Edition: 3rd edDescription: xvii, 341 p.: ill.; 24 cmISBN:- 9788120350748
- 511.6 CHO
Item type | Current library | Collection | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
General Books | CUTN Central Library Sciences | Non-fiction | 511.6 CHO (Browse shelf(Opens below)) | Available | 34034 | |
General Books | CUTN Central Library Sciences | Non-fiction | 511.6 CHO (Browse shelf(Opens below)) | Available | 34035 | |
General Books | CUTN Central Library Sciences | Non-fiction | 511.6 CHO (Browse shelf(Opens below)) | Available | 34036 | |
General Books | CUTN Central Library Sciences | Non-fiction | 511.6 CHO (Browse shelf(Opens below)) | Available | 34037 | |
Reference Books | CUTN Central Library Sciences | Reference | 511.6 CHO (Browse shelf(Opens below)) | Not For Loan | 34038 |
Browsing CUTN Central Library shelves, Shelving location: Sciences, Collection: Non-fiction Close shelf browser (Hides shelf browser)
511.6 CHO Fundamentals of Discrete mathematical structures | 511.6 CHO Fundamentals of Discrete mathematical structures | 511.6 CHO Fundamentals of Discrete mathematical structures | 511.6 CHO Fundamentals of Discrete mathematical structures | 511.6 EMM Combinatorics / | 511.6 FEN Combinatorial extremization / | 511.6 KOL Discrete mathematical structures. |
Discrete Structures and Set Theory
Induction, Recursion and Recurrences
Combinatorics
Discrete Probability
Mathematical Logic
Logical Inferencing
Predicate Logic
Graph Theory
Relations
Transitive Closure and Warshall’s Algorithm
Equivalence and Partial Ordering Relations
Trees
Algebraic Systems
Languages, Automata and Grammars
Prime Numbers and Cryptosystems
This updated text, now in its Third Edition, continues to provide the basic concepts of discrete mathematics and its applications at an appropriate level of rigour.
The text teaches mathematical logic, discusses how to work with discrete structures, analyzes combinatorial approach to problem-solving and develops an ability to create and understand mathematical models and algorithms essentials for writing computer programs. Every concept introduced in the text is first explained from the point of view of mathematics, followed by its relation to Computer Science. In addition, it offers excellent coverage of graph theory, mathematical reasoning, foundational material on set theory, relations and their computer representation, supported by a number of worked-out examples and exercises to reinforce the students’ skill.
There are no comments on this title.