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):||9 April 2007|
|PDF File Size:||18.80 Mb|
|ePub File Size:||8.81 Mb|
|Price:||Free* [*Free Regsitration Required]|
His research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology.
We don’t recognize your username or password. Signed out You have successfully signed out and will be required to sign back in should you need to download more resources. Bogart Homepage Kenneth P. 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 drysdal understand the concept of proof.
Instructor resource file download The work is protected by local and international copyright laws and is provided solely for discrefe use of instructors in teaching their courses and assessing student learning.
Discrete Math for Computer Science Students
Before his death inhe was in the final stages of completing an NSF-sponsored project about the teaching of combinatorics through Guided Discovery. 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 mxthematics. Assumes familiarity with data structures. About the Author s.
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. 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 discrege of scientist material. 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 material discrette then expanded on through explanations and extensions of the exercises. He retired from his teaching position on April He’s currently working on applications of Voronoi diagrams and Delaunay triangulations.
Preface Preface is available for download in PDF format.
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. 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 for Computer Scientists
Username Password Forgot your username or password? He is also the co-author of two textbooks: Sign In We’re sorry!
Discrete Mathematics Publication date: Appropriate for large or small class sizes or self study for the motivated professional reader.
The book explores the topics of basic combinatorics, number and graph theory, logic and proof techniques, and many more.
Stein, Drysdale & Bogart, Discrete Mathematics for Computer Scientists | Pearson
Bogart – was a professor in the Mathematics Department at Dartmouth College. Share a link to All Resources. Description For computer science students taking the discrete math course. If you’re interested in creating a cost-saving package for your students, contact your Pearson rep.
No portion of this material may be reproduced, in any form or by any means, without permission in writing from the publisher. Discrete Mathematics for Computer Scientists. 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.
Students, buy or rent this eText. Book Description at Amazon: Preview this title online. Sign Up Already have an access code? The download links are available at the bottom of the course webpage. 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. 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.
He also holds an appointment in the Department of Computer Science.