• Home
  • Data Structures

Pearson Logo
    • Dashboard
    • Manage as Instructor
    • My Library
  • Data Structures

  • Trial

  • Login or Signup
    • Help & Support
    • Accessibility
    • Testimonials
  • Powered by uCertify
  • Request Demo
  • Hello GuestLogin or Signup
  • Feedback & Support
    • Support
    • Keyboard Shortcuts
    • Send Feedback
Scroll to top button

This is the Dashboard that contains the course components. You can also go to the studyplanner, certification of completion, and test history from here. The shortcut for the course navigation is Alt+G.

Oops! You have logged out. Please login to continue.
Readiness - Day 1
Start
Set date
0 0
Target
Set date
When did you start this course?
When do you expect to finish the course to take your final exam?
Don't worry if you don't have an exact date. All we need is a best estimate.
Set start date and exam date to plan your study and avoid procrastination.
When you achieve a readiness score of 90% or better, you are eligible to receive your certificate of course completion from uCertify.
Certificate of Completion
Setup or Link with Instructor Progress | Study Planner | Analytics | Certificate of Completion
  • Lessons
  • Annotation
Expand all

Please enter valid information.

To search lessons, type the title in the textbox.
1

Abstract Data Types and Sequentially Allocated Bags

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Lists

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Sorted Lists

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Searching a List

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

12.1
Dictionaries
12.2
Specifications for the ADT Dictionary
12.3
Using the ADT Dictionary
13

Sequential Hash Tables

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

13.1
Introducing Hashing
13.2
What Is Hashing?
13.3
Hash Functions
13.4
Resolving Collisions
14

Bucket Hashing

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

15

Introduction to Trees

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

16.1
An Implementation of the ADT Binary Tree
17

Binary Search Trees

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

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

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

Composition
Inheritance
Type Compatibility and Superclasses
Polymorphism
*

Appendix D Designing Classes

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

Encapsulation
Specifying Methods
Java Interfaces
Choosing Classes
Reusing Classes
*

Appendix E Handling Exceptions

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

The Basics
Handling an Exception
Throwing an Exception
Programmer-Defined Exception Classes
Inheritance and Exceptions
The finally Block
*

Appendix F File Input and Output

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

Preliminaries
Text Files
Binary Files
*

Appendix G Documentation and Programming Style

Cards 0% Completed">
Quizzes 0%
0%
Exercise0%
0%

Naming Variables and Classes
Indenting
Comments
×
    We use cookies to enhance your experience. By continuing to visit this site you agree to our use of cookies. More information
    Accept