Discrete Mathematics for Computer Scientists. Cliff L Stein. Robert Drysdale. Kenneth Bogart. © |Pearson | Out of print. Share this page. Discrete. Stein/Drysdale/Bogart’s Discrete Mathematics for Computer Scientists is ideal for computer science students taking the discrete math course. Written specifically. Scot Drysdale. Dept. of Computer Science. Dartmouth College. Cliff Stein. Dept. of ii c Kenneth P. Bogart, Scot Drysdale, and Cliff Stein, In a course in discrete mathematics, this level of abstraction is unnecessary, so we will.
|Published (Last):||12 January 2009|
|PDF File Size:||2.30 Mb|
|ePub File Size:||12.7 Mb|
|Price:||Free* [*Free Regsitration Required]|
Bogart Homepage Kenneth P.
Discrete Mathematics for Computer Scientists
He has also made contributions to education. We don’t recognize your username or password. Username Compufer Forgot your username or password? Share a link to All Resources. He is a winner of the Dartmouth Distinguished Teaching award. Written to provide CS students with the foundation they need in discrete math and motivated by problems that CS students can understand early in their studies. Before his death inhe was in the final stages of completing an NSF-sponsored project about the teaching of combinatorics through Guided Discovery.
Discrete Mathematics Publication date: His research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology. You discrte successfully signed out and will be required to sign back in should you need to download more resources. He is best known for papers describing algorithms for computing variants of a geometric structure called the Voronoi Diagram and algorithms that use the Voronoi Diagram drysadle solve other problems in computational geometry.
His research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology. Topic coverage reflects what is important to CS students, including areas that are not covered as completely in other books—recursion trees, the relationship between induction and recursive problem decomposition, and applying tools from discrete math to analyzing and understanding algorithms. Written by leading academics in the field of computer science, readers will gain the skills needed to write and understand the concept of proof.
His main research area is algorithms, primarily computational geometry. Pearson offers special pricing when you package your text with other student resources. Preface Preface is available for download in PDF format.
This material is protected under all copyright laws, as they currently exist. This allows students to actively discover what they are learning, leading to better retention of the material. If you’re interested in creating a cost-saving package for your students, contact your Pearson rep. Atein has also developed algorithms for planning and testing the correctness of tool path movements in Numerical Control NC machining. Sign In We’re sorry! Written specifically for computer science students, this unique textbook directly addresses their needs by providing a foundation in discrete math while matjematics motivating, scoentists CS applications.
About the Author s. Intended for students who have completed the first course in computer science and especially appropriate for students who have completed or are simultaneously studying data structures. He retired from his teaching position on April Bogart – was a professor in the Mathematics Department at Dartmouth College.
Assumes familiarity with data structures. Sign Up Already have an access code?
Rivest—the best-selling textbook in algorithms, which has been translated into 8 languages. This text teaches all the math, with the exception of linear algebra, that is needed to succeed in computer science.
Discrete Mathematics for Computer Scientists.
Stein, Drysdale & Bogart, Discrete Mathematics for Computer Scientists | Pearson
The download links are available at the bottom of the course webpage. No portion of this material may be reproduced, in any form or by any means, without permission in writing from the publisher.
The book explores the topics of basic combinatorics, number and graph theory, logic and proof techniques, and many more. Appropriate for large or small class sizes or self study for the motivated professional reader.