Algorithms: design and analysis

by Bhasin, Harsh

Type Book

Rate 0.0 /5

Details

Files

Reviews

Download

Title Statements

Full title :Algorithms : design and analysis / Harsh Bhasin

Edition Statements

Publication Date:2015

Publication Statements

Publisher(s):Oxford University Press
Place of Publication:Oxford
Language:eng
Publication Date:2015

The Physical Object

Description:xxviii, 690 s : : illustrations ; : 25 cm

Edition Identifiers

ISBN:9780199456666, 0199456666
oclc:ocn935179807
LC Classification:QA76.9.A43
Dewey Decimal:005.1

CHAPTER 1 INTRODUCTION TO ALGORITHMS ; CHAPTER 2 GROWTH OF FUNCTIONS ; CHAPTER 3 RECURSION ; CHAPTER 4 ANALYSIS OF ALGORITHMS ; CHAPTER 5 BASIC DATA STRUCTURES CHAPTER 6 TREES ; CHAPTER 7 GRAPHS ; CHAPTER 8 SORTING IN LINEAR AND QUADRATIC TIME ; CHAPTER 9 DIVIDE AND CONQUER ; CHAPTER 10 GREEDY ALGORITHMS ; CHAPTER 11 DYNAMIC PROGRAMMING CHAPTER 12 BACKTRACKING CHAPTER 13 BRANCH AND BOUND ; CHAPTER 14 RANDOMIZED ALGORITHMS CHAPTER 15 TRANSFORM AND CONQUER CHAPTER 16 DECREASE AND CONQUER 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 INTRODUCTION TO MACHINE LEARNING APPROACHES ; CHAPTER 24 INTRODUCTION TO 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