Muutke küpsiste eelistusi

Discrete Mathematics: for New Technology [Pehme köide]

(Surrey, UK)
  • Formaat: Paperback / softback, 696 pages, kõrgus x laius: 234x156 mm, kaal: 997 g
  • Ilmumisaeg: 01-May-1992
  • Kirjastus: Institute of Physics Publishing
  • ISBN-10: 075030135X
  • ISBN-13: 9780750301350
Teised raamatud teemal:
  • Formaat: Paperback / softback, 696 pages, kõrgus x laius: 234x156 mm, kaal: 997 g
  • Ilmumisaeg: 01-May-1992
  • Kirjastus: Institute of Physics Publishing
  • ISBN-10: 075030135X
  • ISBN-13: 9780750301350
Teised raamatud teemal:
In a comprehensive yet easy-to-follow manner, Discrete Mathematics for New Technology follows the progression from the basic mathematical concepts covered by the GCSE in the UK and by high-school algebra in the USA to the more sophisticated mathematical concepts examined in the latter stages of the book. The book punctuates the rigorous treatment of theory with frequent uses of pertinent examples and exercises, enabling readers to achieve a feel for the subject at hand. The exercise hints and solutions are provided at the end of the book. Topics covered include logic and the nature of mathematical proof, set theory, relations and functions, matrices and systems of linear equations, algebraic structures, Boolean algebras, and a thorough treatise on graph theory.

Although aimed primarily at computer science students, the structured development of the mathematics enables this text to be used by undergraduate mathematicians, scientists, and others who require an understanding of discrete mathematics.

Arvustused

"There is now a wide agreement that mathematics for computer scientists is not calculus and numerical analysis but discrete mathematics. According to this idea this book is a lovely text for undergraduate students, useful also at freshman-sophomore level." -Zentralblatt für Mathematik und ihre Grenzgebiete

"Discrete Mathematics for New Technology is a nice introduction to logic, sets, and algebraic structures." -New Scientist

"The book has a number of noteworthy features which make it a text to be considered seriously by those who wish to teach a course in this area. The material is carefully written and clearly presented in a user-friendly way which makes it a pleasure to read. There is a wealth of well-judged examples, with frequent historical notes to provide background and cartoons to lighten the style." -Times Higher Education Supplement

Sections include: Logic: Propositions and truth tables. Logical equivalence and logical implication. Algebra of propositions. Arguments in predicate logic Mathematical proof: Axioms and axiom systems. Mathematical induction. Sets: Operations on sets. Algebra of sets. Relations: Intersections and unions. Hasse diagrams. Functions: Injections and surjections. Databases - functional dependence and normal forms. Matrix algebra: Operations. The inverse of a matrix. Systems of linear equations: Matrix inverse method. Gaussian elimination. Algebraic structures: Some families of groups. Substructures. Morphisms. Boolean algebra: Switching circuits. Logic networks. Graph theory: Paths and circuits. Isomorphism of graphs. Trees. Applications of graph theory: Searching strategies. Networks and flows.
Rowan Garnier and John Taylor