Loading... Please wait...
Highlights : A Pseudocode approach to Algorithms ? Extensive coverage on Algorithm Analysis with one chapter dedicated to this topic ? Turing Machines, Computability and Formal Languages-topics core to the subject are dealt with comprehensively ? Online Learning Center, in the face of none provided by major competing titles ? Pedagogy: Solved Examples: 262 Problems: 694 Programming Exercises: 36 Figures: 230 New to the Edition : ? Complete and focused coverage of syllabus ? Better chapter organization: Chapters on Computability and Formal Languages and Finite State Machines clubbed into one. ? Numerous new topics like Rules of Inference, Warshall?s Algorithms, DFS, BFS, Semi-Groups and Monoids added ? New pedagogical feature in the form of Programming Exercises added under relevant chapters. ? Over 300 solved and unsolved problems added (189 additional problems and 139 solved problems) ? An exhaustive OLC in the makingTable of Contents:
1. Computability and Formal Languages
2. Permutations, Combinations, and Discrete Probability
3. Relations and Functions
4. Graphs and Planar Graphs
5. Trees and Cut-Sets
6. Finite State Machines
7. Analysis of Algorithms
8. Discrete Numeric Functions and Generating Functions
9. Recurrence Relations and Recursive Algorithms
10. Groups and Rings
11. Boolean Algebras
| Title: | Used Book : Elements of Discrete Mathematics, 2e |
| Publisher: | Tata McGraw-Hill |
| Author: | Liu, C L |
| Edition: | Paperback 2nd Edition |
| Publisher: | Tata McGraw-Hill |
| ISBN: |
0070669139 |
| EAN: |
9780071005449 |
Disclaimer :