Great Ideas In Computer Science Second Edition

In Great Ideas in Computer Science: A Gentle Introduction, Alan Biermann presents the "great ideas" of computer science that together comprise the heart of the field. He condenses a great deal of complex material into a manageable, accessible form. His treatment of programming, for example, presents only a few features of Pascal and restricts all programs to those constructions. Yet most of the important lessons in programming can be taught within these limitations. The student's knowledge of programming then provides the basis for understanding ideas in compilation, operating systems, complexity theory, noncomputability, and other topics. Whenever possible, the author uses common words instead of the specialized vocabulary that might confuse readers. Readers of the book will learn to write a variety of programs in Pascal, design switching circuits, study a variety of Von Neumann and parallel architectures, hand simulate a computer, examine the mechanisms of an operating system, classify various computations as tractable or intractable, learn about noncomputability, and explore many of the important issues in artificial intelligence. This second edition has new chapters on simulation, operating systems, and networks. In addition, the author has upgraded many of the original chapters based on student and instructor comments, with a view toward greater simplicity and readability.

A broad yet deep presentation of the most important concepts in computer science, using the Java programming language for exercises.

When you think about how far and fast computer science has progressed in recent years, it's not hard to conclude that a seven-year old handbook may fall a little short of the kind of reference today's computer scientists, software engineers, and IT professionals need. With a broadened scope, more emphasis on applied computing, and more than 70 chapters either new or significantly revised, the Computer Science Handbook, Second Edition is exactly the kind of reference you need. This rich collection of theory and practice fully characterizes the current state of the field and conveys the modern spirit, accomplishments, and direction of computer science. Highlights of the Second Edition: Coverage that reaches across all 11 subject areas of the discipline as defined in Computing Curricula 2001, now the standard taxonomy More than 70 chapters revised or replaced Emphasis on a more practical/applied approach to IT topics such as information management, net-centric computing, and human computer interaction More than 150 contributing authors--all recognized experts in their respective specialties New chapters on: cryptography computational chemistry computational astrophysics human-centered software development cognitive modeling transaction processing data compression scripting languages event-driven programming software architecture

Provides an overview for applying the GIS concept to transportation (GIS-T).

Praise for the First Edition ". . . an enchanting book for those people in computer science or mathematics who are fascinated by the concept of infinity."—Computing Reviews ". . . a very well written introduction to set theory . . . easy to read and well suited for self-study . . . highly recommended."—Choice The concept of infinity has fascinated and confused mankind for centuries with theories and ideas that cause even seasoned mathematicians to wonder. The Mathematics of Infinity: A Guide to Great Ideas, Second Edition uniquely explores how we can manipulate these ideas when our common sense rebels at the conclusions we are drawing. Continuing to draw from his extensive work on the subject, the author provides a user-friendly presentation that avoids unnecessary, in-depth mathematical rigor. This Second Edition provides important coverage of logic and sets, elements and predicates, cardinals as ordinals, and mathematical physics. Classic arguments and illustrative examples are provided throughout the book and are accompanied by a gradual progression of sophisticated notions designed to stun readers' intuitive view of the world. With an accessible and balanced treatment of both concepts and theory, the book focuses on the following topics: Logic, sets, and functions Prime numbers Counting infinite sets Well ordered sets Infinite cardinals Logic and meta-mathematics Inductions and numbers Presenting an intriguing account of the notions of infinity, The Mathematics of Infinity: A Guide to Great Ideas, Second Edition is an insightful supplement for mathematics courses on set theory at the undergraduate level. The book also serves as a fascinating reference for mathematically inclined individuals who are interested in learning about the world of counterintuitive mathematics.

A new framework for understanding computing: a coherent set of principles spanning technologies, domains, algorithms, architectures, and designs. Computing is usually viewed as a technology field that advances at the breakneck speed of Moore's Law. If we turn away even for a moment, we might miss a game-changing technological breakthrough or an earthshaking theoretical development. This book takes a different perspective, presenting computing as a science governed by fundamental principles that span all technologies. Computer science is a science of information processes. We need a new language to describe the science, and in this book Peter Denning and Craig Martell offer the great principles framework as just such a language. This is a book about the whole of computing—its algorithms, architectures, and designs. Denning and Martell divide the great principles of computing into six categories: communication, computation, coordination, recollection, evaluation, and design. They begin with an introduction to computing, its history, its many interactions with other fields, its domains of practice, and the structure of the great principles framework. They go on to examine the great principles in different areas: information, machines, programming, computation, memory, parallelism, queueing, and design. Finally, they apply the great principles to networking, the Internet in particular. Great Principles of Computing will be essential reading for professionals in science and engineering fields with a “computational” branch, for practitioners in computing who want overviews of less familiar areas of computer science, and for non-computer science majors who want an accessible entry way to the field.

This title is endorsed by Cambridge Assessment International Education to support the full syllabus for examination from 2023. Benefit from the knowledge of our renowned expert authors to navigate through the content of the updated Cambridge IGCSETM and O Level Computer Science syllabuses (0478/0984/2210). - Develop computational thinking and problem-solving skills: clearly-explained concepts are followed by opportunities to implement in the programming language of choice. - Build an understanding of computer systems and associated technologies: carefully prepared worked examples explain new ideas alongside activities to test and consolidate. - Navigate the syllabus confidently: supplementary subject content is flagged clearly, with introductions to each topic outlining the learning objectives. - Satisfy curiosity: students are encouraged to deepen their knowledge and understanding of the subject with Extension Activities and Find Out More. - Consolidate skills and check understanding: self-assessment questions, activities and exam-style questions are embedded throughout the book, alongside key definitions of technical terms and a glossary. Answers to the Student Book are available in Cambridge IGCSE and O Level Computer Science Teacher's Guide with Boost Subscription 9781398318502