Discrete mathematics and its applications with combinatorics and graph theory (Record no. 29187)

MARC details
000 -LEADER
fixed length control field 02138nam a2200277Ia 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20250808102735.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220909b |||||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9780070648241
037 ## - SOURCE OF ACQUISITION
Terms of availability Textual
040 ## - CATALOGING SOURCE
Original cataloging agency CSL
Language of cataloging eng
Transcribing agency CSL
041 ## - LANGUAGE CODE
Language code of text/sound track or separate title eng
084 ## - COLON CLASSIFICATION NUMBER
Classification number B0bD P7-;1
Assigning agency CSL
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Rosen, Kenneth H.
9 (RLIN) 431600
245 #0 - TITLE STATEMENT
Title Discrete mathematics and its applications with combinatorics and graph theory
250 ## - EDITION STATEMENT
Edition statement 6th ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. New Delhi:
Name of publisher, distributor, etc. Tata McGraw-Hill Education Private Limited,
Date of publication, distribution, etc. 2007.
300 ## - PHYSICAL DESCRIPTION
Extent xxi, 787p.
Other physical details : ill.
500 ## - GENERAL NOTE
General note Bibliography B1-B9p.; Index I1-I23p.
520 ## - SUMMARY, ETC.
Summary, etc. The book gives a lot of stress on mathematical reasoning, combinatorial analysis, algorithmic thinking, and applications and modeling. One of the most popular book in use, it gives a presentation of the subject in great depth. The text is strengthened with a host of pedagogical tools which help in making it student friendly. New to this edition Language used is easy to understand. Comprehensive coverage of Induction, Recursion, and Counting. Algorithms in the text are given using pseudocodes. Applications included, demonstrate the utility of the subject in terms of Real-World problems. Pedagogical Features: 2992 Exercise Problems 195 Review Questions 480 Supplementary Exercises 152 Computer Projects 93 Computations & Explorations 140 Writing Projects New to the Edition: A separate chapter on Discrete Structures (Chapter 2) The new chapter 4 on Induction and Recursion. Conditional Statements & De Morgan's Laws receive expanded coverage. Material on Valid Arguments and Rules of Inference is presented in a separate section. Coverage of Turing Machines expanded. Over 400 new exercises and several new examples have been added. The introduction of Basic Counting Techniques, and Permutations and Combinations enhanced.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Discrete mathematics
9 (RLIN) 817507
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Mathematics
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Classification part B0bD P7-;1
Koha item type Textual
Source of classification or shelving scheme Colon Classification (CC)
Edition 7th
Suppress in OPAC No
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Date acquired Source of acquisition Total Checkouts Full call number Barcode Date due Date last seen Date last checked out Price effective from Koha item type Public note
        Central Science Library Central Science Library 2022-09-12 2101, 09/12/2010, Educational Book Agency (India) 1 BObD P7-;1 SL1534010 2025-01-06 2025-01-18 2025-01-18 2022-09-12 Textual {10th reprint 2010}.
Copyright @ Delhi University Library System