Posted by **FenixN** at Jan. 31, 2016

DVDRips | FLV/AVC, ~250 kb/s | 374x210 | Duration: N/A | English: AAC, 48.0 KHz (2 ch) | + PDF Guides | 1.67 GB

Featuring recorded lectures from the Harvard School of Engineering and Applied Sciences course Computer Science 20, this course covers widely applicable mathematical tools for computer science, including topics from logic, set theory, combinatorics, number theory, probability theory, and graph theory. It includes practice in reasoning formally and proving theorems. Students meet twice a week via web conference to solve problems collaboratively.

Posted by **tanas.olesya** at Sept. 8, 2015

English | 1 July 1997 | ISBN: 0070380457 | 535 Pages | DJVU | 5 MB

The first edition of this book sold more than 100,000 copies—and this new edition will show you why! Schaum’s Outline of Discrete Mathematics shows you step by step how to solve the kind of problems you’re going to find on your exams. And this new edition features all the latest applications of discrete mathematics to computer science!

Posted by **MoneyRich** at Nov. 23, 2014

Springer | December 12, 2000 | English | ISBN: 1852332360 | 200 pages | PDF | 12 MB

Drawing on many years' experience of teaching discrete mathem atics to students of all levels, Anderson introduces such as pects as enumeration, graph theory and configurations or arr angements. Starting with an introduction to counting and rel ated problems, he moves on to the basic ideas of graph theor y with particular emphasis on trees and planar graphs. He de scribes the inclusion-exclusion principle followed by partit ions of sets which in turn leads to a study of Stirling and Bell numbers. Then follows a treatment of Hamiltonian cycles, Eulerian circuits in graphs, and Latin squares as well as proof of Hall's theorem. He concludes with the constructions of schedules and a brief introduction to block designs. Each chapter is backed by a number of examples, with straightforw ard applications of ideas and more challenging problems.

Posted by **ChrisRedfield** at Sept. 24, 2013

Published: 2010-12-15 | ISBN: 9048147026 | PDF | 423 pages | 9 MB

Posted by **homefoz** at May 27, 2008

John Wiley & Sons | Pages: 560 | 1988-07-22 | ISBN: 0471849022 | 14 MB

This first-year course in discrete mathematics requires no calculus or computer programming experience. The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem-solving. All algorithms are presented in English, in a format compatible with the Pascal programming language. Contains many exercises, with answers at the back of the book (detailed solutions being supplied for difficult problems).

Posted by **happy4all** at Oct. 22, 2016

2015 | 492 Pages | ISBN: 1284056244 | PDF (conv) | 18 MB

Posted by **zxcvbn** at Sept. 21, 2016

Gerard O'Regan | 2016 | PDF | ISBN: 331944560X | 368 pages | 7 Mb

Posted by **roxul** at July 29, 2016

English | 1999 | ISBN: 9814021725 | 122 pages | PDF | 0,5 MB

Posted by **step778** at July 12, 2016

2005 | pages: 222 | ISBN: 0131176870 | PDF | 12,4 mb

Posted by **roxul** at April 26, 2016

English | ISBN: 0898716969 | 2016 | 226 pages | PDF | 15 MB