|
|
|
|
DESCRIPTION
|
This highly structured text, in its second edition, provides comprehensive coverage of design techniques of algorithms. It traces the complete development of various algorithms in a stepwise approach followed by their pseudo-codes to build an understanding of their applications in practice. With clear explanations, the textbook intends to be much more comprehensive book on design and analysis of algorithm.
Commencing with the introduction, the book gives a detailed account of graphs and data structure. It then elaborately discusses the matrix algorithms, basic algorithms, network algorithms, sorting algorithm, backtracking algorithms and search algorithms. The text also focuses on the heuristics, dynamic programming and meta heuristics. The concepts of cryptography and probabilistic algorithms have been described in detail. Finally, the book brings out the underlying concepts of benchmarking of algorithms, algorithms to schedule processor(s) and complexity of algorithms.
New to the second Edition
New chapters on
• Matrix algorithms • Basic algorithms
• Backtracking algorithms • Complexity of algorithms
Several new sections including asymptotic notation, amortized analysis, recurrences, balanced trees, skip list, disjoint sets, maximal flow algorithm, parsort, radix sort, selection sort, topological sorting/ordering, median and ordered statistics, Huffman coding algorithm, transportation problem, heuristics for scheduling, etc., have been incorporated into the text.
Key features
• Offers in-depth treatment of basic and advanced topics.
• Includes numerous worked-out examples covering various real-world situations to help students grasp the concepts easily.
• Provides chapter-end exercises to enable students to enhance their mastery of the subject.
• Discusses recurrences and complexity of algorithms, which will help readers to develop complexity functions for different algorithms.
This text is designed for the students of B.Tech. and M.Tech. (Computer Science and Engineering, and Information technology), M.C.A. and M.Sc. (Computer Science and Information Technology). It would also be useful to the undergraduate students of electronics and electrical engineering, where a course in algorithm is prescribed, and the students of Ph.D. programmes involving algorithmic researches of different engineering disciplines.
|
|
CONTENTS
|
|
Preface
1. Introduction
2. Graphs
3. Data Structure
4. Matrix Algorithms
5. Basic Algorithms
6. Network Algorithms
7. Sorting Algorithm
8. Backtraking Algorithms
9. Search Algorithms
10. Heuristics
11. Dynamic Programming
12. Meta Heuristics
13. Cryptography
14. Probabilistic Algorithms
15. Benchmarking of Algorithms
16. Algorithms to Schedule Processor(s)
17. Complexity of Algorithms
Questions
Suggested Readings
Index
|
|
ABOUT THE AUTHOR(s)
|
R. PANNEERSELVAM, Ph.D., is Professor of operations and systems, and Head of Department of Management Studies, School of Management, Pondicherry University. He has been the Chairman of Computer Society of India (Pondicherry Chapter). He has more than 35 years of teaching and research experience, including his service at College of Engineering, Anna University, Chennai. He has authored eleven other well-established books, in specific System Simulation, Modelling and Languages,Database Management Systems (second edition), Operations Research (second edition), etc., all published by PHI Learning. He has published about 100 research articles in leading national and international journals. He carried out overseas consultancy for CEMS, Malaysia.
|
| |
|
|
2015 / 648 pp. / 17.8 × 23.5 cm / ISBN-978-81-203-5164-6 / Rs.575.00
|
| |
|
|
|
|
