Atnaujinkite slapukų nuostatas

Mathematics for Algorithm and Systems Analysis [Minkštas viršelis]

  • Formatas: Paperback / softback, 256 pages, aukštis x plotis x storis: 235x155x12 mm, weight: 342 g, Illustrations, unspecified
  • Serija: Dover Books on Mathema 1.4tics
  • Išleidimo metai: 16-Nov-2011
  • Leidėjas: Dover Publications Inc.
  • ISBN-10: 0486442500
  • ISBN-13: 9780486442501
Kitos knygos pagal šią temą:
  • Formatas: Paperback / softback, 256 pages, aukštis x plotis x storis: 235x155x12 mm, weight: 342 g, Illustrations, unspecified
  • Serija: Dover Books on Mathema 1.4tics
  • Išleidimo metai: 16-Nov-2011
  • Leidėjas: Dover Publications Inc.
  • ISBN-10: 0486442500
  • ISBN-13: 9780486442501
Kitos knygos pagal šią temą:
Discrete mathematics is fundamental to computer science, and this up-to-date text assists undergraduates in mastering the ideas and mathematical language to address problems that arise in the fields many applications. It consists of 4 units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory. Discrete mathematics is fundamental to computer science, and this text covers its ideas and mathematical language. Features counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
Unit CL: Basic Counting and Listing
Lists with Repetitions
1(8)
Lists Without Repetition
9(4)
Sets
13(15)
Probability and Basic Counting
28(17)
Multiple Choice Questions for Review
41(4)
Unit Fn: Functions
Some Basic Terminology
45(6)
Permutations
51(7)
Other Combinatorial Aspects of Functions
58(7)
Functions and Probability
65(24)
Multiple Choice Questions for Review
85(4)
Unit DT: Decision Trees and Recursion
Basic Concepts of Decision Trees
89(14)
Recursive Algorithms
103(12)
Decision Trees and Conditional Probability
115(13)
Inductive Proofs and Recursive Equations
128(17)
Multiple Choice Questions for Review
140(5)
Unit GT: Basic Concepts in Graph Theory
What is a Graph?
145(12)
Digraphs, Paths, and Subgraphs
157(11)
Trees
168(13)
Rates of Growth and Analysis of Algorithms
181(18)
Multiple Choice Questions for Review
195(4)
Solutions to Exercises 199(40)
Notation Index 239(2)
Subject Index 241