Invitation to computer science Java version by Schneider, G. Michael

Table of Contents: “…An introduction to computer science -- Level 1: The algorithmic foundations of computer science -- Algorithm discovery and design -- The efficiency of algorithms -- Level 2: The hardware world -- The building blocks: binary numbers, Boolean logic, and gates -- Computer systems organization -- Level 3: The virtual machine -- An introduction to system software and virtual machines -- Computer networks, the Internet, and the World Wide Web -- Level 4: The software world -- Introduction to high-level language programming -- The Tower of Babel -- Compilers and language translation -- Models of computation -- Level 5: Applications -- Simulation and modeling -- Electronic commerce and information security -- Artificial intelligence -- Level 6: Social issues in computing -- Making decisions about computers, information, and society…”

Invitation to computer science by Schneider, G. Michael, Gersting, Judith L.

Table of Contents: “…The Building Blocks: Binary Numbers, Boolean Logic, and Gates -- 5. Computer Systems Organization. …”

Microcomputer engineering by Miller, Gene H.

Table of Contents: “…Computer Fundamentals -- Numbers and Number Systems -- Octal, Hexadecimal, and Binary Numbers -- Two's Complement Signed Numbers -- Binary-coded Decimal Numbers -- Digital System Fundamentals -- Signals, Functions, and Hardware -- Combinational Logic Networks -- Flip Flops and Registers -- Memory -- Synchronous Sequential Networks -- Digital Systems -- Synchronous Serial Communications Example -- Instruction-controlled Information Processor Example -- Stored Program Processors -- Block Diagram -- Instruction Operation -- Definition of the Instruction Set -- General-purpose Computer -- Microprocessors and Microcomputers -- Integrated Circuit Technology -- The Microprocessor and Microcomputer -- Microcomputer Applications -- Instruction Subset and Machine Language -- The 68HC11 Computer Operation -- The Programming Model -- Internal Computer Operations -- Instructions and Addressing Modes -- Extended Addressing -- Direct Addressing -- Inherent Addressing -- Double-byte Data -- Immediate Addressing -- Indexed Addressing -- Relative Addressing -- Addressing Mode Summary -- An Expanded Repertoire -- The Instruction Set Table -- A Tour through the Basic Instructions -- The Comparison Branch Instructions -- Applications of Complex Instructions -- Double-precision Instructions -- Machine Language Programming Example -- Minimum Requirements of a Good Program -- A Classic Example: Copy a Table -- Assemblers and Assembly Language -- The Assembly Process -- The Editor, Assembler, and Loader Programs.…”

A sheep falls out of the tree and other techniques to develop an incredible memory & boost brainpower / by Stenger, Christiane

Table of Contents: “…-- Visualization : using the power of imagery -- Associating new information with what you already know -- Reviewing the important things -- How you can train your memory -- Memory training -- The route method -- The master system, why the sheep falls out of the tree -- How to use these mnemonic techniques -- Numbers -- Words -- Auditory memory training -- Practicing what you've learned -- How to apply these techniques -- Using mnemonic techniques in daily practice -- Interactions with friends, neighbors and customers -- Everyday situations -- School and work -- Developing specialized memory techniques -- Playing cards -- Binary numbers -- Starting training -- Five tips for beginners -- The first seven days -- Words and numbers -- Six tips to keep you going -- Other ways to keep mentally fit -- Focusing your perceptions -- Juggling -- Games -- Mental arithmetic -- Concentration exercises -- Final quiz, see how much you've improved!…”
NetLibrary

Fundamentals of electrical engineering by Bobrow, Leonard S

Table of Contents: “…Digital Logic-- 11.1 Binary Numbers-- 11.2 Binary Arithmetic-- 11.3 Digital Logic Circuits-- 11.4 Boolean Algebra-- 11.5 Standard Forms of Boolean Functions-- 11.6 Simplification of Boolean Functions-- 12. …”

Discrete Mathematics for Computer Science : An Example-Based Introduction / by Fortney, Jon Pierre