当前位置:主页 > 课后答案 > 离散数学习题答案
离散数学及其应用(英文精编第六版)

《离散数学及其应用(英文精编第六版)》课后答案

  • 更新:2021-04-27
  • 大小:521 KB
  • 类别:离散数学
  • 作者:[美]罗森/Kenneth、H.Rose
  • 出版:机械工业出版社
  • 格式:PDF

  • 资源介绍
  • 学习心得
  • 相关内容

给大家带来的是关于离散数学相关的课后习题答案,介绍了关于离散数学、离散数学应用方面的内容,由隆阳朔网友提供,本资源目前已被647人关注,高等院校离散数学类教材综合评分为:9.3分。

书籍介绍

Kenneth H. Rosen: Discrete Mathematics and Its Applications, Sixth Edition (ISBN 978-0-07-288008-3). Copyright . 2007 by Kenneth H. Rosen. All rights reserved. No part of this publication may be reproduced or transmitted in any form or by

any means, electronic or mechanical, including without limitation photocopying, recording, taping, or any database, information or retrieval system, without the prior written permission of the publisher. This authorized English Adaptation is jointly published by McGraw-Hill Education (Asia) and China Machine Press. This edition is authoried for sale in the People's Republic of China only, excluding Hong Kong SAR, Macao SAR and Taiwan.

Copyright . 2010 by McGraw-Hill Education (Asia), a division of the Singapore Branch of The McGraw-Hill Companies, Inc. and China Machine Press.

目录

  • Adapter's Forword
  • Preface
  • To the Student
  • LIST OF SYMBOLS
  • Chapter 1 The Foundations: Logic and Proofs
  • 11 Propositional Logic
  • 12 Propositional Equivalences
  • 13 Predicates and Quantiers
  • 14 Nested Quantiers
  • 15 Rules of Inference
  • 16 Introduction to Proofs
  • 17 Proof Methods and Strategy
  • End-of-Chapter Material
  • Chapter 2 Basic Structures: Sets, Functions, Sequences, and Sums
  • 21 Sets
  • 22 Setoperations
  • 23 Functions
  • 24 Sequences and Summations
  • End-of-Chapter Material
  • Chapter3 Counting
  • 31 The Basics of Counting
  • 32 The Pigeon hole Principle
  • 33 Permutations and Combinations
  • 34 BinomialCoefcients
  • 35 Generalized Permutations and Combinations
  • 36 Generating Permutations and Combinations
  • End-of-Chapter Material 179
  • Chapter 4 Advanced Counting Techniques
  • 41 Recurrence Relations
  • 42 Solving Linear Recurrence Relations
  • 43 Divide-and-Conquer Algorithms and Recurrence Relations
  • 44 Generating Functions
  • 45 Inclusion-Exclusion
  • 46 ApplicationsofInclusion-Exclusion
  • End-of-Chapter Material
  • Chapter 5 Relations
  • 51 Relations and Their Properties
  • 52 nary Relations and Their Applications
  • 53 Representing Relations
  • 54 Closures of Relations
  • 55 Equivalence Relations
  • 56 Partial Orderings
  • End-of-Chapter Material
  • Chapter 6 Graphs304
  • 61 Graphs and Graph Models
  • 62 GraphTerminologyandSpecialTypes of Graphs
  • 63 Representing Graphs and GraphIsomorphism
  • 64 Connectivity
  • 65 Eulerand Hamilton Paths
  • 66 Shortest-Path Problems
  • 67 PlanarGraphs
  • 68 Graph Coloring
  • End-of-Chapter Material
  • Chapter 7 Trees
  • 71 IntroductiontoTrees
  • 72 ApplicationsofTrees
  • 73 TreeTraversal
  • 74 SpanningTrees
  • 75 MinimumSpanningTrees
  • End-of-Chapter Material
  • Answers to Exercises

资源获取

资源地址1:https://pan.baidu.com/s/1RHIVWCmpPLcvg2Ui1cQaqA(密码:um8k)

相关资源

网友留言