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