Greetings, readers! Now that Amazon has disabled its popular ebook lending feature, we're more committed than ever to helping you find the best ways to borrow FREE or save big on the Kindle books that you want to read. Kindle Unlimited and Amazon Prime Reading offer members free reading access to over 1 million titles, including Kindle books, magazines, and audiobooks. Beginning soon, each day in this space we will feature "Today's FREEbies and Top Deals for Our Favorite Readers" to share top 5-star titles that are available for KU and Prime members to read FREE, plus a link to a 30-day FREE trial for Kindle Unlimited!

Lendle

Lendle is a participant in the Amazon Services LLC Associates Program, an affiliate advertising program designed to provide a means for sites to earn advertising fees by advertising and linking to Amazon.com. As an Amazon Associates participant, we earn small amounts from qualifying purchases on the Amazon sites.

"Discrete Mathematics for Computer Science" is the perfect text to combine the fields of mathematics and 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. This text teaches all the math, with the exception of linear algebra, that is needed to succeed in computer science. 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. Assumes familiarity with data structures. 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.