This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford.

    Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems.

    The reader is shown how to develop a database that is predictably sound and able to satisfy the strictest performance criteria. The book offers a carefully developed analysis of the essential subject matter, organized according to how a database is actually designed and operated. It also applies the design of databases to business and organizational activities. One useful feature of the book is that the methodology for designing a database is independent of any software package. Comprehensive and balanced treatment is given to all three Database Management Systems: IMS, IDMS/R and ADABAS. In addition, two detailed case studies are included: designing databases for a banking environment and a university environment. The large number of illustrations and tables make information in the book easy to understand, and questions and answers are provided at the end of each chapter.