Design And Analysis of Algorithms
Price: 1035.00 INR
We sell our titles through other companies
Disclaimer :You will be redirected to a third party website.The sole responsibility of supplies, condition of the product, availability of stock, date of delivery, mode of payment will be as promised by the said third party only. Prices and specifications may vary from the OUP India site.
ISBN:
9789354977886
Publication date:
30/11/2023
Paperback
Price: 1035.00 INR
We sell our titles through other companies
Disclaimer :You will be redirected to a third party website.The sole responsibility of supplies, condition of the product, availability of stock, date of delivery, mode of payment will be as promised by the said third party only. Prices and specifications may vary from the OUP India site.
ISBN:
9789354977886
Publication date:
30/11/2023
Paperback
Second Edition
S. Sridhar
-
In-depth treatment for topics such as divide and conquer, greedy approach, dynamic programming, transform-and-conquer technique, decrease-and-conquer technique, linear programming, and randomized and approximation algorithms
-
Extensive discussion on computational skills, algorithm writing and analysis of iterative and recursive algorithms
-
Extensive discussion on the developing and designing aspects of algorithms using minimal mathematics
-
Numerous examples to assist understanding of the concepts
-
Judicious presentation of algorithms using a 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
New to the Second Edition
-
Laboratory manual involving Python
-
Selected implementation of algorithms in Python
-
Addition of topics like computational skills, Recurrence equations, B-Trees and other data structures
-
Complete rewriting of selected chapters to give more clarity
-
Additional problems to promote experiential learning
Rights: World Rights
Second Edition
S. Sridhar
Description
The second edition of Design and Analysis of Algorithms is an essential textbook for undergraduate and postgraduate students of computer science and information technology. This book is useful for students of other engineering branches who opt for algorithms courses, diploma students and postgraduate students of computer applications. The book is also useful for competitive examinations like GATE and coding interviews. It is specially designed to equip students with comprehensive knowledge of fundamental concepts related to algorithm design, analysis and implementation aspects of algorithms.
The book begins with exploring algorithm basics and problem-solving concepts and then introduces topics like algorithm writing, analysis of iterative and recursive algorithms. It provides detailed explanations and design techniques, including brute force, divide-and-conquer, decrease-and-conquer, greedy approach, transform-and-conquer, dynamic programming, branch-and-bound, backtracking and Iterative development. Moreover, the book delves into string algorithms, data structures, linear programming, computability theory, NP-hard problems, NP-completeness, randomized algorithms, approximation algorithms, parallel algorithms offering a well-rounded comprehensive coverage essential topics.
The book includes various chapter-end pedagogical features such as point-wise summary, glossary, review questions, exercises, crosswords, additional problems help readers test understanding, apply, practice concepts learnt. Appendices basic mathematics, proof techniques given aid students revising fundamental concepts.
About the author
S. Sridhar is Professor at the Department of Information Science and Technology, College of Engineering, Guindy Campus, Anna University, Chennai.
Second Edition
S. Sridhar
Table of contents
1 Introduction to Algorithms
2 Basics of Algorithm Writing
3 Basics of Algorithm Analysis
4 Mathematical Analysis of Recursive Algorithms
5 Data Structures—I
Data Structures—II
7 Brute Force Approaches
8 Divide-and-conquer Approach
9 Decrease-and-conquer Approach
10 Time–Space Tradeoffs
11 Greedy Algorithms
12 Transform-and-conquer Approach
13 Dynamic Programming
14 Backtracking
15 Branch-and-bound Technique
16 String Algorithms
17 Iterative Improvement and Linear Programming
18 Basics of Computational Complexity
19 Randomized Algorithms
20 Approximation Algorithms
21 Parallel Algorithms
Second Edition
S. Sridhar
Description
The second edition of Design and Analysis of Algorithms is an essential textbook for undergraduate and postgraduate students of computer science and information technology. This book is useful for students of other engineering branches who opt for algorithms courses, diploma students and postgraduate students of computer applications. The book is also useful for competitive examinations like GATE and coding interviews. It is specially designed to equip students with comprehensive knowledge of fundamental concepts related to algorithm design, analysis and implementation aspects of algorithms.
The book begins with exploring algorithm basics and problem-solving concepts and then introduces topics like algorithm writing, analysis of iterative and recursive algorithms. It provides detailed explanations and design techniques, including brute force, divide-and-conquer, decrease-and-conquer, greedy approach, transform-and-conquer, dynamic programming, branch-and-bound, backtracking and Iterative development. Moreover, the book delves into string algorithms, data structures, linear programming, computability theory, NP-hard problems, NP-completeness, randomized algorithms, approximation algorithms, parallel algorithms offering a well-rounded comprehensive coverage essential topics.
The book includes various chapter-end pedagogical features such as point-wise summary, glossary, review questions, exercises, crosswords, additional problems help readers test understanding, apply, practice concepts learnt. Appendices basic mathematics, proof techniques given aid students revising fundamental concepts.
About the author
S. Sridhar is Professor at the Department of Information Science and Technology, College of Engineering, Guindy Campus, Anna University, Chennai.
Table of contents
1 Introduction to Algorithms
2 Basics of Algorithm Writing
3 Basics of Algorithm Analysis
4 Mathematical Analysis of Recursive Algorithms
5 Data Structures—I
Data Structures—II
7 Brute Force Approaches
8 Divide-and-conquer Approach
9 Decrease-and-conquer Approach
10 Time–Space Tradeoffs
11 Greedy Algorithms
12 Transform-and-conquer Approach
13 Dynamic Programming
14 Backtracking
15 Branch-and-bound Technique
16 String Algorithms
17 Iterative Improvement and Linear Programming
18 Basics of Computational Complexity
19 Randomized Algorithms
20 Approximation Algorithms
21 Parallel Algorithms
Data Structures and Algorithms
Reema Thareja
Reema Thareja
Object Oriented Programming with C++ (Second Edition)
Reema Thareja
Fundamentals of Information System
Reema Thareja
N. P. Padhy, S. P. Simon, M. Senthil Kumar
Sini Raj Pulari , Umadevi Maramreddy & Shriram K. Vasudevan
Personality Development and Soft Skills
Barun.K.Mitra
R Rajagopalan
Reema Thareja
Computer Fundamentals and Programming in C
Reema Thareja
