Ten Software Patterns Every Student Should Know

Introduction

Just as students of literature must know the basic canon of English works, so should students of software engineering know basic patterns of program development. Even with the advent of powerful AI tools for programming, it is important to understand the techniques and approaches to building efficient programs. This book picks out ten patterns that span several programming domains that represent key ideas that apply to breadth of software engineering tasks. The patterns are not algorithms but ways of approaching the construction of sophisticated software systems.

Hash Tables

The book opens with one of the most ubiquitous software patterns that is often invisible to programmers: Hash tables. Yet building a truly scalable and efficient hash table that may even span multiple computers is not often taught in school and often cannot be obtained off-the-shelf.

Finite State Machines

Other patterns include using finite state machines to recognize basic patterns and to ensure programs don’t miss critical use cases.

Concurrency Patterns

Two patterns provide ways of reasoning about multi-threaded and multi-process programs and introducing a way of programming that works for both types of concurrent programming.

Design for Failure

The book closes with a call to design for failure: to anticipate that a complex system rarely works perfectly and that determining why something fails is almost as important as knowing why it works.

Author

Michael Kilian holds a Ph.D. from Harvard University and been working in Software Engineering for nearly 50 years. This book grew from interviews with college students while working at Ab Initio and realizing that some basic ideas were missing from the curricula of even the brightest students.