Introduction to Computing and Algorithms
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Introduction to Computing and Algorithms
Introduction to Computing and Algorithms

Introduction to Computing and Algorithms

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

This book prepares students for the world of computing by giving them a solid foundation in the "science" of computer science - algorithms. By taking an algorithm-based approach to the subject, this new book helps readers grasp overall concepts, rather than getting them bogged down with specific syntax details of a programming language that can become obsolete quickly. By working with algorithms from the start and applying the concepts to the real world, students will understand the power of computers as problem solving tools and learn to think like programmers.

Table of Contents:
I. THE COMPUTING PERSPECTIVE. Technology, Science and Culture. What is Technology. Technology and Human Evolution. Paradigmatic Change. The Age of Tribal Consciousness. Abstract Media Technology. The Age of Absolute Abstraction. Mechanical Media Technology. The Age of Mechanistic Thinking. Electronic Media Technology. Hallmarks of a Paradigm Shift. Essential Features of the Emerging Paradigm. The Central Theme of the New Paradigm. The Algorithmic Model. Introduction. Flow Charts. Properties of Algorithms. Algorithms. Components. Seeing Things from the Computing Perspective. Summary. II. THE ALGORITHM TOOLKIT. Basic Data, Operations, and Decisions. Atomic Data. Operators. Data Types and Declarations. Conditions and Decisions. Summary. Tools for “Procedural Abstraction.” Why modularity? Two Kinds of Modules. The Scope of Data. Parameters. The Importance of Procedural Abstraction. Documenting Modules. Recursive Control. Using a stack to Trace Recursion. Summary. Tools for “Data Abstraction.” Records. The Difference Between Types and Variables. Anonymous Data Types. Dynamic Data Structures. Linked Lists. The Scope of Linked Data. Binary Trees. Graphs. Iterative Control. Iteration vs. Recursion. Arrays. The Abstraction Power of Constants. The “Data Abstraction” Power of Creating New Data Types. Summary. Graphical Data Notation. Algorithmic Methods. Searches and Traversals. Divide and Conquer. Optimization Algorithms. Summary. Tools for Estimating Cost and Complexity. Measures of Performance. Analysis of work done. Performance and Data Structures. Reasonable vs. Unreasonable Algorithms. Summary. Tools for Verifying Correctness. Bugs and Debugging. Ambiguity. Language errors. Logic errors. Proving correctness. Verification. Summary. Tools for “Behavioral Abstraction.” The “Object-Oriented” Paradigm. The Benefits of the OO Approach. Achieving Superior Encapsulation. Achieving Superior Reusability. Achieving Superior Adaptability. Achieving Polymorphism. Everything is an Object. Summary. III. THE LIMITS OF COMPUTING. Concurrency and Parallelism. Overview: Concurrency vs. Parallelism. Concurrency. Issues in Concurrency. Parallelism. Summary. Hierarchies of Complexity. The Complexity of Problems. Tractable vs. Intractable Problems. “NP-Complete” Problems. Oracles and Determinism. NP-Complete vs. Intractable Problems. Undecidability. Summary. 0201314517T04062001


Best Sellers


Product Details
  • ISBN-13: 9780201314519
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Pearson
  • Height: 229 mm
  • No of Pages: 440
  • Spine Width: 24 mm
  • Width: 188 mm
  • ISBN-10: 0201314517
  • Publisher Date: 02 Jan 1998
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Weight: 710 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Introduction to Computing and Algorithms
Pearson Education (US) -
Introduction to Computing and Algorithms
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 Computing and Algorithms

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!