MARC details
| 000 -LEADER |
|---|
| fixed length control field |
06549nam a22002177a 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20230117122727.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
230117b ||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780367472498 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.133 |
| Item number |
HAV |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Havill, Jessen |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Discovering computer science: |
| Remainder of title |
interdisciplinary problems, principles, and python programming |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
2nd |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Name of publisher, distributor, etc. |
CRC Press |
| Place of publication, distribution, etc. |
Boco Raton |
| Date of publication, distribution, etc. |
2021 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
516 p. |
| 365 ## - TRADE PRICE |
|---|
| Price type code |
GBP |
| Price amount |
68.99 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Table of Contents<br/>Preface <br/><br/>Acknowledgments <br/><br/>About the author <br/><br/>How to Solve It <br/><br/>UNDERSTAND THE PROBLEM <br/><br/>DESIGN AN ALGORITHM <br/><br/>WRITE A PROGRAM <br/><br/>LOOK BACK <br/><br/>SUMMARY AND FURTHER DISCOVERY <br/><br/>Visualizing Abstraction <br/><br/>DATA ABSTRACTION <br/><br/>DRAWING FLOWERS AND PLOTTING EARTHQUAKES <br/><br/>FUNCTIONAL ABSTRACTION <br/><br/>PROGRAMMING IN STYLE <br/><br/>A RETURN TO FUNCTIONS <br/><br/>SCOPE AND NAMESPACES<br/><br/>SUMMARY AND FURTHER DISCOVERY <br/><br/>Inside a Computer <br/><br/>COMPUTERS ARE DUMB <br/><br/>EVERYTHING IS BITS<br/><br/>COMPUTER ARITHMETIC <br/><br/>BINARY ARITHMETIC <br/><br/>THE UNIVERSAL MACHINE <br/><br/>Growth and Decay <br/><br/>ACCUMULATORS <br/><br/>DATA VISUALIZATION <br/><br/>CONDITIONAL ITERATION <br/><br/>CONTINUOUS MODELS <br/><br/>NUMERICAL ANALYSIS <br/><br/>SUMMING UP <br/><br/>FURTHER DISCOVERY <br/><br/>PROJECTS <br/><br/>Forks in the Road <br/>RANDOM WALKS <br/>PSEUDORANDOM NUMBER GENERATORS <br/><br/>SIMULATING PROBABILITY DISTRIBUTIONS <br/><br/>BACK TO BOOLEANS <br/><br/>DEFENSIVE PROGRAMMING <br/><br/>GUESS MY NUMBER <br/><br/>SUMMARY AND FURTHER DISCOVERY <br/><br/>PROJECTS <br/><br/> <br/><br/>Text, Documents, and DNA <br/>FIRST STEPS <br/><br/>TEXT DOCUMENTS<br/><br/>A CONCORDANCE<br/><br/>WORD FREQUENCY TRENDS<br/><br/>COMPARING TEXTS<br/><br/> TIME COMPLEXITY<br/><br/> COMPUTATIONAL GENOMICS <br/><br/>SUMMARY AND FURTHER DISCOVERY <br/><br/>PROJECTS <br/><br/>Data Analysis <br/>SUMMARY STATISTICS <br/><br/>WRANGLING DATA <br/><br/>TALLYING FREQUENCIES <br/><br/>READING TABULAR DATA <br/><br/>DESIGNING EFFICIENT ALGORITHMS <br/><br/>LINEAR REGRESSION <br/><br/>DATA CLUSTERING <br/><br/>SUMMARY AND FURTHER DISCOVERY <br/><br/>PROJECTS <br/><br/>Flatland <br/>TABULAR DATA <br/><br/>THE GAME OF LIFE <br/><br/>DIGITAL IMAGES <br/><br/>SUMMARY AND FURTHER DISCOVERY <br/><br/>PROJECTS <br/><br/>Self-similarity and Recursion <br/><br/>FRACTALS <br/><br/>RECURSION AND ITERATION <br/><br/> THE MYTHICAL TOWER OF HANOI <br/><br/>RECURSIVE LINEAR SEARCH <br/><br/>DIVIDE AND CONQUER <br/><br/>LINDENMAYER SYSTEMS <br/><br/>9SUMMARY AND FURTHER DISCOVERY <br/><br/>PROJECTS <br/><br/> <br/><br/>Organizing Data <br/>BINARY SEARCH <br/><br/>SELECTION SORT<br/><br/>INSERTION SORT<br/><br/>EFFICIENT SORTING<br/><br/>TRACTABLE AND INTRACTABLE ALGORITHMS<br/><br/>SUMMARY AND FURTHER DISCOVERY <br/><br/>PROJECTS <br/><br/>Networks <br/>MODELING WITH GRAPHS <br/><br/>SHORTEST PATHS <br/><br/>IT’S A SMALL WORLD <br/><br/>RANDOM GRAPHS <br/><br/>SUMMARY AND FURTHER DISCOVERY <br/><br/>PROJECTS <br/><br/>Object-oriented Design <br/>SIMULATING AN EPIDEMIC <br/>OPERATORS AND POLYMORPHISM |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
Discovering Computer Science: Interdisciplinary Problems, Principles, and Python Programming is a problem-oriented introduction to computational problem solving and programming in Python, appropriate for a first course for computer science majors, a more targeted disciplinary computing course or, at a slower pace, any introductory computer science course for a general audience.<br/><br/>Realizing that an organization around language features only resonates with a narrow audience, this textbook instead connects programming to students’ prior interests using a range of authentic problems from the natural and social sciences and the digital humanities. The presentation begins with an introduction to the problem-solving process, contextualizing programming as an essential component. Then, as the book progresses, each chapter guides students through solutions to increasingly complex problems, using a spiral approach to introduce Python language features.<br/><br/>The text also places programming in the context of fundamental computer science principles, such as abstraction, efficiency, testing, and algorithmic techniques, offering glimpses of topics that are traditionally put off until later courses.<br/><br/>This book contains 30 well-developed independent projects that encourage students to explore questions across disciplinary boundaries, over 750 homework exercises, and 300 integrated reflection questions engage students in problem solving and active reading. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer science |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Python (Computer program language) |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Dewey Decimal Classification |
| Koha item type |
Book |