Introductory discrete mathematics / (Record no. 194301)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01246pam a2200301 a 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780486691152 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | CUS |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 511 |
| Item number | BAL/I |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Balakrishnan, V. K., |
| 245 10 - TITLE STATEMENT | |
| Title | Introductory discrete mathematics / |
| Statement of responsibility, etc. | V.K. Balakrishnan. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | Dover ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | New York : |
| Name of publisher, distributor, etc. | Dover Publications, |
| Date of publication, distribution, etc. | 1996. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xiv, 236 p. : |
| Other physical details | ill. ; |
| Dimensions | 24 cm. |
| 440 #0 - SERIES | |
| Title | Dover books on mathematics |
| 500 ## - GENERAL NOTE | |
| General note | "An unabridged, corrected republication of the work first published by Prentice Hall, Englewood Cliffs, N.J., 1991"--T.p. verso. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Includes bibliographical references (p. 219-223) and index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Set theory and logic. Introduction to set theory ; Functions and relations ; Inductive proofs and recursive definitions --<br/>Combinatorics. Two basic counting rules ; Permutations ; Combinations ; More on permutations and combinations ; The pigeonhole principle ; The inclusion-exclusion principle ; Summary of results in combinatorics --<br/>Generating functions. Ordinary generating functions ; Exponential generating functions --<br/>Recurrence relations. Homogeneous recurrence relations ; Inhomogeneous recurrence relations ; Recurrence relations and generating functions ; Analysis of algorithms --<br/>Graphs and digraphs. Adjacency matrices and incidence matrices ; Joining in graphs ; Reaching in digraphs ; Testing connectedness ; Strong orientation of graphs --<br/>More on graphs and digraphs. Eulerian paths and Eulerian circuits ; Coding and de Bruijn digraphs ; Hamiltonian paths and Hamiltonian cycles ; Applications of Hamiltonian cycles ; Vertex coloring and planarity of graphs --<br/>Trees and their applications. Spanning trees ; Binary trees --<br/>Spanning tree problems. More on spanning trees ; Kruskal's greedy algorithm ; Prim's greedy algorithm ; Comparison of the two algorithms --<br/>Shortest path problems. Dijkstra's algorithm ; Floyd-Warshall algorithm ; Comparison of the two algorithms --<br/>What is NP-completeness? Problems and their instances ; The size of an instance ; Algorithm to solve a problem ; The "Big Oh" or the O(ยท) notation ; Easy problems and difficult problems ; the Class P and the Class NP ; Polynomial transformations and NP-completeness ; Coping with hard problems. |
| 650 #0 - SUBJECT | |
| Keyword | Mathematics. |
| 650 #0 - SUBJECT | |
| Keyword | Computer science |
| General subdivision | Mathematics. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | General Books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Date acquired | Source of acquisition | Cost, normal purchase price | Full call number | Accession number | Date last seen | Date last checked out | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Central Library, Sikkim University | Central Library, Sikkim University | 10/01/2018 | Researchco | 771.78 | 511 BAL/I | 46062 | 14/11/2019 | 14/11/2019 | General Books |