A Concise and Practical Introduction to Programming Algorithms in Java

✍ Scribed by Frank Nielsen (auth.)

• Publisher: Springer-Verlag London
• Year: 2009
• Tongue: English
• Leaves: 263
• Series: Undergraduate Topics in Computer Science
• Edition: 1
• Category: Library

✦ 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.

✦ Table of Contents

Front Matter....Pages 1-24
Front Matter....Pages 1-1
Expressions, Variables and Assignments....Pages 1-27
Conditional Structures and Loops....Pages 1-25
Functions and Recursive Functions....Pages 1-25
Arrays....Pages 1-21
Front Matter....Pages 1-1
Objects and Strings....Pages 1-20
Searching and Sorting....Pages 1-17
Linked Lists....Pages 1-23
Object-Oriented Data-Structures....Pages 1-22
Paradigms for Optimization Problems....Pages 1-28
The Science of Computing....Pages 1-5
Front Matter....Pages 1-1
Exam & Solution....Pages 1-20
Back Matter....Pages 1-5

✦ Subjects

Data Structures; Software Engineering/Programming and Operating Systems