Atnaujinkite slapukų nuostatas

Discrete Mathematical Structures: International Edition 5th edition [Minkštas viršelis]

3.56/5 (114 ratings by Goodreads)
, ,
  • Formatas: Paperback / softback, 528 pages, aukštis x plotis x storis: 254x203x20 mm, weight: 928 g
  • Išleidimo metai: 13-Nov-2003
  • Leidėjas: Pearson
  • ISBN-10: 0131230468
  • ISBN-13: 9780131230460
Kitos knygos pagal šią temą:
Discrete Mathematical Structures: International Edition 5th editionDidesnis paveikslėlis
  • Formatas: Paperback / softback, 528 pages, aukštis x plotis x storis: 254x203x20 mm, weight: 928 g
  • Išleidimo metai: 13-Nov-2003
  • Leidėjas: Pearson
  • ISBN-10: 0131230468
  • ISBN-13: 9780131230460
Kitos knygos pagal šią temą:
Pastovi nuoroda: https://www.kriso.lt/db/9780131230460.html
For one- or two-term freshman/sophomore-level courses in Discrete Mathematics.

Combining a careful selection of topics with previews of their genuine applications in computer science, this text, more than any other book in its field, is written at an elementary level with a strong pedagogical focus. It limits its area and coverage of topics to those that students will actually utilize, and emphasizes both basic theory and applications, giving a firm foundation for more advanced courses, as well as providing an excellent reference work for those courses.
1. Fundamentals.


Sets and Subsets. Operations on Sets. Sequences. Properties of Integers.
Matrices. Mathematical Structures.



2. Logic.


Propositions and Logical Operations. Conditional Statements. Methods of
Proof. Mathematical Induction.



3. Counting.


Permutations. Combinations. Pigeonhole Principle. Elements of Probability.
Recurrence Relations.



4. Relations and Digraphs.


Product Sets and Partitions. Relations and Digraphs. Paths in Relations and
Digraphs. Properties of Relations. Equivalence Relations. Computer
Representation of Relations and Digraphs. Operations on Relations. Transitive
Closure and Warshall's Algorithm.



5. Functions.


Functions. Functions for Computer Science. Growth of Functions. Permutation
Functions.



6. Order Relations and Structures.


Partially Ordered Sets. Extremal Elements of Partially Ordered Sets.
Lattices. Finite Boolean Algebras. Functions on Boolean Algebras. Circuit
Design.



7. Trees.


Trees. Labeled Trees. Tree Searching. Undirected Trees. Minimal Spanning
Trees.



8. Topics in Graph Theory.


Graphs. Euler Paths and Circuits. Hamiltonian Paths and Circuits. Transport
Networks. Matching Problems. Coloring Graphs.



9. Semigroups and Groups.


Binary Operations, Revisited. Semigroups. Products and Quotients of
Semigroups. Groups. Products and Quotients of Groups.



10. Languages and Finite-State Machines.


Languages. Representations of Special Grammars and Languages. Finite-State
Machines. Semigroups, Machines, and Languages. Machines and Regular
Languages. Simplification of Machines.



11. Groups and Coding.


Coding of Binary Information and Error Detection. Decoding and Error
Correction. Public Key Cryptology.



Appendix A: Algorithms and Pseudocode.


Appendix B: Additional Experiments in Discrete Mathematics.


Answers to Odd-Numbered Exercises.


Answers to
Chapter Tests.


Index.