Author: Stephen A. Ward,Robert H. Halstead

Publisher: MIT Press

ISBN: 9780262231398

Category: Computers

Page: 789

View: 1959

Computer Systems Organization -- general.
Read More

Author: Harold Abelson

Publisher: Mit Press

ISBN: 9780262011532

Category: Computers

Page: 657

View: 1224

Structure and Interpretation of Computer Programs has had a dramatic impact on computer science curricula over the past decade. This long-awaited revision contains changes throughout the text. There are new implementations of most of the major programming systems in the book, including the interpreters and compilers, and the authors have incorporated many small changes that reflect their experience teaching the course at MIT since the first edition was published. A new theme has been introduced that emphasizes the central role played by different approaches to dealing with time in computational models: objects with state, concurrent programming, functional programming and lazy evaluation, and nondeterministic programming. There are new example sections on higher-order procedures in graphics and on applications of stream processing in numerical programming, and many new exercises. In addition, all the programs have been reworked to run in any Scheme implementation that adheres to the IEEE standard.
Read More

With Application to Understanding Data

Author: John V. Guttag

Publisher: MIT Press

ISBN: 0262529629

Category: Computers

Page: 472

View: 6647

The new edition of an introductory text that teaches students the art of computational problem solving, covering topics ranging from simple algorithms to information visualization.
Read More

Author: Eric Lehman,F. Thomson Leighton,Albert R. Meyer

Publisher: N.A

ISBN: 9789888407064

Category:

Page: 979

View: 6489

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.
Read More

An Introductory Textbook

Author: Niklaus Wirth

Publisher: Springer Science & Business Media

ISBN: 3642577806

Category: Technology & Engineering

Page: 204

View: 2266

The author is the leading programming language designer of our time and in this book, based on a course for 2nd-year students at, he closes the gap between hardware and software design. He encourages students to put the theory to work in exercises that include lab work culminating in the design of a simple yet complete computer. In short, a modern introduction to designing circuits using state-of-the-art technology and a concise, easy to master hardware description language (Lola).
Read More

Abstraction, Specification, and Object-Oriented Design

Author: Barbara Liskov,John Guttag

Publisher: Pearson Education

ISBN: 076868496X

Category: Computers

Page: 464

View: 9190

Written by a world-renowned expert on programming methodology, and the winner of the 2008 Turing Award, this book shows how to build production-quality programs--programs that are reliable, easy to maintain, and quick to modify. Its emphasis is on modular program construction: how to get the modules right and how to organize a program as a collection of modules. The book presents a methodology effective for either an individual programmer, who may be writing a small program or a single module in a larger one; or a software engineer, who may be part of a team developing a complex program comprised of many modules. Both audiences will acquire a solid foundation for object-oriented program design and component-based software development from this methodology. Because each module in a program corresponds to an abstraction, such as a collection of documents or a routine to search the collection for documents of interest, the book first explains the kinds of abstractions most useful to programmers: procedures; iteration abstractions; and, most critically, data abstractions. Indeed, the author treats data abstraction as the central paradigm in object-oriented program design and implementation. The author also shows, with numerous examples, how to develop informal specifications that define these abstractions--specifications that describe what the modules do--and then discusses how to implement the modules so that they do what they are supposed to do with acceptable performance. Other topics discussed include: Encapsulation and the need for an implementation to provide the behavior defined by the specification Tradeoffs between simplicity and performance Techniques to help readers of code understand and reason about it, focusing on such properties as rep invariants and abstraction functions Type hierarchy and its use in defining families of related data abstractions Debugging, testing, and requirements analysis Program design as a top-down, iterative process, and design patterns The Java programming language is used for the book's examples. However, the techniques presented are language independent, and an introduction to key Java concepts is included for programmers who may not be familiar with the language.
Read More

Author: Berthold Horn

Publisher: MIT Press

ISBN: 9780262081597

Category: Computers

Page: 509

View: 6441

"Presents a solid framework for understanding existing work and planning future research."--Cover.
Read More

Author: Mark Donald Hill,Norman Paul Jouppi,Gurindar Sohi

Publisher: Gulf Professional Publishing

ISBN: 9781558605398

Category: Computers

Page: 717

View: 5992

Offering a carefully reviewed selection of over 50 papers illustrating the breadth and depth of computer architecture, this text includes insightful introductions to guide readers through the primary sources.
Read More

