Concise and Practical Introduction to Programming Algorithms in Java

AvFrank Nielsen

Häftad, Engelska, 2009

Del i serien Undergraduate Topics in Computer Science

314 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

E-bok

375 kr

Beskrivning

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.

Produktinformation

Utgivningsdatum:2009-04-23
Mått:178 x 235 x 16 mm
Vikt:462 g
Format:Häftad
Språk:Engelska
Serie:Undergraduate Topics in Computer Science
Antal sidor:252
Förlag:Springer London Ltd
ISBN:9781848823389

Utforska kategorier

Programspråk inom Data och IT

Recensioner i media

From the reviews: "This is an excellent book. ... The author takes an interesting and entirely appropriate approach to Java ... . the book is designed primarily as a textbook for class use, a programmer experienced in another procedural or object-oriented language, who would like to get started with Java, could also use it. The examples and exercises are definitely a lot more interesting than those found in most books aimed at professionals ... . I like this book and I recommend it." (Edgar R. Chavez, ACM Computing Reviews, August, 2009)

Innehållsförteckning

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.