Free Course: Data Structures -uCertify

2.1

A Bag Implementation That Links Data

2.2

Linked Data

2.3

A Linked Implementation of the ADT Bag

2.4

Removing an Item from a Linked Chain

2.5

A Class Node That Has Set and Get Methods

2.6

The Pros and Cons of Using a Chain to Implement the ADT Bag

Introduction to Analysis of Algorithms

3.1

The Efficiency of Algorithms

3.2

Motivation

3.3

Measuring an Algorithm's Efficiency

3.4

Picturing Efficiency

3.5

The Efficiency of Implementations of the ADT Bag

Stacks

4.1

Stacks

4.2

Specifications of the ADT Stack

4.3

Using a Stack to Process Algebraic Expressions

4.4

Stack Implementations

4.5

A Linked Implementation

4.6

An Array-Based Implementation

Queues

5.1

Queues, Deques, and Priority Queues

5.2

The ADT Queue

5.3

Queue, Deque, and Priority Queue Implementations

5.4

A Linked Implementation of a Queue

5.5

An Array-Based Implementation of a Queue

Deques

6.1

The ADT Deque

6.2

A Doubly Linked Implementation of a Deque

Lists

7.1

Lists

7.2

Specifications for the ADT List

7.3

Using the ADT List

7.4

List Implementations That Use Arrays

7.5

Using an Array to Implement the ADT List

7.6

Operations on a Chain of Linked Nodes

7.7

Beginning the Implementation

7.8

Continuing the Implementation

7.9

A Refined Implementation

7.10

The Efficiency of Using a Chain to Implement the ADT List

Basic Sorting Algorithms

8.1

An Introduction to Sorting

8.2

Organizing Java Methods That Sort an Array

8.3

Selection Sort

8.4

Insertion Sort

Faster Sorting Algorithms

9.1

Faster Sorting Methods

9.2

Merge Sort

9.3

Quick Sort

9.4

Radix Sort

Sorted Lists

10.1

Specifications for the ADT Sorted List

10.2

A Linked Implementation

Searching a List

11.1

Searching

11.2

The Problem

11.3

Searching an Unsorted Array

11.4

Searching a Sorted Array

11.5

Searching an Unsorted Chain

11.6

Searching a Sorted Chain

11.7

Choosing a Search Method

Dictionary as an Associative ADT

12.1

Dictionaries

12.2

Specifications for the ADT Dictionary

12.3

Using the ADT Dictionary

Sequential Hash Tables

13.1

Introducing Hashing

13.2

What Is Hashing?

13.3

Hash Functions

13.4

Resolving Collisions

Bucket Hashing

Introduction to Trees

15.1

Tree Concepts

15.2

Traversals of a Tree

15.3

Examples of Binary Trees

15.4

Examples of General Trees

Implementation of Binary Trees

16.1

An Implementation of the ADT Binary Tree

Binary Search Trees

17.1

Getting Started

17.2

Searching and Retrieving

17.3

Traversing

17.4

Adding an Entry

17.5

Removing an Entry

17.6

The Efficiency of Operations

17.7

An Implementation of the ADT Dictionary

Appendix A Java Essentials

Introduction

Java Basics

Simple Input and Output Using the Keyboard and Screen

The if-else Statement

The switch Statement

Enumerations

Scope

Loops

The Class String

The Class StringBuilder

Using Scanner to Extract Pieces of a String

Arrays

Wrapper Classes

Appendix B Java Classes

Objects and Classes

Using the Methods in a Java Class

Defining a Java Class

Enumeration as a Class

Packages

Generic Data Types

Appendix C Creating Classes from Other Classes

Composition

Inheritance

Type Compatibility and Superclasses

Polymorphism

Appendix D Designing Classes

Encapsulation

Specifying Methods

Java Interfaces

Choosing Classes

Reusing Classes

Appendix E Handling Exceptions

The Basics

Handling an Exception

Throwing an Exception

Programmer-Defined Exception Classes

Inheritance and Exceptions

The finally Block

Appendix F File Input and Output

Preliminaries

Text Files

Binary Files

Appendix G Documentation and Programming Style