Zetech University Library - Online Catalog

Mobile: +254-705278678

Whatsapp: +254-706622557

Feedback/Complaints/Suggestions

library@zetech.ac.ke

Amazon cover image
Image from Amazon.com
Syndetics cover image
Image from Syndetics
Image from Google Jackets
Image from OpenLibrary

Discrete mathematics / Norman L. Biggs

By: Material type: TextTextPublication details: New Delhi : Oxford University Press, c2002.Edition: 2nd edDescription: xiv, 425 pages : illISBN:
  • 9780198507178
Subject(s): LOC classification:
  • QA76.9.M35 B54 2002
Contents:
Statements and proofs -- Set notation -- The logical framework -- Natural numbers -- Functions -- How to count -- Integers -- Divisibility and prime numbers -- Fractions and real numbers -- Principles of counting -- Subsets and designs -- Partition, classification and distribution -- Modular arithmetic -- Algorithms and their efficiency -- Graphs -- Trees, sorting and searching -- Bipartite graphs and matching problems -- Digraphs, networks and flows -- Recursive techniques -- Groups -- Groups of permutations -- Rings, fields and polynomials-- Finite fields and some applications -- Error-correcting codes -- Generating functions -- Partitions of a positive integer -- Symmetry and counting.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Collection Call number Copy number Status Date due Barcode
Books Books Zetech Library - TRC General Stacks Non-fiction QA76.9 .M35 B54 2002 (Browse shelf(Opens below)) C3 Available Z007116
Books Books Zetech Library - TRC General Stacks Non-fiction QA76.9 .M35 B54 2002 (Browse shelf(Opens below)) C.2 Available Z006998
Books Books Zetech Library - TRC General Stacks Non-fiction QA76.9 .M35 B54 2002 (Browse shelf(Opens below)) C.1 Available Z005444
Browsing Zetech Library - TRC shelves, Shelving location: General Stacks, Collection: Non-fiction Close shelf browser (Hides shelf browser)
QA76.9.L63 .N38 2023 Computational thinking and social science : combining programming, methodologies and fundamental concepts / QA76.9.M23 1991 Discrete mathematics QA76.9 .M35 B54 2002 Discrete mathematics / QA76.9 .M35 B54 2002 Discrete mathematics / QA76.9 .M35 B54 2002 Discrete mathematics / QA76.9 .M35 H34 2002 Discrete mathematics for computing / QA76.9 .M35 H34 2002 Discrete mathematics for computing /

Includes index.

Statements and proofs -- Set notation -- The logical framework -- Natural numbers -- Functions -- How to count -- Integers -- Divisibility and prime numbers -- Fractions and real numbers -- Principles of counting -- Subsets and designs -- Partition, classification and distribution -- Modular arithmetic -- Algorithms and their efficiency -- Graphs -- Trees, sorting and searching -- Bipartite graphs and matching problems -- Digraphs, networks and flows -- Recursive techniques -- Groups -- Groups of permutations -- Rings, fields and polynomials-- Finite fields and some applications -- Error-correcting codes -- Generating functions -- Partitions of a positive integer -- Symmetry and counting.

There are no comments on this title.

to post a comment.