create a linked list queue in c++ by following all the instruction in the image below 1. Create a class called Job (comprising an ID for the job, the name of the user who submitted it, and thenumber of pages).2. Create a class called Printer. This will provide an interface to add new jobs and process all the jobs addedso far.3. To implement the printer class, it will need to store all the pending jobs. We'll implement a very basicstrategy - first come, first served. Whoever submits the job first will be the first to get the job done.Finally, simulate a scenario where multiple people are adding jobs to the printer, and the printer isprocessing them one by one.4.

1. Create a class called Job (comprising an ID for the job, the name of the user who submitted it, and the number of pages). 2. Create a class called Printer. This will provide an interface to add new jobs and process all the jobs ad so far. 3. To implement the printer class, it will need to store all the pending jobs. We'll implement a very basic strategy - first come, first served. Whoever submits the job first will be the first to get the job done. Finally, simulate a scenario where multiple people are adding jobs to the printer, and the printer is 4.

1. Create a class called Job (comprising an ID for the job, the name of the user who submitted it, and the number of pages). 2. Create a class called Printer. This will provide an interface to add new jobs and process all the jobs ad so far. 3. To implement the printer class, it will need to store all the pending jobs. We'll implement a very basic strategy - first come, first served. Whoever submits the job first will be the first to get the job done. Finally, simulate a scenario where multiple people are adding jobs to the printer, and the printer is 4.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a c++ code for comparing the times to traverse a list (containing a large number of elements) implemented in an array, in a simple linked list, and in an unrolled linked list.
Write a C++ code using C++ STL to a. Create 2 lists first list of size 3 and second with size 2 elements in each list. (elements inserted in 2 list are scanned from user) b. Reverse each list using stack. c. Store the two lists in a queue d. Print queue without deleting elements in it
In Haskell, use list comprehension to return all the numbers greater than 18 and divisible by 2 in the list [12, 24, 25, 28, 30, 33, 35] Write a Haskell function that takes a list and an integer n as parameters and returns the nth item in the list. EX. [1,2,3,4] 2 gives 3 and [1,2,3,4] 1 gives 2
Question 4 Write a C++ program to implement a queue using a linked list as data structure. The queue must allow to store any record type consist of up to two data only. Your program must implement the following operations: • Insert a record in the queue. Retrieve the first record in the queue. Retrieve the last record in the queue. Return the number of records in the queue.
Stack ADT Implement a program in C++ that has the following three parts and each does the following: 1. Implements in C++, the specification of a Stack ADT with all the Main and Helper behaviors (save the file as StackADT.h) 2. Implements in C++, all the necessary methods (behavior) of the StackADT (save the file as StackADT.cpp) 3. Implements in C++, a main function (the client or application program) that creates and uses Stack objects (save the file as StackMain.cpp). This main function should be able to do the following: a. It should be able to read a given text file as input, b. It should be able to get each input value from the input file (one word at a time) and store it (push) on the StackADT object until it stores all the words from the input file. c. It should be able to retrieve an item from the stack and 1) display it on the screen, as well as 2) write it to an output file, and then delete (pop) that item from the stack, and repeat this process until it retrieves all the…
Merging and Sorting Two Unsorted Stacks in C++.(Please write in the simplest way).
L
We need to add the first two digits and return the sum as a linked list. Please do code in c++ Output and screenshot of code is necessary. Logic diagram given below. Example 1: Input 12 = 2 5 11 = [2,4,3] Output 7 [5,6,4] [7,0,8] 6 0 3 8
We need to add the first two digits and return the sum as a linked list. Please do code in c++ Output and screenshot of code is necessary. Logic diagram given below. Example 1: Input 11 = 12 = 2 5 [2,4,3] Output 7 [5,6,4] [7,0,8] 6 3 8
Write a C++ program that uses a sorted list to implement a priority queue.
Write a program in C language to create a singly linked list as shown below and print it in the output. 1->2->3->4->5
Create a medium C++ code to implement some stack operations using the singly linked list. - Push 5 elements to the list assuming the list is empty. - delete at least one element from the list.