Combinatorics for Computer Science (Dover Books on Mathematics) by S. Gill Williamson (PDF)

Description

Useful guide covers two major subdivisions of combinatorics — enumeration and graph theory — with emphasis on conceptual needs of computer science. Each part is divided into a “basic concepts” chapter emphasizing intuitive needs of the subject, followed by four “topics” chapters that explore these ideas in depth. Invaluable practical resource for graduate students, advanced undergraduates, and professionals with an interest in algorithm design and other aspects of computer science and combinatorics. References for Linear Order & for Graphs, Trees, and Recursions. 219 figures.

User’s Reviews

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐I am a software engineer by trade, and this is the book I wish I had with me.Today, I don’t see it as a textbook for coursework, but I think there are probably better in today’s world. Though I will let the other reviewer’s viewpoint on this address that issue.However, this is an excellent book for any programmer or software engineer. Honestly I doubt most programmers have this math background ( okay contradicting myself a little, but I did say the other reviewer covered the academic side of this ).The structure of this books makes it an excellent self-study or reference for actually coding. You will have to brush up on the notation at the beginning of the book, but that is minor.It is well written and has very broad coverage of the subject and does not lose rigor or examples. It is well illustrated when it needs to be. Whether you are writing sorting routines or want to really understand and implement graph theory. ( the graph theory coverage is outstanding. ). Honestly you could spend a month learning everything you wanted to know about sorting and network optization from this book.It is not an easy textbook, and honestly I have alot to learn from it yet, but I just simply have to revisit some of my math foundations. But even if you get lost on part of the material in the book, it is still worth it for what you will get.The only cons are some of the material not covered in this book from number theory, which newer textbooks really cover well.

⭐This excellent reference has numerous examples, definitions and exercises covering trees, graphs, linked lists etc. This book provides a great companion to any data structures text.

⭐

Keywords

Free Download Combinatorics for Computer Science (Dover Books on Mathematics) in PDF format
Combinatorics for Computer Science (Dover Books on Mathematics) PDF Free Download
Download Combinatorics for Computer Science (Dover Books on Mathematics) 2076 PDF Free
Combinatorics for Computer Science (Dover Books on Mathematics) 2076 PDF Free Download
Download Combinatorics for Computer Science (Dover Books on Mathematics) PDF
Free Download Ebook Combinatorics for Computer Science (Dover Books on Mathematics)