Data Structures & Algorithms in Java: Working with Stacks

Java SE 13    |    Intermediate
  • 13 Videos | 1h 34m 8s
  • Includes Assessment
  • Earns a Badge
Likes 29 Likes 29
The stack in Java allows us to access data in a last in, first out manner and in the best case scenario, both of these operations are performed in constant time. In this course, you'll get started by examining the behavior and characteristics of the stack data structure. The stack is often referred to as LIFO - or last in, first out - since the last element that you push on to a stack is the first element that you access. You'll learn how you can implement the stack data structure using arrays and linked lists and how to assess the trade-offs between these two implementations. Lastly, you'll see how to write code to perform common operations on a stack such as push(), pop(), and peek() and how to assess the running time for each of these operations.

WHAT YOU WILL LEARN

  • discover the key concepts covered in this course
    recall the basic characteristics of the stack data structure
    perform simple operations on a stack implemented using arrays
    push new elements on to a stack implemented using arrays
    pop elements from a stack implemented using arrays
    peek into a stack implemented using arrays
    push new elements on to a stack implemented using linked lists
  • pop elements from and peek into a stack implemented using linked lists
    set up the basic interface for the Command object
    implement undo using stacks and the Command object
    check for well formed arithmetic expressions using stacks
    find the minimum element in constant time in a stack
    summarize the key concepts covered in this course

IN THIS COURSE

  • Playable
    1. 
    Course Overview
    1m 59s
    UP NEXT
  • Playable
    2. 
    Introducing the Stack
    10m 7s
  • Locked
    3. 
    Stack Using Arrays - Is Empty, Is Full, and Size
    6m 52s
  • Locked
    4. 
    Stack Using Arrays - Push
    4m 37s
  • Locked
    5. 
    Stack Using Arrays - Pop
    8m 21s
  • Locked
    6. 
    Stack Using Arrays - Peek
    3m 57s
  • Locked
    7. 
    Stack Using Linked Lists - Push
    9m 8s
  • Locked
    8. 
    Stack Using Linked Lists - Pop and Peek
    6m 14s
  • Locked
    9. 
    Stack Problems - The Command Design Pattern
    5m 56s
  • Locked
    10. 
    Stack Problems - Implementing Undo
    9m 14s
  • Locked
    11. 
    Stack Problems - Matching Parenthesis
    10m 29s
  • Locked
    12. 
    Stack Problems - Minimum Element in Constant Time
    10m 6s
  • Locked
    13. 
    Course Summary
    1m 36s

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.

YOU MIGHT ALSO LIKE