Ship-Ship-Hooray! Free Shipping on $25+ Details >

by D.S. Malik and M.K. Sen

Edition: 04Copyright: 2004

Publisher: Course Technology, Inc.

Published: 2004

International: No

Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.

Available in the Marketplace starting at $1.99

Price | Condition | Seller | Comments |
---|

Discrete Mathematical Structures teaches students the mathematical foundations of computer science, including logic, Boolean algebra, basic graph theory, finite state machines, grammars, and algorithms. This required class for Computer Science students helps them understand mathematical reasoning for reading, comprehension, and construction of mathematical arguments.

1. Foundations: Sets, Logic, and Algorithms

2. Integers and Mathematical Induction

3. Relations and Posets

4. Matrices and Closures of Relations

5. Functions

6. Congruences

7. Counting Principles

8. Recurrence Relations

9. Algorithms and Time Complexity

10. Graphs

11. Trees and Networks

12. Boolean Algebra and Combinatorial Circuits

13. Finite Automata

shop us with confidence

Summary

Discrete Mathematical Structures teaches students the mathematical foundations of computer science, including logic, Boolean algebra, basic graph theory, finite state machines, grammars, and algorithms. This required class for Computer Science students helps them understand mathematical reasoning for reading, comprehension, and construction of mathematical arguments.

Table of Contents

1. Foundations: Sets, Logic, and Algorithms

2. Integers and Mathematical Induction

3. Relations and Posets

4. Matrices and Closures of Relations

5. Functions

6. Congruences

7. Counting Principles

8. Recurrence Relations

9. Algorithms and Time Complexity

10. Graphs

11. Trees and Networks

12. Boolean Algebra and Combinatorial Circuits

13. Finite Automata

Publisher Info

Publisher: Course Technology, Inc.

Published: 2004

International: No

Published: 2004

International: No

2. Integers and Mathematical Induction

3. Relations and Posets

4. Matrices and Closures of Relations

5. Functions

6. Congruences

7. Counting Principles

8. Recurrence Relations

9. Algorithms and Time Complexity

10. Graphs

11. Trees and Networks

12. Boolean Algebra and Combinatorial Circuits

13. Finite Automata