OXFORD UNIVERSITY PRESS

ユーザーログイン

Algorithms: Design and Analysis
Algorithms: Design and Analysis

Algorithms: Design and Analysis

著者: 
Harsh Bhasin
0
(0)
(税込)

Algorithms: Design and Analysis of is a textbook designed for the undergraduate and postgraduate students of computer science engineering, information technology, and computer applications. It helps the students to understand the fundamentals and applications of algorithms. The book has been divided into four sections: Algorithm Basics, Data Structures, Design Techniques and Advanced Topics. The first section explains the importance of algorithms, growth of functions, recursion and analysis of algorithms. The second section covers the data structures basics, trees, graphs, sorting in linear and quadratic time. Section three discusses the various design techniques namely, divide and conquer, greedy approach, dynamic approach, backtracking, branch and bound and randomized algorithms used for solving problems in separate chapters. The fourth section includes the advanced topics such as transform and conquer, decrease and conquer, number thoeretics, string matching, computational geometry, complexity classes, approximation algorithms, and parallel algorithms. Finally, the applications of algorithms in Machine Learning and Computational Biology areas are dealt with in the subsequent chapters. This section will be useful for those interested in advanced courses in algorithms. The book also has 10 appendixes which include topics like probability, matrix operations, Red-black tress, linear programming, DFT, scheduling, a reprise of sorting, searching and amortized analysis and problems based on writing algorithms. The concepts and algorithms in the book are explained with the help of examples which are solved using one or more methods for better understanding. The book includes variety of chapter-end pedagogical features such as point-wise summary, glossary, multiple choice questions with answers, review questions, application-based exercises to help readers test their understanding of the learnt concepts.

目次: 

CHAPTER 1 INTRODUCTION TO ALGORITHMS
CHAPTER 2 GROWTH OF FUNCTIONS
CHAPTER 3 RECURSION
CHAPTER 4 ANALYSIS OF ALGORITHMS
4.6.1 V IVA PROBLEM
4.6.2 MARRIAGE PROBLEM
CHAPTER 5 BASIC DATA STRUCTURES
5.3.1 LINEAR SEARCH
5.4.1 ADVANTAGES OF A LINKED LIST
5.5.1 STATIC IMPLEMENTATION OF STACK
5.6.1 STATIC IMPLEMENTATION
CHAPTER 6 TREES
CHAPTER 7 GRAPHS
CHAPTER 8 SORTING IN LINEAR AND QUADRATIC TIME
CHAPTER 9 DIVIDE AND CONQUER
CHAPTER 10 GREEDY ALGORITHMS
11.2.1 IMPLEMENTING THE DYNAMIC APPROACH
11.7 THE OPTIMAL BINARY SEARCH TREE PROBLEM
CHAPTER 13 BRANCH AND BOUND
13.7.1 OPTIMIZATION
14.6.1 THE BOOK PROBLEM
CHAPTER 17 NUMBER THEORETIC ALGORITHMS
CHAPTER 18 STRING MATCHING
CHAPTER 19 COMPLEXITY CLASSES
CHAPTER 20 AN INTRODUCTION TO PSPACE
CHAPTER 21 APPROXIMATION ALGORITHMS
CHAPTER 22 PARALLEL ALGORITHMS
CHAPTER 23 AN INTRODUCTION TO MACHINE LEARNING APPROACHES
CHAPTER 24 COMPUTATIONAL BIOLOGY AND BIOINFORMATICS
APPENDIX A1 AMORTIZED ANALYSIS REVISITED
APPENDIX A2 2-3-4 AND REDBLACK TREES
APPENDIX A3 MATRIX OPERATIONS
APPENDIX A4 LINEAR PROGRAMMING
APPENDIX A5 COMPLEX NUMBERS AND INTRODUCTION TO DFT
APPENDIX A6 PROBABILITY
APPENDIX A7 SCHEDULING
APPENDIX A8 SEARCHING REPRISE
APPENDIX A9 ANALYSIS OF SORTING ALGORITHMS
APPENDIX A10 PROBLEMS

著者について: 

Harsh Bhasin is currently an Assistant Professor in the Department of Computer Science, FMIT, Jamia Hamdard, New Delhi. Prior to this, he has taught as visiting faculty in many colleges including Delhi Technological University. He was also the proprietor S.S. Developers, a firm based in Faridabad, Haryana. Prof. Bhasin has been involved in the development of a number of Enterprise Resource Planning Systems. He has published around 60 research papers in various national and international journals of repute and is the author of Programming in C# published by OUP, India. He has also reviewed papers, journals and books for renowned publishers. Prof. Bhasin is a B. Tech and M. Tech in Computer Science. He has been actively involved in research and had also received the Young Researchers Award by ErNet in 2012. His areas of interest include Genetic Algorithms, Cellular Automata, Big Data, Theory of Computation, C# and Algorithms.

商品情報

著者: 
Harsh Bhasin
刊行日
2015年11月
カスタマーレビュー
0
(0)

同じカテゴリーの商品

カスタマーレビュー

まだレビューはありません

このページに掲載の「参考価格」は日本国内における希望小売価格です。当ウェブサイトでのご購入に対して特別価格が適用される場合、販売価格は「割引価格」として表示されます。なお、価格は予告なく変更されることがございますので、あらかじめご了承ください。

Algorithms: Design and Analysis

Algorithms: Design and Analysis

Algorithms: Design and Analysis