zax rachel (21 Ergebnisse)

Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

hardcover. Zustand: Good.

hardcover. Zustand: Good. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Zustand: New.

hardcover. Zustand: New. Ships in a BOX from Central Missouri! UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Zustand: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Hardback. Zustand: New. A more intuitive approach to the mathematical foundation of computer scienceDiscrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. This textbook covers the discrete mathematics that every computer science student needs to learn. Guiding students quickly through thirty-one short chapters that discuss one major topic each, this flexible book can be tailored to fit the syllabi for a variety of courses.Proven in the classroom, Essential Discrete Mathematics for Computer Science aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof. It is fully illustrated in color, and each chapter includes a concise summary as well as a set of exercises. The text requires only precalculus, and where calculus is needed, a quick summary of the basic facts is provided.Essential Discrete Mathematics for Computer Science is the ideal introductory textbook for standard undergraduate courses, and is also suitable for high school courses, distance education for adult learners, and self-study.The essential introduction to discrete mathematicsFeatures thirty-one short chapters, each suitable for a single class lessonIncludes more than 300 exercisesAlmost every formula and theorem proved in fullBreadth of content makes the book adaptable to a variety of coursesEach chapter includes a concise summaryCurated video supplements available to instructors and studentsSolutions manual available to instructors.

Hardcover. Zustand: Brand New. 388 pages. 10.25x8.25x1.00 inches. In Stock.

Zustand: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.

Hardback. Zustand: New. A more intuitive approach to the mathematical foundation of computer scienceDiscrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. This textbook covers the discrete mathematics that every computer science student needs to learn. Guiding students quickly through thirty-one short chapters that discuss one major topic each, this flexible book can be tailored to fit the syllabi for a variety of courses.Proven in the classroom, Essential Discrete Mathematics for Computer Science aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof. It is fully illustrated in color, and each chapter includes a concise summary as well as a set of exercises. The text requires only precalculus, and where calculus is needed, a quick summary of the basic facts is provided.Essential Discrete Mathematics for Computer Science is the ideal introductory textbook for standard undergraduate courses, and is also suitable for high school courses, distance education for adult learners, and self-study.The essential introduction to discrete mathematicsFeatures thirty-one short chapters, each suitable for a single class lessonIncludes more than 300 exercisesAlmost every formula and theorem proved in fullBreadth of content makes the book adaptable to a variety of coursesEach chapter includes a concise summaryCurated video supplements available to instructors and studentsSolutions manual available to instructors.

Zustand: New. &Uumlber den AutorHarry Lewis and Rachel ZaxKlappentextrnrnDiscrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. This textbook covers th.

Hardback. Zustand: New. A more intuitive approach to the mathematical foundation of computer scienceDiscrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. This textbook covers the discrete mathematics that every computer science student needs to learn. Guiding students quickly through thirty-one short chapters that discuss one major topic each, this flexible book can be tailored to fit the syllabi for a variety of courses.Proven in the classroom, Essential Discrete Mathematics for Computer Science aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof. It is fully illustrated in color, and each chapter includes a concise summary as well as a set of exercises. The text requires only precalculus, and where calculus is needed, a quick summary of the basic facts is provided.Essential Discrete Mathematics for Computer Science is the ideal introductory textbook for standard undergraduate courses, and is also suitable for high school courses, distance education for adult learners, and self-study.The essential introduction to discrete mathematicsFeatures thirty-one short chapters, each suitable for a single class lessonIncludes more than 300 exercisesAlmost every formula and theorem proved in fullBreadth of content makes the book adaptable to a variety of coursesEach chapter includes a concise summaryCurated video supplements available to instructors and studentsSolutions manual available to instructors.

Hardback. Zustand: New. A more intuitive approach to the mathematical foundation of computer scienceDiscrete mathematics is the basis of much of computer science, from algorithms and automata theory to combinatorics and graph theory. This textbook covers the discrete mathematics that every computer science student needs to learn. Guiding students quickly through thirty-one short chapters that discuss one major topic each, this flexible book can be tailored to fit the syllabi for a variety of courses.Proven in the classroom, Essential Discrete Mathematics for Computer Science aims to teach mathematical reasoning as well as concepts and skills by stressing the art of proof. It is fully illustrated in color, and each chapter includes a concise summary as well as a set of exercises. The text requires only precalculus, and where calculus is needed, a quick summary of the basic facts is provided.Essential Discrete Mathematics for Computer Science is the ideal introductory textbook for standard undergraduate courses, and is also suitable for high school courses, distance education for adult learners, and self-study.The essential introduction to discrete mathematicsFeatures thirty-one short chapters, each suitable for a single class lessonIncludes more than 300 exercisesAlmost every formula and theorem proved in fullBreadth of content makes the book adaptable to a variety of coursesEach chapter includes a concise summaryCurated video supplements available to instructors and studentsSolutions manual available to instructors.