Home > General > Design & Analysis of Algorithm
6%
Design & Analysis of Algorithm

Design & Analysis of Algorithm

4.8       |  4 Reviews 
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

Table of Contents Fundamentals of Algorithm Introduction Notion of Algorithm    Necessary Mathematical Foundation Proof Techniques Algorithm Specifications Analysis Framework Asymptotic Notations Recurrence Equations   Mathematical Analysis of Non Recursive Algorithms  Mathematical Analysis of Recursive Algorithms  Fibonacci Numbers Probabilistic Analysis and Randomized Algorithm     Randomized Algorithm Amortized Analysis Brute Force Method Introduction Selection Sort     Bubble Sort  Sequential Search Brute Force String Matching Algorithm  Exhaustive Search  Divide and Conquer General Method  Binary Search     Merge Sort  Quick Sort  Exponentiation Strassen’s Matrix Multiplication        Finding Minimum and Maximum  Greedy Method Introduction The Greedy Method     Job Sequencing with Deadlines  Knapsack Problem  Minimum Cost Spanning Tree  Single Source Shortest Paths  Optimal Merge Pattern  Container Loading  Dynamic Programming Introduction The General Method Difference between Divide and Conquer and Dynamic Programming Difference between Greedy Algorithm and Dynamic Programming Steps of Dynamic Programming Principles of Optimality Elements of Dynamic Programming Applications of Dynamic Programming 0/1 Knapsack Problem   Optimal Binary Search Tree (OBST)  Traveling Salesperson Problem      Multistage Graph Reliability Design Matrix Chain Multiplication Longest Common Subsequence  Warshall Algorithm  Floyd's Algorithm Assembly Line Scheduling Backtracking General Method Basic Terminologies used in Backtracking  Algorithms for Backtracking Applications of Backtracking The 8-Queen's Problem  Sum of Subset    Hamiltonian Circuit Problem  Graph Coloring  Knapsack Problem Branch and Bound Introduction Assignment Problem Knapsack Problem Travelling Salesperson Problem Difference between Backtracking and Branch and Bound Selected Topics Algebraic Computation  The P and NP Class Problems Non Deterministic Algorithms Non Deterministic Algorithm for 0/1 Knapsack The Class of NP-Hard and NP-Complete Problems  NP Complete Problems  Satisfiability Problems Vertex Cover Problem  Cook's Theorem NP Hard Problems   NP Hard Graph Problems NP-Hard Scheduling Problem NP Hard Code Generation Problem Simplified NP Hard Problems Parallel Algorithms Introduction Computational Model Study of Different Graph Problems Implementation of Different Sorting Problems on Multiprocessor System Basic Techniques and Algorithms Complete Binary Tree  Pointer Doubling  Prefix Computation  List Ranking Selection Merging Sorting Graph Problems.


Best Sellers



Product Details
  • ISBN-13: 9789350386002
  • Publisher: Technical Publications
  • Language: English
  • ISBN-10: 9350386003
  • Publisher Date: 2013

Related Categories

Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

4.8       |  4 Reviews 
out of (%) reviewers recommend this product
Top Reviews
Rating Snapshot
Select a row below to filter reviews.
5
4
3
2
1
Average Customer Ratings
4.8       |  4 Reviews 
00 of 0 Reviews
Sort by :
Active Filters

00 of 0 Reviews
SEARCH RESULTS
1–2 of 2 Reviews
    BoxerLover2 - 5 Days ago
    A Thrilling But Totally Believable Murder Mystery

    Read this in one evening. I had planned to do other things with my day, but it was impossible to put down. Every time I tried, I was drawn back to it in less than 5 minutes. I sobbed my eyes out the entire last 100 pages. Highly recommend!

    BoxerLover2 - 5 Days ago
    A Thrilling But Totally Believable Murder Mystery

    Read this in one evening. I had planned to do other things with my day, but it was impossible to put down. Every time I tried, I was drawn back to it in less than 5 minutes. I sobbed my eyes out the entire last 100 pages. Highly recommend!


Sample text
Photo of
    Media Viewer

    Sample text
    Reviews
    Reader Type:
    BoxerLover2
    00 of 0 review

    Your review was submitted!
    Design & Analysis of Algorithm
    Technical Publications -
    Design & Analysis of Algorithm
    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.

    Design & Analysis of Algorithm

    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!