Algorithms: design and analysis
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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New Delhi
Oxford University Press
2015
|
| Schriftenreihe: | Oxford higher education
|
| Schlagworte: | |
| Zusammenfassung: | 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 und++ |
| Beschreibung: | Literaturverzeichnis: Seiten [681]-684 |
| Beschreibung: | xxviii, 690 Seiten Illustrationen, Diagramme |
| ISBN: | 0199456666 9780199456666 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV043361439 | ||
| 003 | DE-604 | ||
| 005 | 20160714 | ||
| 007 | t | ||
| 008 | 160212s2015 a||| |||| 00||| eng d | ||
| 020 | |a 0199456666 |9 0-19-945666-6 | ||
| 020 | |a 9780199456666 |9 978-0-19-945666-6 | ||
| 035 | |a (OCoLC)933537313 | ||
| 035 | |a (DE-599)GBV837901669 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-91G |a DE-573 | ||
| 082 | 0 | |a 005.1 |2 23 | |
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a DAT 530f |2 stub | ||
| 100 | 1 | |a Bhasin, Harsh |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Algorithms |b design and analysis |c Harsh Bhasin (Assistant Professor, Department of Computer Science, Jamia Hamdard, New Delhi) |
| 264 | 1 | |a New Delhi |b Oxford University Press |c 2015 | |
| 300 | |a xxviii, 690 Seiten |b Illustrationen, Diagramme | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Oxford higher education | |
| 500 | |a Literaturverzeichnis: Seiten [681]-684 | ||
| 520 | 1 | |a 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 und++ | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-028780641 | ||
Datensatz im Suchindex
| _version_ | 1804175920413540352 |
|---|---|
| any_adam_object | |
| author | Bhasin, Harsh |
| author_facet | Bhasin, Harsh |
| author_role | aut |
| author_sort | Bhasin, Harsh |
| author_variant | h b hb |
| building | Verbundindex |
| bvnumber | BV043361439 |
| classification_rvk | ST 134 |
| classification_tum | DAT 530f |
| ctrlnum | (OCoLC)933537313 (DE-599)GBV837901669 |
| dewey-full | 005.1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.1 |
| dewey-search | 005.1 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03117nam a2200373 c 4500</leader><controlfield tag="001">BV043361439</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160714 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">160212s2015 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0199456666</subfield><subfield code="9">0-19-945666-6</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780199456666</subfield><subfield code="9">978-0-19-945666-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)933537313</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV837901669</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-573</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 530f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bhasin, Harsh</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms</subfield><subfield code="b">design and analysis</subfield><subfield code="c">Harsh Bhasin (Assistant Professor, Department of Computer Science, Jamia Hamdard, New Delhi)</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New Delhi</subfield><subfield code="b">Oxford University Press</subfield><subfield code="c">2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxviii, 690 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Oxford higher education</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturverzeichnis: Seiten [681]-684</subfield></datafield><datafield tag="520" ind1="1" ind2=" "><subfield code="a">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 und++</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028780641</subfield></datafield></record></collection> |
| id | DE-604.BV043361439 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T07:23:57Z |
| institution | BVB |
| isbn | 0199456666 9780199456666 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028780641 |
| oclc_num | 933537313 |
| open_access_boolean | |
| owner | DE-703 DE-91G DE-BY-TUM DE-573 |
| owner_facet | DE-703 DE-91G DE-BY-TUM DE-573 |
| physical | xxviii, 690 Seiten Illustrationen, Diagramme |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | Oxford University Press |
| record_format | marc |
| series2 | Oxford higher education |
| spelling | Bhasin, Harsh Verfasser aut Algorithms design and analysis Harsh Bhasin (Assistant Professor, Department of Computer Science, Jamia Hamdard, New Delhi) New Delhi Oxford University Press 2015 xxviii, 690 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Oxford higher education Literaturverzeichnis: Seiten [681]-684 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 und++ Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 |
| spellingShingle | Bhasin, Harsh Algorithms design and analysis Algorithmus (DE-588)4001183-5 gnd |
| subject_GND | (DE-588)4001183-5 |
| title | Algorithms design and analysis |
| title_auth | Algorithms design and analysis |
| title_exact_search | Algorithms design and analysis |
| title_full | Algorithms design and analysis Harsh Bhasin (Assistant Professor, Department of Computer Science, Jamia Hamdard, New Delhi) |
| title_fullStr | Algorithms design and analysis Harsh Bhasin (Assistant Professor, Department of Computer Science, Jamia Hamdard, New Delhi) |
| title_full_unstemmed | Algorithms design and analysis Harsh Bhasin (Assistant Professor, Department of Computer Science, Jamia Hamdard, New Delhi) |
| title_short | Algorithms |
| title_sort | algorithms design and analysis |
| title_sub | design and analysis |
| topic | Algorithmus (DE-588)4001183-5 gnd |
| topic_facet | Algorithmus |
| work_keys_str_mv | AT bhasinharsh algorithmsdesignandanalysis |