Providing a comprehensive introduction to operating systems, this book emphasizes the fundamentals of the key mechanisms of modern operating systems, and the types of design tradeoffs and decisions involved in operating system design. It presents recent developments in operating system design, and uses three running examples of operating systems to illustrate the material--Windows NT, UNIX, and IBM MVS.

Operating Systems

Computers & Technology

STALLINGS WILLIAM

MacMillan Publishing Company

The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. 
In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage. 
As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds. 
 Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.

Introduction to Algorithms, Second Edition

Cormen, Thomas H.

Leiserson, Charles E.

Rivest, Ronald L.

Stein, Clifford

Programming

McGraw-Hill Science/Engineering/Math.

This book is based on the premise that starting with a high level programming language is not the best approach. The reason most students do not understand a programming language when they take it as a first course is because they are forced to memorize technical details. They do not understand the basic underpinnings of how a computer works. 
 The result of this thought is the motivated bottom-up approach found in Patt/Patel's Introduction To Computing Systems. This text starts with the logic structures and architecture of a computer and moves up to the application software that runs on it. The book covers in turn: switch level abstraction of a MOS Transistor, Logic Gates, latches, logic structures (MUX, Decoder, Adder, gated latches), finally culminating in an implementation of memory. From there, the book moves on to the Von Neumann model of execution, then a simple computer (the LC-2), machine language programming, assembly language, assemblers and then assembly language programming of the LC-2. The book then moves to the high level language C, recursion, and finally elementary data structures. The book establishes a foundation that every subsequent course in the computer science or computer engineering curriculum can benefit from and build on.

Introduction to Computing Systems: From Bits and Gates to C and Beyond with CD-ROM

Patt, Yale N.

Patel, Sanjay J.

Programming Language Pragmatics, Third Edition, is the most comprehensive programming language book available today. Taking the perspective that language design and implementation are tightly interconnected and that neither can be fully understood in isolation, this critically acclaimed and bestselling book has been thoroughly updated to cover the most recent developments in programming language design, inclouding Java 6 and 7, C++0X, C# 3.0, F#, Fortran 2003 and 2008, Ada 2005, and Scheme R6RS. A new chapter on run-time program management covers virtual machines, managed code, just-in-time and dynamic compilation, reflection, binary translation and rewriting, mobile code, sandboxing, and debugging and program analysis tools. Over 800 numbered examples are provided to help the reader quickly cross-reference and access content. This text is designed for undergraduate Computer Science students, programmers, and systems and software engineers.

Programming Language Pragmatics

Scott, Michael

Computer Science

Morgan Kaufmann

Programming Language Pragmatics, Fourth Edition, is the most comprehensive programming language textbook available today. It is distinguished and acclaimed for its integrated treatment of language design and implementation, with an emphasis on the fundamental tradeoffs that continue to drive software development. The book provides readers with a solid foundation in the syntax, semantics, and pragmatics of the full range of programming languages, from traditional languages like C to the latest in functional, scripting, and object-oriented programming. This fourth edition has been heavily revised throughout, with expanded coverage of type systems and functional programming, a unified treatment of polymorphism, highlights of the newest language standards, and examples featuring the ARM and x86 64-bit architectures.

Web Development & Design

The innovative approach of the first edition of Programming Language Pragmatics provided students with an integrated view of programming language design and implementation, while offering a solid teaching text on timely language topics in a rigorous yet accessible style. The new edition carries on these distinctive features as well as the signature tradition of illustrating the most recent developments in programming language design with a variety of modern programming languages.

Instructors Resource Manual

Stephen Robbins

Pearson Education Limited

The Berkeley UNIX environment was foundational in C programming, explained in detail in this book!

C Programming in the Berkeley Unix Environment

Horspool, R. Nigel

Prentice-Hall

Known as the bible of C, this classic bestseller introduces the C programming language and illustrates algorithms, data structures, and programming techniques.

The C Programming Language

Kernighan,Ritchie

Science & Math

The authors present the complete guide to ANSI standard C language programming. Written by the developers of C, this new version helps readers keep up with the finalized ANSI standard for C while showing how to take advantage of C's rich set of operators, economy of expression, improved control flow, and data structures. The 2/E has been completely rewritten with additional examples and problem sets to clarify the implementation of difficult language constructs. For years, C programmers have let K&amp;R guide them to building well-structured and efficient programs. Now this same help is available to those working with ANSI compilers. Includes detailed coverage of the C language plus the official C language reference manual for at-a-glance help with syntax notation, declarations, ANSI changes, scope rules, and the list goes on and on.

C Programming Language, 2nd Edition

BRIAN W. KERNIGHAN

Dennis M. Ritchie