Maths Success II : discrete mathematics for the computer sciences / Pender Pedler
Material type: TextPublication details: Guidford : Vineyard ; 2001Edition: 1st editionDescription: iv, 196 p.: ill. ; 28 cmISBN:- 1740160010
- QA 39.2 .P43 2001
Contents:
Logic -- Conditionals and and arguments -- Sets -- Logic circuits -- Boolean algebra -- Simplifying logic circuits -- Relations and functions -- Recursions -- Complexity of algorithms -- Proof -- Counting principles -- Binomial and multinomial coefficients.
Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
Books | Zetech Library - TRC General Stacks | Non-fiction | QA 39.2 .P43 2001 (Browse shelf(Opens below)) | C.2 | Available | Z007816 | ||
Books | Zetech Library - TRC General Stacks | Non-fiction | QA 39.2 .P43 2001 (Browse shelf(Opens below)) | C.1 | Available | Z007538 |
Browsing Zetech Library - TRC shelves, Shelving location: General Stacks, Collection: Non-fiction Close shelf browser (Hides shelf browser)
QA39.2 .F68 2000 Foundations of mathematics 10 / | QA39.2.G733 1994 Concrete mathematics : | QA39.2 .J65 2014 Discrete mathematics / | QA 39.2 .P43 2001 Maths Success II : discrete mathematics for the computer sciences / | QA 39.2 .P43 2001 Maths Success II : discrete mathematics for the computer sciences / | QA39.3 .A3 S49 2009 Advance discrete mathematics / | QA39.3 .A3 S49 2009 Advance discrete mathematics / |
Logic -- Conditionals and and arguments -- Sets -- Logic circuits -- Boolean algebra -- Simplifying logic circuits -- Relations and functions -- Recursions -- Complexity of algorithms -- Proof -- Counting principles -- Binomial and multinomial coefficients.
There are no comments on this title.
Log in to your account to post a comment.