Learn Data Structures and Algorithms with Golang :: Level up Your Go Programming Skills to Develop Faster and More Efficient Code.
Learn Data Structures and Algorithms with Golang covers topics related to simple and advanced concepts in computer programming. The primary objective is to choose a right algorithm and data structures for a problem. This book provides the concepts to compare algorithms complexity and data structures...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Birmingham :
Packt Publishing Ltd,
2019.
|
| Subjects: | |
| Online Access: | DE-862 DE-863 |
| Summary: | Learn Data Structures and Algorithms with Golang covers topics related to simple and advanced concepts in computer programming. The primary objective is to choose a right algorithm and data structures for a problem. This book provides the concepts to compare algorithms complexity and data structures for code performance and efficiency. |
| Item Description: | The preOrderTraverseTree method |
| Physical Description: | 1 online resource (324 pages) |
| Bibliography: | Includes bibliographical references. |
| ISBN: | 178961841X 9781789618419 |
Staff View
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-on1096532052 | ||
| 003 | OCoLC | ||
| 005 | 20250103110447.0 | ||
| 006 | m o d | ||
| 007 | cr |n|---||||| | ||
| 008 | 190413s2019 enk o 000 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d MERUC |d CHVBK |d OCLCQ |d UKAHL |d OCLCQ |d VT2 |d OCLCQ |d N$T |d NLW |d UKMGB |d OCLCQ |d OCLCO |d OCLCL |d OCLCQ | ||
| 015 | |a GBC216939 |2 bnb | ||
| 016 | 7 | |a 019365475 |2 Uk | |
| 020 | |a 178961841X | ||
| 020 | |a 9781789618419 |q (electronic bk.) | ||
| 020 | |z 9781789618501 |q print | ||
| 035 | |a (OCoLC)1096532052 | ||
| 037 | |a 9781789618419 |b Packt Publishing | ||
| 050 | 4 | |a QA76.9.D35 |b .K666 2019 | |
| 082 | 7 | |a 005.73 |2 23 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Kommadi, Bhagvan. | |
| 245 | 1 | 0 | |a Learn Data Structures and Algorithms with Golang : |b Level up Your Go Programming Skills to Develop Faster and More Efficient Code. |
| 260 | |a Birmingham : |b Packt Publishing Ltd, |c 2019. | ||
| 300 | |a 1 online resource (324 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 | |a Cover; Title Page; Copyright and Credits; About Packt; Contributors; Table of Contents; Preface; Section 1: Introduction to Data Structures and Algorithms and the Go Language; Chapter 1: Data Structures and Algorithms; Technical requirements; Classification of data structures and structural design patterns; Classification of data structures; Lists; Tuples; Heaps; Structural design patterns; Adapter; Bridge; drawShape method; drawContour method; Composite; Decorator; Facade; Flyweight; Private class data; Proxy; Representation of algorithms; Flow chart; Pseudo code | |
| 505 | 8 | |a Complexity and performance analysisComplexity analysis of algorithms; Big O notation; Linear complexity; Quadratic complexity; Cubic complexity; Logarithmic complexity; Brute force algorithms; Divide and conquer algorithms; Backtracking algorithms; Summary; Questions and exercises; Further reading; Chapter 2: Getting Started with Go for Data Structures and Algorithms; Technical requirements; Arrays; Slices; The len function ; Slice function; Two-dimensional slices; Maps; Database operations; The GetCustomer method; The InsertCustomer method; Variadic functions; The update operation | |
| 505 | 8 | |a The delete operationCRUD web forms; The defer and panic statements; The InsertCustomer method; The UpdateCustomer method; The DeleteCustomer method; CRM web application; The Create function; The Insert function; The Alter function; The Update function; The Delete function; The main method; The Header template; The Footer template; The Menu template; The Create template; The Update template; The View template; Summary; Questions; Further reading; Section 2: Basic Data Structures and Algorithms using Go; Chapter 3: Linear Data Structures; Technical requirements; Lists; LinkedList | |
| 505 | 8 | |a The Node classThe LinkedList class; The AddToHead method; The IterateList method; The LastNode method; The AddToEnd method; The NodeWithValue method; The AddAfter method; The main method; Doubly linked list; The NodeBetweenValues method; The AddToHead method; AddAfter method; The AddToEnd method; The main method; Sets; The AddElement method; The DeleteElement method; The ContainsElement method; The main method -- contains element; The InterSect method; The Union method; The main method -- intersection and union; Tuples; Queues; The New method; The Add method; The main method -- queues | |
| 505 | 8 | |a Synchronized queueThe New method; The StartTicketIssue method ; The EndTicketIssue method; The ticketIssue method; The StartPass method; The EndPass method; The passenger method; The main method; Stacks; The New method; The Push method; The Pop method; The main method; Summary; Questions; Further reading; Chapter 4: Non-Linear Data Structures; Technical requirements; Trees; Binary search tree; The BinarySearchTree class; The InsertElement method; The insertTreeNode method; The inOrderTraverse method; The inOrderTraverseTree method; The PreOrderTraverseTree method | |
| 500 | |a The preOrderTraverseTree method | ||
| 520 | |a Learn Data Structures and Algorithms with Golang covers topics related to simple and advanced concepts in computer programming. The primary objective is to choose a right algorithm and data structures for a problem. This book provides the concepts to compare algorithms complexity and data structures for code performance and efficiency. | ||
| 504 | |a Includes bibliographical references. | ||
| 650 | 0 | |a Data structures. | |
| 650 | 7 | |a Biology, life sciences. |2 bicssc | |
| 650 | 7 | |a Computer hardware. |2 bicssc | |
| 650 | 7 | |a Consumer advice. |2 bicssc | |
| 650 | 7 | |a Information technology: general issues. |2 bicssc | |
| 650 | 7 | |a Computers |x Buyer's Guides. |2 bisacsh | |
| 650 | 7 | |a Computers |x Bioinformatics. |2 bisacsh | |
| 650 | 7 | |a Computers |x General. |2 bisacsh | |
| 650 | 7 | |a Computer algorithms |2 fast | |
| 650 | 7 | |a Data structures (Computer science) |2 fast | |
| 650 | 7 | |a Go (Computer program language) |2 fast | |
| 758 | |i has work: |a Learn Data Structures and Algorithms with Golang (Text) |1 https://id.oclc.org/worldcat/entity/E39PCYBmBgrH3bGq3r3H9RvGVy |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |a Kommadi, Bhagvan. |t Learn Data Structures and Algorithms with Golang : Level up Your Go Programming Skills to Develop Faster and More Efficient Code. |d Birmingham : Packt Publishing Ltd, ©2019 |z 9781789618501 |
| 966 | 4 | 0 | |l DE-862 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=2094782 |3 Volltext |
| 966 | 4 | 0 | |l DE-863 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=2094782 |3 Volltext |
| 936 | |a BATCHLOAD | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH36147906 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL5744462 | ||
| 938 | |a EBSCOhost |b EBSC |n 2094782 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-862 | ||
| 049 | |a DE-863 | ||
Record in the Search Index
| DE-BY-FWS_katkey | ZDB-4-EBA-on1096532052 |
|---|---|
| _version_ | 1829095301548343296 |
| adam_text | |
| any_adam_object | |
| author | Kommadi, Bhagvan |
| author_facet | Kommadi, Bhagvan |
| author_role | |
| author_sort | Kommadi, Bhagvan |
| author_variant | b k bk |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.D35 .K666 2019 |
| callnumber-search | QA76.9.D35 .K666 2019 |
| callnumber-sort | QA 276.9 D35 K666 42019 |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Cover; Title Page; Copyright and Credits; About Packt; Contributors; Table of Contents; Preface; Section 1: Introduction to Data Structures and Algorithms and the Go Language; Chapter 1: Data Structures and Algorithms; Technical requirements; Classification of data structures and structural design patterns; Classification of data structures; Lists; Tuples; Heaps; Structural design patterns; Adapter; Bridge; drawShape method; drawContour method; Composite; Decorator; Facade; Flyweight; Private class data; Proxy; Representation of algorithms; Flow chart; Pseudo code Complexity and performance analysisComplexity analysis of algorithms; Big O notation; Linear complexity; Quadratic complexity; Cubic complexity; Logarithmic complexity; Brute force algorithms; Divide and conquer algorithms; Backtracking algorithms; Summary; Questions and exercises; Further reading; Chapter 2: Getting Started with Go for Data Structures and Algorithms; Technical requirements; Arrays; Slices; The len function ; Slice function; Two-dimensional slices; Maps; Database operations; The GetCustomer method; The InsertCustomer method; Variadic functions; The update operation The delete operationCRUD web forms; The defer and panic statements; The InsertCustomer method; The UpdateCustomer method; The DeleteCustomer method; CRM web application; The Create function; The Insert function; The Alter function; The Update function; The Delete function; The main method; The Header template; The Footer template; The Menu template; The Create template; The Update template; The View template; Summary; Questions; Further reading; Section 2: Basic Data Structures and Algorithms using Go; Chapter 3: Linear Data Structures; Technical requirements; Lists; LinkedList The Node classThe LinkedList class; The AddToHead method; The IterateList method; The LastNode method; The AddToEnd method; The NodeWithValue method; The AddAfter method; The main method; Doubly linked list; The NodeBetweenValues method; The AddToHead method; AddAfter method; The AddToEnd method; The main method; Sets; The AddElement method; The DeleteElement method; The ContainsElement method; The main method -- contains element; The InterSect method; The Union method; The main method -- intersection and union; Tuples; Queues; The New method; The Add method; The main method -- queues Synchronized queueThe New method; The StartTicketIssue method ; The EndTicketIssue method; The ticketIssue method; The StartPass method; The EndPass method; The passenger method; The main method; Stacks; The New method; The Push method; The Pop method; The main method; Summary; Questions; Further reading; Chapter 4: Non-Linear Data Structures; Technical requirements; Trees; Binary search tree; The BinarySearchTree class; The InsertElement method; The insertTreeNode method; The inOrderTraverse method; The inOrderTraverseTree method; The PreOrderTraverseTree method |
| ctrlnum | (OCoLC)1096532052 |
| dewey-full | 005.73 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.73 |
| dewey-search | 005.73 |
| dewey-sort | 15.73 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05851cam a2200649 i 4500</leader><controlfield tag="001">ZDB-4-EBA-on1096532052</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20250103110447.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr |n|---|||||</controlfield><controlfield tag="008">190413s2019 enk o 000 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">EBLCP</subfield><subfield code="b">eng</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">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VT2</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">N$T</subfield><subfield code="d">NLW</subfield><subfield code="d">UKMGB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBC216939</subfield><subfield code="2">bnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">019365475</subfield><subfield code="2">Uk</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">178961841X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781789618419</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781789618501</subfield><subfield code="q">print</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1096532052</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">9781789618419</subfield><subfield code="b">Packt Publishing</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9.D35</subfield><subfield code="b">.K666 2019</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">005.73</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">Kommadi, Bhagvan.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Learn Data Structures and Algorithms with Golang :</subfield><subfield code="b">Level up Your Go Programming Skills to Develop Faster and More Efficient Code.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Birmingham :</subfield><subfield code="b">Packt Publishing Ltd,</subfield><subfield code="c">2019.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (324 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="a">Cover; Title Page; Copyright and Credits; About Packt; Contributors; Table of Contents; Preface; Section 1: Introduction to Data Structures and Algorithms and the Go Language; Chapter 1: Data Structures and Algorithms; Technical requirements; Classification of data structures and structural design patterns; Classification of data structures; Lists; Tuples; Heaps; Structural design patterns; Adapter; Bridge; drawShape method; drawContour method; Composite; Decorator; Facade; Flyweight; Private class data; Proxy; Representation of algorithms; Flow chart; Pseudo code</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Complexity and performance analysisComplexity analysis of algorithms; Big O notation; Linear complexity; Quadratic complexity; Cubic complexity; Logarithmic complexity; Brute force algorithms; Divide and conquer algorithms; Backtracking algorithms; Summary; Questions and exercises; Further reading; Chapter 2: Getting Started with Go for Data Structures and Algorithms; Technical requirements; Arrays; Slices; The len function ; Slice function; Two-dimensional slices; Maps; Database operations; The GetCustomer method; The InsertCustomer method; Variadic functions; The update operation</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">The delete operationCRUD web forms; The defer and panic statements; The InsertCustomer method; The UpdateCustomer method; The DeleteCustomer method; CRM web application; The Create function; The Insert function; The Alter function; The Update function; The Delete function; The main method; The Header template; The Footer template; The Menu template; The Create template; The Update template; The View template; Summary; Questions; Further reading; Section 2: Basic Data Structures and Algorithms using Go; Chapter 3: Linear Data Structures; Technical requirements; Lists; LinkedList</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">The Node classThe LinkedList class; The AddToHead method; The IterateList method; The LastNode method; The AddToEnd method; The NodeWithValue method; The AddAfter method; The main method; Doubly linked list; The NodeBetweenValues method; The AddToHead method; AddAfter method; The AddToEnd method; The main method; Sets; The AddElement method; The DeleteElement method; The ContainsElement method; The main method -- contains element; The InterSect method; The Union method; The main method -- intersection and union; Tuples; Queues; The New method; The Add method; The main method -- queues</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Synchronized queueThe New method; The StartTicketIssue method ; The EndTicketIssue method; The ticketIssue method; The StartPass method; The EndPass method; The passenger method; The main method; Stacks; The New method; The Push method; The Pop method; The main method; Summary; Questions; Further reading; Chapter 4: Non-Linear Data Structures; Technical requirements; Trees; Binary search tree; The BinarySearchTree class; The InsertElement method; The insertTreeNode method; The inOrderTraverse method; The inOrderTraverseTree method; The PreOrderTraverseTree method</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">The preOrderTraverseTree method</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Learn Data Structures and Algorithms with Golang covers topics related to simple and advanced concepts in computer programming. The primary objective is to choose a right algorithm and data structures for a problem. This book provides the concepts to compare algorithms complexity and data structures for code performance and efficiency.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Data structures.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Biology, life sciences.</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer hardware.</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Consumer advice.</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information technology: general issues.</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computers</subfield><subfield code="x">Buyer's Guides.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computers</subfield><subfield code="x">Bioinformatics.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computers</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</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">Go (Computer program language)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Learn Data Structures and Algorithms with Golang (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCYBmBgrH3bGq3r3H9RvGVy</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Kommadi, Bhagvan.</subfield><subfield code="t">Learn Data Structures and Algorithms with Golang : Level up Your Go Programming Skills to Develop Faster and More Efficient Code.</subfield><subfield code="d">Birmingham : Packt Publishing Ltd, ©2019</subfield><subfield code="z">9781789618501</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-862</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=2094782</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-863</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=2094782</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="936" ind1=" " ind2=" "><subfield code="a">BATCHLOAD</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH36147906</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL5744462</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">2094782</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-862</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-on1096532052 |
| illustrated | Not Illustrated |
| indexdate | 2025-04-11T08:46:51Z |
| institution | BVB |
| isbn | 178961841X 9781789618419 |
| language | English |
| oclc_num | 1096532052 |
| open_access_boolean | |
| owner | MAIN DE-862 DE-BY-FWS DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-862 DE-BY-FWS DE-863 DE-BY-FWS |
| physical | 1 online resource (324 pages) |
| psigel | ZDB-4-EBA FWS_PDA_EBA ZDB-4-EBA |
| publishDate | 2019 |
| publishDateSearch | 2019 |
| publishDateSort | 2019 |
| publisher | Packt Publishing Ltd, |
| record_format | marc |
| spelling | Kommadi, Bhagvan. Learn Data Structures and Algorithms with Golang : Level up Your Go Programming Skills to Develop Faster and More Efficient Code. Birmingham : Packt Publishing Ltd, 2019. 1 online resource (324 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier Print version record. Cover; Title Page; Copyright and Credits; About Packt; Contributors; Table of Contents; Preface; Section 1: Introduction to Data Structures and Algorithms and the Go Language; Chapter 1: Data Structures and Algorithms; Technical requirements; Classification of data structures and structural design patterns; Classification of data structures; Lists; Tuples; Heaps; Structural design patterns; Adapter; Bridge; drawShape method; drawContour method; Composite; Decorator; Facade; Flyweight; Private class data; Proxy; Representation of algorithms; Flow chart; Pseudo code Complexity and performance analysisComplexity analysis of algorithms; Big O notation; Linear complexity; Quadratic complexity; Cubic complexity; Logarithmic complexity; Brute force algorithms; Divide and conquer algorithms; Backtracking algorithms; Summary; Questions and exercises; Further reading; Chapter 2: Getting Started with Go for Data Structures and Algorithms; Technical requirements; Arrays; Slices; The len function ; Slice function; Two-dimensional slices; Maps; Database operations; The GetCustomer method; The InsertCustomer method; Variadic functions; The update operation The delete operationCRUD web forms; The defer and panic statements; The InsertCustomer method; The UpdateCustomer method; The DeleteCustomer method; CRM web application; The Create function; The Insert function; The Alter function; The Update function; The Delete function; The main method; The Header template; The Footer template; The Menu template; The Create template; The Update template; The View template; Summary; Questions; Further reading; Section 2: Basic Data Structures and Algorithms using Go; Chapter 3: Linear Data Structures; Technical requirements; Lists; LinkedList The Node classThe LinkedList class; The AddToHead method; The IterateList method; The LastNode method; The AddToEnd method; The NodeWithValue method; The AddAfter method; The main method; Doubly linked list; The NodeBetweenValues method; The AddToHead method; AddAfter method; The AddToEnd method; The main method; Sets; The AddElement method; The DeleteElement method; The ContainsElement method; The main method -- contains element; The InterSect method; The Union method; The main method -- intersection and union; Tuples; Queues; The New method; The Add method; The main method -- queues Synchronized queueThe New method; The StartTicketIssue method ; The EndTicketIssue method; The ticketIssue method; The StartPass method; The EndPass method; The passenger method; The main method; Stacks; The New method; The Push method; The Pop method; The main method; Summary; Questions; Further reading; Chapter 4: Non-Linear Data Structures; Technical requirements; Trees; Binary search tree; The BinarySearchTree class; The InsertElement method; The insertTreeNode method; The inOrderTraverse method; The inOrderTraverseTree method; The PreOrderTraverseTree method The preOrderTraverseTree method Learn Data Structures and Algorithms with Golang covers topics related to simple and advanced concepts in computer programming. The primary objective is to choose a right algorithm and data structures for a problem. This book provides the concepts to compare algorithms complexity and data structures for code performance and efficiency. Includes bibliographical references. Data structures. Biology, life sciences. bicssc Computer hardware. bicssc Consumer advice. bicssc Information technology: general issues. bicssc Computers Buyer's Guides. bisacsh Computers Bioinformatics. bisacsh Computers General. bisacsh Computer algorithms fast Data structures (Computer science) fast Go (Computer program language) fast has work: Learn Data Structures and Algorithms with Golang (Text) https://id.oclc.org/worldcat/entity/E39PCYBmBgrH3bGq3r3H9RvGVy https://id.oclc.org/worldcat/ontology/hasWork Print version: Kommadi, Bhagvan. Learn Data Structures and Algorithms with Golang : Level up Your Go Programming Skills to Develop Faster and More Efficient Code. Birmingham : Packt Publishing Ltd, ©2019 9781789618501 |
| spellingShingle | Kommadi, Bhagvan Learn Data Structures and Algorithms with Golang : Level up Your Go Programming Skills to Develop Faster and More Efficient Code. Cover; Title Page; Copyright and Credits; About Packt; Contributors; Table of Contents; Preface; Section 1: Introduction to Data Structures and Algorithms and the Go Language; Chapter 1: Data Structures and Algorithms; Technical requirements; Classification of data structures and structural design patterns; Classification of data structures; Lists; Tuples; Heaps; Structural design patterns; Adapter; Bridge; drawShape method; drawContour method; Composite; Decorator; Facade; Flyweight; Private class data; Proxy; Representation of algorithms; Flow chart; Pseudo code Complexity and performance analysisComplexity analysis of algorithms; Big O notation; Linear complexity; Quadratic complexity; Cubic complexity; Logarithmic complexity; Brute force algorithms; Divide and conquer algorithms; Backtracking algorithms; Summary; Questions and exercises; Further reading; Chapter 2: Getting Started with Go for Data Structures and Algorithms; Technical requirements; Arrays; Slices; The len function ; Slice function; Two-dimensional slices; Maps; Database operations; The GetCustomer method; The InsertCustomer method; Variadic functions; The update operation The delete operationCRUD web forms; The defer and panic statements; The InsertCustomer method; The UpdateCustomer method; The DeleteCustomer method; CRM web application; The Create function; The Insert function; The Alter function; The Update function; The Delete function; The main method; The Header template; The Footer template; The Menu template; The Create template; The Update template; The View template; Summary; Questions; Further reading; Section 2: Basic Data Structures and Algorithms using Go; Chapter 3: Linear Data Structures; Technical requirements; Lists; LinkedList The Node classThe LinkedList class; The AddToHead method; The IterateList method; The LastNode method; The AddToEnd method; The NodeWithValue method; The AddAfter method; The main method; Doubly linked list; The NodeBetweenValues method; The AddToHead method; AddAfter method; The AddToEnd method; The main method; Sets; The AddElement method; The DeleteElement method; The ContainsElement method; The main method -- contains element; The InterSect method; The Union method; The main method -- intersection and union; Tuples; Queues; The New method; The Add method; The main method -- queues Synchronized queueThe New method; The StartTicketIssue method ; The EndTicketIssue method; The ticketIssue method; The StartPass method; The EndPass method; The passenger method; The main method; Stacks; The New method; The Push method; The Pop method; The main method; Summary; Questions; Further reading; Chapter 4: Non-Linear Data Structures; Technical requirements; Trees; Binary search tree; The BinarySearchTree class; The InsertElement method; The insertTreeNode method; The inOrderTraverse method; The inOrderTraverseTree method; The PreOrderTraverseTree method Data structures. Biology, life sciences. bicssc Computer hardware. bicssc Consumer advice. bicssc Information technology: general issues. bicssc Computers Buyer's Guides. bisacsh Computers Bioinformatics. bisacsh Computers General. bisacsh Computer algorithms fast Data structures (Computer science) fast Go (Computer program language) fast |
| title | Learn Data Structures and Algorithms with Golang : Level up Your Go Programming Skills to Develop Faster and More Efficient Code. |
| title_auth | Learn Data Structures and Algorithms with Golang : Level up Your Go Programming Skills to Develop Faster and More Efficient Code. |
| title_exact_search | Learn Data Structures and Algorithms with Golang : Level up Your Go Programming Skills to Develop Faster and More Efficient Code. |
| title_full | Learn Data Structures and Algorithms with Golang : Level up Your Go Programming Skills to Develop Faster and More Efficient Code. |
| title_fullStr | Learn Data Structures and Algorithms with Golang : Level up Your Go Programming Skills to Develop Faster and More Efficient Code. |
| title_full_unstemmed | Learn Data Structures and Algorithms with Golang : Level up Your Go Programming Skills to Develop Faster and More Efficient Code. |
| title_short | Learn Data Structures and Algorithms with Golang : |
| title_sort | learn data structures and algorithms with golang level up your go programming skills to develop faster and more efficient code |
| title_sub | Level up Your Go Programming Skills to Develop Faster and More Efficient Code. |
| topic | Data structures. Biology, life sciences. bicssc Computer hardware. bicssc Consumer advice. bicssc Information technology: general issues. bicssc Computers Buyer's Guides. bisacsh Computers Bioinformatics. bisacsh Computers General. bisacsh Computer algorithms fast Data structures (Computer science) fast Go (Computer program language) fast |
| topic_facet | Data structures. Biology, life sciences. Computer hardware. Consumer advice. Information technology: general issues. Computers Buyer's Guides. Computers Bioinformatics. Computers General. Computer algorithms Data structures (Computer science) Go (Computer program language) |
| work_keys_str_mv | AT kommadibhagvan learndatastructuresandalgorithmswithgolanglevelupyourgoprogrammingskillstodevelopfasterandmoreefficientcode |