๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Fundamentals of Computer Science

โœ Scribed by Andrew J. T. Colin (auth.)


Publisher
Macmillan Education UK
Year
1980
Tongue
English
Leaves
271
Series
Macmillan Computer Science Series
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Table of Contents


Front Matter....Pages i-x
Information....Pages 1-11
Information Inside Computers....Pages 12-23
The Basic Structure of a Computer....Pages 24-36
The Implementation of Binary Arithmetic....Pages 37-46
Sequential Networks....Pages 47-56
Immediate Access Stores....Pages 57-61
Introduction to SNARK....Pages 62-68
Jump Instructions on SNARK....Pages 69-77
Array Handling of SNARK....Pages 78-86
Computers โ€” the Grand Design....Pages 87-119
Backing Stores....Pages 120-128
Peripheral Devices....Pages 129-138
Software....Pages 139-146
Translators....Pages 147-167
The History of Computers....Pages 168-173
Main-frame Computers....Pages 174-183
Minicomputers....Pages 184-193
Microprocessors....Pages 194-199
Back Matter....Pages 200-260

โœฆ Subjects


Theory of Computation


๐Ÿ“œ SIMILAR VOLUMES


Fundamentals of Computer Graphics: An Al
โœ Edet, Theophilus ๐Ÿ“‚ Library ๐Ÿ“… 2023 ๐Ÿ› CompreQuest Books ๐ŸŒ English

Are you ready to embark on a captivating journey into the world of computer graphics? "Fundamentals of Computer Graphics: An Algorithmic Approach" is your key to unlocking this enchanting universe, from the basics to the most intricate concepts. Journey Through the Digital Wonderland Discover the

Computability, Complexity and Languages:
โœ Martin Davis, Elaine J. Weyuker ๐Ÿ“‚ Library ๐Ÿ“… 1983 ๐Ÿ› Academic Press Inc ๐ŸŒ English

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability

Computability, complexity, and languages
โœ Davis M., Sigal R., Weyuker E. ๐Ÿ“‚ Library ๐Ÿ“… 1994 ๐Ÿ› AP ๐ŸŒ English

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability

Computability, complexity and languages:
โœ Davis M., Weyuker E. ๐Ÿ“‚ Library ๐Ÿ“… 1983 ๐Ÿ› AP ๐ŸŒ English

This introductory text covers the key areas of computer science, including recursive function theory, formal languages, and automata. It assumes a minimal background in formal mathematics. The book is divided into five parts: Computability, Grammars and Automata, Logic, Complexity, and Unsolvability