Please enter valid information.

1

Abstract Data Types and Sequentially Allocated Bags
Quizzes Link

Exercises Link
1.1
The Bag
1.2
Specifying a Bag
1.3
Using the ADT Bag
1.4
Using an ADT Is Like Using a Vending Machine
1.5
Bag Implementations That Use Arrays
1.6
Using a Fixed-Size Array to Implement the ADT Bag
1.7
The Pros and Cons of Using an Array to Implement the ADT Bag
2

Implementing Bags with Linked Allocation
Quizzes Link

Exercises Link
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
3

Introduction to Analysis of Algorithms
Quizzes Link
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
4

Stacks
Quizzes Link
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
5

Queues
Quizzes Link
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
6

Deques
Quizzes Link
6.1
The ADT Deque
6.2
A Doubly Linked Implementation of a Deque
7

Lists
Quizzes Link

Exercises Link
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
8

Basic Sorting Algorithms
Quizzes Link
8.1
An Introduction to Sorting
8.2
Organizing Java Methods That Sort an Array
8.3
Selection Sort
8.4
Insertion Sort
9

Faster Sorting Algorithms
Quizzes Link
9.1
Faster Sorting Methods
9.2
Merge Sort
9.3
Quick Sort
9.4
Radix Sort
10

Sorted Lists
Quizzes Link
10.1
Specifications for the ADT Sorted List
10.2
A Linked Implementation
11

Searching a List
Quizzes Link
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
12

Dictionary as an Associative ADT
Quizzes Link
12.1
Dictionaries
12.2
Specifications for the ADT Dictionary
12.3
Using the ADT Dictionary
13

Sequential Hash Tables
Quizzes Link
13.1
Introducing Hashing
13.2
What Is Hashing?
13.3
Hash Functions
13.4
Resolving Collisions
14

Bucket Hashing
Quizzes Link
15

Introduction to Trees
Quizzes Link
15.1
Tree Concepts
15.2
Traversals of a Tree
15.3
Examples of Binary Trees
15.4
Examples of General Trees
16

Implementation of Binary Trees
Quizzes Link
16.1
An Implementation of the ADT Binary Tree
17

Binary Search Trees
Quizzes Link
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
Quizzes Link
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
Naming Variables and Classes
Indenting
Comments

Link with Instructor

Start
Set date
0%
Target
Set date

Based on your activity to date, your readiness score is %. If you continue at this pace, you will need to achieve a readiness score of 100%. Your current estimated completion date is .

Open Study Planner

Certificate of Completion

When you achieve a readiness score of 90% or better, you are eligible to receive your certificate of course completion from uCertify.

Test History & Performance Analytics

These reports will allow you to gauge your progress, identify the areas you have mastered and help you focus on areas which need improvement.

Course Files

Download

1	Solution Files data-struct/013293650X_LM-170762.zip	Download
2	Code for Readers data-struct/SourceCodeForReaders3e-143809.zip	Download

Abstract Data Types and Sequentially Allocated Bags

Implementing Bags with Linked Allocation

Introduction to Analysis of Algorithms

Stacks

Queues

Deques

Lists

Basic Sorting Algorithms

Faster Sorting Algorithms

Sorted Lists

Searching a List

Dictionary as an Associative ADT

Sequential Hash Tables

Bucket Hashing

Introduction to Trees

Implementation of Binary Trees

Binary Search Trees

Appendix A Java Essentials

Appendix B Java Classes

Appendix C Creating Classes from Other Classes

Appendix D Designing Classes

Appendix E Handling Exceptions

Appendix F File Input and Output

Appendix G Documentation and Programming Style

Link with Instructor

Certificate of Completion

Test History & Performance Analytics

Download