Data structures and algorithms in Python:
This textbook offers a comprehensive, definitive introduction to data structures in Python by respected authors. It is the first mainstream object-oriented book available not only for the Python data structures course, but also provides a comprehensive introduction to data structures and algorithms,...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
John Wiley & Sons, Inc.
[2013]
|
| Schlagworte: | |
| Online-Zugang: | FHD01 |
| Zusammenfassung: | This textbook offers a comprehensive, definitive introduction to data structures in Python by respected authors. It is the first mainstream object-oriented book available not only for the Python data structures course, but also provides a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation |
| Beschreibung: | 1 Online-Ressource (xix, 748 Seiten) |
| ISBN: | 9781118476734 |
Internformat
MARC
| LEADER | 00000nmm a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV046326249 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200109s2013 |||| o||u| ||||||eng d | ||
| 020 | |a 9781118476734 |9 978-1-118-47673-4 | ||
| 035 | |a (OCoLC)880838944 | ||
| 035 | |a (DE-599)BVBBV046326249 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1050 | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 084 | |a ST 250 |0 (DE-625)143626: |2 rvk | ||
| 100 | 1 | |a Goodrich, Michael T. |d 1961- |e Verfasser |0 (DE-588)121131181 |4 aut | |
| 245 | 1 | 0 | |a Data structures and algorithms in Python |c Michael T. Goodrich, Department of Computer Science, University of California, Irvine, Roberto Tamassia, Department of Computer Science, Brown University, Michael H. Goldwasser, Department of Mathematics and Computer Science, Saint Louis University |
| 264 | 1 | |a New York, NY |b John Wiley & Sons, Inc. |c [2013] | |
| 300 | |a 1 Online-Ressource (xix, 748 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 505 | 8 | |a Cover; Title Page; Copyright Page; Preface; Contents; 1 Python Primer; 1.1 Python Overview; 1.1.1 The Python Interpreter; 1.1.2 Preview of a Python Program; 1.2 Objects in Python; 1.2.1 Identifiers, Objects, and the Assignment Statement; 1.2.2 Creating and Using Objects; 1.2.3 Python's Built-In Classes; 1.3 Expressions, Operators, and Precedence; 1.3.1 Compound Expressions and Operator Precedence; 1.4 Control Flow; 1.4.1 Conditionals; 1.4.2 Loops; 1.5 Functions; 1.5.1 Information Passing; 1.5.2 Python's Built-In Functions; 1.6 Simple Input and Output; 1.6.1 Console Input and Output | |
| 505 | 8 | |a 1.6.2 Files1.7 Exception Handling; 1.7.1 Raising an Exception; 1.7.2 Catching an Exception; 1.8 Iterators and Generators; 1.9 Additional Python Conveniences; 1.9.1 Conditional Expressions; 1.9.2 Comprehension Syntax; 1.9.3 Packing and Unpacking of Sequences; 1.10 Scopes and Namespaces; 1.11 Modules and the Import Statement; 1.11.1 Existing Modules; 1.12 Exercises; 2 Object-Oriented Programming; 2.1 Goals, Principles, and Patterns; 2.1.1 Object-Oriented Design Goals; 2.1.2 Object-Oriented Design Principles; 2.1.3 Design Patterns; 2.2 Software Development; 2.2.1 Design; 2.2.2 Pseudo-Code | |
| 505 | 8 | |a 2.2.3 Coding Style and Documentation2.2.4 Testing and Debugging; 2.3 Class Definitions; 2.3.1 Example: CreditCard Class; 2.3.2 Operator Overloading and Python's Special Methods; 2.3.3 Example: Multidimensional Vector Class; 2.3.4 Iterators; 2.3.5 Example: Range Class; 2.4 Inheritance; 2.4.1 Extending the CreditCard Class; 2.4.2 Hierarchy of Numeric Progressions; 2.4.3 Abstract Base Classes; 2.5 Namespaces and Object-Orientation; 2.5.1 Instance and Class Namespaces; 2.5.2 Name Resolution and Dynamic Dispatch; 2.6 Shallow and Deep Copying; 2.7 Exercises; 3 Algorithm Analysis | |
| 505 | 8 | |a 3.1 Experimental Studies3.1.1 Moving Beyond Experimental Analysis; 3.2 The Seven Functions Used in This Book; 3.2.1 Comparing Growth Rates; 3.3 Asymptotic Analysis; 3.3.1 The "Big-Oh" Notation; 3.3.2 Comparative Analysis; 3.3.3 Examples of Algorithm Analysis; 3.4 Simple Justification Techniques; 3.4.1 By Example; 3.4.2 The "Contra" Attack; 3.4.3 Induction and Loop Invariants; 3.5 Exercises; 4 Recursion; 4.1 Illustrative Examples; 4.1.1 The Factorial Function; 4.1.2 Drawing an English Ruler; 4.1.3 Binary Search; 4.1.4 File Systems; 4.2 Analyzing Recursive Algorithms; 4.3 Recursion Run Amok | |
| 505 | 8 | |a 4.3.1 Maximum Recursive Depth in Python4.4 Further Examples of Recursion; 4.4.1 Linear Recursion; 4.4.2 Binary Recursion; 4.4.3 Multiple Recursion; 4.5 Designing Recursive Algorithms; 4.6 Eliminating Tail Recursion; 4.7 Exercises; 5 Array-Based Sequences; 5.1 Python's Sequence Types; 5.2 Low-Level Arrays; 5.2.1 Referential Arrays; 5.2.2 Compact Arrays in Python; 5.3 Dynamic Arrays and Amortization; 5.3.1 Implementing a Dynamic Array; 5.3.2 Amortized Analysis of Dynamic Arrays; 5.3.3 Python's List Class; 5.4 Efficiency of Python's Sequence Types; 5.4.1 Python's List and Tuple Classes | |
| 520 | |a This textbook offers a comprehensive, definitive introduction to data structures in Python by respected authors. It is the first mainstream object-oriented book available not only for the Python data structures course, but also provides a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation | ||
| 650 | 4 | |a Python (Computer program language) | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 7 | |a Computer algorithms |2 fast | |
| 650 | 7 | |a Data structures (Computer science) |2 fast | |
| 650 | 7 | |a Python (Computer program language) |2 fast | |
| 700 | 1 | |a Tamassia, Roberto |d 1960- |e Verfasser |0 (DE-588)141557834 |4 aut | |
| 700 | 1 | |a Goldwasser, Michael H. |d 1969- |e Verfasser |0 (DE-588)133831086 |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-1-118-29027-9 |
| 912 | |a ZDB-30-PQE | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-031703196 | ||
| 966 | e | |u https://ebookcentral.proquest.com/lib/th-deggendorf/detail.action?docID=4946360 |l FHD01 |p ZDB-30-PQE |q FHD01_PQE_Kauf |x Aggregator |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804180813420429313 |
|---|---|
| any_adam_object | |
| author | Goodrich, Michael T. 1961- Tamassia, Roberto 1960- Goldwasser, Michael H. 1969- |
| author_GND | (DE-588)121131181 (DE-588)141557834 (DE-588)133831086 |
| author_facet | Goodrich, Michael T. 1961- Tamassia, Roberto 1960- Goldwasser, Michael H. 1969- |
| author_role | aut aut aut |
| author_sort | Goodrich, Michael T. 1961- |
| author_variant | m t g mt mtg r t rt m h g mh mhg |
| building | Verbundindex |
| bvnumber | BV046326249 |
| classification_rvk | ST 134 ST 250 |
| collection | ZDB-30-PQE |
| contents | Cover; Title Page; Copyright Page; Preface; Contents; 1 Python Primer; 1.1 Python Overview; 1.1.1 The Python Interpreter; 1.1.2 Preview of a Python Program; 1.2 Objects in Python; 1.2.1 Identifiers, Objects, and the Assignment Statement; 1.2.2 Creating and Using Objects; 1.2.3 Python's Built-In Classes; 1.3 Expressions, Operators, and Precedence; 1.3.1 Compound Expressions and Operator Precedence; 1.4 Control Flow; 1.4.1 Conditionals; 1.4.2 Loops; 1.5 Functions; 1.5.1 Information Passing; 1.5.2 Python's Built-In Functions; 1.6 Simple Input and Output; 1.6.1 Console Input and Output 1.6.2 Files1.7 Exception Handling; 1.7.1 Raising an Exception; 1.7.2 Catching an Exception; 1.8 Iterators and Generators; 1.9 Additional Python Conveniences; 1.9.1 Conditional Expressions; 1.9.2 Comprehension Syntax; 1.9.3 Packing and Unpacking of Sequences; 1.10 Scopes and Namespaces; 1.11 Modules and the Import Statement; 1.11.1 Existing Modules; 1.12 Exercises; 2 Object-Oriented Programming; 2.1 Goals, Principles, and Patterns; 2.1.1 Object-Oriented Design Goals; 2.1.2 Object-Oriented Design Principles; 2.1.3 Design Patterns; 2.2 Software Development; 2.2.1 Design; 2.2.2 Pseudo-Code 2.2.3 Coding Style and Documentation2.2.4 Testing and Debugging; 2.3 Class Definitions; 2.3.1 Example: CreditCard Class; 2.3.2 Operator Overloading and Python's Special Methods; 2.3.3 Example: Multidimensional Vector Class; 2.3.4 Iterators; 2.3.5 Example: Range Class; 2.4 Inheritance; 2.4.1 Extending the CreditCard Class; 2.4.2 Hierarchy of Numeric Progressions; 2.4.3 Abstract Base Classes; 2.5 Namespaces and Object-Orientation; 2.5.1 Instance and Class Namespaces; 2.5.2 Name Resolution and Dynamic Dispatch; 2.6 Shallow and Deep Copying; 2.7 Exercises; 3 Algorithm Analysis 3.1 Experimental Studies3.1.1 Moving Beyond Experimental Analysis; 3.2 The Seven Functions Used in This Book; 3.2.1 Comparing Growth Rates; 3.3 Asymptotic Analysis; 3.3.1 The "Big-Oh" Notation; 3.3.2 Comparative Analysis; 3.3.3 Examples of Algorithm Analysis; 3.4 Simple Justification Techniques; 3.4.1 By Example; 3.4.2 The "Contra" Attack; 3.4.3 Induction and Loop Invariants; 3.5 Exercises; 4 Recursion; 4.1 Illustrative Examples; 4.1.1 The Factorial Function; 4.1.2 Drawing an English Ruler; 4.1.3 Binary Search; 4.1.4 File Systems; 4.2 Analyzing Recursive Algorithms; 4.3 Recursion Run Amok 4.3.1 Maximum Recursive Depth in Python4.4 Further Examples of Recursion; 4.4.1 Linear Recursion; 4.4.2 Binary Recursion; 4.4.3 Multiple Recursion; 4.5 Designing Recursive Algorithms; 4.6 Eliminating Tail Recursion; 4.7 Exercises; 5 Array-Based Sequences; 5.1 Python's Sequence Types; 5.2 Low-Level Arrays; 5.2.1 Referential Arrays; 5.2.2 Compact Arrays in Python; 5.3 Dynamic Arrays and Amortization; 5.3.1 Implementing a Dynamic Array; 5.3.2 Amortized Analysis of Dynamic Arrays; 5.3.3 Python's List Class; 5.4 Efficiency of Python's Sequence Types; 5.4.1 Python's List and Tuple Classes |
| ctrlnum | (OCoLC)880838944 (DE-599)BVBBV046326249 |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05209nmm a2200481 c 4500</leader><controlfield tag="001">BV046326249</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200109s2013 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781118476734</subfield><subfield code="9">978-1-118-47673-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)880838944</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046326249</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-1050</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">ST 250</subfield><subfield code="0">(DE-625)143626:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goodrich, Michael T.</subfield><subfield code="d">1961-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121131181</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Data structures and algorithms in Python</subfield><subfield code="c">Michael T. Goodrich, Department of Computer Science, University of California, Irvine, Roberto Tamassia, Department of Computer Science, Brown University, Michael H. Goldwasser, Department of Mathematics and Computer Science, Saint Louis University</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">John Wiley & Sons, Inc.</subfield><subfield code="c">[2013]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xix, 748 Seiten)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Cover; Title Page; Copyright Page; Preface; Contents; 1 Python Primer; 1.1 Python Overview; 1.1.1 The Python Interpreter; 1.1.2 Preview of a Python Program; 1.2 Objects in Python; 1.2.1 Identifiers, Objects, and the Assignment Statement; 1.2.2 Creating and Using Objects; 1.2.3 Python's Built-In Classes; 1.3 Expressions, Operators, and Precedence; 1.3.1 Compound Expressions and Operator Precedence; 1.4 Control Flow; 1.4.1 Conditionals; 1.4.2 Loops; 1.5 Functions; 1.5.1 Information Passing; 1.5.2 Python's Built-In Functions; 1.6 Simple Input and Output; 1.6.1 Console Input and Output</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">1.6.2 Files1.7 Exception Handling; 1.7.1 Raising an Exception; 1.7.2 Catching an Exception; 1.8 Iterators and Generators; 1.9 Additional Python Conveniences; 1.9.1 Conditional Expressions; 1.9.2 Comprehension Syntax; 1.9.3 Packing and Unpacking of Sequences; 1.10 Scopes and Namespaces; 1.11 Modules and the Import Statement; 1.11.1 Existing Modules; 1.12 Exercises; 2 Object-Oriented Programming; 2.1 Goals, Principles, and Patterns; 2.1.1 Object-Oriented Design Goals; 2.1.2 Object-Oriented Design Principles; 2.1.3 Design Patterns; 2.2 Software Development; 2.2.1 Design; 2.2.2 Pseudo-Code</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">2.2.3 Coding Style and Documentation2.2.4 Testing and Debugging; 2.3 Class Definitions; 2.3.1 Example: CreditCard Class; 2.3.2 Operator Overloading and Python's Special Methods; 2.3.3 Example: Multidimensional Vector Class; 2.3.4 Iterators; 2.3.5 Example: Range Class; 2.4 Inheritance; 2.4.1 Extending the CreditCard Class; 2.4.2 Hierarchy of Numeric Progressions; 2.4.3 Abstract Base Classes; 2.5 Namespaces and Object-Orientation; 2.5.1 Instance and Class Namespaces; 2.5.2 Name Resolution and Dynamic Dispatch; 2.6 Shallow and Deep Copying; 2.7 Exercises; 3 Algorithm Analysis</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">3.1 Experimental Studies3.1.1 Moving Beyond Experimental Analysis; 3.2 The Seven Functions Used in This Book; 3.2.1 Comparing Growth Rates; 3.3 Asymptotic Analysis; 3.3.1 The "Big-Oh" Notation; 3.3.2 Comparative Analysis; 3.3.3 Examples of Algorithm Analysis; 3.4 Simple Justification Techniques; 3.4.1 By Example; 3.4.2 The "Contra" Attack; 3.4.3 Induction and Loop Invariants; 3.5 Exercises; 4 Recursion; 4.1 Illustrative Examples; 4.1.1 The Factorial Function; 4.1.2 Drawing an English Ruler; 4.1.3 Binary Search; 4.1.4 File Systems; 4.2 Analyzing Recursive Algorithms; 4.3 Recursion Run Amok</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">4.3.1 Maximum Recursive Depth in Python4.4 Further Examples of Recursion; 4.4.1 Linear Recursion; 4.4.2 Binary Recursion; 4.4.3 Multiple Recursion; 4.5 Designing Recursive Algorithms; 4.6 Eliminating Tail Recursion; 4.7 Exercises; 5 Array-Based Sequences; 5.1 Python's Sequence Types; 5.2 Low-Level Arrays; 5.2.1 Referential Arrays; 5.2.2 Compact Arrays in Python; 5.3 Dynamic Arrays and Amortization; 5.3.1 Implementing a Dynamic Array; 5.3.2 Amortized Analysis of Dynamic Arrays; 5.3.3 Python's List Class; 5.4 Efficiency of Python's Sequence Types; 5.4.1 Python's List and Tuple Classes</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This textbook offers a comprehensive, definitive introduction to data structures in Python by respected authors. It is the first mainstream object-oriented book available not only for the Python data structures course, but also provides a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Python (Computer program language)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data structures (Computer science)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Python (Computer program language)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tamassia, Roberto</subfield><subfield code="d">1960-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)141557834</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goldwasser, Michael H.</subfield><subfield code="d">1969-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)133831086</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-1-118-29027-9</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-PQE</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031703196</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://ebookcentral.proquest.com/lib/th-deggendorf/detail.action?docID=4946360</subfield><subfield code="l">FHD01</subfield><subfield code="p">ZDB-30-PQE</subfield><subfield code="q">FHD01_PQE_Kauf</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046326249 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T08:41:43Z |
| institution | BVB |
| isbn | 9781118476734 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031703196 |
| oclc_num | 880838944 |
| open_access_boolean | |
| owner | DE-1050 |
| owner_facet | DE-1050 |
| physical | 1 Online-Ressource (xix, 748 Seiten) |
| psigel | ZDB-30-PQE ZDB-30-PQE FHD01_PQE_Kauf |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | John Wiley & Sons, Inc. |
| record_format | marc |
| spelling | Goodrich, Michael T. 1961- Verfasser (DE-588)121131181 aut Data structures and algorithms in Python Michael T. Goodrich, Department of Computer Science, University of California, Irvine, Roberto Tamassia, Department of Computer Science, Brown University, Michael H. Goldwasser, Department of Mathematics and Computer Science, Saint Louis University New York, NY John Wiley & Sons, Inc. [2013] 1 Online-Ressource (xix, 748 Seiten) txt rdacontent c rdamedia cr rdacarrier Cover; Title Page; Copyright Page; Preface; Contents; 1 Python Primer; 1.1 Python Overview; 1.1.1 The Python Interpreter; 1.1.2 Preview of a Python Program; 1.2 Objects in Python; 1.2.1 Identifiers, Objects, and the Assignment Statement; 1.2.2 Creating and Using Objects; 1.2.3 Python's Built-In Classes; 1.3 Expressions, Operators, and Precedence; 1.3.1 Compound Expressions and Operator Precedence; 1.4 Control Flow; 1.4.1 Conditionals; 1.4.2 Loops; 1.5 Functions; 1.5.1 Information Passing; 1.5.2 Python's Built-In Functions; 1.6 Simple Input and Output; 1.6.1 Console Input and Output 1.6.2 Files1.7 Exception Handling; 1.7.1 Raising an Exception; 1.7.2 Catching an Exception; 1.8 Iterators and Generators; 1.9 Additional Python Conveniences; 1.9.1 Conditional Expressions; 1.9.2 Comprehension Syntax; 1.9.3 Packing and Unpacking of Sequences; 1.10 Scopes and Namespaces; 1.11 Modules and the Import Statement; 1.11.1 Existing Modules; 1.12 Exercises; 2 Object-Oriented Programming; 2.1 Goals, Principles, and Patterns; 2.1.1 Object-Oriented Design Goals; 2.1.2 Object-Oriented Design Principles; 2.1.3 Design Patterns; 2.2 Software Development; 2.2.1 Design; 2.2.2 Pseudo-Code 2.2.3 Coding Style and Documentation2.2.4 Testing and Debugging; 2.3 Class Definitions; 2.3.1 Example: CreditCard Class; 2.3.2 Operator Overloading and Python's Special Methods; 2.3.3 Example: Multidimensional Vector Class; 2.3.4 Iterators; 2.3.5 Example: Range Class; 2.4 Inheritance; 2.4.1 Extending the CreditCard Class; 2.4.2 Hierarchy of Numeric Progressions; 2.4.3 Abstract Base Classes; 2.5 Namespaces and Object-Orientation; 2.5.1 Instance and Class Namespaces; 2.5.2 Name Resolution and Dynamic Dispatch; 2.6 Shallow and Deep Copying; 2.7 Exercises; 3 Algorithm Analysis 3.1 Experimental Studies3.1.1 Moving Beyond Experimental Analysis; 3.2 The Seven Functions Used in This Book; 3.2.1 Comparing Growth Rates; 3.3 Asymptotic Analysis; 3.3.1 The "Big-Oh" Notation; 3.3.2 Comparative Analysis; 3.3.3 Examples of Algorithm Analysis; 3.4 Simple Justification Techniques; 3.4.1 By Example; 3.4.2 The "Contra" Attack; 3.4.3 Induction and Loop Invariants; 3.5 Exercises; 4 Recursion; 4.1 Illustrative Examples; 4.1.1 The Factorial Function; 4.1.2 Drawing an English Ruler; 4.1.3 Binary Search; 4.1.4 File Systems; 4.2 Analyzing Recursive Algorithms; 4.3 Recursion Run Amok 4.3.1 Maximum Recursive Depth in Python4.4 Further Examples of Recursion; 4.4.1 Linear Recursion; 4.4.2 Binary Recursion; 4.4.3 Multiple Recursion; 4.5 Designing Recursive Algorithms; 4.6 Eliminating Tail Recursion; 4.7 Exercises; 5 Array-Based Sequences; 5.1 Python's Sequence Types; 5.2 Low-Level Arrays; 5.2.1 Referential Arrays; 5.2.2 Compact Arrays in Python; 5.3 Dynamic Arrays and Amortization; 5.3.1 Implementing a Dynamic Array; 5.3.2 Amortized Analysis of Dynamic Arrays; 5.3.3 Python's List Class; 5.4 Efficiency of Python's Sequence Types; 5.4.1 Python's List and Tuple Classes This textbook offers a comprehensive, definitive introduction to data structures in Python by respected authors. It is the first mainstream object-oriented book available not only for the Python data structures course, but also provides a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation Python (Computer program language) Data structures (Computer science) Computer algorithms Computer algorithms fast Data structures (Computer science) fast Python (Computer program language) fast Tamassia, Roberto 1960- Verfasser (DE-588)141557834 aut Goldwasser, Michael H. 1969- Verfasser (DE-588)133831086 aut Erscheint auch als Druck-Ausgabe 978-1-118-29027-9 |
| spellingShingle | Goodrich, Michael T. 1961- Tamassia, Roberto 1960- Goldwasser, Michael H. 1969- Data structures and algorithms in Python Cover; Title Page; Copyright Page; Preface; Contents; 1 Python Primer; 1.1 Python Overview; 1.1.1 The Python Interpreter; 1.1.2 Preview of a Python Program; 1.2 Objects in Python; 1.2.1 Identifiers, Objects, and the Assignment Statement; 1.2.2 Creating and Using Objects; 1.2.3 Python's Built-In Classes; 1.3 Expressions, Operators, and Precedence; 1.3.1 Compound Expressions and Operator Precedence; 1.4 Control Flow; 1.4.1 Conditionals; 1.4.2 Loops; 1.5 Functions; 1.5.1 Information Passing; 1.5.2 Python's Built-In Functions; 1.6 Simple Input and Output; 1.6.1 Console Input and Output 1.6.2 Files1.7 Exception Handling; 1.7.1 Raising an Exception; 1.7.2 Catching an Exception; 1.8 Iterators and Generators; 1.9 Additional Python Conveniences; 1.9.1 Conditional Expressions; 1.9.2 Comprehension Syntax; 1.9.3 Packing and Unpacking of Sequences; 1.10 Scopes and Namespaces; 1.11 Modules and the Import Statement; 1.11.1 Existing Modules; 1.12 Exercises; 2 Object-Oriented Programming; 2.1 Goals, Principles, and Patterns; 2.1.1 Object-Oriented Design Goals; 2.1.2 Object-Oriented Design Principles; 2.1.3 Design Patterns; 2.2 Software Development; 2.2.1 Design; 2.2.2 Pseudo-Code 2.2.3 Coding Style and Documentation2.2.4 Testing and Debugging; 2.3 Class Definitions; 2.3.1 Example: CreditCard Class; 2.3.2 Operator Overloading and Python's Special Methods; 2.3.3 Example: Multidimensional Vector Class; 2.3.4 Iterators; 2.3.5 Example: Range Class; 2.4 Inheritance; 2.4.1 Extending the CreditCard Class; 2.4.2 Hierarchy of Numeric Progressions; 2.4.3 Abstract Base Classes; 2.5 Namespaces and Object-Orientation; 2.5.1 Instance and Class Namespaces; 2.5.2 Name Resolution and Dynamic Dispatch; 2.6 Shallow and Deep Copying; 2.7 Exercises; 3 Algorithm Analysis 3.1 Experimental Studies3.1.1 Moving Beyond Experimental Analysis; 3.2 The Seven Functions Used in This Book; 3.2.1 Comparing Growth Rates; 3.3 Asymptotic Analysis; 3.3.1 The "Big-Oh" Notation; 3.3.2 Comparative Analysis; 3.3.3 Examples of Algorithm Analysis; 3.4 Simple Justification Techniques; 3.4.1 By Example; 3.4.2 The "Contra" Attack; 3.4.3 Induction and Loop Invariants; 3.5 Exercises; 4 Recursion; 4.1 Illustrative Examples; 4.1.1 The Factorial Function; 4.1.2 Drawing an English Ruler; 4.1.3 Binary Search; 4.1.4 File Systems; 4.2 Analyzing Recursive Algorithms; 4.3 Recursion Run Amok 4.3.1 Maximum Recursive Depth in Python4.4 Further Examples of Recursion; 4.4.1 Linear Recursion; 4.4.2 Binary Recursion; 4.4.3 Multiple Recursion; 4.5 Designing Recursive Algorithms; 4.6 Eliminating Tail Recursion; 4.7 Exercises; 5 Array-Based Sequences; 5.1 Python's Sequence Types; 5.2 Low-Level Arrays; 5.2.1 Referential Arrays; 5.2.2 Compact Arrays in Python; 5.3 Dynamic Arrays and Amortization; 5.3.1 Implementing a Dynamic Array; 5.3.2 Amortized Analysis of Dynamic Arrays; 5.3.3 Python's List Class; 5.4 Efficiency of Python's Sequence Types; 5.4.1 Python's List and Tuple Classes Python (Computer program language) Data structures (Computer science) Computer algorithms Computer algorithms fast Data structures (Computer science) fast Python (Computer program language) fast |
| title | Data structures and algorithms in Python |
| title_auth | Data structures and algorithms in Python |
| title_exact_search | Data structures and algorithms in Python |
| title_full | Data structures and algorithms in Python Michael T. Goodrich, Department of Computer Science, University of California, Irvine, Roberto Tamassia, Department of Computer Science, Brown University, Michael H. Goldwasser, Department of Mathematics and Computer Science, Saint Louis University |
| title_fullStr | Data structures and algorithms in Python Michael T. Goodrich, Department of Computer Science, University of California, Irvine, Roberto Tamassia, Department of Computer Science, Brown University, Michael H. Goldwasser, Department of Mathematics and Computer Science, Saint Louis University |
| title_full_unstemmed | Data structures and algorithms in Python Michael T. Goodrich, Department of Computer Science, University of California, Irvine, Roberto Tamassia, Department of Computer Science, Brown University, Michael H. Goldwasser, Department of Mathematics and Computer Science, Saint Louis University |
| title_short | Data structures and algorithms in Python |
| title_sort | data structures and algorithms in python |
| topic | Python (Computer program language) Data structures (Computer science) Computer algorithms Computer algorithms fast Data structures (Computer science) fast Python (Computer program language) fast |
| topic_facet | Python (Computer program language) Data structures (Computer science) Computer algorithms |
| work_keys_str_mv | AT goodrichmichaelt datastructuresandalgorithmsinpython AT tamassiaroberto datastructuresandalgorithmsinpython AT goldwassermichaelh datastructuresandalgorithmsinpython |