Book Image

Learn Java with Projects

By : Dr. Seán Kennedy, Maaike van Putten
5 (3)
Book Image

Learn Java with Projects

5 (3)
By: Dr. Seán Kennedy, Maaike van Putten

Overview of this book

Learn Java with Projects stands out in the world of Java guides; while some books skim the surface and others get lost in too much detail, this one finds a nice middle ground. You’ll begin by exploring the fundamentals of Java, from its primitive data types through to loops and arrays. Next, you’ll move on to object-oriented programming (OOP), where you’ll get to grips with key topics such as classes, objects, encapsulation, inheritance, polymorphism, interfaces, and more. The chapters are designed in a way that focuses on topics that really matter in real-life work situations. No extra fluff here, so that you get more time to spend on the basics and form a solid foundation. As you make progress, you’ll learn advanced topics including generics, collections, lambda expressions, streams and concurrency. This book doesn't just talk about theory—it shows you how things work with little projects, which eventually add up to one big project that brings it all together. By the end of this Java book, you’ll have sound practical knowledge of Java and a helpful guide to walk you through the important parts of Java.
Table of Contents (22 chapters)
1
Part 1: Java Fundamentals
9
Part 2: Object-Oriented Programming
15
Part 3: Advanced Topics

List

So, the List interface is a part of the Java collections framework and it is used to represent an ordered collection of elements. Elements in a List interface can be accessed by their position (index) and can include duplicates. Since List is an interface, it cannot be instantiated. Two commonly used implementations of the List interface are ArrayList and LinkedList. Since these are implementation classes, they can be instantiated. Let’s explore what they are.

ArrayList

ArrayList is a resizable array-backed implementation of the List interface. It provides fast random access to elements and is efficient for read-heavy operations. Random access means directly reaching any item using its index quickly.

ArrayList dynamically resizes itself when elements are added or removed. Adding and removing elements is somewhat slower. LinkedList is optimized for this.

LinkedList

LinkedList is an implementation of the List interface based on a doubly linked list data structure...