Data Structures & Algorithms in Java: Working with Queues

Java    |    Intermediate
  • 15 videos | 1h 48m 55s
  • Includes Assessment
  • Earns a Badge
Rating 4.5 of 22 users Rating 4.5 of 22 users (22)
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

  • 1m 59s
  • 7m 49s
    After completing this video, you will be able to recall the basic characteristics of a queue. FREE ACCESS
  • Locked
    3.  Queue Using Arrays - Is Full, Is Empty, and Size
    6m 2s
    Learn how to perform simple operations using "Is Full," "Is Empty," and "Size" on a queue implemented using arrays. FREE ACCESS
  • Locked
    4.  Queue Using Arrays - Enqueue
    7m 53s
    Find out how to add elements to a queue implemented using arrays. FREE ACCESS
  • Locked
    5.  Queue Using Arrays - Dequeue
    7m 7s
    In this video, you will learn how to remove elements from a queue implemented using arrays. FREE ACCESS
  • Locked
    6.  Queue Using Arrays - O(N) Enqueue and Peek
    7m 38s
    After completing this video, you will be able to recall why enqueue is an O(1) operation in a queue implemented using arrays. FREE ACCESS
  • Locked
    7.  Circular Queue - Is Full, Is Empty, and Enqueue
    8m 35s
    Find out how to add elements to a queue implemented as a circular queue. FREE ACCESS
  • Locked
    8.  Circular Queue - Dequeue and Peek
    8m 6s
    In this video, find out how to remove elements from a queue implemented as a circular queue. FREE ACCESS
  • Locked
    9.  Queue Using Linked Lists - Enqueue
    7m 34s
    In this video, you will add elements to a queue implemented using linked lists. FREE ACCESS
  • Locked
    10.  Queue Using Linked Lists - Dequeue and Peek
    6m 5s
    During this video, you will learn how to remove elements and peek into a queue implemented using linked lists. FREE ACCESS
  • Locked
    11.  Double-ended Queue
    10m 20s
    Find out how to implement a double-ended queue. FREE ACCESS
  • Locked
    12.  Queue Using Two Stacks
    11m 28s
    In this video, you will learn how to build a queue using two stacks. FREE ACCESS
  • Locked
    13.  Built-in Stack and Queue
    5m 52s
    Find out how to use the built-in queues and stacks in Java. FREE ACCESS
  • Locked
    14.  The Priority Queue
    10m 47s
    In this video, you will learn how to use the priority queue and how to specify priorities using a comparator. FREE ACCESS
  • 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 on some of our courses, which can be shared on any social network or business platform.

Digital badges are yours to keep, forever.

YOU MIGHT ALSO LIKE

Audiobook Troubleshooting Java: Read, Debug, and Optimize JVM Applications
Course C++: Working with Sequence Containers
Rating 4.4 of 5 users Rating 4.4 of 5 users (5)
Course Advanced Data Structures & Algorithms in Java: Working with the Binary Heap
Rating 4.6 of 15 users Rating 4.6 of 15 users (15)

PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Course Mobile App Development: An Introduction to Android Development
Rating 4.5 of 83 users Rating 4.5 of 83 users (83)
Course Interfaces, Lambda Expressions, Collections, & Generics
Rating 4.4 of 152 users Rating 4.4 of 152 users (152)
Course Data Structures & Algorithms in Java: Introduction
Rating 4.5 of 100 users Rating 4.5 of 100 users (100)