Discrete mathematics is fundamental to computer science, and this up-to-date text assists undergraduates in mastering the ideas and mathematical language to address problems that arise in the field's many applications. It consists of four units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
"synopsis" may belong to another edition of this title.
Williamson was Professor of Mathematics at the University of California, San Diego, from 1965 to 1991, and has been Professor of Computer Science at the University of California, San Diego, from 1991 to present.
"About this title" may belong to another edition of this title.
Seller: Goodwill of Colorado, COLORADO SPRINGS, CO, U.S.A.
Condition: good. This item is in overall good condition. Covers and dust jackets are intact but may have minor wear including slight curls or bends to corners as well as cosmetic blemishes including stickers. Pages are intact but may have minor highlighting writing. Binding is intact; however, spine may have slight wear overall. Digital codes may not be included and have not been tested to be redeemable and or active. Minor shelf wear overall. Please note that all items are donated goods and are in used condition. Orders shipped Monday through Friday! Your purchase helps put people to work and learn life skills to reach their full potential. Orders shipped Monday through Friday. Your purchase helps put people to work and learn life skills to reach their full potential. Thank you! Seller Inventory # 466OE30045IT
Seller: Better World Books, Mishawaka, IN, U.S.A.
Condition: Good. 1 Edition. Used book that is in clean, average condition without any missing pages. Seller Inventory # 594521-75
Seller: Zoom Books Company, Lynden, WA, U.S.A.
Condition: very_good. Book is in very good condition and may include minimal underlining highlighting. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service. Seller Inventory # ZBV.0486442500.VG
Seller: HPB Inc., Dallas, TX, U.S.A.
Paperback. Condition: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_449256089
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 3324963-n
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condition: New. Mathematics for Algorithm and Systems Analysis. Book. Seller Inventory # BBS-9780486442501
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 3324963
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Feb2215580229699
Seller: Rarewaves USA, OSWEGO, IL, U.S.A.
Paperback. Condition: New. Seller Inventory # LU-9780486442501
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. Discrete mathematics is fundamental to computer science, and interesting, challenging problems in discrete mathematics arise in programming languages, computer architecture, networking, distributed systems, database systems, artificial intelligence, theoretical computer science, and elsewhere. This up-to-date text prepares undergraduates with four units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory. Each unit is divided into four sections, and each section contains a selection of problems that vary in difficulty. Solutions to these problems are given at the end of the text.Multiple-choice questions for review appear at the end of each unit. The text offers students the mathematical language and sophistication to recognise and articulate the ideas behind these questions and to answer questions similar in concept and difficulty. Those who master the necessary ideas and mathematical language to understand these review questions gain the ability to formulate, in the neutral language of mathematics, the problems that arise in various applications of computer science--a skill that enables them to discuss problems in discrete mathematics with other computer scientists and with mathematicians. Discrete mathematics is fundamental to computer science, and this text covers its ideas and mathematical language. Features counting and listing, functions, decision trees and recursion, and basic concepts of graph theory. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780486442501