You know how to code..but is it enough? Do you feel left out when other programmers talk about asymptotic bounds? Have you failed a job interview because you don't know computer science? The author, a senior developer at a major software company with a PhD in computer science, takes you through what you would have learned while earning a four-year computer science degree. Volume one covers the most frequently referenced topics, including algorithms and data structures, graphs, problem-solving techniques, and complexity theory. When you finish this book, you'll have the tools you need to hold your own with people who have - or expect you to have - a computer science degree.

Understand essential computer science concepts and skills. This book focuses on the foundational and fundamental concepts upon which expertise in specific areas can be developed, including computer architecture, programming language, algorithm and data structure, operating systems, computer networks, distributed systems, security, and more. According to code.org, there are 500,000 open programming positions available in the US— compared to an annual crop of just 50,000 graduating computer science majors. The US Department of Labor predicted that there will be almost a million and a half computer science jobs in the very near future, but only enough programmers to fill roughly one third of these jobs. To bridge the gap, many people not formally trained in computer science are employed in programming jobs. Although they are able to start programming and coding quickly, it often takes them time to acquire the necessary understanding to gain the requisite skills to become an efficient computer engineer or advanced developer. What You Will Learn The fundamentals of how a computer works The basics of computer programming and programming paradigms How to write efficient programs How the hardware and software work together to provide a good user experience and enhance the usability of the system How computers can talk to each other How to ensure the security of the system The fundamentals of cloud offerings, implications/trade-offs, and deployment/adoption configurations The fundamentals of machine learning Who This Book Is For Computer programmers lacking a formal education in computer science, and anyone with a formal education in computer science, looking to develop a general understanding of computer science fundamentals

You know how to code... ...but is it enough?Do you feel left out when other programmers talk about asymptotic bounds?Have you failed a job interview because you don't know computer science?Volume two picks up where volume one left off, covering proofs, security, hardware and software, and various advanced topics.You've learned the basics. Are you ready for what comes next?

A tutorial and reference to the object-oriented programming language for beginning to experienced programmers, updated for version 1.8, describes the language's structure, syntax, and operation, and explains how to build applications. Original. (Intermediate)

This invaluable textbook presents a comprehensive introduction to modern competitive programming. The text highlights how competitive programming has proven to be an excellent way to learn algorithms, by encouraging the design of algorithms that actually work, stimulating the improvement of programming and debugging skills, and reinforcing the type of thinking required to solve problems in a competitive setting. The book contains many “folklore” algorithm design tricks that are known by experienced competitive programmers, yet which have previously only been formally discussed in online forums and blog posts. Topics and features: reviews the features of the C++ programming language, and describes how to create efficient algorithms that can quickly process large data sets; discusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard library; introduces the algorithm design technique of dynamic programming, and investigates elementary graph algorithms; covers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queries; surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming; examines advanced graph techniques, geometric algorithms, and string techniques; describes a selection of more advanced topics, including square root algorithms and dynamic programming optimization. This easy-to-follow guide is an ideal reference for all students wishing to learn algorithms, and practice for programming contests. Knowledge of the basics of programming is assumed, but previous background in algorithm design or programming contests is not necessary. Due to the broad range of topics covered at various levels of difficulty, this book is suitable for both beginners and more experienced readers.

An extensive revision of the first edition, The Programmer's Guide to PC Video Systems, 2nd Ed. is the indispensable reference to the latest and greatest video hardware available, and to the techniques programmers need to get the most from that hardware.