Author: Daniel P. Friedman,William E. Byrd,Oleg Kiselyov,Jason Hemann,Duane Bibby,Guy Lewis Steele,Gerald Jay Sussman,Robert A. Kowalski

Publisher: MIT Press

ISBN: 0262348780

Category: Computers

Page: 208

View: 8068

The goal of this book is to show the beauty and elegance of relational programming, which captures the essence of logic programming. The book shows how to implement a relational programming language in Scheme, or in any other functional language, and demonstrates the remarkable flexibility of the resulting relational programs. As in the first edition, the pedagogical method is a series of questions and answers, which proceed with the characteristic humor that marked The Little Schemer and The Seasoned Schemer. Familiarity with a functional language or with the first five chapters of The Little Schemer is assumed. For this second edition, the authors have greatly simplified the programming language used in the book, as well as the implementation of the language. In addition to revising the text extensively, and simplifying and revising the "Laws" and "Commandments," they have added explicit "Translation" rules to ease translation of Scheme functions into relations.
Read More

Author: Steve Oualline

Publisher: "O'Reilly Media, Inc."

ISBN: 9780596004194

Category: Computers

Page: 549

View: 4657

Teaches the programming language, covering topics including syntax, coding standards, object classes, templates, debugging, and the C++ preprocessor.
Read More

Author: Gerald Jay Sussman,Jack Wisdom

Publisher: MIT Press

ISBN: 0262028964

Category: Science

Page: 584

View: 8009

The new edition of a classic text that concentrates on developing general methods for studying the behavior of classical systems, with extensive use of computation.
Read More

How Stories Explain Computing

Author: Martin Erwig

Publisher: MIT Press

ISBN: 0262341700

Category: Mathematics

Page: 336

View: 7644

Picture a computer scientist, staring at a screen and clicking away frantically on a keyboard, hacking into a system, or perhaps developing an app. Now delete that picture. In Once Upon an Algorithm, Martin Erwig explains computation as something that takes place beyond electronic computers, and computer science as the study of systematic problem solving. Erwig points out that many daily activities involve problem solving. Getting up in the morning, for example: You get up, take a shower, get dressed, eat breakfast. This simple daily routine solves a recurring problem through a series of well-defined steps. In computer science, such a routine is called an algorithm. Erwig illustrates a series of concepts in computing with examples from daily life and familiar stories. Hansel and Gretel, for example, execute an algorithm to get home from the forest. The movie Groundhog Day illustrates the problem of unsolvability; Sherlock Holmes manipulates data structures when solving a crime; the magic in Harry Potter's world is understood through types and abstraction; and Indiana Jones demonstrates the complexity of searching. Along the way, Erwig also discusses representations and different ways to organize data; "intractable" problems; language, syntax, and ambiguity; control structures, loops, and the halting problem; different forms of recursion; and rules for finding errors in algorithms. This engaging book explains computation accessibly and shows its relevance to daily life. Something to think about next time we execute the algorithm of getting up in the morning.
Read More

Author: Franklyn Turbak,David Gifford,Mark A. Sheldon

Publisher: MIT Press

ISBN: 0262303159

Category: Computers

Page: 1346

View: 5173

Hundreds of programming languages are in use today -- scripting languages for Internet commerce, user interface programming tools, spreadsheet macros, page format specification languages, and many others. Designing a programming language is a metaprogramming activity that bears certain similarities to programming in a regular language, with clarity and simplicity even more important than in ordinary programming. This comprehensive text uses a simple and concise framework to teach key ideas in programming language design and implementation. The book's unique approach is based on a family of syntactically simple pedagogical languages that allow students to explore programming language concepts systematically. It takes as premise and starting point the idea that when language behaviors become incredibly complex, the description of the behaviors must be incredibly simple. The book presents a set of tools (a mathematical metalanguage, abstract syntax, operational and denotational semantics) and uses it to explore a comprehensive set of programming language design dimensions, including dynamic semantics (naming, state, control, data), static semantics (types, type reconstruction, polymporphism, effects), and pragmatics (compilation, garbage collection). The many examples and exercises offer students opportunities to apply the foundational ideas explained in the text. Specialized topics and code that implements many of the algorithms and compilation methods in the book can be found on the book's Web site, along with such additional material as a section on concurrency and proofs of the theorems in the text. The book is suitable as a text for an introductory graduate or advanced undergraduate programming languages course; it can also serve as a reference for researchers and practitioners.
Read More

