عنوان

From computing to computational thinking

شابک

9781482217650

کد کشور

IR

شماره

27524

زبان متن نوشتاري يا گفتاري و مانند آن

انگلیسی

کشور محل نشر

IR

عنوان اصلي

From computing to computational thinking

نام عام مواد

[Book]

نام نخستين پديدآور

/ Paul S. Wang

محل نشرو پخش و غیره

Boca Raton, FL

نام ناشر، پخش کننده و غيره

: CRC Press/Taylor & Francis Group

تاریخ نشرو بخش و غیره

, 2016.

نام خاص و کميت اثر

xxii, 266 pages

ساير جزييات

: illustrations, maps

ابعاد

; 24 cm

متن يادداشت

Includes bibliographical references (page 253) and index

متن يادداشت

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

شماره رده

نشانه اثر

مستند نام اشخاص تاييد نشده

Wang, Paul S.

کشور

Iran

سازمان

University of Tehran. College of Science Library

شماره بازیابی

QA 76 .W25 2016

وضعیت فهرست نویسی

old catalog

نوع ماده

BL

پیشوند ISBD اعمال شده است

1

سطح دسترسي

a

تكميل شده

Y