Design and Analysis of Algorithms image

Design and Analysis of Algorithms (Paperback)

by S Sridhar

TK. 1,710 Total: TK. 1,471

(You Saved TK. 239)
  • Look inside image 1
  • Look inside image 2
  • Look inside image 3
  • Look inside image 4
  • Look inside image 5
  • Look inside image 6
  • Look inside image 7
  • Look inside image 8
  • Look inside image 9
  • Look inside image 10
  • Look inside image 11
  • Look inside image 12
  • Look inside image 13
  • Look inside image 14
  • Look inside image 15
  • Look inside image 16
  • Look inside image 17
  • Look inside image 18
  • Look inside image 19
  • Look inside image 20
Design and Analysis of Algorithms

1st edition, 2014

Design and Analysis of Algorithms (Paperback)

TK. 1,710 TK. 1,471 You Save TK. 239 (14%)
in-stock icon In Stock (only 2 copies left)

* স্টক আউট হওয়ার আগেই অর্ডার করুন

Book Length

book-length-icon

788 Pages

Edition

editon-icon

1st edition

ISBN

isbn-icon

9780198093695

book-icon

বই হাতে পেয়ে মূল্য পরিশোধের সুযোগ

mponey-icon

৭ দিনের মধ্যে পরিবর্তনের সুযোগ

Customers Also Bought

Product Specification & Summary

DESIGN AND ANALYSIS OF ALGORITHMS
Design and Analysis of Algorithms is designed to serve as a textbook for the undergraduate students of computer science engineering and information technology as well as postgraduate students of computer applications. The book aims to empower students with in-depth knowledge of the fundamental concepts and the design, analysis, and implementation aspects of algorithms.
The book begins with the basics of algorithms and problem-solving concepts followed by an introduction to algorithm writing, and analysis of iterative and recursive algorithms. In-depth explanations and designing techniques of various types of algorithms used for problem-solving such as brute force technique, divide-and-conquer technique, decrease-and- conquer strategy, greedy approach, transform-and-conquer strategy, dynamic programming, branch-and-bound approach, and backtracking are provided in the book. It also covers discussion of string algorithms, iterative improvement, linear programming, computability theory, NP-hard problems, NP-completeness, randomized algorithms, approximation algorithms, and parallel algorithms.
The book includes a variety of chapter-end pedagogical features such as point-wise summary, glossary, review questions, exercises, and additional problems to help readers test their understanding and also apply and practise the concepts learnt. Appendices on basic mathematics and proof techniques are given to aid students refresh the fundamental concepts.
.
Key Features
■ In-depth treatment for topics such as greedy approach, dynamic programming, transform-and-conquer technique, decrease-and-conquer technique, linear programming, and randomized and approximation algorithms
■ Dedicated chapters on backtracking and branch-and-bound techniques, string matching algorithms, and parallel algorithms
■ Extensive discussion on the developing and designing aspects of algorithms using minimal mathematics and numerous examples
■ Judicious presentation of algorithms using step-wise approach throughout the text
Historical notes on various topics and chapter-end crossword puzzles provided to engage readers and enhance their interest in the subject
Title Design and Analysis of Algorithms
Author
Publisher
ISBN 9780198093695
Edition 1st edition, 2014
Number of Pages 788
Country India
Language English

Similar Category Best Selling Books

Sponsored Products Related To This Item

Reviews and Ratings

sort icon

Product Q/A

Have a question regarding the product? Ask Us

Show more Question(s)
prize book-reading point

Recently Sold Products

Recently Viewed
cash

Cash on delivery

Pay cash at your doorstep

service

Delivery

All over Bangladesh

return

Happy return

7 days return facility

0 Item(s)

Subtotal:

Customers Also Bought

Are you sure to remove this from book shelf?

Design and Analysis of Algorithms