Data Structures & Algorithms in Java: Working with Queues

Java SE 13    |    Intermediate
  • 15 Videos | 1h 55m 25s
  • Includes Assessment
  • Earns a Badge
Likes 13 Likes 13
In this course, you’ll explore a popular data structure, the queue. Queues offer first in, first out access. All additions to the queue are done at one end, which is the rear of the queue, and removals from the queue are done from the front of the queue. You'll learn how to implement a queue using arrays and linked lists and you’ll also examine a related data structure, the deque - basically the queue with additional operations. Next, you'll learn about implementations of the stack and queue, which are part of the standard Java library. Finally, you'll see how you can work with the priority queue, which allows you to access elements in the order of priority.

WHAT YOU WILL LEARN

  • discover the key concepts covered in this course
    recall the basic characteristics of a queue
    perform simple operations using Is Full, Is Empty, and Size on a queue implemented using arrays
    enqueue elements in a queue implemented using arrays
    dequeue elements in a queue implemented using arrays
    recall why enqueue is an O(N) operation in a queue implemented using arrays
    enqueue elements in a queue implemented as a circular queue
    dequeue elements in a queue implemented as a circular queue
  • enqueue elements in a queue implemented using linked lists
    dequeue elements and peek into a queue implemented using linked lists
    implement a double-ended queue
    build a queue using two stacks
    use the built-in classes in Java for queues and stacks
    use the priority queue and specify priorities using a comparator
    summarize the key concepts covered in this course

IN THIS COURSE

  • Playable
    1. 
    Course Overview
    1m 59s
    UP NEXT
  • Playable
    2. 
    Introducing the Queue
    7m 49s
  • Locked
    3. 
    Queue Using Arrays - Is Full, Is Empty, and Size
    6m 2s
  • Locked
    4. 
    Queue Using Arrays - Enqueue
    7m 53s
  • Locked
    5. 
    Queue Using Arrays - Dequeue
    7m 7s
  • Locked
    6. 
    Queue Using Arrays - O(N) Enqueue and Peek
    7m 38s
  • Locked
    7. 
    Circular Queue - Is Full, Is Empty, and Enqueue
    8m 35s
  • Locked
    8. 
    Circular Queue - Dequeue and Peek
    8m 6s
  • Locked
    9. 
    Queue Using Linked Lists - Enqueue
    7m 34s
  • Locked
    10. 
    Queue Using Linked Lists - Dequeue and Peek
    6m 5s
  • Locked
    11. 
    Double-ended Queue
    10m 20s
  • Locked
    12. 
    Queue Using Two Stacks
    11m 28s
  • Locked
    13. 
    Built-in Stack and Queue
    5m 52s
  • Locked
    14. 
    The Priority Queue
    10m 47s
  • Locked
    15. 
    Course Summary
    1m 39s

EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

Skillsoft is providing you the opportunity to earn a digital badge upon successful completion of this course, which can be shared on any social network or business platform

Digital badges are yours to keep, forever.