Discrete mathematics and its applications / (Record no. 13262)

MARC details
000 -BAŞLIK
Sabit Uzunluktaki Kontrol Alanı 04319na a2200289 4500
001 - KONTROL NUMARASI
Control Dosyası 16072
003 - KONTROL NUMARASI KİMLİĞİ
Kontrol Alanı KOHA_mirakil
005 - EN SON İŞLEM TARİHİ ve ZAMANI
Kontrol Alanı 20220831234343.0
008 - SABİT UZUNLUKTAKİ VERİ ÖGELERİ - GENEL BİLGİ
Sabit Alan 161114b tu 000 0
020 ## - ISBN - ULUSLARARASI STANDART KİTAP NUMARASI
Isbn 9780071244749
040 ## - KATALOGLAMA KAYNAĞI
Özgün Kataloglama Kurumu TR-IsBEY
Kataloglama Dili tur
Değştiren Kurum TR-IsBEY
041 ## - DİL KODU
Metin ya da ses kaydının dil kodu eng
050 00 - SINIFLAMA ve YER NUMARASI
Sınıflama Numarası QA 39.2
Cuttur Numarası .R67 2007
090 ## - YEREL YER NUMARASI
Yerel Yer Numarası QA 39.2 .R67 2007
100 0# - KİŞİ ADI
Yazar Adı (Kişi adı) Rosen, Kenneth H.
245 10 - ESER ADI BİLDİRİMİ
Başlık Discrete mathematics and its applications /
Sorumluluk Bildirimi Kenneth H. Rosen.
250 ## - BASIM BİLDİRİMİ
Basım Bildirimi 6th. ed., International edition.
260 ## - YAYIN, DAĞITIM, VB.
Yayın Yeri Boston :
Yayınevi McGraw Hill,
Yayın Tarihi 2007.
300 ## - FİZİKSEL TANIMLAMA
Sayfa, Cilt vb. xxii, 842 p.,
Boyutları 27 cm.
504 ## - BİBLİYOGRAFİ NOTU
Bibliyografi Notu Includes bibliographical references and index.
505 ## - İÇİNDEKİLER NOTU
İçindekiler Notu Contents: PrefaceThe MathZone Companion WebsiteTo the Student1 The Foundations: Logic and Proofs1.1 Propositional Logic1.2 Propositional Equivalences1.3 Predicates and Quantifiers1.4 Nested Quantifiers1.5 Rules of Inference1.6 Introduction to Proofs1.7 Proof Methods and StrategyEnd-of-Chapter Material2 Basic Structures: Sets, Functions, Sequences and Sums2.1 Sets2.2 Set Operations2.3 Functions2.4 Sequences and SummationsEnd-of-Chapter Material3 The Fundamentals: Algorithms, the Integers, and Matrices3.1 Algorithms3.2 The Growth of Functions3.3 Complexity of Algorithms3.4 The Integers and Division3.5 Primes and Greatest Common Divisors3.6 Integers and Algorithms3.7 Applications of Number Theory3.8 MatricesEnd-of-Chapter Material4 Induction and Recursion4.1 Mathematical Induction4.2 Strong Induction and Well-Ordering4.3 Recursive Definitions and Structural Induction4.4 Recursive Algorithms4.5 Program CorrectnessEnd-of-Chapter Material5 Counting5.1 The Basics of Counting5.2 The Pigeonhole Principle5.3 Permutations and Combinations5.4 Binomial Coefficients5.5 Generalized Permutations and Combinations5.6 Generating Permutations and CombinationsEnd-of-Chapter Material6 Discrete Probability6.1 An Introduction to Discrete Probability6.2 Probability Theory6.3 Bayes' Theorem6.4 Expected Value and VarianceEnd-of-Chapter Material7 Advanced Counting Techniques7.1 Recurrence Relations7.2 Solving Linear Recurrence Relations7.3 Divide-and-Conquer Algorithms and Recurrence elations7.4 Generating Functions7.5 Inclusion-Exclusion7.6 Applications of Inclusion-ExclusionEnd-of-Chapter Material8 Relations8.1 Relations and Their Properties8.2 n-ary Relations and Their Applications8.3 Representing Relations8.4 Closures of Relations8.5 Equivalence Relations8.6 Partial OrderingsEnd-of-Chapter Material9 Graphs9.1 Graphs and Graph Models9.2 Graph Terminology and Special Types of Graphs9.3 Representing Graphs and Graph Isomorphism9.4 Connectivity9.5 Euler and Hamilton Paths9.6 Shortest-Path Problems9.7 Planar Graphs9.8 Graph ColoringEnd-of-Chapter Material10 Trees10.1 Introduction to Trees10.2 Applications of Trees10.3 Tree Traversal10.4 Spanning Trees10.5 Minimum Spanning TreesEnd-of-Chapter Material11 Boolean Algebra11.1 Boolean Functions11.2 Representing Boolean Functions11.3 Logic Gates11.4 Minimization of CircuitsEnd-of-Chapter Material12 Modeling Computation12.1 Languages and Grammars12.2 Finite-State Machines with Output12.3 Finite-State Machines with No Output12.4 Language Recognition12.5 Turing MachinesEnd-of-Chapter MaterialAppendixesA.1 Axioms for the Real Numbers and the Positive IntegersA.2 Exponential and Logarithmic FunctionsA.3 PseudocodeSuggested ReadingsAnswers to Odd-Numbered ExercisesPhoto CreditsIndex of BiographiesIndex.
520 ## - ÖZET NOTU
Özet notu Summary: "Discrete Mathematics and its Applications, Sixth Edition", is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been used at over 500 institutions around the world, gives a focused introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a wide variety of real-world applications ...from computer science to data networking, to psychology, to chemistry, to engineering, to linguistics, to biology, to business, and to many other important fields.
650 ## - KONU BAŞLIĞI EK GİRİŞ - KONU TERİMİ
Konusal terim veya coğrafi ad Bilgisayar bilimi
Genel Alt Konu Matematik.
650 ## - KONU BAŞLIĞI EK GİRİŞ - KONU TERİMİ
Konusal terim veya coğrafi ad Computer science
Genel Alt Konu Mathematics.
902 ## - LOCAL DATA ELEMENT B, LDB (RLIN)
a 15245
942 ## - EK GİRİŞ ÖGELERİ (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Books
900 ## - YEREL BİLGİ
Kontrol Mehmet Faruk Akgül
Holdings
Geri Çekilme Durumu Kayıp Durumu Sınıflandırma Kaynağı Hasarlı Durumu Koha sıralama için normalleştirilmiş sınıflandırma Kredi için değil Koha itemnumber (otomatik oluşturulmuş) Kalıcı Konum Mevcut Konum Kayıt Tarih Edinim Kaynağı Kodlanmış Konum Niteleyicisi Toplam Ödünçverme Yer Numarası Demirbaş Numarası Son Görülme Tarihi Son Kontrol Tarihi Fatura Tarihi Materyal Türü Genel Not / Bağış Notu
    Library of Congress Classification   QA00392 R67 02007   15549 Beykoz Üniversitesi Kütüphanesi Beykoz Üniversitesi Kütüphanesi 14/11/2016 Bağış Genel Derme   QA 39.2 .R67 2007 00015245 14/11/2016 14/11/2016 04/09/2022 Books BAĞIŞLAYAN: Sabancı Üniversitesi.