Amazon cover image
Image from Amazon.com

Sets, logic and maths for computing / David Makinson

By: Material type: TextTextLanguage: ENG Publication details: New York Springer 2008Description: 302 pISBN:
  • 9788184897524
Subject(s): DDC classification:
  • 004.0151 MAK-D
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Shelving location Call number Status Date due Barcode Item holds
Books Books BITS Pilani Hyderabad 003-007 General Stack (For lending) 004.0151 MAK-D (Browse shelf(Opens below)) Available 11769
Total holds: 0

University studies in computing require the ability to pass from a concrete problem to an abstract representation, reason with the abstract structure, and return with useful solutions to the speci??? c situation.The tools for developing these skills are in part qualitative ??" concepts such as set, relation, function, and structures such as trees and well-founded orders. They are also in part quantitative ??" notably elementary combinatorics and ???nite probability. Recurring in all of these are instruments of proof, both purely logical ones (such as proof by contradiction) and mathematical (the various forms of induction). Features: Explains the basic mathematical tools required by students as they set out in their studies of Computer or Information Science Explores the interplay between qualitative thinking and calculation Teaches the material as a language for thinking, as much as knowledge to be acquired Uses an intuitive approach with a focus on examples for all general concepts Provides numerous exercises, solutions and proofs to deepen and test the reader's understanding Includes highlight boxes that raise common queries and clear away confusions This easy-to-follow text allows readers to carry out their computing studies with a clear understanding of the basic ???nite mathematics and logic that they will need. Written explicitly for undergraduates, it requires only a minimal mathematical background and is ideal for self-study as well as classroom use. Table of Contents Collecting Things Together: Sets Comparing Things: Relations Associating One Item with Another: Functions Recycling Outputs as Inputs: Induction and Recursion Counting Things: Combinatorics Weighing the Odds: Probability Squirrel Math: Trees Yea and Nay: Propositional Logic Something about Everything: Quanti???cational Logic Index.

There are no comments on this title.

to post a comment.
An institution deemed to be a University Estd. Vide Sec.3 of the UGC
Act,1956 under notification # F.12-23/63.U-2 of Jun 18,1964

© 2015 BITS-Library, BITS-Hyderabad, India.