Project information

• Category: System
• Completion Date: December 10, 2020
• Technologies Used: C++
• GitHub URL: Scheduler Repo

This system is designed to manage a collection of printer jobs efficiently. It utilizes a priority queue data structure called a min-heap, where jobs with higher priority (lower numerical value) are given precedence. Each job is represented as an object with attributes such as the number of pages, original position, and position change. The system includes functions for inserting jobs into the priority queue, extracting the highest priority job, and performing operations like swapping elements and printing the queue. The main program drives the system by generating random jobs, processing them through the priority queue, and calculating statistics on job positions for analysis and reporting. Overall, it provides a robust framework for printer job management and analysis.