Introduction to Computational Thinking -Bookswagon
Home > Science & Mathematics > Mathematics > Calculus & mathematical analysis > Numerical analysis > Introduction to Computational Thinking
Introduction to Computational Thinking

Introduction to Computational Thinking


     0     
5
4
3
2
1



International Edition


About the Book

1 Introduction 1Models of the world and formalising problems . . 4What is computational thinking? . . . . . . . . . 6Computational thinking in a broader context . . . 12What is to come . . . . . . . . . . . . . . . . . . 152 Introducing Python programming 19Obtaining Python . . . . . . . . . . . . . . . . . 20Running Python . . . . . . . . . . . . . . . . . . 22Expressions in Python . . . . . . . . . . . . . . . 22Logical (or boolean) expressions . . . . . . . . . . 26Variables . . . . . . . . . . . . . . . . . . . . . . 30Working with strings . . . . . . . . . . . . . . . . 32Lists . . . . . . . . . . . . . . . . . . . . . . . . 36Tuples . . . . . . . . . . . . . . . . . . . . . . . 41iiiSets and dictionaries . . . . . . . . . . . . . . . . 42Input and output . . . . . . . . . . . . . . . . . . 44Conditional statements (if statements) . . . . . . 47Loops (for and while) . . . . . . . . . . . . . . . 50Using modules . . . . . . . . . . . . . . . . . . . 543 Introduction to algorithms 57Designing algorithms . . . . . . . . . . . . . . . 62Exercises for sequential algorithms . . . . . . . . 81Exercises on lists . . . . . . . . . . . . . . . . . . 874 Algorithmic eciency 95The RAM model of a computer and its primitiveoperations . . . . . . . . . . . . . . . . . . 97Types of eciency . . . . . . . . . . . . . . . . . 107Asymptotic running time and big-Oh notation . . 116Empirically validating an algorithms running time 1355 Searching and sorting 141Searching . . . . . . . . . . . . . . . . . . . . . . 142Sorting . . . . . . . . . . . . . . . . . . . . . . . 147Generalising searching and sorting . . . . . . . . 182How computers represent numbers . . . . . . . . 1866 Functions 197Parameters and local and global variables . . . . . 203Side eects . . . . . . . . . . . . . . . . . . . . . 210Returning from a function . . . . . . . . . . . . . 215Higher order functions . . . . . . . . . . . . . . . 221Functions vs function instances . . . . . . . . . . 227Default parameters and keyword arguments . . . 230Generalising parameters . . . . . . . . . . . . . . 234Exceptions . . . . . . . . . . . . . . . . . . . . . 239Writing your own Python modules . . . . . . . . 2517 Inner functions 253A comparison function for a search algorithm . . 256Counter function . . . . . . . . . . . . . . . . . . 261Apply . . . . . . . . . . . . . . . . . . . . . . . . 265Currying functions . . . . . . . . . . . . . . . . . 269Function composition . . . . . . . . . . . . . . . 274Thunks and lazy evaluation . . . . . . . . . . . . 276Decorators . . . . . . . . . . . . . . . . . . . . . 281Eciency . . . . . . . . . . . . . . . . . . . . . . 2888 Recursion 291Denitions of recursion . . . . . . . . . . . . . . 291Recursive functions . . . . . . . . . . . . . . . . 293Recursion stacks . . . . . . . . . . . . . . . . . . 297Recursion and iteration . . . . . . . . . . . . . . 307Tail-calls . . . . . . . . . . . . . . . . . . . . . . 316Continuations . . . . . . . . . . . . . . . . . . . 324Continuations, thunks and trampolines . . . . . . 3359 Divide and conquer and dynamic programming 343Divide and conquer running times . . . . . . . . 355Dynamic programming . . . . . . . . . . . . . . 371Representing oating point numbers . . . . . . . 39210 Hidden Markov models 399Probabili
About the Author: Thomas Mailund, PhD is an associate professor in bioinformatics at Aarhus University, Denmark. He has a background in math and computer science, including experience programming and teaching in the C, Python and R programming languages. For the last decade, his main focus has been on genetics and evolutionary studies, particularly comparative genomics, speciation, and gene flow between emerging species.


Best Sellers



Product Details
  • ISBN-13: 9781484270769
  • Publisher: Apress
  • Publisher Imprint: Apress
  • Height: 254 mm
  • No of Pages: 657
  • Spine Width: 34 mm
  • Weight: 1196 gr
  • ISBN-10: 1484270762
  • Publisher Date: 12 Nov 2021
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: Problem Solving, Algorithms, Data Structures, and More
  • Width: 178 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Introduction to Computational Thinking
Apress -
Introduction to Computational Thinking
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Introduction to Computational Thinking

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!