Computer science : an overview
著者
書誌事項
Computer science : an overview
Addison-Wesley, c2000
6th ed
大学図書館所蔵 全15件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
Computer Science: An Overview lives up to its title, providing the broad coverage and clear explanations of the entire computer science discipline that have made it the leading textbook for the breadth-first/CS0 course. This language-independent book introduces students to the discipline of computer science by providing accurate and balanced coverage of a variety of computer science topics, including programming languages, operating systems, algorithms, software engineering, and machine architecture. The sixth edition has been thoroughly updated to discuss increasingly important trends such as networking, object-oriented programming, and software engineering. It features new sections on public key encryption, evolutionary programming, and genetic algorithms, as well as thoroughly revised sections on data manipulation, operating systems, and networking. It features material on the move towards object-oriented software engineering with new sections covering Design Patterns and UML. Thought-provoking discussions of ethical and legal issues revolving around computing are integrated into each chapter so they are presented in the context of the material being covered at that time. J. Glenn Brookshear is a master of making even the most complex topics accessible to students through the use of real-life analogies and concrete examples.
目次
Introduction.
The Study of Algorithms.
The Development of Algorithmic Machines.
The Evolution of Computer Science.
The Role of Abstraction.
Ethical/Social/Legal Issues.
I. MACHINE ARCHITECTURE.
Data Storage.
Storage of Bits.
Main Memory.
Mass Storage.
Coding Information for Storage.
The Binary System.
Storing Integers.
Storing Fractions.
Storing Pictures.
Communication Errors.
Data Manipulation.
The Central Processing Unit.
The Stored-Program Concept.
Program Execution.
Other Architectures.
Arithmetic/Logic Instructions.
Computer/Peripheral Communication.
II. SOFTWARE.
Operating Systems And Networks.
The Evolution of Operating Systems.
Operating System Architecture.
Coordinating the Machine's Activities.
Handling Competition Among Processes.
Networks.
Network Protocols.
Algorithms.
The Concept of an Algorithm.
Algorithm Representation.
Algorithm Discovery.
Iterative Structures.
Recursive Structures.
Efficiency and Correctness.
Programming Languages.
Historical Perspective.
Traditional Programming Concepts.
Program Units.
Language Implementation.
Object-Oriented Programming.
Parallel Computing.
Declarative Programming.
Software Engineering.
The Software Engineering Discipline.
The Software Life Cycle.
Modularity.
Design Patterns.
Development Tools and Techniques.
Documentation.
Software Ownership and Liability.
III. DATA ORGANIZATION.
Data Structures.
Arrays.
Lists.
Stacks.
Queues.
Trees.
Customized Data Types.
Evolution toward Objects.
File Structures.
Sequential Files.
Text Files.
Indexed Files.
Hashed Files.
The Role of the Operating System.
Database Structures.
General Issues.
The Layered Approach to Database Implementation.
The Relational Model.
Object-Oriented Databases.
Maintaining Database Integrity.
Social Impact of Database Technology.
IV. THE POTENTIAL OF ALGORITHMIC MACHINES.
Artificial Intelligence.
Intelligence and Machines.
Understanding Images.
Reasoning.
Control System Activities.
Using Heuristics.
Artificial Neural Networks.
Genetic Algorithms.
Applications of Artificial Intelligence.
Considering the Consequences.
Theory Of Computation.
A Bare Bones Programming Language.
Turing Machines.
Computable Functions.
A Noncomputable Function.
Complexity of Problems.
Public Key Cryptography.
Appendices.
A. ASCII.
B. Circuits to Manipulate Two's Complement Representations.
C. A Simple Machine Language.
D. Program Examples.
E. The Equivalence of Iterative and Recursive Structures.
F. Answers to Questions/Exercises. 020135747XT04062001
「Nielsen BookData」 より