About This Chapter
Stacks & Queues for Data Structures - Chapter Summary
This informative chapter on queues and stacks for data structures is made up of engaging lessons on topics such as abstract data types and the functionality of stack data in Java. Each lesson is self-paced, accessible 24 hours a day on any mobile device or computer and accompanied by a self-assessment quiz. Review as few or as many of the lessons as needed to meet your study goals. Once you complete this chapter, you should be able to:
- Identify abstract data types in Java
- Describe the class of stack data
- Detail the creation of singly linked lists in Java
- Understand the difference between circularly linked lists and doubly linked lists in Java
- Define queue data in Java
- Explain the use of double-ended queues in Java
- Discuss how to implement priority queues in Java
- Outline stacks, queues and linked lists
1. Abstract Data Types in Java
Do you want to define your own data types? Learn about why abstract data types are useful in programming, and how to create very basic ones in Java using a Java interface in this lesson.
2. Stack Data in Java: Functionality & Class
In this lesson, you will learn how to create a Stack abstract data type in Java. You will learn how a stack works, including push and pop functions. Working code examples are provided.
3. Singly Linked Lists in Java: Creation & Application
This lesson covers singly linked lists in Java, and explores the reasons for using a linked list as opposed to using an array. Working code examples are provided that guide you through creating and using linked lists.
4. Circularly Linked Lists in Java: Creation & Uses
In this lesson, we explore the circularly linked list or a list that resembles a closed circle more than a single string of nodes. We will discuss its uses and provide examples.
5. Doubly Linked Lists in Java: Creation & Nodes
In this lesson, you will learn how doubly linked lists are created and maintained in Java. By using code examples, you will also learn how these lists connect to each other forwardly and backwardly.
6. Queue Data in Java: Definition & Functions
Queues are abstract data types that provide a first-in and first-out approach to list management. Java has a Queue Interface with several methods to support queue manipulation.
7. Double-Ended Queues in Java: Use & Interface
Queues are abstract data elements used in computer science to store and manage data. In this lesson, you will learn about a special type of queue: the double-ended queue. We will explore what it is and how to use it with Java.
8. How to Implement Priority Queues in Java
In this lesson, you will learn two methods of implementing priority queues in Java. Those methods are implementing with an unsorted list and implementation with a sorted list. We will also compare the two implementations.
9. Practical Application for Data Structures: Stacks, Queues & Linked Lists
In this lesson, we are going to check your Java skills in order to create a program that will use different Data Structures like Stacks, Queues and Linked Lists.
Earning College Credit
Did you know… We have over 200 college courses that prepare you to earn credit by exam that is accepted by over 1,500 colleges and universities. You can test out of the first two years of college and save thousands off your degree. Anyone can earn credit-by-exam regardless of age or education level.
To learn more, visit our Earning Credit Page
Transferring credit to the school of your choice
Not sure what college you want to attend yet? Study.com has thousands of articles about every imaginable degree, area of study and career path that can help you find the school that's right for you.
Other chapters within the Computer Science 109: Introduction to Programming course
- Computer Programming Basics
- Built-In Data Types for Programming
- Conditionals & Loops in Programming
- Arrays in Programming
- Input & Output in Programming
- Functions & Modules in Programming
- Object-Oriented Programming Overview
- Algorithmic Analysis, Sorting & Searching
- Tables, Maps & Graphs in Programming