A Concise and Practical Introduction to Programming Algorithms in Java (Undergraduate Topics in Computer Science) - Couverture souple

Nielsen, Frank

Couverture souple

ISBN 10 : 184882338X ISBN 13 : 9781848823389

Editeur : Springer, 2009

Synopsis

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 propos du livre

À propos de la quatrième de couverture

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.

Détails de l'édition

• Éditeur: Springer
• Date d'édition: 2009
• Langue: anglais
• ISBN 10: 184882338X
• ISBN 13: 9781848823389
• Reliure: Broché
• Nombre de pages: 252
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible