Home > Computer & Internet > Computing: general > Design and Analysis of Algorithms
7%
Design and Analysis of Algorithms

Design and Analysis of Algorithms

          
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

This well organized text provides the design techniques of algorithms in a simple and straight forward manner. It describes the complete development of various algorithms along with their pseudo-codes in order to have an understanding of their applications.

The book begins with a description of the fundamental concepts and basic design techniques of algorithms. Gradually, it introduces more complex and advanced topics such as dynamic programming, backtracking and various algorithms related to graph data structure. Finally, the text elaborates on NP-hard, matrix operations and sorting network. Primarily designed as a text for undergraduate students of Computer Science and Engineering and Information Technology (B.Tech., Computer Science, B.Tech. IT) and postgraduate students of Computer Applications (MCA), the book would also be quite useful to postgraduate students of Computer Science and IT (M.Sc., Computer Science; M.Sc., IT).

New to this Second Edition

1. A new section on Characteristics of Algorithms (Section 1.3) has been added
2. Five new sections on Insertion Sort (Section 2.2), Bubble Sort (Section 2.3), Selection Sort (Section 2.4), Shell Sort/Diminishing Increment Sort/Comb Sort (Section 2.5) and Merge Sort (Section 2.6) have been included
3. A new chapter on Divide and Conquer (Chapter 5) has also been incorporatedAbout the AuthorPRABHAKAR GUPTA (Ph.D.) is Dean (Academics) at Shri Ram Murti Smarak College of Engineering & Technology, Bareilly (UP). He has ten years of teaching experience and four years of experience in research activities. Professor Gupta has attended many national conferences and published several research papers in national and international journals. His areas of interest include Data Structure, Analysis and Designing of Algorithms, Graph Theory and Discrete Structure.|VINEET AGARWAL (PhD) is Professor, Computer Science and Engineering, Rakshapal Bahadur College of Engineering and Technology, Bareilly. He has more than eleven years of teaching experience and four years of industrial experience. He has participated in many national and international level conferences.|MANISH VARSHNEY (PhD) is Associate Professor and Head of Computer Science & Engineering Department at Shri Siddhi Vinayak Institute of Technology, Bareilly. He has eleven years of teaching experience. He has taught at Shri Ram Murti College of Engineering and Technology for seven years. He has published and presented several papers in International/national journals/conferences. He has authored several books as well.


Best Sellers



Product Details
  • ISBN-13: 9788120346635
  • Publisher: PHI Learning
  • Binding: Paperback
  • Height: 233 mm
  • No of Pages: 424
  • Spine Width: 23 mm
  • Width: 179 mm
  • ISBN-10: 8120346637
  • Publisher Date: 15 Sep 2012
  • Edition: 2
  • Language: ENGLISH
  • Returnable: Y
  • Weight: 630 gr


Similar Products

Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Design and Analysis of Algorithms
PHI Learning -
Design and Analysis of 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.

Design and Analysis of 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!