عنوان

From computing to computational thinking

(Number (ISBN

9781482217650

Country Code

IR

Number

27524

.Language of Text, Soundtrack etc

انگلیسی

Country of publication

IR

Title Proper

From computing to computational thinking

General Material Designation

[Book]

First Statement of Responsibility

/ Paul S. Wang

Place of Publication, Distribution, etc.

Boca Raton, FL

Name of Publisher, Distributor, etc.

: CRC Press/Taylor & Francis Group

Date of Publication, Distribution, etc.

, 2016.

Specific Material Designation and Extent of Item

xxii, 266 pages

Other Physical Details

: illustrations, maps

Dimensions

; 24 cm

Text of Note

Includes bibliographical references (page 253) and index

Text of Note

Machine generated contents note: 1.Why Did the Chicken Cross the Road? -- 1.1.The Computer -- 1.2.Turing Machine -- CT: Abstract Away -- 1.3.A Brief History of Computers -- 1.4.Software -- 1.5.Programming -- 1.6.Syntax and Semantics -- CT: Beware of Semantics -- 1.7.Flowcharts -- CT: Ready for All Contingencies -- CT: First Things First -- CT: Check before Proceeding -- 1.8.Algorithms -- CT: Make It an Algorithm -- CT: Consider Extreme Cases -- 1.9.Pseudo Code -- CT: Step by Step -- 1.10.The Euclidean GCD Algorithm -- CT: Apply Domain Knowledge -- 1.11.Goals and How to Get There -- CT: Break It Down -- 1.12.Road Crossing -- Exercises -- 2.Bits, Bytes, and Words -- 2.1.Digital Computers -- 2.2.Binary Numbers -- CT: Meaning of Symbols -- 2.2.1.Numbers in Other Bases -- CT: Evaluate Different Options -- 2.3.Positive and Negative Integers -- 2.4.Modular Arithmetic -- CT: Mind Resource Limitations -- CT: Symbols Can Be Deceiving -- 2.5.Base Conversion -- CT: Start from the End --Machine generated contents note: 1.Why Did the Chicken Cross the Road? -- 1.1.The Computer -- 1.2.Turing Machine -- CT: Abstract Away -- 1.3.A Brief History of Computers -- 1.4.Software -- 1.5.Programming -- 1.6.Syntax and Semantics -- CT: Beware of Semantics -- 1.7.Flowcharts -- CT: Ready for All Contingencies -- CT: First Things First -- CT: Check before Proceeding -- 1.8.Algorithms -- CT: Make It an Algorithm -- CT: Consider Extreme Cases -- 1.9.Pseudo Code -- CT: Step by Step -- 1.10.The Euclidean GCD Algorithm -- CT: Apply Domain Knowledge -- 1.11.Goals and How to Get There -- CT: Break It Down -- 1.12.Road Crossing -- Exercises -- 2.Bits, Bytes, and Words -- 2.1.Digital Computers -- 2.2.Binary Numbers -- CT: Meaning of Symbols -- 2.2.1.Numbers in Other Bases -- CT: Evaluate Different Options -- 2.3.Positive and Negative Integers -- 2.4.Modular Arithmetic -- CT: Mind Resource Limitations -- CT: Symbols Can Be Deceiving -- 2.5.Base Conversion -- CT: Start from the End --Machine generated contents note: 1.Why Did the Chicken Cross the Road? -- 1.1.The Computer -- 1.2.Turing Machine -- CT: Abstract Away -- 1.3.A Brief History of Computers -- 1.4.Software -- 1.5.Programming -- 1.6.Syntax and Semantics -- CT: Beware of Semantics -- 1.7.Flowcharts -- CT: Ready for All Contingencies -- CT: First Things First -- CT: Check before Proceeding -- 1.8.Algorithms -- CT: Make It an Algorithm -- CT: Consider Extreme Cases -- 1.9.Pseudo Code -- CT: Step by Step -- 1.10.The Euclidean GCD Algorithm -- CT: Apply Domain Knowledge -- 1.11.Goals and How to Get There -- CT: Break It Down -- 1.12.Road Crossing -- Exercises -- 2.Bits, Bytes, and Words -- 2.1.Digital Computers -- 2.2.Binary Numbers -- CT: Meaning of Symbols -- 2.2.1.Numbers in Other Bases -- CT: Evaluate Different Options -- 2.3.Positive and Negative Integers -- 2.4.Modular Arithmetic -- CT: Mind Resource Limitations -- CT: Symbols Can Be Deceiving -- 2.5.Base Conversion -- CT: Start from the End --Machine generated contents note: 1.Why Did the Chicken Cross the Road? -- 1.1.The Computer -- 1.2.Turing Machine -- CT: Abstract Away -- 1.3.A Brief History of Computers -- 1.4.Software -- 1.5.Programming -- 1.6.Syntax and Semantics -- CT: Beware of Semantics -- 1.7.Flowcharts -- CT: Ready for All Contingencies -- CT: First Things First -- CT: Check before Proceeding -- 1.8.Algorithms -- CT: Make It an Algorithm -- CT: Consider Extreme Cases -- 1.9.Pseudo Code -- CT: Step by Step -- 1.10.The Euclidean GCD Algorithm -- CT: Apply Domain Knowledge -- 1.11.Goals and How to Get There -- CT: Break It Down -- 1.12.Road Crossing -- Exercises -- 2.Bits, Bytes, and Words -- 2.1.Digital Computers -- 2.2.Binary Numbers -- CT: Meaning of Symbols -- 2.2.1.Numbers in Other Bases -- CT: Evaluate Different Options -- 2.3.Positive and Negative Integers -- 2.4.Modular Arithmetic -- CT: Mind Resource Limitations -- CT: Symbols Can Be Deceiving -- 2.5.Base Conversion -- CT: Start from the End --Machine generated contents note: 1.Why Did the Chicken Cross the Road? -- 1.1.The Computer -- 1.2.Turing Machine -- CT: Abstract Away -- 1.3.A Brief History of Computers -- 1.4.Software -- 1.5.Programming -- 1.6.Syntax and Semantics -- CT: Beware of Semantics -- 1.7.Flowcharts -- CT: Ready for All Contingencies -- CT: First Things First -- CT: Check before Proceeding -- 1.8.Algorithms -- CT: Make It an Algorithm -- CT: Consider Extreme Cases -- 1.9.Pseudo Code -- CT: Step by Step -- 1.10.The Euclidean GCD Algorithm -- CT: Apply Domain Knowledge -- 1.11.Goals and How to Get There -- CT: Break It Down -- 1.12.Road Crossing -- Exercises -- 2.Bits, Bytes, and Words -- 2.1.Digital Computers -- 2.2.Binary Numbers -- CT: Meaning of Symbols -- 2.2.1.Numbers in Other Bases -- CT: Evaluate Different Options -- 2.3.Positive and Negative Integers -- 2.4.Modular Arithmetic -- CT: Mind Resource Limitations -- CT: Symbols Can Be Deceiving -- 2.5.Base Conversion -- CT: Start from the End --Machine generated contents note: 1.Why Did the Chicken Cross the Road? -- 1.1.The Computer -- 1.2.Turing Machine -- CT: Abstract Away -- 1.3.A Brief History of Computers -- 1.4.Software -- 1.5.Programming -- 1.6.Syntax and Semantics -- CT: Beware of Semantics -- 1.7.Flowcharts -- CT: Ready for All Contingencies -- CT: First Things First -- CT: Check before Proceeding -- 1.8.Algorithms -- CT: Make It an Algorithm -- CT: Consider Extreme Cases -- 1.9.Pseudo Code -- CT: Step by Step -- 1.10.The Euclidean GCD Algorithm -- CT: Apply Domain Knowledge -- 1.11.Goals and How to Get There -- CT: Break It Down -- 1.12.Road Crossing -- Exercises -- 2.Bits, Bytes, and Words -- 2.1.Digital Computers -- 2.2.Binary Numbers -- CT: Meaning of Symbols -- 2.2.1.Numbers in Other Bases -- CT: Evaluate Different Options -- 2.3.Positive and Negative Integers -- 2.4.Modular Arithmetic -- CT: Mind Resource Limitations -- CT: Symbols Can Be Deceiving -- 2.5.Base Conversion -- CT: Start from the End --Machine generated contents note: 1.Why Did the Chicken Cross the Road? -- 1.1.The Computer -- 1.2.Turing Machine -- CT: Abstract Away -- 1.3.A Brief History of Computers -- 1.4.Software -- 1.5.Programming -- 1.6.Syntax and Semantics -- CT: Beware of Semantics -- 1.7.Flowcharts -- CT: Ready for All Contingencies -- CT: First Things First -- CT: Check before Proceeding -- 1.8.Algorithms -- CT: Make It an Algorithm -- CT: Consider Extreme Cases -- 1.9.Pseudo Code -- CT: Step by Step -- 1.10.The Euclidean GCD Algorithm -- CT: Apply Domain Knowledge -- 1.11.Goals and How to Get There -- CT: Break It Down -- 1.12.Road Crossing -- Exercises -- 2.Bits, Bytes, and Words -- 2.1.Digital Computers -- 2.2.Binary Numbers -- CT: Meaning of Symbols -- 2.2.1.Numbers in Other Bases -- CT: Evaluate Different Options -- 2.3.Positive and Negative Integers -- 2.4.Modular Arithmetic -- CT: Mind Resource Limitations -- CT: Symbols Can Be Deceiving -- 2.5.Base Conversion -- CT: Start from the End --Machine generated contents note: 1.Why Did the Chicken Cross the Road? -- 1.1.The Computer -- 1.2.Turing Machine -- CT: Abstract Away -- 1.3.A Brief History of Computers -- 1.4.Software -- 1.5.Programming -- 1.6.Syntax and Semantics -- CT: Beware of Semantics -- 1.7.Flowcharts -- CT: Ready for All Contingencies -- CT: First Things First -- CT: Check before Proceeding -- 1.8.Algorithms -- CT: Make It an Algorithm -- CT: Consider Extreme Cases -- 1.9.Pseudo Code -- CT: Step by Step -- 1.10.The Euclidean GCD Algorithm -- CT: Apply Domain Knowledge -- 1.11.Goals and How to Get There -- CT: Break It Down -- 1.12.Road Crossing -- Exercises -- 2.Bits, Bytes, and Words -- 2.1.Digital Computers -- 2.2.Binary Numbers -- CT: Meaning o -- 2.1.Digital Computers -- 2.2.Binary Numbers -- CT: Meaning of Symbols -- 2.2.1.Numbers in Other Bases -- CT: Evaluate Different Options -- 2.3.Positive and Negative Integers -- 2.4.Modular Arithmetic -- CT: Mind Resource Limitations -- CT: Symbols Can

Computer systems

Computer science

Computational learning theory

Class number

Book number

Wang, Paul S.

Country

Iran

Agency

University of Tehran. College of Science Library

Call Number

QA 76 .W25 2016

old catalog

BL

1

a

Y