testzxcvzxcvzxcv
  • Introduction
  • 1. Introduction to Java
    • 1.1 Essentials
    • 1.2 Objects
  • 2. Lists
    • 2.1 Mystery of the Walrus
    • 2.2 The SLList
    • 2.3 The DList
    • 2.4 Arrays
    • 2.5 The AList
  • 3. Testing
    • 3.1 A New Way
  • 4. Inheritance, Implements
    • 4.1 Intro and Interfaces
    • 4.2 Extends, Casting, and Higher Order Functions
    • 4.3 Subtype Polymorphism vs. HOF
    • 4.4 Java Libraries and Packages
Powered by GitBook
On this page

Was this helpful?

Introduction

Next1. Introduction to Java

Last updated 6 years ago

Was this helpful?

This book is the companion to Josh Hug's version of CS61B, UC Berkeley's Data Structures course. The spring 2019 version of the course can be found at . There may be newer versions. See .

This course presumes that you already have a strong understanding of programming fundamentals. At the very least, you should be comfortable with the ideas of object oriented programming, recursion, lists, and trees. You should also understand how to use a terminal in the operating system of your choice. If you don't have such experience, I encourage you to check out CS61A, UC Berkeley's introductory programming course .

If you already have experience with Java, you might consider skipping straight to chapter 2, though you might still get something by skimming the first chapter.

Licensing:

All materials for this course are distributed under a Creative Commons 4.0 BY-NC-SA license, which you can learn about in glorious human-readable terms . The basic idea is that it's all free, and you can even redistribute or remix the course content however you want, so long as you give credit to Josh Hug and also enforce the same license on any content you create. Sites like Chegg, CourseHero, etc. may not distribute my course materials.

sp19.datastructur.es
https://datastructur.es
CS61A
at this link