A Concise and Practical Introduction to Programming Algorithms in Java:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
London
Springer London
2009
|
| Ausgabe: | 1st ed. 2009 |
| Schriftenreihe: | Undergraduate Topics in Computer Science
|
| Schlagworte: | |
| Online-Zugang: | DE-355 URL des Erstveröffentlichers |
| Beschreibung: | 1 Online-Ressource (XXVIII, 252 Seiten) |
| ISBN: | 9781848823396 |
| ISSN: | 2197-1781 |
| DOI: | 10.1007/978-1-84882-339-6 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV050122750 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 250115s2009 xx o|||| 00||| eng d | ||
| 020 | |a 9781848823396 |9 978-1-84882-339-6 | ||
| 024 | 7 | |a 10.1007/978-1-84882-339-6 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-1-84882-339-6 | ||
| 035 | |a (DE-599)BVBBV050122750 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-355 | ||
| 082 | 0 | |a 005.1 |2 23 | |
| 100 | 1 | |a Nielsen, Frank |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A Concise and Practical Introduction to Programming Algorithms in Java |c by Frank Nielsen |
| 250 | |a 1st ed. 2009 | ||
| 264 | 1 | |a London |b Springer London |c 2009 | |
| 300 | |a 1 Online-Ressource (XXVIII, 252 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Undergraduate Topics in Computer Science |x 2197-1781 | |
| 505 | 8 | |a This gentle introduction to programming and algorithms has been designed as a first course for undergraduates, and requires no prior knowledge. Divided into two parts the first covers programming basic tasks using Java. The fundamental notions of variables, expressions, assignments with type checking are looked at before moving on to cover the conditional and loop statements that allow programmers to control the instruction workflows. Functions with pass-by-value/pass-by-reference arguments and recursion are explained, followed by a discussion of arrays and data encapsulation using objects. The second part of the book focuses on data structures and algorithms, describing sequential and bisection search techniques and analysing their efficiency by using complexity analysis. Iterative and recursive sorting algorithms are discussed followed by linked lists and common insertion/deletion/merge operations that can be carried out on these. Abstract data structures are introduced along with how to program these in Java using object-orientation. The book closes with an introduction to more evolved algorithmic tasks that tackle combinatorial optimisation problems. Exercises are included at the end of each chapter in order for students to practice the concepts learned, and a final section contains an overall exam which allows them to evaluate how well they have assimilated the material covered in the book | |
| 650 | 4 | |a Software Engineering | |
| 650 | 4 | |a Data Science | |
| 650 | 4 | |a Software engineering | |
| 650 | 4 | |a Artificial intelligence / Data processing | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781848823389 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781848823402 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-84882-339-6 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-1-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2009 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035459620 | |
| 966 | e | |u https://doi.org/10.1007/978-1-84882-339-6 |l DE-355 |p ZDB-2-SCS |q UBR Paketkauf 2024 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1821312683345969152 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Nielsen, Frank |
| author_facet | Nielsen, Frank |
| author_role | aut |
| author_sort | Nielsen, Frank |
| author_variant | f n fn |
| building | Verbundindex |
| bvnumber | BV050122750 |
| collection | ZDB-1-SCS |
| contents | This gentle introduction to programming and algorithms has been designed as a first course for undergraduates, and requires no prior knowledge. Divided into two parts the first covers programming basic tasks using Java. The fundamental notions of variables, expressions, assignments with type checking are looked at before moving on to cover the conditional and loop statements that allow programmers to control the instruction workflows. Functions with pass-by-value/pass-by-reference arguments and recursion are explained, followed by a discussion of arrays and data encapsulation using objects. The second part of the book focuses on data structures and algorithms, describing sequential and bisection search techniques and analysing their efficiency by using complexity analysis. Iterative and recursive sorting algorithms are discussed followed by linked lists and common insertion/deletion/merge operations that can be carried out on these. Abstract data structures are introduced along with how to program these in Java using object-orientation. The book closes with an introduction to more evolved algorithmic tasks that tackle combinatorial optimisation problems. Exercises are included at the end of each chapter in order for students to practice the concepts learned, and a final section contains an overall exam which allows them to evaluate how well they have assimilated the material covered in the book |
| ctrlnum | (ZDB-2-SCS)978-1-84882-339-6 (DE-599)BVBBV050122750 |
| 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 |
| doi_str_mv | 10.1007/978-1-84882-339-6 |
| edition | 1st ed. 2009 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zcb4500</leader><controlfield tag="001">BV050122750</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">250115s2009 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781848823396</subfield><subfield code="9">978-1-84882-339-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-84882-339-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-84882-339-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV050122750</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-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nielsen, Frank</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Concise and Practical Introduction to Programming Algorithms in Java</subfield><subfield code="c">by Frank Nielsen</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2009</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London</subfield><subfield code="b">Springer London</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XXVIII, 252 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="490" ind1="0" ind2=" "><subfield code="a">Undergraduate Topics in Computer Science</subfield><subfield code="x">2197-1781</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">This gentle introduction to programming and algorithms has been designed as a first course for undergraduates, and requires no prior knowledge. Divided into two parts the first covers programming basic tasks using Java. The fundamental notions of variables, expressions, assignments with type checking are looked at before moving on to cover the conditional and loop statements that allow programmers to control the instruction workflows. Functions with pass-by-value/pass-by-reference arguments and recursion are explained, followed by a discussion of arrays and data encapsulation using objects. The second part of the book focuses on data structures and algorithms, describing sequential and bisection search techniques and analysing their efficiency by using complexity analysis. Iterative and recursive sorting algorithms are discussed followed by linked lists and common insertion/deletion/merge operations that can be carried out on these. Abstract data structures are introduced along with how to program these in Java using object-orientation. The book closes with an introduction to more evolved algorithmic tasks that tackle combinatorial optimisation problems. Exercises are included at the end of each chapter in order for students to practice the concepts learned, and a final section contains an overall exam which allows them to evaluate how well they have assimilated the material covered in the book</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence / Data processing</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">9781848823389</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">9781848823402</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-84882-339-6</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2009</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035459620</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-84882-339-6</subfield><subfield code="l">DE-355</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">UBR Paketkauf 2024</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV050122750 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-15T11:05:28Z |
| institution | BVB |
| isbn | 9781848823396 |
| issn | 2197-1781 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035459620 |
| open_access_boolean | |
| owner | DE-355 DE-BY-UBR |
| owner_facet | DE-355 DE-BY-UBR |
| physical | 1 Online-Ressource (XXVIII, 252 Seiten) |
| psigel | ZDB-1-SCS ZDB-2-SCS_2009 ZDB-2-SCS UBR Paketkauf 2024 |
| publishDate | 2009 |
| publishDateSearch | 2009 |
| publishDateSort | 2009 |
| publisher | Springer London |
| record_format | marc |
| series2 | Undergraduate Topics in Computer Science |
| spelling | Nielsen, Frank Verfasser aut A Concise and Practical Introduction to Programming Algorithms in Java by Frank Nielsen 1st ed. 2009 London Springer London 2009 1 Online-Ressource (XXVIII, 252 Seiten) txt rdacontent c rdamedia cr rdacarrier Undergraduate Topics in Computer Science 2197-1781 This gentle introduction to programming and algorithms has been designed as a first course for undergraduates, and requires no prior knowledge. Divided into two parts the first covers programming basic tasks using Java. The fundamental notions of variables, expressions, assignments with type checking are looked at before moving on to cover the conditional and loop statements that allow programmers to control the instruction workflows. Functions with pass-by-value/pass-by-reference arguments and recursion are explained, followed by a discussion of arrays and data encapsulation using objects. The second part of the book focuses on data structures and algorithms, describing sequential and bisection search techniques and analysing their efficiency by using complexity analysis. Iterative and recursive sorting algorithms are discussed followed by linked lists and common insertion/deletion/merge operations that can be carried out on these. Abstract data structures are introduced along with how to program these in Java using object-orientation. The book closes with an introduction to more evolved algorithmic tasks that tackle combinatorial optimisation problems. Exercises are included at the end of each chapter in order for students to practice the concepts learned, and a final section contains an overall exam which allows them to evaluate how well they have assimilated the material covered in the book Software Engineering Data Science Software engineering Artificial intelligence / Data processing Erscheint auch als Druck-Ausgabe 9781848823389 Erscheint auch als Druck-Ausgabe 9781848823402 https://doi.org/10.1007/978-1-84882-339-6 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Nielsen, Frank A Concise and Practical Introduction to Programming Algorithms in Java This gentle introduction to programming and algorithms has been designed as a first course for undergraduates, and requires no prior knowledge. Divided into two parts the first covers programming basic tasks using Java. The fundamental notions of variables, expressions, assignments with type checking are looked at before moving on to cover the conditional and loop statements that allow programmers to control the instruction workflows. Functions with pass-by-value/pass-by-reference arguments and recursion are explained, followed by a discussion of arrays and data encapsulation using objects. The second part of the book focuses on data structures and algorithms, describing sequential and bisection search techniques and analysing their efficiency by using complexity analysis. Iterative and recursive sorting algorithms are discussed followed by linked lists and common insertion/deletion/merge operations that can be carried out on these. Abstract data structures are introduced along with how to program these in Java using object-orientation. The book closes with an introduction to more evolved algorithmic tasks that tackle combinatorial optimisation problems. Exercises are included at the end of each chapter in order for students to practice the concepts learned, and a final section contains an overall exam which allows them to evaluate how well they have assimilated the material covered in the book Software Engineering Data Science Software engineering Artificial intelligence / Data processing |
| title | A Concise and Practical Introduction to Programming Algorithms in Java |
| title_auth | A Concise and Practical Introduction to Programming Algorithms in Java |
| title_exact_search | A Concise and Practical Introduction to Programming Algorithms in Java |
| title_full | A Concise and Practical Introduction to Programming Algorithms in Java by Frank Nielsen |
| title_fullStr | A Concise and Practical Introduction to Programming Algorithms in Java by Frank Nielsen |
| title_full_unstemmed | A Concise and Practical Introduction to Programming Algorithms in Java by Frank Nielsen |
| title_short | A Concise and Practical Introduction to Programming Algorithms in Java |
| title_sort | a concise and practical introduction to programming algorithms in java |
| topic | Software Engineering Data Science Software engineering Artificial intelligence / Data processing |
| topic_facet | Software Engineering Data Science Software engineering Artificial intelligence / Data processing |
| url | https://doi.org/10.1007/978-1-84882-339-6 |
| work_keys_str_mv | AT nielsenfrank aconciseandpracticalintroductiontoprogrammingalgorithmsinjava |