Author: Bjarne Stroustrup

Publisher: Pearson Education

ISBN: 0321563840

Category: Computers

Page: 1346

View: 8862

Offers information on using the C++ programming languge using the new C++11 standard, covering such topics as concurrency, facilities, standard libraries, and design techniques.
Read More

Building a Modern Computer from First Principles

Author: Noam Nisan,Shimon Schocken

Publisher: MIT Press

ISBN: 9780262140874

Category: Computers

Page: 325

View: 5051

This title gives students an integrated and rigorous picture of applied computer science, as it comes to play in the construction of a simple yet powerful computer system.
Read More

A Cyber-Physical Systems Approach

Author: Edward Ashford Lee,Sanjit Arunkumar Seshia

Publisher: MIT Press

ISBN: 0262340526

Category: Computers

Page: 568

View: 2592

The most visible use of computers and software is processing information for human consumption. The vast majority of computers in use, however, are much less visible. They run the engine, brakes, seatbelts, airbag, and audio system in your car. They digitally encode your voice and construct a radio signal to send it from your cell phone to a base station. They command robots on a factory floor, power generation in a power plant, processes in a chemical plant, and traffic lights in a city. These less visible computers are called embedded systems, and the software they run is called embedded software. The principal challenges in designing and analyzing embedded systems stem from their interaction with physical processes. This book takes a cyber-physical approach to embedded systems, introducing the engineering concepts underlying embedded systems as a technology and as a subject of study. The focus is on modeling, design, and analysis of cyber-physical systems, which integrate computation, networking, and physical processes. The second edition offers two new chapters, several new exercises, and other improvements. The book can be used as a textbook at the advanced undergraduate or introductory graduate level and as a professional reference for practicing engineers and computer scientists. Readers should have some familiarity with machine structures, computer programming, basic discrete mathematics and algorithms, and signals and systems.
Read More

Author: Anant Agarwal,Jeffrey Lang

Publisher: Elsevier

ISBN: 008050681X

Category: Technology & Engineering

Page: 1008

View: 8794

Unlike books currently on the market, this book attempts to satisfy two goals: combine circuits and electronics into a single, unified treatment, and establish a strong connection with the contemporary world of digital systems. It will introduce a new way of looking not only at the treatment of circuits, but also at the treatment of introductory coursework in engineering in general. Using the concept of ''abstraction,'' the book attempts to form a bridge between the world of physics and the world of large computer systems. In particular, it attempts to unify electrical engineering and computer science as the art of creating and exploiting successive abstractions to manage the complexity of building useful electrical systems. Computer systems are simply one type of electrical systems. +Balances circuits theory with practical digital electronics applications. +Illustrates concepts with real devices. +Supports the popular circuits and electronics course on the MIT OpenCourse Ware from which professionals worldwide study this new approach. +Written by two educators well known for their innovative teaching and research and their collaboration with industry. +Focuses on contemporary MOS technology.
Read More

Introducing Computer Science

Author: Brian Harvey,Matthew Wright

Publisher: MIT Press

ISBN: 9780262082815

Category: Computers

Page: 579

View: 6625

This lively introduction to computer science and computer programming in Scheme is for non-computer science majors with a strong interest in the subject and for computer science majors who lack prior programming experience. The text allows the student to experience the computer as a tool for expressing ideas, not as a frustrating set of mathematical obstacles. This goal is supported by the use of Scheme, a modern dialect of Lisp, designed to emphasize symbolic programming.
Read More

Author: Cliff L Stein,Robert Drysdale,Kenneth Bogart

Publisher: Pearson Higher Ed

ISBN: 0133001296

Category: Computers

Page: 528

View: 4816

This is the eBook of the printed book and may not include any media, website access codes, or print supplements that may come packaged with the bound book. Stein/Drysdale/Bogart's Discrete Mathematics for Computer Scientists is ideal for computer science students taking the discrete math course. Written specifically for computer science students, this unique textbook directly addresses their needs by providing a foundation in discrete math while using motivating, relevant CS applications. This text takes an active-learning approach where activities are presented as exercises and the material is then fleshed out through explanations and extensions of the exercises.
Read More