Apress Windows 10 Release Sale

A Concise and Practical Introduction to Programming Algorithms in Java

By Frank Nielsen

  • eBook Price: $29.95
Buy eBook Buy Print Book

A Concise and Practical Introduction to Programming Algorithms in Java Cover Image

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.

Full Description

  • Add to Wishlist
  • ISBN13: 978-1-8488-2338-9
  • 280 Pages
  • User Level: Students
  • Publication Date: April 5, 2009
  • Available eBook Formats: PDF

Related Titles

  • Information Systems and Neuroscience
  • BPM - Driving Innovation in a Digital World
  • Data-Driven Process Discovery and Analysis
  • Physical Asset Management
  • Transactions on Large-Scale Data- and Knowledge-Centered Systems XVIII
  • UML @ Classroom
  • AIDA-CMK: Multi-Algorithm Optimization Kernel Applied to Analog IC Sizing
  • Computational Color Imaging
  • Uncertainty Quantification in Computational Fluid Dynamics and Aircraft Engines
  • Non-Linear Finite Element Analysis in Structural Mechanics
Full Description
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.
Table of Contents

Table of Contents

  1. Preface.
  2. Part 1 Getting Started.
  3. Expressions, Variables and Assignments.
  4. Conditional Structures and Loops.
  5. Functions and Recursive Functions.
  6. Arrays.
  7. Part II Data
  8. structures and Algorithms.
  9. Objects and Strings.
  10. Searching and Sorting.
  11. Linked Lists.
  12. Object
  13. oriented Data Structures.
  14. Paradigms for Optimization Problems.
  15. The Science of Computing.
  16. Part III Exam Review.
  17. Exam and Solution.
  18. Bibliography.

Please Login to submit errata.

No errata are currently published