Applied discrete structures for computer science
This textbook was written for a first course in digital logic for computer science majors. The book covers set theory, combinatorics, logic, matrix algebra, relations, functions, recursion, graph theory, trees, Boolean algebra, monoids, automata, group theory, rings, fields, and determinants.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Published: |
Chicago
Science Research Associates
1989
©1989 |
| Edition: | Second Edition |
| Subjects: | |
| Online Access: | Click Here to View Status and Holdings. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Add Tag | Summary: | This textbook was written for a first course in digital logic for computer science majors. The book covers set theory, combinatorics, logic, matrix algebra, relations, functions, recursion, graph theory, trees, Boolean algebra, monoids, automata, group theory, rings, fields, and determinants. |
|---|---|
| Item Description: | Includes index. |
| Physical Description: | xxiv, 654 pages illustrations 24 cm |
| Bibliography: | Includes bibliographical references (page 641-643) and indexes |
| ISBN: | 0023299347 |
Discrete mathematical structures for computer science