Design methods and analysis of algorithms
Basu, S. K
Design methods and analysis of algorithms S K Basu - 2nd ed. - New Delhi : PHI Learning, 2015. - xxv, 369 p.: ill.; 22 cm.
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.
9788120347465
Allegories (Mathematics)
Categories (Mathematics)
Algorithms
518.1 / BAS
Design methods and analysis of algorithms S K Basu - 2nd ed. - New Delhi : PHI Learning, 2015. - xxv, 369 p.: ill.; 22 cm.
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.
9788120347465
Allegories (Mathematics)
Categories (Mathematics)
Algorithms
518.1 / BAS