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):||18 February 2010|
|PDF File Size:||20.53 Mb|
|ePub File Size:||14.78 Mb|
|Price:||Free* [*Free Regsitration Required]|
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. Preview this title online. He’s currently working on applications of Voronoi diagrams and Delaunay triangulations. Username Password Forgot your username or password? Discrete Mathematics Publication date: The book explores the topics of basic combinatorics, number and graph theory, logic and proof techniques, and many more.
Assumes familiarity with data structures. 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 is a winner of the Dartmouth Distinguished Teaching award. This text is driven by activities presented as exercises. This text teaches all the math, with the exception of linear algebra, that is needed to succeed in computer science.
Written by leading academics in the field of computer science, readers will gain the skills needed to write and understand the concept of proof. Description For computer science students taking the discrete math course. He has also developed algorithms for planning and testing the correctness of tool path movements in Numerical Control NC machining.
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 to solve other problems in computational geometry. The download links are available at the bottom of the course webpage. Discrete Math for Computer Science Students This text teaches all the math, with the exception of linear algebra, that is needed to succeed in computer science.
No portion of this material may be reproduced, in any form or by any means, without permission in writing from the publisher. You have successfully signed out and will be required to sign back in should you need to download more resources. Bogart – was a professor in the Mathematics Department at Dartmouth College.
His main research area is algorithms, primarily computational geometry. Rivest—the best-selling textbook in algorithms, which has been translated into 8 languages. Written specifically for computer science students, this unique textbook directly addresses their needs by providing a foundation in discrete math while using motivating, relevant CS applications. If you’re interested in creating a cost-saving package for your students, contact your Pearson rep.
The work is protected by local and international copyright laws and is provided solely for the use of instructors in teaching their courses and assessing student learning. Preface Preface is available for download in PDF format.
Pearson offers special pricing when you package your text with other student resources. He has also made contributions to education. Discrete Mathematics for Computer Scientists. About the Author s. 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.
Book Description at Amazon: He also holds an appointment in the Department of Computer Science.
Early treatment of number theory and combinatorics allow readers to explore RSA encryption early and also to encourage them to use their knowledge of hashing and trees from Bogat before those topics are covered in this course.
The material is then expanded on through explanations and extensions of the exercises.
Discrete Mathematics for Computer Scientists
This allows students to actively discover what they are learning, leading to better retention of the material. Share a link to All Resources.
He retired from his teaching position on April He is also the co-author of two textbooks: Students, buy or rent this eText. We don’t recognize your username or password. His research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology.
Sign In We’re sorry! Instructor resource file download The work is protected by local and international copyright laws and is provided solely for the use of instructors in teaching their courses and assessing student learning.
Bogart Homepage Kenneth P. Before his death inhe was in the final stages of completing an NSF-sponsored project about the teaching of combinatorics through Guided Discovery.
Stein, Drysdale & Bogart, Discrete Mathematics for Computer Scientists | Pearson
Sign Up Already have an steiin code? This material is protected under all copyright laws, as they currently exist. His research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology. Signed out You have successfully signed out and will be required to sign back in should you need scientistw download more resources.
Appropriate for large or small class sizes or self study for the motivated professional reader.