Understand Mathematics, Understand Computing
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Maths for computer scientists > Understand Mathematics, Understand Computing: Discrete Mathematics That All Computing Students Should Know
Understand Mathematics, Understand Computing: Discrete Mathematics That All Computing Students Should Know

Understand Mathematics, Understand Computing: Discrete Mathematics That All Computing Students Should Know


     0     
5
4
3
2
1



International Edition


X
About the Book

In this book the authors aim to endow the reader with an operational, conceptual, and methodological understanding of the discrete mathematics that can be used to study, understand, and perform computing. They want the reader to understand the elements of computing, rather than just know them. The basic topics are presented in a way that encourages readers to develop their personal way of thinking about mathematics. Many topics are developed at several levels, in a single voice, with sample applications from within the world of computing. Extensive historical and cultural asides emphasize the human side of mathematics and mathematicians. By means of lessons and exercises on “doing” mathematics, the book prepares interested readers to develop new concepts and invent new techniques and technologies that will enhance all aspects of computing. The book will be of value to students, scientists, and engineers engaged in the design and use of computing systems, and to scholars and practitioners beyond these technical fields who want to learn and apply novel computational ideas.

Table of Contents:
Introduction.- “Doing” Mathematics: A Toolkit for Mathematical Reasoning.- Sets and Their Algebras: The Stem Cells of Mathematics.- Numbers I: The Basics of Our Number System.- Arithmetic: Putting Numbers to Work.- Summations: Complex Operations from Simple Components.- The Vertigo of Infinity: Handling the Very Large and the Infinite.- Numbers II: Building the Integers and Building with the Integers.- Recurrences: Rendering Complex Structure Manageable.- Numbers III: Operational Representations and Their Consequences.- The Art of Counting: Combinatorics, Probability, and Statistics.- Graphs I: Representing Relationships Mathematically.- Graphs II: Graphs Within Computation and Communication.- Solutions to Exercises.- App. A, Pairing Functions.- App. B, A Deeper Look at the Fibonacci Numbers.- App. C, Two Recurrence-Defined Number Families.- App. D, Signed-Digit Numerals: Carry-Free Addition.- App. E, The Diverse Delights of de Bruijn Networks.- List of Symbols.- References.- Index.

About the Author :
Prof. Arnold Rosenberg is a distinguished university professor emeritus at the University of Massachusetts, Amherst. He also held research positions at Northeastern University and Colorado State University, a professorship at Duke University, and a staff research position at IBM Watson Research Center. He was elected a fellow of the ACM in 1996 for his work on graph-theoretic models of compuation, emphasizing theoretical studies of parallel algorithms and architectures, VLSI design and layout, and data structures. In 1997, he was elected as a fellow of the IEEE for fundamental contributions to theoretical aspects of computer science and engineering.  Prof. Denis Trystram is a distinguished professor at the Grenoble Institute of Engineering, an honorary member of the Institut Universitaire de France (IUF), and he works at the Laboratoire d'Informatique de Grenoble (LIG) in the team-project DataMove-INRIA. His research interestst include the design and analysis of efficient algorithms for optimizing resource use in parallel and distributed systems, approximation algorithms for scheduling and packing problems, and algorithms for data analytics. Both authors have considerable teaching and practical experience in the application of discrete mathematics approaches to computing tasks.

Review :
“There are a lot of things I like about this book … . The basic concept of the book, the overall structure of the book, and the material presented are all excellent: it deserves a better implementation.” (David J. Littleboy, SIGACT News, Vol. 54 (3), 2023) “The text is written in an easy to read format which generously incorporates narratives from the history of mathematics as well as rigorous proofs of the concepts presented. The appendices and references to other texts provide the reader with numerous sources of supplementary information for those wishing to delve into a subject at a deeper level … . chapters are organized and clearly labeled to express which sections are appropriate for a beginning learner, an intermediate learner, or the specialist.” (Tom French, MAA Reviews, October 3, 2021) “Each chapter comes with several exercises from easy to difficult, the latter with complete solutions in the appendix. To accommodate the book to readers with different backgrounds and goals, the authors provide a guide which gives paths through the book for several courses. The exposition is always clear and motivating, no prerequisites are presumed, all terms and concepts are defined precisely, and there are many look-and-see proofs.” (Dieter Riebesehl, zbMATH 1465.68004, 2021)


Best Sellers


Product Details
  • ISBN-13: 9783030583750
  • Publisher: Springer Nature Switzerland AG
  • Publisher Imprint: Springer Nature Switzerland AG
  • Height: 235 mm
  • No of Pages: 550
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 3030583759
  • Publisher Date: 06 Dec 2020
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Sub Title: Discrete Mathematics That All Computing Students Should Know


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Understand Mathematics, Understand Computing: Discrete Mathematics That All Computing Students Should Know
Springer Nature Switzerland AG -
Understand Mathematics, Understand Computing: Discrete Mathematics That All Computing Students Should Know
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Understand Mathematics, Understand Computing: Discrete Mathematics That All Computing Students Should Know

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!