Computational thinking for the modern problem solver / (Record no. 635873)

MARC details
000 -LEADER
fixed length control field 07359nam a22004457i 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20250919130305.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 190117t20142014flua b 001 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781466587779
Qualifying information hardback
Terms of availability RM336.37
039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE]
Level of rules in bibliographic description 201906261112
Level of effort used to assign nonsubject heading access points hayat
Level of effort used to assign subject headings 201904041103
Level of effort used to assign classification baiti
Level of effort used to assign subject headings 201904021215
Level of effort used to assign classification binar
y 01-17-2019
z binar
040 ## - CATALOGING SOURCE
Original cataloging agency AU@
Language of cataloging eng
Transcribing agency AU@
Description conventions rda
Modifying agency OCLCO
-- OCLCF
-- OCLCO
-- YDXCP
-- BTCTA
-- UKMGB
-- NHA
-- DLC
-- UKM
090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN)
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) QA76.R557
090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN)
Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) QA76
Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) .R557
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Riley, David D.,
Dates associated with a name 1951-,
Relator term author.
245 10 - TITLE STATEMENT
Title Computational thinking for the modern problem solver /
Statement of responsibility, etc. David D. Riley and Kenny A. Hunt.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Boca Raton, FL
Name of producer, publisher, distributor, manufacturer CRC Press,
Date of production, publication, distribution, manufacture, or copyright notice [2014].
264 #4 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture ©2014.
300 ## - PHYSICAL DESCRIPTION
Extent xv, 389 pages :
Other physical details illustrations ;
Dimensions 25 cm.
336 ## - CONTENT TYPE
Content type term text
Source rdacontent
337 ## - MEDIA TYPE
Media type term unmediated
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term volume
Source rdacarrier
490 1# - SERIES STATEMENT
Series statement Chapman & Hall/CRC textbooks in computing
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes bibliographical references and index.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Machine generated contents note: 1.1.Computers, Computers Everywhere -- 1.2.Computer, Computer Science, And Computational Thinking -- 1.3.From Abacus To Machine -- 1.4.The First Software -- 1.5.What Makes It A Modern Computer? -- 1.6.The First Modern Computer -- 1.7.Moore's Law -- 1.8.Summary -- 1.9.When Will You Ever Use This Stuff? -- References -- Terminology -- Exercises -- 2.1.Information And Data -- 2.2.Converting Information Into Data -- 2.3.Data Capacity -- 2.4.Data Types And Data Encoding -- 2.4.1.Numbers -- 2.4.1.1.Numeral Systems -- 2.4.1.2.Positional Numeral System -- 2.4.1.3.Integers As Binary Bit Strings -- 2.4.1.4.Real Numbers As Binary Bit Strings -- 2.4.1.5.Precision As A Source Of Error -- 2.4.1.6.Underflow And Overflow As Sources Of Error -- 2.4.2.Text -- 2.4.3.Colors -- 2.4.4.Pictures -- 2.4.5.Sound -- 2.5.Data Compression -- 2.5.1.Run-Length Encoding -- 2.6.Summary -- Reference -- Terminology -- Exercises -- 3.1.What Is Logic? -- 3.2.Boolean Logic --
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Contents note continued: 3.2.1.Writing Well-Formed Propositions -- 3.2.2.Evaluating Propositions -- 3.2.2.1.Conjunction (And) -- 3.2.2.2.Disjunction (Or) -- 3.2.2.3.Implication (Implies) -- 3.2.2.4.Equivalence (E) -- 3.2.2.5.Logical Negation (Not) -- 3.2.2.6.Compound Propositions -- 3.2.2.7.Logical Equivalence -- 3.2.2.8.Tautologies And Contradictions -- 3.3.Applications Of Propositional Logic -- 3.3.1.Search Queries -- 3.3.1.1.Conjunction In Search Queries -- 3.3.1.2.Disjunction In Search Queries -- 3.3.1.3.Negation In Search Queries -- 3.3.2.Digital Logic -- 3.3.3.Image Compositing -- 3.3.4.Database Queries -- 3.3.5.Software Requirements -- Terminology -- Exercises -- 4.1.Problem Definition -- 4.2.Logical Reasoning -- 4.3.Decomposition: Software Design -- 4.4.Decomposition: Other Uses -- 4.5.Abstraction: Class Diagrams -- 4.6.Abstraction: Use Case Diagrams -- 4.7.Summary -- 4.8.When Will You Ever Use This Stuff? -- References -- Terminology -- Exercises -- 5.1.Algorithms --
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Contents note continued: 5.2.Software And Programming Languages -- 5.3.Actions -- 5.3.1.Name Binding -- 5.3.1.1.Proper Naming -- 5.3.1.2.State -- 5.3.2.Selection -- 5.3.2.1.One-Way Selection -- 5.3.2.2.Two-Way Selection -- 5.3.2.3.Multiway Selection -- 5.3.3.Repetition -- 5.3.3.1.Infinite Loops -- 5.3.4.Modularization -- 5.3.4.1.Module Flexibility -- Terminology -- Exercises -- 6.1.Activity Diagrams -- 6.2.Selection In Activity Diagrams -- 6.3.Repetition In Activity Diagrams -- 6.4.Control Abstraction In Activity Diagrams -- 6.5.States And State Diagrams -- 6.6.Including Behavior In State Diagrams -- 6.7.Providing More Detail In State Diagrams -- 6.8.Summary -- 6.9.When Will I Ever Use This Stuff? -- Terminology -- Exercises -- 7.1.Names -- 7.2.Lists -- 7.2.1.Arrays -- 7.2.1.1.Storage -- 7.2.1.2.Accessing Array Elements -- 7.2.1.3.Deleting Array Elements -- 7.2.1.4.Inserting Array Elements -- 7.2.1.5.Array Summary -- 7.2.2.Linking -- 7.2.2.1.Storage --
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Contents note continued: 7.2.2.2.Accessing Linked List Elements -- 7.2.2.3.Deleting Linked List Elements -- 7.2.2.4.Inserting Linked List Elements -- 7.2.2.5.Linked List Summary -- 7.3.Graphs -- 7.3.1.Terminology And Properties -- 7.3.2.Storage -- 7.4.Hierarchies -- 7.4.1.Organizational Chart -- 7.4.2.Family Tree -- 7.4.3.Biology -- 7.4.4.Linguistics -- 7.4.5.Trees -- References -- Terminology -- Exercises -- 8.1.Von Neumann Architecture -- 8.2.Spreadsheets -- 8.2.1.Spreadsheet Structure -- 8.2.2.Formulas/expressions -- 8.2.2.1.Numbers -- 8.2.2.2.Operators -- 8.2.2.3.Cell References -- 8.2.2.4.Functions -- 8.3.Text Processing -- 8.3.1.String Basics -- 8.3.2.String Operations -- 8.3.2.1.Indexing -- 8.3.2.2.Length -- 8.3.2.3.Concatenation -- 8.3.2.4.Naming -- 8.3.2.5.Substring -- 8.3.2.6.Searching -- 8.3.2.7.Case Study: Processing E-Mail Addresses -- 8.3.2.8.Case Study: Processing Dates -- 8.4.Patterns -- 8.4.1.How To Write A Pattern --
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Contents note continued: 8.4.1.1.Case Study: Hugs And Kisses Pattern -- 8.4.1.2.Case Study: MPAA Rating Pattern -- 8.4.1.3.Case Study: Social Security Numbers -- 8.4.2.Repetition Rules -- 8.4.3.Character Class Rules -- 8.4.4.Case Study: DNA Sequencing -- 8.4.5.Case Study: Web Searches And Enron Legal Documents -- Reference -- Terminology -- Exercises -- 9.1.'Computer Errors' Usually Aren't -- 9.2.Software Correctness -- 9.3.Verification -- 9.4.Software Testing -- 9.5.White Box Testing -- 9.6.Black Box Testing With Equivalence Partitioning -- 9.7.Boundary Value Analysis -- 9.8.When Will You Ever Use This Stuff? -- Reference -- Terminology -- Exercises -- 10.1.How Is Capacity Measured In Computers? -- 10.2.An Estimate Of The Physical Limitations -- 10.3.Benchmarks -- 10.4.Counting The Performance -- 10.5.Impractical Algorithms -- 10.6.Impossible Algorithms -- 10.7.Metaphysical Limitations -- 10.8.When Will You Ever Use This Stuff? -- References -- Terminology -- Exercises --
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Contents note continued: 11.1.Parallelism Or Concurrency? -- 11.2.Scheduling -- 11.3.Sorting Networks -- 11.4.Measuring Concurrency's Effect -- 11.5.Challenges Of Concurrency -- 11.6.When Will You Ever Use This Stuff? -- References -- Terminology -- Exercises -- 12.1.What Is Security? -- 12.2.Foundations -- 12.3.Common Forms Of Cybercrime -- 12.4.How To Secure? Step 1: Authenticate -- 12.5.How To Secure? Step 2: Authorization -- 12.6.All A Matter Of Risk -- 12.7.A Few Good Ideas -- 12.7.1.Encryption -- 12.7.2.Firewalls (Including Spam Filters) -- 12.7.3.Antivirus Software -- 12.7.4.Software Update -- 12.7.5.Backups -- 12.7.6.Log Files -- 12.8.Good Strategies -- 12.8.1.Secure The Weakest Link -- 12.8.2.Reduce The Attack Surface -- 12.8.3.Defend Deeply -- 12.8.4.Compartmentalize -- 12.8.5.Trust Reluctantly -- 12.8.6.Use Open Software -- 12.9.When Will You Ever Use This Stuff? -- Reference -- Terminology -- Exercises.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer science.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Hunt, Kenny A.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Chapman & Hall/CRC textbooks in computing
907 ## - LOCAL DATA ELEMENT G, LDG (RLIN)
a .b1667781x
b 2019-11-12
c 2019-11-12
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type AM
Suppress in OPAC No
Call number prefix QA76.R557
914 ## - VTLS Number
VTLS Number vtls003643137
990 ## - EQUIVALENCES OR CROSS-REFERENCES [LOCAL, CANADA]
Link information for 9XX fields bety
991 ## - LOCAL NOTE (NAMA FAKULTI/INSTITUT/PUSAT)
a Fakulti Pendidikan
998 ## - LOCAL CONTROL INFORMATION (RLIN)
Library PERPUSTAKAAN TUN SERI LANANG
Operator's initials, OID (RLIN) 2019-04-01
Cataloger's initials, CIN (RLIN) m
Material Type (Sierra) Printed Books
Language English
Country
-- 0
-- .b1667781x
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Inventory number Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
        PERPUSTAKAAN TUN SERI LANANG PERPUSTAKAAN TUN SERI LANANG KOLEKSI AM-P. TUN SERI LANANG (ARAS 5) 12/11/2019 - 319.55 .i21174763   QA76.R557 00002222180 19/09/2025 1 19/09/2025 AM

Contact Us

Perpustakaan Tun Seri Lanang, Universiti Kebangsaan Malaysia
43600 Bangi, Selangor Darul Ehsan,Malaysia
+603-89213446 – Consultation Services
019-2045652 – Telegram/Whatsapp
Email: helpdeskptsl@ukm.edu.my

Copyright ©The National University of Malaysia Library