DS-JAVA.AP1
Data Structures and Abstractions with Java
Learn the essential data structures and algorithms in Java to improve your programming efficiency and problem-solving skills.
- Practice in 74 Laboratorios prácticos — nothing to install
- 37 Lecciones interactivas y 284 topics mapped to the official exam objectives
- 725 Preguntas del examen de práctica
Intermediate A tu propio ritmo · 1 año de acceso 4.4/5 (330 Revisar)
74 LiveLabs prácticos
Practice real IT tasks in guided environments.
- Entornos reales
- Calificación automática
- Sin instalación
37Lecciones interactivas
284Topics
74Laboratorio en vivo
725Preguntas del examen de práctica
523Tarjetas didácticas
523Glosario de términos
01 / Habilidades que obtendrás
What you will be able to do
Try Free →
No se requiere tarjeta de crédito
Our training course offers an in-depth exploration of essential data structures and their applications in Java programming. Starting with the foundation concepts such as encapsulation and Java interfaces, the course discusses various data structures, including bags, stacks, queues, lists, and trees, and their implementations. Key topics of our data structure course include algorithm efficiency, recursion, sorting, and hashing. By the end of the course, you’ll be able to organize and manipulate data efficiently, improving your programming and decision-making skills.
- Implement data structures using arrays and linked lists.
- Monitor and optimize algorithm effectiveness and efficiency using Big Oh notation.
- Develop skills in recursion and solving problems using recursive methods.
- Utilize various sorting algorithms, including selection, insertion, merge, and quick sort.
- Gain expertise in hashing techniques and implementing dictionaries.
- Experiment with use cases of balanced search trees like AVL trees and red-black trees.
- Implement different Java data structures.
- Familiarity with Java-specific concepts like interfaces, generics, and exceptions.
- Get practical experience in designing and reusing classes, and using Java's class library.
Course Highlights
-
37 Lecciones estructuradas Cobertura completa de los objetivos principales del curso
-
74 LiveLabs prácticos Escenarios interactivos guiados con evaluación instantánea
-
725 Preguntas de práctica Pruebas de evaluación con justificaciones de respuesta detalladas
-
1 año de acceso completo Aprendizaje a tu propio ritmo, accesible en cualquier momento y en todos los dispositivos
02 / Lecciones y laboratorios
See exactly what you will learn and practice
Plan de estudios
37 Lecciones interactivas · 284 topics01 Introduction 1 topics +
- Organizing Data
02 Prelude: Designing Classes 7 topics +
- Encapsulation
- Specifying Methods
- Java Interfaces
- Choosing Classes
- Reusing Classes
- Exercises
- Projects
03 Bags 11 topics · 4 Laboratorio en vivo +
- The Bag
- Specifying a Bag
- Using the ADT Bag
- Using an ADT Is Like Using a Vending Machine
- The ADT Set
- Java Class Library: The Interface Set
- Java Interlude 1: Generics
- Lesson Summary
- Programming Tip
- Exercises
- Projects
4 Laboratorio en vivo in this lesson — see the labs panel →
04 Bag Implementations That Use Arrays 8 topics · 1 Laboratorio en vivo +
- Using a Fixed-Size Array to Implement the ADT Bag
- Using Array Resizing to Implement the ADT Bag
- The Pros and Cons of Using an Array to Implement the ADT Bag
- Java Interlude 2 Exceptions
- Lesson Summary
- Programming Tips
- Exercises
- Projects
1 Laboratorio en vivo in this lesson — see the labs panel →
05 A Bag Implementation That Links Data 9 topics · 3 Laboratorio en vivo +
- Linked Data
- A Linked Implementation of the ADT Bag
- Removing an Item from a Linked Chain
- A Class Node That Has Set and Get Methods
- The Pros and Cons of Using a Chain to Implement the ADT Bag
- Lesson Summary
- Programming Tip
- Exercises
- Projects
3 Laboratorio en vivo in this lesson — see the labs panel →
06 The Efficiency of Algorithms 8 topics · 3 Laboratorio en vivo +
- Motivation
- Measuring an Algorithm’s Efficiency
- Big Oh Notation
- Picturing Efficiency
- The Efficiency of Implementations of the ADT Bag
- Lesson Summary
- Exercises
- Projects
3 Laboratorio en vivo in this lesson — see the labs panel →
07 Stacks 8 topics · 8 Laboratorio en vivo +
- Specifications of the ADT Stack
- Using a Stack to Process Algebraic Expressions
- The Program Stack
- Java Class Library: The Class Stack
- Lesson Summary
- Programming Tip
- Exercises
- Projects
8 Laboratorio en vivo in this lesson — see the labs panel →
08 Stack Implementations 7 topics · 3 Laboratorio en vivo +
- A Linked Implementation
- An Array-Based Implementation
- A Vector-Based Implementation
- Java Interlude 3: More About Exceptions
- Lesson Summary
- Exercises
- Projects
3 Laboratorio en vivo in this lesson — see the labs panel →
09 Queues, Deques, and Priority Queues 7 topics · 3 Laboratorio en vivo +
- The ADT Queue
- The ADT Deque
- The ADT Priority Queue
- Lesson Summary
- Programming Tip
- Exercises
- Projects
3 Laboratorio en vivo in this lesson — see the labs panel →
10 Queue, Deque, and Priority Queue Implementations 10 topics · 2 Laboratorio en vivo +
- A Linked Implementation of a Queue
- An Array-Based Implementation of a Queue
- Circular Linked Implementations of a Queue
- Java Class Library: The Class AbstractQueue
- A Doubly Linked Implementation of a Deque
- Possible Implementations of a Priority Queue
- Lesson Summary
- Programming Tip
- Exercises
- Projects
2 Laboratorio en vivo in this lesson — see the labs panel →
11 Recursion 12 topics · 3 Laboratorio en vivo +
- What Is Recursion?
- Tracing a Recursive Method
- Recursive Methods That Return a Value
- Recursively Processing an Array
- Recursively Processing a Linked Chain
- The Time Efficiency of Recursive Methods
- Tail Recursion
- Using a Stack Instead of Recursion
- Lesson Summary
- Programming Tips
- Exercises
- Projects
3 Laboratorio en vivo in this lesson — see the labs panel →
12 Lists 7 topics · 1 Laboratorio en vivo +
- Specifications for the ADT List
- Using the ADT List
- Java Class Library: The Interface List
- Java Class Library: The Class ArrayList
- Lesson Summary
- Exercises
- Projects
1 Laboratorio en vivo in this lesson — see the labs panel →
13 A List Implementation That Uses an Array 5 topics · 2 Laboratorio en vivo +
- Using an Array to Implement the ADT List
- The Efficiency of Using an Array to Implement the ADT List
- Lesson Summary
- Exercises
- Projects
2 Laboratorio en vivo in this lesson — see the labs panel →
14 A List Implementation That Links Data 10 topics · 2 Laboratorio en vivo +
- Operations on a Chain of Linked Nodes
- Beginning the Implementation
- Continuing the Implementation
- A Refined Implementation
- The Efficiency of Using a Chain to Implement the ADT List
- Java Class Library: The Class LinkedList
- Java Interlude 4: Iterators
- Lesson Summary
- Exercises
- Projects
2 Laboratorio en vivo in this lesson — see the labs panel →
15 Iterators for the ADT List 9 topics · 3 Laboratorio en vivo +
- Ways to Implement an Iterator
- A Separate Class Iterator
- An Inner Class Iterator
- Why Are Iterator Methods in Their Own Class?
- An Array-Based Implementation of the Interface ListIterator
- Lesson Summary
- Programming Tip
- Exercises
- Projects
3 Laboratorio en vivo in this lesson — see the labs panel →
16 Problem Solving with Recursion 9 topics · 1 Laboratorio en vivo +
- A Simple Solution to a Difficult Problem
- A Poor Solution to a Simple Problem
- Languages and Grammars
- Indirect Recursion
- Backtracking
- Java Interlude 5: More About Generics
- Lesson Summary
- Exercises
- Projects
1 Laboratorio en vivo in this lesson — see the labs panel →
17 An Introduction to Sorting 9 topics · 3 Laboratorio en vivo +
- Organizing Java Methods That Sort an Array
- Selection Sort
- Insertion Sort
- Shell Sort
- Comparing the Algorithms
- Lesson Summary
- Programming Tip
- Exercises
- Projects
3 Laboratorio en vivo in this lesson — see the labs panel →
18 Faster Sorting Methods 8 topics · 4 Laboratorio en vivo +
- Merge Sort
- Quick Sort
- Radix Sort
- Comparing the Algorithms
- Java Interlude 6: Mutable and Immutable Objects
- Lesson Summary
- Exercises
- Projects
4 Laboratorio en vivo in this lesson — see the labs panel →
19 Sorted Lists 7 topics · 3 Laboratorio en vivo +
- Specifications for the ADT Sorted List
- A Linked Implementation
- An Implementation That Uses the ADT List
- Java Interlude 7: Inheritance and Polymorphism
- Lesson Summary
- Exercises
- Projects
3 Laboratorio en vivo in this lesson — see the labs panel →
20 Inheritance and Lists 7 topics · 1 Laboratorio en vivo +
- Using Inheritance to Implement a Sorted List
- Designing a Base Class
- An Efficient Implementation of a Sorted List
- Lesson Summary
- Programming Tips
- Exercises
- Projects
1 Laboratorio en vivo in this lesson — see the labs panel →
21 Searching 11 topics · 2 Laboratorio en vivo +
- The Problem
- Searching an Unsorted Array
- Searching a Sorted Array
- Searching an Unsorted Chain
- Searching a Sorted Chain
- Choosing a Search Method
- Java Interlude 8: Generics Once Again
- Lesson Summary
- Programming Tip
- Exercises
- Projects
2 Laboratorio en vivo in this lesson — see the labs panel →
22 Dictionaries 7 topics · 2 Laboratorio en vivo +
- Specifications for the ADT Dictionary
- Using the ADT Dictionary
- Java Class Library: The Interface Map
- Lesson Summary
- Programming Tips
- Exercises
- Projects
2 Laboratorio en vivo in this lesson — see the labs panel →
23 Dictionary Implementations 6 topics · 1 Laboratorio en vivo +
- Array-Based Implementations
- Linked Implementations
- Lesson Summary
- Programming Tips
- Exercises
- Projects
1 Laboratorio en vivo in this lesson — see the labs panel →
24 Introducing Hashing 6 topics · 1 Laboratorio en vivo +
- What Is Hashing?
- Hash Functions
- Resolving Collisions
- Lesson Summary
- Exercises
- Projects
1 Laboratorio en vivo in this lesson — see the labs panel →
25 Hashing as a Dictionary Implementation 9 topics · 1 Laboratorio en vivo +
- The Efficiency of Hashing
- Rehashing
- Comparing Schemes for Collision Resolution
- A Dictionary Implementation That Uses Hashing
- Java Class Library: The Class HashMap
- Java Class Library: The Class HashSet
- Lesson Summary
- Exercises
- Projects
1 Laboratorio en vivo in this lesson — see the labs panel →
26 Trees 8 topics · 3 Laboratorio en vivo +
- Tree Concepts
- Traversals of a Tree
- Java Interfaces for Trees
- Examples of Binary Trees
- Examples of General Trees
- Lesson Summary
- Exercises
- Projects
3 Laboratorio en vivo in this lesson — see the labs panel →
27 Tree Implementations 10 topics · 2 Laboratorio en vivo +
- The Nodes in a Binary Tree
- An Implementation of the ADT Binary Tree
- An Implementation of an Expression Tree
- General Trees
- Using a Binary Tree to Represent a General Tree
- Java Interlude 9: Cloning
- Lesson Summary
- Programming Tips
- Exercises
- Projects
2 Laboratorio en vivo in this lesson — see the labs panel →
28 A Binary Search Tree Implementation 10 topics · 2 Laboratorio en vivo +
- Getting Started
- Searching and Retrieving
- Traversing
- Adding an Entry
- Removing an Entry
- The Efficiency of Operations
- An Implementation of the ADT Dictionary
- Lesson Summary
- Exercises
- Projects
2 Laboratorio en vivo in this lesson — see the labs panel →
29 A Heap Implementation 9 topics · 3 Laboratorio en vivo +
- Reprise: The ADT Heap
- Using an Array to Represent a Heap
- Adding an Entry
- Removing the Root
- Creating a Heap
- Heap Sort
- Lesson Summary
- Exercises
- Projects
3 Laboratorio en vivo in this lesson — see the labs panel →
30 Balanced Search Trees 8 topics · 1 Laboratorio en vivo +
- AVL Trees
- 2-3 Trees
- 2-4 Trees
- Red-Black Trees
- B-Trees
- Lesson Summary
- Exercises
- Projects
1 Laboratorio en vivo in this lesson — see the labs panel →
31 Graphs 8 topics · 4 Laboratorio en vivo +
- Some Examples and Terminology
- Traversals
- Topological Order
- Paths
- Java Interfaces for the ADT Graph
- Lesson Summary
- Exercises
- Projects
4 Laboratorio en vivo in this lesson — see the labs panel →
32 Graph Implementations 6 topics · 2 Laboratorio en vivo +
- An Overview of Two Implementations
- Vertices and Edges
- An Implementation of the ADT Graph
- Lesson Summary
- Exercises
- Projects
2 Laboratorio en vivo in this lesson — see the labs panel →
33 Appendix A: Documentation and Programming Style 3 topics +
- Naming Variables and Classes
- Indenting
- Comments
34 Appendix B: Java Classes 5 topics +
- Objects and Classes
- Using the Methods in a Java Class
- Defining a Java Class
- Enumeration as a Class
- Packages
35 Appendix C: Creating Classes from Other Classes 3 topics +
- Composition
- Inheritance
- Type Compatibility and Superclasses
36 Supplement 1: Java Basics 13 topics +
- Introduction
- Elements of Java
- 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
37 Supplement 2: File Input and Output 3 topics +
- Preliminaries
- Text Files
- Binary Files
Laboratorios prácticos Our edge
74 Laboratorio en vivos- Counting the Occurrence of Each Item in a Bag
- Performing Matrix Multiplication
- Transposing a Matrix
- Finding the Intersection of Two Arrays
- Handling an Exception
- Counting the Entries in a Bag
- Adding a Node at the End of a Doubly Linked Chain
- Removing First Node from a Doubly Linked Chain
- Adding Nodes to the Beginning of a Doubly Linked Chain
- Searching an Entry in a Bag
- Rearranging the Integers in an Array
- Creating a Stack and Adding Five Elements to it
- Removing an Element from a Stack
- Searching an Element in a Stack
- Transferring the Elements of One Stack to Another
- Transforming an Infix Expression to a Postfix Expression
- Evaluating a Postfix Expression
- Evaluating an Infix Expression
- Testing an Input String for Palindrome Using a Stack
- Creating an Array-Based Stack to Retrieve the Topmost Entry
- Creating a Vector-Based Stack to Retrieve the Topmost Entry
- Creating Custom Exception Class
- Creating a Queue
- Creating a Deque
- Creating a Priority Queue
- Removing the First Element from a Circular Linked Queue
- Removing the First Element from a Doubly Linked Deque
- Creating a Recursive Void Method to Print First Five Natural Numbers
- Traversing the Elements of a Linked List in Reverse Order
- Creating a Recursive Method to Return the Factorial of a Number
- Replacing an Element in the Linked List
- Removing an Element from the Specified Position in a Linked List
- Locating an Element in the Linked List
- Adding an Element at the Specified Position in a Linked List
- Converting an ArrayList to an Array
- Working with a List
- Traversing a List
- Removing Duplicates from the List
- Evaluating a Prefix Expression
- Sorting an Array using Selection Sort
- Sorting an Array using Insertion Sort
- Sorting an Array using Shell Sort
- Sorting an Array using Merge Sort
- Sorting an Array using Quick Sort
- Sorting an Array using Radix Sort
- Replacing a Word Using the StringBuilder Class
- Inserting an Element into a Sorted Array
- Using Polymorphism
- Using the Abstract Class
- Sorting a List using Inheritance
- Performing Sequential Search
- Performing Binary Search
- Implementing a Dictionary
- Implementing a Map
- Searching for a Key in a Dictionary
- Using Linear Probing in a Hash Table
- Implementing HashMap
- Traversing a Binary Tree using Inorder Traversal
- Traversing a Binary Tree using Preorder Traversal
- Traversing a Binary Tree Using Postorder Traversal
- Counting the Nodes of a Binary Tree
- Computing the Height of a Binary Tree
- Searching a Node in the Binary Search Tree
- Removing a Node from a Binary Search Tree
- Adding Nodes to a Max Heap
- Removing the Maximum Value Node from a Max Heap
- Sorting an Array using Heap Sort
- Adding Nodes to an AVL Tree
- Using the DFS Traversal
- Using the BFS Traversal
- Using Topological Sort
- Using Dijkstra's Algorithm
- Printing an Adjacency List
- Printing an Adjacency Matrix
Los laboratorios se ejecutan en tu navegador; no hay nada que instalar.
03 / Preguntas frecuentes
Preguntas antes de empezar
What is data structures and abstraction (DSA)? +
Data structures and abstractions (DSA) involve organizing and managing data efficiently and using abstraction to simplify complex data manipulation.
What is an abstraction in Java?+
Abstraction in Java is the concept of hiding the implementation details and showing only the essential features of an object, typically achieved through interfaces and abstract classes.
Is DSA important for Java developers?+
Yes, DSA is important for Java developers as it assists in writing efficient code, optimizing performance, and solving complex problems.
Can I learn DSA in 1 month? +
It is possible to learn the basics of DSA in 1 month with consistent study and practice, but mastering it may take longer. What you can do is accelerate your learning time with our data structures in Java course, packed with engaging labs and gamified test preps.
How can I start DSA as a beginner? +
Beginners can start with a structured course like ours on DSA to practice coding problems and implement data structures & algorithms.
Keep going
You might also like
Build Strong Data Abstractions and Structures
Enroll in our data structures and abstractions with Java course today to learn all about data manipulation and algorithms.
- 1 año de acceso completo
- 74 LiveLab incluido
- Certificado de finalización
No se requiere tarjeta de crédito