A Programmer’s Guide to Computer Science (Vol.1)

A Programmer's Guide to Computer ScienceFree Download A Programmer’s Guide to Computer Science (A virtual degree for the self-taught developer) Vol.1 Book in PDF written by William M. Springer II, PhD and published by Jaxson Media, Madison, WI, United States of America. 

According to the Author, “The developers I know come from a wide variety of backgrounds. Some have graduate degrees in computer science; others studied photography, math, or don’t even have a college degree. Over the last few years I’ve noticed more of a desire from working programmers to learn computer science for a number of reasons. While many people will find the topics covered here interesting in their own right, I’ve attempted to also show where this knowledge is useful in real-world (non-academic) situations. The goal is that when you’ve finished this book, you will know the basics of what you would have learned from an undergraduate computer science degree and how to apply it.

Simply put, this book aims to make you a better, more knowledgeable programmer through a greater understanding of computer science. I can’t consolidate two decades of college and professional experience into one book… but I can try to hit the good parts. My hope is that you will find at least one concept where you can say “yeah, that makes sense now” and apply it to your everyday work.

The point of this book is to make the reader more comfortable with computer science concepts and how to apply them, rather than to fully replicate four years of study. In particular, this is not a book on proofs. While part VIII in Volume II covers proof techniques, standard algorithms are generally given without proofs of correctness. The idea is that the reader will emerge knowing of the existence of these algorithms and how to use them, without getting bogged down in the fine details. For a book of proofs, written at the graduate level, I highly recommend Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein, generally referred to as CLRS. More in-depth reading material is often referenced in the footnotes as well.

This is also not a book on programming; you won’t find a discussion of when to use integers vs doubles or an explanation of loops. Indeed, it is expected that the reader will be able to understand pseudocode listings used to describe algorithms1. The intent is to tie computer science concepts to programming practices that are already familiar to the reader.

Table of Contents

  1. Asymptotic Runtime
  2. Data Structures
  3. Classes of problems
  4. Introduction to Graph Theory
  5. Data Structures on Graphs
  6. Well-Known Graph Algorithms
  7. Common Graph Classes
  8. Sorting Algorithms
  9. Brute Force or No
  10. Dynamic Programming
  11. Greedy Algorithms
  12. Understanding Complexity Theory
  13. Languages and State Machines
  14. Turing Machines
  15. Appendices

Free Download A Programmer’s Guide to Computer Science (A virtual degree for the self-taught developer) Vol.1 Book in PDF written by William M. Springer II from following download links. 

Download Link 1

Download Link 2

File Size: 2.89 MB         Pages: 122    Please Read Disclaimer

Don’t forget to drop a comment below after downloading this book.

Note: If download links are not working, kindly drop a comment below, so we’ll update the download link for you

Happy downloading!

You may also like to download Code The Hidden Language of Computer Hardware and Software in PDF

Leave a Reply

Your email address will not be published.

This site uses Akismet to reduce spam. Learn how your comment data is processed.