A Concise and Practical Introduction to Programming Algorithms in Java 2009 Edition Contributor(s): Nielsen, Frank (Author) |
|
ISBN: 184882338X ISBN-13: 9781848823389 Publisher: Springer OUR PRICE: $28.49 Product Type: Paperback - Other Formats Published: April 2009 Annotation: 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. |
Additional Information |
BISAC Categories: - Computers | Programming Languages - Java - Computers | Software Development & Engineering - General - Computers | Data Modeling & Design |
Dewey: 005.133 |
LCCN: 2009921195 |
Series: Undergraduate Topics in Computer Science |
Physical Information: 0.7" H x 6.9" W x 9.1" (1.00 lbs) 252 pages |
Descriptions, Reviews, Etc. |
Publisher 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. |