Data Structures & Algorithms in Java: Working with Queues
Java
| Intermediate
- 15 videos | 1h 48m 55s
- Includes Assessment
- Earns a Badge
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 49sAfter completing this video, you will be able to recall the basic characteristics of a queue. FREE ACCESS
-
3. Queue Using Arrays - Is Full, Is Empty, and Size6m 2sLearn how to perform simple operations using "Is Full," "Is Empty," and "Size" on a queue implemented using arrays. FREE ACCESS
-
4. Queue Using Arrays - Enqueue7m 53sFind out how to add elements to a queue implemented using arrays. FREE ACCESS
-
5. Queue Using Arrays - Dequeue7m 7sIn this video, you will learn how to remove elements from a queue implemented using arrays. FREE ACCESS
-
6. Queue Using Arrays - O(N) Enqueue and Peek7m 38sAfter completing this video, you will be able to recall why enqueue is an O(1) operation in a queue implemented using arrays. FREE ACCESS
-
7. Circular Queue - Is Full, Is Empty, and Enqueue8m 35sFind out how to add elements to a queue implemented as a circular queue. FREE ACCESS
-
8. Circular Queue - Dequeue and Peek8m 6sIn this video, find out how to remove elements from a queue implemented as a circular queue. FREE ACCESS
-
9. Queue Using Linked Lists - Enqueue7m 34sIn this video, you will add elements to a queue implemented using linked lists. FREE ACCESS
-
10. Queue Using Linked Lists - Dequeue and Peek6m 5sDuring this video, you will learn how to remove elements and peek into a queue implemented using linked lists. FREE ACCESS
-
11. Double-ended Queue10m 20sFind out how to implement a double-ended queue. FREE ACCESS
-
12. Queue Using Two Stacks11m 28sIn this video, you will learn how to build a queue using two stacks. FREE ACCESS
-
13. Built-in Stack and Queue5m 52sFind out how to use the built-in queues and stacks in Java. FREE ACCESS
-
14. The Priority Queue10m 47sIn this video, you will learn how to use the priority queue and how to specify priorities using a comparator. FREE ACCESS
-
15. Course Summary1m 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
Rating 4.6 of 26 users
(26)
