A Concise and Practical Introduction to Programming Algorithms in Java
Seiten
2009
Springer London Ltd (Verlag)
978-1-84882-338-9 (ISBN)
Springer London Ltd (Verlag)
978-1-84882-338-9 (ISBN)
This introduction to programming and algorithms requires no prior knowledge of the subject. It covers programming basic tasks using Java as well as focuses on data structures and algorithms. Exercises are included at the end of each chapter.
A Concise and Practical Introduction to Programming Algorithms in Java has two main goals. The first is for novice programmers to learn progressively the basic concepts underlying most imperative programming languages using Java. The second goal is to introduce new programmers to the very basic principles of thinking the algorithmic way and turning the algorithms into programs using the programming concepts of Java.
The book is divided into two parts and includes: The fundamental notions of variables, expressions and assignments with type checking - Conditional and loop statements - Explanation of the concepts of functions with pass-by-value arguments and recursion - Fundamental sequential and bisection search techniques - Basic iterative and recursive sorting algorithms.
Each chapter of the book concludes with a set of exercises to enable students to practice concepts covered.
A Concise and Practical Introduction to Programming Algorithms in Java has two main goals. The first is for novice programmers to learn progressively the basic concepts underlying most imperative programming languages using Java. The second goal is to introduce new programmers to the very basic principles of thinking the algorithmic way and turning the algorithms into programs using the programming concepts of Java.
The book is divided into two parts and includes: The fundamental notions of variables, expressions and assignments with type checking - Conditional and loop statements - Explanation of the concepts of functions with pass-by-value arguments and recursion - Fundamental sequential and bisection search techniques - Basic iterative and recursive sorting algorithms.
Each chapter of the book concludes with a set of exercises to enable students to practice concepts covered.
I. Getting Started.- Expressions, Variables and Assignments.- Conditional Structures and Loops.- Functions and Recursive Functions.- Arrays.- II. Data-Structures & Algorithms.- Objects and Strings.- Searching and Sorting.- Linked Lists.- Object-Oriented Data-Structures.- Paradigms for Optimization Problems.- The Science of Computing.- III. Exam Review.- Exam #x0026; Solution.
| Erscheint lt. Verlag | 23.4.2009 |
|---|---|
| Reihe/Serie | Undergraduate Topics in Computer Science |
| Zusatzinfo | XXVIII, 252 p. |
| Verlagsort | England |
| Sprache | englisch |
| Maße | 178 x 235 mm |
| Themenwelt | Mathematik / Informatik ► Informatik ► Betriebssysteme / Server |
| Mathematik / Informatik ► Informatik ► Datenbanken | |
| Informatik ► Programmiersprachen / -werkzeuge ► Java | |
| Mathematik / Informatik ► Informatik ► Software Entwicklung | |
| Informatik ► Theorie / Studium ► Algorithmen | |
| ISBN-10 | 1-84882-338-X / 184882338X |
| ISBN-13 | 978-1-84882-338-9 / 9781848823389 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
mit über 150 Workouts in Java und Python
Buch (2023)
Carl Hanser (Verlag)
CHF 41,95
Einführung, Ausbildung, Praxis
Buch | Hardcover (2023)
Rheinwerk (Verlag)
CHF 69,85
