Introduction to Java Programming: Fundamental Data Structures and Algorithms (edX)

Emphasis is put on immediate feedback and on having a fun experience. Programming knowledge is not only useful to be able to program today’s devices such as computers and smartphones. It also opens the door to computational thinking, i.e. the application of computing techniques to every-day processes.

This course is designed taking into account the subset and recommendations of the College Board in order to prepare learners for the Advanced Placement (AP) Computer Science A exam.

This course is part of the Introduction to Java Programming Professional Certificate.

What you'll learn:

- Arrange data on arrays and linked lists using primitive data types and classes.

- Develop and use linear data structures, such as stacks and queues, implemented with linked lists or arrays.

- Develop and use non-linear data structures, such as trees, including binary search trees and heaps, implemented with linked lists or arrays.

- Implement algorithms for the efficient searching and sorting of data.

Syllabus

1. Lists

The first week starts with the most fundamental data structure: Lists. Several implementations for storing information in Lists are presented in this week, including the use of Arrays of primitive data types, the use of Arrays of objects of the same class, and the use of links (Linked Lists).

2. Stacks

The second week addresses Stacks, which are one well-known linear data structure. Stacks are also called LIFO data structures (last-in, first-out). Algorithms for inserting and extracting information from Stacks will be discussed this week, as well as implementations of Stacks with Linked Lists.

3. Queues

The third week addresses another well-known linear data structure: Queues. Queues are also called FIFO data structures (first-in, first-out). Algorithms for inserting and extracting information from Queues will be discussed this week, as well as implementations of Queues with Linked Lists.

4. Trees

The fourth week introduces non-linear data structures, and particularly Trees. Binary Search Trees and Heaps are presented as two well-known examples of Trees. Algorithms for inserting and extracting information from Binary Search Trees and Heaps will be discussed this week. Implementations based on Linked Lists for Trees and Heaps will be analyzed.

5. Searching and Sorting

The last week presents some basic algorithms for searching and sorting information in linear and non-linear data structures. The efficiency of these algorithms is discussed, proposing alternatives for their improvement.

Prerequisites

It is recommended to be familiar with the topics covered in Introduction to Programming with Java - Part 1: Starting to Code with Java and Introduction to Programming with Java - Part 2: Writing Good Code.