Course Outline

Introduction

  • Definition of a Queue
  • Applications of Queue Data Structures in Public Sector Operations
  • Variations: Priority Queue, Deque, and Circular Queue

Queue Implementation for Government

  • Implementing Queues Using Stacks
  • Implementing Least Recently Used (LRU) Cache
  • Implementing Stacks Using Queues
  • Implementing Deques
  • Priority Queues

Standard Queue Problems for Government

  • Determining if a Queue Can Be Sorted into Another Queue
  • Utilizing Breadth-First Search (BFS) in Graphs
  • Level Order Tree Traversal
  • Reversing a Path in a Binary Search Tree (BST)
  • Constructing a Complete Binary Tree
  • Implementing Page Replacement Algorithms
  • Verifying the Completeness of a Binary Tree
  • Zigzag Tree Traversal
  • FIFO vs. LIFO: Understanding Queue and Stack Operations

Operations on Queues for Government

  • Reversing a Queue
  • Interleaving the First Half of the Queue with the Second Half
  • Sorting a Queue Without Additional Space

Additional Queue Operations for Government

  • Level Order Traversal in Spiral Form
  • Finding the Largest and Smallest Multiple
  • The Iterative Method of Finding the Height of a Binary Tree
  • Implementing Priority Queues Using Comparators in Java
  • Determining the Maximum Level Sum in a Binary Tree
  • A Queue-Based Approach for Identifying the First Non-Repeating Character in a Stream

Summary and Next Steps for Government

Requirements

  • Fundamental understanding of an object-oriented programming language

Audience

  • Software developers for government
 7 Hours

Number of participants


Price per participant

Testimonials (2)

Upcoming Courses

Related Categories