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):||14 June 2017|
|PDF File Size:||8.86 Mb|
|ePub File Size:||17.6 Mb|
|Price:||Free* [*Free Regsitration Required]|
He is scietists 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.
Discrete Mathematics for Computer Scientists
He is a winner of the Dartmouth Distinguished Teaching award. Signed out You have successfully signed out and will be required to sign back in should you need to download more resources.
About the Author s. 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 using motivating, relevant CS applications.
Book Description at Amazon: Before his death inhe was in the final stages of completing an NSF-sponsored project about the teaching of combinatorics through Guided Discovery. He retired from his teaching position on April The material is then expanded on through explanations and extensions of the exercises. He also holds an appointment in the Department of Computer Science.
Discrete Mathematics Publication date: Appropriate for large or small class sizes or self study for the motivated professional reader. Instructor resource file download The work is protected by local and international copyright discrte and is provided solely for the use of instructors in teaching their courses and assessing student learning.
He has also developed algorithms for planning and testing the correctness of tool path movements in Numerical Control Jathematics machining. Assumes familiarity with data structures. Username Password Forgot your username or password? Rivest—the best-selling textbook in matheatics, which has been translated into 8 languages.
This text is driven by activities presented as exercises. Sign Up Already have an access code? He’s currently working on applications of Voronoi diagrams and Delaunay triangulations. Pearson offers special pricing when you package your text with other student resources. This material is protected under all copyright laws, as they currently exist. Description For computer science students taking the discrete math course.
Preview this title online. 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.
Discrete Math for Computer Science Students
His main research area is algorithms, primarily computational geometry. Preface Preface is available for download in PDF format.
Bogart – was a professor in the Mathematics Department at Dartmouth College. 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.
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 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.
His research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology. Discrete Mathematics for Computer Scientists. His research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology.