Hands-on structures and algorithms with python :: write complex and powerful code using the latest features of python 3. 7 /
Data structures help us to organize and align the data in a very efficient way. This book will surely help you to learn important and essential data structures through Python implementation for better understanding of the concepts.
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Birmingham :
Packt Publishing Ltd,
2018.
|
| Ausgabe: | 2nd ed. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Data structures help us to organize and align the data in a very efficient way. This book will surely help you to learn important and essential data structures through Python implementation for better understanding of the concepts. |
| Beschreibung: | Binary search tree implementation |
| Beschreibung: | 1 online resource (389 pages) |
| ISBN: | 9781788991933 1788991931 |
Internformat
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-on1086115998 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr |n|---||||| | ||
| 008 | 190216t20182018enk o 000 0 eng d | ||
| 040 | |a EBLCP |b eng |e rda |e pn |c EBLCP |d MERUC |d CHVBK |d OCLCQ |d YDX |d N$T |d OCLCQ |d YDX |d OCLCO |d OCLCF |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d TMA |d OCLCQ | ||
| 066 | |c Grek | ||
| 019 | |a 1063763436 |a 1146280380 | ||
| 020 | |a 9781788991933 |q (electronic book) | ||
| 020 | |a 1788991931 |q (electronic book) | ||
| 035 | |a (OCoLC)1086115998 |z (OCoLC)1063763436 |z (OCoLC)1146280380 | ||
| 050 | 4 | |a QA76.73.P98 |b A33 2018 | |
| 082 | 7 | |a 005.133 |2 23 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Agarwal, Basant, |e author. | |
| 245 | 1 | 0 | |a Hands-on structures and algorithms with python : |b write complex and powerful code using the latest features of python 3. 7 / |c Basant Agarwal and Benjamin Baka. |
| 250 | |a 2nd ed. | ||
| 264 | 1 | |a Birmingham : |b Packt Publishing Ltd, |c 2018. | |
| 264 | 4 | |c ©2018 | |
| 300 | |a 1 online resource (389 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |6 880-01 |a Cover; Title Page; Copyright and Credits; Dedication; Packt Upsell; Contributors; Acknowledgments; Table of Contents; Preface; Chapter 1: Python Objects, Types, and Expressions; Technical requirements; Installing Python; Understanding data structures and algorithms; Python for data; The Python environment; Variables and expressions; Variable scope; Flow control and iteration; Overview of data types and objects; Strings; Lists; Functions as first class objects; Higher order functions; Recursive functions; Generators and co-routines; Classes and object programming; Special methods; Inheritance | |
| 505 | 8 | |a Data encapsulation and propertiesSummary; Further reading; Chapter 2: Python Data Types and Structures; Technical requirements; Built-in data types; None type; Numeric types; Representation error; Membership, identity, and logical operations; Sequences; Learning about tuples; Beginning with dictionaries; Python; Sorting dictionaries; Dictionaries for text analysis; Sets; Immutable sets; Modules for data structures and algorithms; Collections; Deques; ChainMap objects; Counter objects; Ordered dictionaries; defaultdict; Learning about named tuples; Arrays; Summary | |
| 505 | 8 | |a Singly linked listsSingly linked list class; The append operation; A faster append operation; Getting the size of the list; Improving list traversal; Deleting nodes; List search; Clearing a list; Doubly linked lists; A doubly linked list node; Doubly linked list class; Append operation; The delete operation; List search; Circular lists; Appending elements; Deleting an element in a circular list; Iterating through a circular list; Summary; Chapter 5: Stacks and Queues; Technical requirements; Stacks; Stack implementation; Push operation; Pop operation; Peek operation | |
| 505 | 8 | |a Bracket-matching applicationQueues; List-based queues; The enqueue operation; The dequeue operation; Stack-based queues; Enqueue operation; Dequeue operation; Node-based queues; Queue class; The enqueue operation; The dequeue operation; Application of queues; Media player queues; Summary; Chapter 6: Trees; Technical requirements; Terminology; Tree nodes; Tree traversal; Depth-first traversal; In-order traversal and infix notation; Pre-order traversal and prefix notation; Post-order traversal and postfix notation; Breadth-first traversal; Binary trees; Binary search trees | |
| 500 | |a Binary search tree implementation | ||
| 520 | |a Data structures help us to organize and align the data in a very efficient way. This book will surely help you to learn important and essential data structures through Python implementation for better understanding of the concepts. | ||
| 650 | 0 | |a Python (Computer program language) |0 http://id.loc.gov/authorities/subjects/sh96008834 | |
| 650 | 6 | |a Python (Langage de programmation) | |
| 650 | 7 | |a Python (Computer program language) |2 fast | |
| 700 | 1 | |a Baka, Benjamin, |e author. | |
| 776 | 0 | 8 | |i Print version: |a Agarwal, Basant. |t Hands-On Data Structures and Algorithms with Python : Write Complex and Powerful Code Using the Latest Features of Python 3. 7, 2nd Edition. |d Birmingham : Packt Publishing Ltd, ©2018 |z 9781788995573 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1925364 |3 Volltext |
| 880 | 8 | |6 505-01/Grek |a Chapter 3: Principles of Algorithm DesignTechnical requirements; An introduction to algorithms; Algorithm design paradigms; Recursion and backtracking; Backtracking; Divide and conquer -- long multiplication; The recursive approach; Runtime analysis; Asymptotic analysis; Big O notation; Composing complexity classes; Omega notation (Ω); Theta notation (ϴ); Amortized analysis; Summary; Chapter 4: Lists and Pointer Structures; Technical requirements; Beginning with an example; Arrays; Pointer structures; Nodes; Finding endpoints; Node class; Other node types; Introducing lists | |
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL5675578 | ||
| 938 | |a YBP Library Services |b YANK |n 15825629 | ||
| 938 | |a EBSCOhost |b EBSC |n 1925364 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-on1086115998 |
|---|---|
| _version_ | 1816882485110243328 |
| adam_text | |
| any_adam_object | |
| author | Agarwal, Basant Baka, Benjamin |
| author_facet | Agarwal, Basant Baka, Benjamin |
| author_role | aut aut |
| author_sort | Agarwal, Basant |
| author_variant | b a ba b b bb |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.73.P98 A33 2018 |
| callnumber-search | QA76.73.P98 A33 2018 |
| callnumber-sort | QA 276.73 P98 A33 42018 |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Cover; Title Page; Copyright and Credits; Dedication; Packt Upsell; Contributors; Acknowledgments; Table of Contents; Preface; Chapter 1: Python Objects, Types, and Expressions; Technical requirements; Installing Python; Understanding data structures and algorithms; Python for data; The Python environment; Variables and expressions; Variable scope; Flow control and iteration; Overview of data types and objects; Strings; Lists; Functions as first class objects; Higher order functions; Recursive functions; Generators and co-routines; Classes and object programming; Special methods; Inheritance Data encapsulation and propertiesSummary; Further reading; Chapter 2: Python Data Types and Structures; Technical requirements; Built-in data types; None type; Numeric types; Representation error; Membership, identity, and logical operations; Sequences; Learning about tuples; Beginning with dictionaries; Python; Sorting dictionaries; Dictionaries for text analysis; Sets; Immutable sets; Modules for data structures and algorithms; Collections; Deques; ChainMap objects; Counter objects; Ordered dictionaries; defaultdict; Learning about named tuples; Arrays; Summary Singly linked listsSingly linked list class; The append operation; A faster append operation; Getting the size of the list; Improving list traversal; Deleting nodes; List search; Clearing a list; Doubly linked lists; A doubly linked list node; Doubly linked list class; Append operation; The delete operation; List search; Circular lists; Appending elements; Deleting an element in a circular list; Iterating through a circular list; Summary; Chapter 5: Stacks and Queues; Technical requirements; Stacks; Stack implementation; Push operation; Pop operation; Peek operation Bracket-matching applicationQueues; List-based queues; The enqueue operation; The dequeue operation; Stack-based queues; Enqueue operation; Dequeue operation; Node-based queues; Queue class; The enqueue operation; The dequeue operation; Application of queues; Media player queues; Summary; Chapter 6: Trees; Technical requirements; Terminology; Tree nodes; Tree traversal; Depth-first traversal; In-order traversal and infix notation; Pre-order traversal and prefix notation; Post-order traversal and postfix notation; Breadth-first traversal; Binary trees; Binary search trees |
| ctrlnum | (OCoLC)1086115998 |
| dewey-full | 005.133 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.133 |
| dewey-search | 005.133 |
| dewey-sort | 15.133 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| edition | 2nd ed. |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05273cam a2200529 i 4500</leader><controlfield tag="001">ZDB-4-EBA-on1086115998</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |n|---|||||</controlfield><controlfield tag="008">190216t20182018enk o 000 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">EBLCP</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">EBLCP</subfield><subfield code="d">MERUC</subfield><subfield code="d">CHVBK</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">YDX</subfield><subfield code="d">N$T</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">YDX</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">TMA</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="066" ind1=" " ind2=" "><subfield code="c">Grek</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">1063763436</subfield><subfield code="a">1146280380</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781788991933</subfield><subfield code="q">(electronic book)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1788991931</subfield><subfield code="q">(electronic book)</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1086115998</subfield><subfield code="z">(OCoLC)1063763436</subfield><subfield code="z">(OCoLC)1146280380</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.73.P98</subfield><subfield code="b">A33 2018</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">005.133</subfield><subfield code="2">23</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Agarwal, Basant,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Hands-on structures and algorithms with python :</subfield><subfield code="b">write complex and powerful code using the latest features of python 3. 7 /</subfield><subfield code="c">Basant Agarwal and Benjamin Baka.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">2nd ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Birmingham :</subfield><subfield code="b">Packt Publishing Ltd,</subfield><subfield code="c">2018.</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2018</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (389 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="6">880-01</subfield><subfield code="a">Cover; Title Page; Copyright and Credits; Dedication; Packt Upsell; Contributors; Acknowledgments; Table of Contents; Preface; Chapter 1: Python Objects, Types, and Expressions; Technical requirements; Installing Python; Understanding data structures and algorithms; Python for data; The Python environment; Variables and expressions; Variable scope; Flow control and iteration; Overview of data types and objects; Strings; Lists; Functions as first class objects; Higher order functions; Recursive functions; Generators and co-routines; Classes and object programming; Special methods; Inheritance</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Data encapsulation and propertiesSummary; Further reading; Chapter 2: Python Data Types and Structures; Technical requirements; Built-in data types; None type; Numeric types; Representation error; Membership, identity, and logical operations; Sequences; Learning about tuples; Beginning with dictionaries; Python; Sorting dictionaries; Dictionaries for text analysis; Sets; Immutable sets; Modules for data structures and algorithms; Collections; Deques; ChainMap objects; Counter objects; Ordered dictionaries; defaultdict; Learning about named tuples; Arrays; Summary</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Singly linked listsSingly linked list class; The append operation; A faster append operation; Getting the size of the list; Improving list traversal; Deleting nodes; List search; Clearing a list; Doubly linked lists; A doubly linked list node; Doubly linked list class; Append operation; The delete operation; List search; Circular lists; Appending elements; Deleting an element in a circular list; Iterating through a circular list; Summary; Chapter 5: Stacks and Queues; Technical requirements; Stacks; Stack implementation; Push operation; Pop operation; Peek operation</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Bracket-matching applicationQueues; List-based queues; The enqueue operation; The dequeue operation; Stack-based queues; Enqueue operation; Dequeue operation; Node-based queues; Queue class; The enqueue operation; The dequeue operation; Application of queues; Media player queues; Summary; Chapter 6: Trees; Technical requirements; Terminology; Tree nodes; Tree traversal; Depth-first traversal; In-order traversal and infix notation; Pre-order traversal and prefix notation; Post-order traversal and postfix notation; Breadth-first traversal; Binary trees; Binary search trees</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Binary search tree implementation</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Data structures help us to organize and align the data in a very efficient way. This book will surely help you to learn important and essential data structures through Python implementation for better understanding of the concepts.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Python (Computer program language)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh96008834</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Python (Langage de programmation)</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">Baka, Benjamin,</subfield><subfield code="e">author.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Agarwal, Basant.</subfield><subfield code="t">Hands-On Data Structures and Algorithms with Python : Write Complex and Powerful Code Using the Latest Features of Python 3. 7, 2nd Edition.</subfield><subfield code="d">Birmingham : Packt Publishing Ltd, ©2018</subfield><subfield code="z">9781788995573</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1925364</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="880" ind1="8" ind2=" "><subfield code="6">505-01/Grek</subfield><subfield code="a">Chapter 3: Principles of Algorithm DesignTechnical requirements; An introduction to algorithms; Algorithm design paradigms; Recursion and backtracking; Backtracking; Divide and conquer -- long multiplication; The recursive approach; Runtime analysis; Asymptotic analysis; Big O notation; Composing complexity classes; Omega notation (Ω); Theta notation (ϴ); Amortized analysis; Summary; Chapter 4: Lists and Pointer Structures; Technical requirements; Beginning with an example; Arrays; Pointer structures; Nodes; Finding endpoints; Node class; Other node types; Introducing lists</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL5675578</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">15825629</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">1925364</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-on1086115998 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-27T13:29:21Z |
| institution | BVB |
| isbn | 9781788991933 1788991931 |
| language | English |
| oclc_num | 1086115998 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (389 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 2018 |
| publishDateSearch | 2018 |
| publishDateSort | 2018 |
| publisher | Packt Publishing Ltd, |
| record_format | marc |
| spelling | Agarwal, Basant, author. Hands-on structures and algorithms with python : write complex and powerful code using the latest features of python 3. 7 / Basant Agarwal and Benjamin Baka. 2nd ed. Birmingham : Packt Publishing Ltd, 2018. ©2018 1 online resource (389 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier Print version record. 880-01 Cover; Title Page; Copyright and Credits; Dedication; Packt Upsell; Contributors; Acknowledgments; Table of Contents; Preface; Chapter 1: Python Objects, Types, and Expressions; Technical requirements; Installing Python; Understanding data structures and algorithms; Python for data; The Python environment; Variables and expressions; Variable scope; Flow control and iteration; Overview of data types and objects; Strings; Lists; Functions as first class objects; Higher order functions; Recursive functions; Generators and co-routines; Classes and object programming; Special methods; Inheritance Data encapsulation and propertiesSummary; Further reading; Chapter 2: Python Data Types and Structures; Technical requirements; Built-in data types; None type; Numeric types; Representation error; Membership, identity, and logical operations; Sequences; Learning about tuples; Beginning with dictionaries; Python; Sorting dictionaries; Dictionaries for text analysis; Sets; Immutable sets; Modules for data structures and algorithms; Collections; Deques; ChainMap objects; Counter objects; Ordered dictionaries; defaultdict; Learning about named tuples; Arrays; Summary Singly linked listsSingly linked list class; The append operation; A faster append operation; Getting the size of the list; Improving list traversal; Deleting nodes; List search; Clearing a list; Doubly linked lists; A doubly linked list node; Doubly linked list class; Append operation; The delete operation; List search; Circular lists; Appending elements; Deleting an element in a circular list; Iterating through a circular list; Summary; Chapter 5: Stacks and Queues; Technical requirements; Stacks; Stack implementation; Push operation; Pop operation; Peek operation Bracket-matching applicationQueues; List-based queues; The enqueue operation; The dequeue operation; Stack-based queues; Enqueue operation; Dequeue operation; Node-based queues; Queue class; The enqueue operation; The dequeue operation; Application of queues; Media player queues; Summary; Chapter 6: Trees; Technical requirements; Terminology; Tree nodes; Tree traversal; Depth-first traversal; In-order traversal and infix notation; Pre-order traversal and prefix notation; Post-order traversal and postfix notation; Breadth-first traversal; Binary trees; Binary search trees Binary search tree implementation Data structures help us to organize and align the data in a very efficient way. This book will surely help you to learn important and essential data structures through Python implementation for better understanding of the concepts. Python (Computer program language) http://id.loc.gov/authorities/subjects/sh96008834 Python (Langage de programmation) Python (Computer program language) fast Baka, Benjamin, author. Print version: Agarwal, Basant. Hands-On Data Structures and Algorithms with Python : Write Complex and Powerful Code Using the Latest Features of Python 3. 7, 2nd Edition. Birmingham : Packt Publishing Ltd, ©2018 9781788995573 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1925364 Volltext 505-01/Grek Chapter 3: Principles of Algorithm DesignTechnical requirements; An introduction to algorithms; Algorithm design paradigms; Recursion and backtracking; Backtracking; Divide and conquer -- long multiplication; The recursive approach; Runtime analysis; Asymptotic analysis; Big O notation; Composing complexity classes; Omega notation (Ω); Theta notation (ϴ); Amortized analysis; Summary; Chapter 4: Lists and Pointer Structures; Technical requirements; Beginning with an example; Arrays; Pointer structures; Nodes; Finding endpoints; Node class; Other node types; Introducing lists |
| spellingShingle | Agarwal, Basant Baka, Benjamin Hands-on structures and algorithms with python : write complex and powerful code using the latest features of python 3. 7 / Cover; Title Page; Copyright and Credits; Dedication; Packt Upsell; Contributors; Acknowledgments; Table of Contents; Preface; Chapter 1: Python Objects, Types, and Expressions; Technical requirements; Installing Python; Understanding data structures and algorithms; Python for data; The Python environment; Variables and expressions; Variable scope; Flow control and iteration; Overview of data types and objects; Strings; Lists; Functions as first class objects; Higher order functions; Recursive functions; Generators and co-routines; Classes and object programming; Special methods; Inheritance Data encapsulation and propertiesSummary; Further reading; Chapter 2: Python Data Types and Structures; Technical requirements; Built-in data types; None type; Numeric types; Representation error; Membership, identity, and logical operations; Sequences; Learning about tuples; Beginning with dictionaries; Python; Sorting dictionaries; Dictionaries for text analysis; Sets; Immutable sets; Modules for data structures and algorithms; Collections; Deques; ChainMap objects; Counter objects; Ordered dictionaries; defaultdict; Learning about named tuples; Arrays; Summary Singly linked listsSingly linked list class; The append operation; A faster append operation; Getting the size of the list; Improving list traversal; Deleting nodes; List search; Clearing a list; Doubly linked lists; A doubly linked list node; Doubly linked list class; Append operation; The delete operation; List search; Circular lists; Appending elements; Deleting an element in a circular list; Iterating through a circular list; Summary; Chapter 5: Stacks and Queues; Technical requirements; Stacks; Stack implementation; Push operation; Pop operation; Peek operation Bracket-matching applicationQueues; List-based queues; The enqueue operation; The dequeue operation; Stack-based queues; Enqueue operation; Dequeue operation; Node-based queues; Queue class; The enqueue operation; The dequeue operation; Application of queues; Media player queues; Summary; Chapter 6: Trees; Technical requirements; Terminology; Tree nodes; Tree traversal; Depth-first traversal; In-order traversal and infix notation; Pre-order traversal and prefix notation; Post-order traversal and postfix notation; Breadth-first traversal; Binary trees; Binary search trees Python (Computer program language) http://id.loc.gov/authorities/subjects/sh96008834 Python (Langage de programmation) Python (Computer program language) fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh96008834 |
| title | Hands-on structures and algorithms with python : write complex and powerful code using the latest features of python 3. 7 / |
| title_auth | Hands-on structures and algorithms with python : write complex and powerful code using the latest features of python 3. 7 / |
| title_exact_search | Hands-on structures and algorithms with python : write complex and powerful code using the latest features of python 3. 7 / |
| title_full | Hands-on structures and algorithms with python : write complex and powerful code using the latest features of python 3. 7 / Basant Agarwal and Benjamin Baka. |
| title_fullStr | Hands-on structures and algorithms with python : write complex and powerful code using the latest features of python 3. 7 / Basant Agarwal and Benjamin Baka. |
| title_full_unstemmed | Hands-on structures and algorithms with python : write complex and powerful code using the latest features of python 3. 7 / Basant Agarwal and Benjamin Baka. |
| title_short | Hands-on structures and algorithms with python : |
| title_sort | hands on structures and algorithms with python write complex and powerful code using the latest features of python 3 7 |
| title_sub | write complex and powerful code using the latest features of python 3. 7 / |
| topic | Python (Computer program language) http://id.loc.gov/authorities/subjects/sh96008834 Python (Langage de programmation) Python (Computer program language) fast |
| topic_facet | Python (Computer program language) Python (Langage de programmation) |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=1925364 |
| work_keys_str_mv | AT agarwalbasant handsonstructuresandalgorithmswithpythonwritecomplexandpowerfulcodeusingthelatestfeaturesofpython37 AT bakabenjamin handsonstructuresandalgorithmswithpythonwritecomplexandpowerfulcodeusingthelatestfeaturesofpython37 |