Normal view MARC view ISBD view

Design methods and analysis of algorithms S K Basu

By: Basu, S. K.
Material type: materialTypeLabelBookPublisher: New Delhi : PHI Learning, 2015Edition: 2nd ed.Description: xxv, 369 p.: ill.; 22 cm.ISBN: 9788120347465.Subject(s): Allegories (Mathematics) | Categories (Mathematics) | AlgorithmsDDC classification: 518.1
Contents:
Computational Models Basics of Algorithm Divide and Conquer Greedy Method Dynamic Programming Further Divide and Conquer A Bit of Theory Approximation Algorithms Randomized Algorithms Graph Algorithms Backtracking, Branch and Bound Lower Bound Techniques Genetic Algorithms Parallel Algorithms Bioinformatics Algorithms
Summary: The design of correct and efficient algorithms for problem solving lies at the heart of computer science. This concise text, without being highly specialized, teaches the skills needed to master the essentials of this subject. With clear explanations and engaging writing style, the book places increased emphasis on algorithm design techniques rather than programming in order to develop in the reader the problem-solving skills. The treatment throughout the book is primarily tailored to the curriculum needs of B.Tech. students in computer science and engineering, B.Sc. (Hons.) and M.Sc. students in computer science, and MCA students. The book focuses on the standard algorithm design methods and the concepts are illustrated through representative examples to offer a reader-friendly text. Elementary analysis of time complexities is provided for each example-algorithm. A varied collection of exercises at the end of each chapter serves to reinforce the principles/methods involved.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode
General Books General Books CUTN Central Library

This is a searchable open catalogue of all library of the Central University of Tamil Nadu.

Sciences
Non-fiction 518.1 BAS (Browse shelf) Available 33876
General Books General Books CUTN Central Library

This is a searchable open catalogue of all library of the Central University of Tamil Nadu.

Sciences
Non-fiction 518.1 BAS (Browse shelf) Available 33877
General Books General Books CUTN Central Library

This is a searchable open catalogue of all library of the Central University of Tamil Nadu.

Sciences
Non-fiction 518.1 BAS (Browse shelf) Available 33878
General Books General Books CUTN Central Library

This is a searchable open catalogue of all library of the Central University of Tamil Nadu.

Sciences
Non-fiction 518.1 BAS (Browse shelf) Available 33879
Reference Books Reference Books CUTN Central Library

This is a searchable open catalogue of all library of the Central University of Tamil Nadu.

Sciences
Reference 518.1 BAS (Browse shelf) Not For Loan 33880

Computational Models
Basics of Algorithm
Divide and Conquer
Greedy Method

Dynamic Programming


Further Divide and Conquer



A Bit of Theory



Approximation Algorithms





Randomized Algorithms






Graph Algorithms







Backtracking, Branch and Bound







Lower Bound Techniques








Genetic Algorithms







Parallel Algorithms









Bioinformatics Algorithms









The design of correct and efficient algorithms for problem solving lies at the heart of computer science. This concise text, without being highly specialized, teaches the skills needed to master the essentials of this subject. With clear explanations and engaging writing style, the book places increased emphasis on algorithm design techniques rather than programming in order to develop in the reader the problem-solving skills.

The treatment throughout the book is primarily tailored to the curriculum needs of B.Tech. students in computer science and engineering, B.Sc. (Hons.) and M.Sc. students in computer science, and MCA students.

The book focuses on the standard algorithm design methods and the concepts are illustrated through representative examples to offer a reader-friendly text. Elementary analysis of time complexities is provided for each example-algorithm. A varied collection of exercises at the end of each chapter serves to reinforce the principles/methods involved.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha