Concise and practical introduction to programming algorithms in java
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 checkin...
| Main Author: | Nielsen, Frank. |
|---|---|
| Other Authors: | SpringerLink (Online service) |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin :
Springer,
2009.
Berlin : 2009. |
| Physical Description: |
1 online resource. |
| Series: |
Undergraduate topics in computer science.
|
| Subjects: |
| Summary: |
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. |
|---|---|
| Item Description: |
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 & Solution. 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. |
| Physical Description: |
1 online resource. |
| ISBN: |
1848823398 9781848823396 |