HOME > 상세정보

상세정보

Introduction to discrete mathematics

Introduction to discrete mathematics

자료유형
단행본
개인저자
Bradley, James, 1943-
서명 / 저자사항
Introduction to discrete mathematics / James Bradley.
발행사항
Reading, Mass. :   Addison-Wesley Pub. Co.,   c1988.  
형태사항
xiv, 685 p. : ill. ; 24 cm.
ISBN
0201106280 :
서지주기
Includes bibliographies and index.
일반주제명
Mathematics. Computer science --Mathematics.
000 00734camuuu200241 a 4500
001 000000089334
005 19980526111713.0
008 870918s1988 maua b 00110 eng
010 ▼a 87027067 //r902
020 ▼a 0201106280 : ▼c $36.95
040 ▼a DLC ▼c DLC ▼d DLC
049 1 ▼l 421112135 ▼f 과개
050 0 0 ▼a QA39.2 ▼b .B725 1988
082 0 0 ▼a 004/.01/51 ▼2 19
090 ▼a 004.0151 ▼b B811i
100 1 0 ▼a Bradley, James, ▼d 1943-
245 1 0 ▼a Introduction to discrete mathematics / ▼c James Bradley.
260 0 ▼a Reading, Mass. : ▼b Addison-Wesley Pub. Co., ▼c c1988.
300 ▼a xiv, 685 p. : ▼b ill. ; ▼c 24 cm.
504 ▼a Includes bibliographies and index.
650 0 ▼a Mathematics.
650 0 ▼a Computer science ▼x Mathematics.

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 과학도서관/Sci-Info(2층서고)/ 청구기호 004.0151 B811i 등록번호 421112135 도서상태 대출가능 반납예정일 예약 서비스 B M

컨텐츠정보

저자소개

제임스 브래들리(지은이)

제임스 브래들리는 태평양전쟁을 소재로 한 넌픽션 베스트셀러 ‘아버지의 깃발’(2000) Flags of Our Fathers과 '플라이보이스’(2003)Flyboys의 작가이다. 태평양 이오지마섬의 스리바시산정에 성조기를 게양한 생존 미해병대원 가운데 한 명이 그의 부친이었다. 현재 뉴욕에서 작품활동을 하고 있다. 웹사이트 www.jamesbradley.com

정보제공 : Aladin

목차


CONTENTS
1 Discrete Models = 1
2 Foundations = 13
 2.1 Basic Concepts of Sets = 14
 2.2 Russell's Paradox = 26
 2.3 Functions-Basic Concepts = 28
 2.4 Further Properties of Functions = 41
 2.5 Exponential and Logarithmic Functions = 49
 2.6 Finite series = 58
  Review Exercises - Chapter 2 = 66
3 Logic = 71
 3.1 Introduction to Logic = 72
 3.2 Propositional Logic = 77
 3.3 Connectives = 81
 3.4 Evaluating More Complex Expressions = 91
 3.5 Predicate Logic = 99
 3.6 Rules of Inference = 111
 3.7 Mathematical Induction = 126
 3.8 Combinational Circuits = 136
  Review Exercises - Chapter 3 = 148
4 Algorithms = 153
 4.1 Algorithms = 154
 4.2 Asymptotic Domination = 169
 4.3 Analysis and Verification of Algorithms = 179
 4.4 Inefficient Algorithms and Intractable Problems = 193
 4.5 Searching Algorithms = 200
  Review Exercises - Chapter 4 = 209
5 Elementary Number Theory = 215
 5.1 Introduction = 216
 5.2 Prime Numbers = 223
 5.3 Divisibility Properties = 230
 5.4 Positional Notation = 239
 5.5 Congruence = 251
  Review Exercises - Chapter 5 = 257
6 Recursion = 259
 6.1 Introduction to Recurrence Equations = 260
 6.2 Solving Recurrence Equations = 272
 6.3 Linear, First-Order Recurrence Equations = 283
 6.4 Linear, Second-Order Recurrence Equations = 292
 6.5 Recursive Algorithms = 305
 6.6 More Recursive Algorithms = 322
  Review Exercises - Chapter 6 = 333
7 Combinatorics and Discrete Probability = 337
 7.1 The Addition and Multiplication Principles = 338
 7.2 Permutations = 348
 7.3 Combinations = 362
 7.4 Applications and Properties of the Binomial Coefficient = 374
 7.5 Probability Models = 382
 7.6 Computing Discrete Probabilities = 393
 7.7 Conditional Probability, Independence, and Expectation = 400
  Review Exercises - Chapter 7 = 410
8 Relations = 415
 8.1 Basic Concepts = 417
 8.2 Properties of Relations = 426
 8.3 Order Relations = 438
 8.4 Operations on Relations = 452
  Review Exercises - Chapter 8 = 466
9 Graph Theory = 469
 9.1 Introduction = 470
 9.2 Euler Circuits and Hamiltonian Cycles = 482
 9.3 Graph Isomorphisms and Representations = 497
 9.4 Planar Graphs = 511
  Review Exercises - Chapter 9 = 522
10 Trees = 525
 10.1 Introduction to Trees = 527
 10.2 Spanning Trees = 535
 10.3 Rooted Trees = 547
 10.4 Applications of Binary Trees in Computer Science = 559
  Review Exercises - Chapter 10 = 577
Appendixes = 579
 A Arrays = 579
 B Introduction to Matrices = 591
 C Simultaneous Linear Equations and Gaussian Elimination = 607
 D Matrix Inversion = 627
 E Complex Numbers and Recurrence Equations = 641
 F Counting Equivalence Relations = 649
Glossary of Key Terms = 653
Answers to Odd-numbered Exercises = 661
Index = 680


관련분야 신착자료

김자미 (2021)