Systems Programming

Fülszöveg

CTHEfi McGFAWHILL EOCKS
COMPUTER STRUCTURES: Examples and Readings C. GORDON BELL and ALLEN NEWELL, both of Carnegie-Mellon Uni-versity. McGraw-Hill Computer Science Series. 576 pages By utilizing a case study approach covering 40 distinct computer types, this text provides a taxonomical framework for analyzing the 1000 different computers now extant. In addition, these computers are examined at the processors, memories, and switches component levels, and the instruction and processor level. One-third of the book is original machine material and of the 40 computers described, 10 are based on unpublished sourcés.
INTRODUCTION TO APPLIED COMBINATORIAL MATHEMATICS C. L. LIU, Massachusetts Institute of Technology. 393 pages McGraw-Hill Computer Science Series.
Four aspects of combinatorial mathematics are covered in this text: enumerative analysis, theory of graphs, optimization techniques, and design of experiments. The discussion combines fundamental theory and modern... Tovább

Fülszöveg

CTHEfi McGFAWHILL EOCKS
COMPUTER STRUCTURES: Examples and Readings C. GORDON BELL and ALLEN NEWELL, both of Carnegie-Mellon Uni-versity. McGraw-Hill Computer Science Series. 576 pages By utilizing a case study approach covering 40 distinct computer types, this text provides a taxonomical framework for analyzing the 1000 different computers now extant. In addition, these computers are examined at the processors, memories, and switches component levels, and the instruction and processor level. One-third of the book is original machine material and of the 40 computers described, 10 are based on unpublished sourcés.
INTRODUCTION TO APPLIED COMBINATORIAL MATHEMATICS C. L. LIU, Massachusetts Institute of Technology. 393 pages McGraw-Hill Computer Science Series.
Four aspects of combinatorial mathematics are covered in this text: enumerative analysis, theory of graphs, optimization techniques, and design of experiments. The discussion combines fundamental theory and modern applications, with basic concepts unencumbered by excessive mathematical detail. No prior background in the subject or in modern algebra is required, and numerous worked-out examples, which are graded in increasing difficulty, are offered to lead the student into various topics.
SWITCHING AND FINITE AUTOMATA THEORY
ZVI KOHAVI, Technion, Israel. McGraw-Hill Computer Science Series. 592 pages
Many topics concerned with the diagnosis, structure, and capabilities of logical machines are included for the first time in this general text. This new material constitutes about half of the entire book. The author's pur-pose is to develop topics which are the product of recent research and are of practical interest to the logical designer and the computer scien-tist. He provides the student and the engineer with specific techniques for designing logical circuits; techniques for minimizing or decomposing combinational as well as sequential circuits, etc.
INTRODUCTION TO COMPUTER ORGANIZATION AND DATA STRUCTURES
HAROLD S. STONE, Stanford University. McGraw-Hill Computer Science Series.
Using a minicomputer, the Hewlett-Packard 2116, and the IBM System/ 360-370 as examples, this volume describes basic computer Organization, assembly language programming, and techniques for representing data structures for efficient processing. Topics are presented from a machine-independent point of view, and concrete examples of the subjects are presented In the assembly language of both computers.
McGRAW-HILL BOOK COMPANY
Serving Man's Need for Knowledge®
1221 Avenue of The Americas • New York, N.Y. 10020 Vissza