Discrete mathematics for engineers and scientist / (Record no. 3145)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03691nam a2200229Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20250520094816.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 250520s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9789814232920 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA 76.9 .H34 2008 |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Haggard, Gary |
| Relator term | author |
| 245 #0 - TITLE STATEMENT | |
| Title | Discrete mathematics for engineers and scientist / |
| Statement of responsibility, etc. | Gary Haggard, John Schlipf and Sue Whitesides. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | Belmont, California : |
| Name of publisher, distributor, etc. | Thomson Brooks/Cole, |
| Date of publication, distribution, etc. | c2008 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xxiii, 600 pages : |
| Other physical details | illustrations ; |
| Dimensions | 24 cm |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc. note | Includes index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 1. SETS, PROOF TEMPLATES, AND INDUCTION. Basic Definitions. Exercises. Operations on Sets. Exercises. The Principle of Inclusion-Exclusion. Exercises. Mathematical Induction. Program Correctness. Exercises. Strong Form of Mathematical Induction. Exercises. Chapter Review. 2. FORMAL LOGIC. Introduction to Propositional Logic. Exercises. Truth and Logical Truth. Exercises. Normal Forms. Exercises. Predicates and Quantification. Exercises. Chapter Review. 3. RELATIONS. Binary Relations. Operations on Binary Relations. Exercises. Special Types of Relations. Exercises. Equivalence Relations. Exercises. Ordering Relations. Exercises. Relational Databases: An Introduction. Exercises. Chapter Review. 4. FUNCTIONS. Basic Definitions. Exercises. Operations on Functions. Sequences and Subsequences. Exercises. The Pigeon-Hole Principle. Exercises. Countable and Uncountable Sets. Exercises. Chapter Review. 5. ANALYSIS OF ALGORITHMS. Comparing Growth Rates of Functions. Exercises. Complexity of Programs. Exercises. Uncomputability. Chapter Review. 6. GRAPH THEORY. Introduction to Graph Theory. The Handshaking Problem. Paths and Cycles. Graph Isomorphism. Representation of Graphs. Exercises. Connected Graphs. The Konigsberg Bridge Problem. Exercises. Trees. Spanning Trees. Rooted Trees. Exercises. Directed Graphs. Applications: Scheduling a Meeting Facility. Finding a Cycle in a Directed Graph. Priority in Scheduling. Connectivity in Directed Graphs. Eulerian Circuits in Directed Graphs. Exercises. Chapter Review. 7. COUNTING AND COMBINATORICS. Traveling Salesperson. Counting Principles. Set Decomposition Principle. Exercises. Permutations and Combinations. Constructing the kth Permutation. Exercises. Counting with Repeated Objects. Combinatorial Identities. Pascals Triangle. Exercises. Chapter Review. 8. DISCRETE PROBABILITY. Ideas of Chance in Computer Science. Exercises. Cross Product Sample Spaces. Exercises. Independent Events and Conditional Probability. Exercises. Discrete Random Variables. Exercises. Variance, Standard Deviation, and the Law of Averages. Exercises. Chapter Review. 9. RECURRENCE RELATIONS. The Tower of Hanoi Problem. Solving First-Order Recurrence Relations. Exercises. Second-Order Recurrence Relations. Exercises. Divide-and-Conquer Paradigm. Binary Search. Merge Sort. Multiplication of n-Bit Numbers. Divide-and-Conquer Recurrence Relations. Exercises. Chapter Review. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Master the fundamentals of discrete mathematics with DISCRETE MATHEMATICS FOR COMPUTER SCIENCE with Student Solutions Manual CD-ROM! An increasing number of computer scientists from diverse areas are using discrete mathematical structures to explain concepts and problems and this mathematics text shows you how to express precise ideas in clear mathematical language. Through a wealth of exercises and examples, you will learn how mastering discrete mathematics will help you develop important reasoning skills that will continue to be useful throughout your career. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | MATHEMATICS |
| 700 ## - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Schlipf, John ;Whitesides, Sue |
| Relator term | co-author;co-author |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Library of Congress Classification |
| Koha item type | Books |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Cost, normal purchase price | Total checkouts | Full call number | Barcode | Date last seen | Copy number | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Library of Congress Classification | Gen. Ed. - CCIT | LRC - Main | National University - Manila | General Circulation | 04/11/2011 | Purchased - MindMover | 698.00 | GC QA 76.9 .H34 2008 | NULIB000000904 | 05/20/2025 | c.1 | 05/20/2025 | Books |