Intended for a one-term course in discrete mathematics, to prepare freshmen and sophomores for further work in computer science as well as mathematics. Sets, proof techniques, logic, combinatorics, and graph theory are covered in concise form. All topics are motivated by concrete examples, often emphasizing the interplay between computer science and mathematics. Examples also illustrate all definitions. Applications and references cover a wide variety of realistic situations. Coverage of mathematical induction includes the ...
Read More
Intended for a one-term course in discrete mathematics, to prepare freshmen and sophomores for further work in computer science as well as mathematics. Sets, proof techniques, logic, combinatorics, and graph theory are covered in concise form. All topics are motivated by concrete examples, often emphasizing the interplay between computer science and mathematics. Examples also illustrate all definitions. Applications and references cover a wide variety of realistic situations. Coverage of mathematical induction includes the stroung form of induction, and new sections have been added on nonhomogeneous recurrence relations and the essentials of probability.
Read Less
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
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!
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Used book in good and clean conditions. Pages and cover are intact. Limited notes marks and highlighting may be present. May show signs of normal shelf wear and bends on edges. Item may be missing CDs or access codes. May include library marks. Fast Shipping.