Separate the codes files PLEASE Expert Q&ADonePLEASE seperate each source fileQueueADTQueueADTFor this assignment, Imagine people entering a Queueor a Line and wait for a service, and leaves the Queueor Line after getting the service.Implement in C++ a QueueADT that does the following:1. gets the input ( person's first name) from theuser (from the keyboard)2. inserts (represents as if the person is entering aqueue or to wait in line for a service) the firstname into the Queue (your Queue ADT must beable to have a maximum of 20 names)3. your QueueADT must have the behaviors ofinserting, removing, and retrieving & displayingthe Queue on the screen after each event(either entry of a name into the queue, ORremoving name of the person leaving from thequeue.NOTE:Your QueueADT must implement ALL the Mainbehaviors of a typical Queue Data structuresuch as inserting (or enqueueing), removing (ordequeueing), displaying, etc. and any otherhelper• Implement using the Object-Oriented paradigm(the way we did an ADT in the class showingmodularity)• Make sure your application/user/client programshows an example of the use of each of themethods in your class, at least once.• Make sure you connent appropriately• Make sure your program is indented properly• Use a struct where needed• NO PLGIARISM in ANY FORM. The instructormay ask questions and not give any points if youcannot answer questions on the your programyou submitted.• Please make sure you submit the three codefiles (*.h, *.cpp, and *Main.cpp).• NO links, NO zipped files, OR other format filessuch as pdf, word, etc. (POINTS WILL BETAKEN OFF or WILL GET ZERO points)• Only other format file that is allowed is thescreen shots in (picture format)

Step 1: Create header file QueueADT.h that contains the declaration of class QueueADT with…

For this assignment, Imagine people entering a Queue or a Line and wait for a service, and leaves the Queue or Line after getting the service. Implement in C++ a QueueADT that does the following: 1. gets the input ( person's first name) from the user (from the keyboard) 2. inserts (represents as if the person is entering a queue or to wait in line for a service) the first name into the Queue (your Queue ADT must be able to have a maximum of 20 names) 3. your QueueADT must have the behaviors of inserting, removing, and retrieving & displaying the Queue on the screen after each event (either entry of a name into the queue, OR removing name of the person leaving from the queue.

For this assignment, Imagine people entering a Queue or a Line and wait for a service, and leaves the Queue or Line after getting the service. Implement in C++ a QueueADT that does the following: 1. gets the input ( person's first name) from the user (from the keyboard) 2. inserts (represents as if the person is entering a queue or to wait in line for a service) the first name into the Queue (your Queue ADT must be able to have a maximum of 20 names) 3. your QueueADT must have the behaviors of inserting, removing, and retrieving & displaying the Queue on the screen after each event (either entry of a name into the queue, OR removing name of the person leaving from the queue.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

What would be a way in implementing the Josephus problem in C++ using a vector or a list? That takes in three parameters, one the number of knights for the knight parameter. The second parameter, "skip", is the number of knights to skip and to execute the next night. Then the third parameter "start", is the index of the knight to execute first.
Write a program in c++ and make sure it works, that reads a list of students (first names only) from a file. It is possible for the names to be in unsorted order in the file but they have to be placed in sorted order within the linked list.The program should use a doubly linked list.Each node in the doubly linked list should have the student’s name, a pointer to the next student, and a pointer to the previous student. Here is a sample visual. The head points to the beginning of the list. The tail points to the end of the list. When inserting consider all the following conditions:if(!head){ //no other nodes}else if (strcmp(data, head->name)<0){ //smaller than head}else if (strcmp(data, tail->name)>0){ //larger than tail}else{ //somewhere in the middle} When deleting a student consider all the following conditions:student may be at the head, the tail or in the middleBelow, you will find a sample of what the file looks like. Notice the names are in…
write a c++ code using stack,linked list. In quiz game, questions are chosen in such a a way that they cover all fields of a typical quiz contest. The user’s general knowledge is tested with quiz questions regarding science, technology, movies, sports, general health, geography and many more. Quiz Game Project Introduction: Functions of projects and below is some function used in project:- Edit score--adds the prize won to the previous one upon giving the right answer to a question Help-- menu with game summary and rules Show record--shows the highest cash prize won by a particular user Show score--to view the highest score Reset score--to reset the highest score/ default In quiz game project, we can store the user’s name, view the highest score secured by a user, and even reset the score. The game ends when the user’s cash prize piles up to 1000 RS. For each question there are 4 options A, B, C and D and no negative markings. so, money would not be…
Assume q1 is a queue created in the main and q2 is created in a block scope and we write q2=q1 and in the main function we print the items of the q1, if no operator= overload method then then Select one: a. The q1 has the same items of q2 b. The q1 items becomes rubbish c. The q1 becomes empty d. The q1 was not changed
in c++ Write a function that takes a queue with 20 integer values and deletes the elements thatare between 15 and 20. In other words, only the elements less than 15 or greater than 20remain in the queue. This means that you need to have an auxiliary queue to store theelements between 15 and 20 and restore them back to the original queue.
Java Programming In your program, you will demonstrate an understanding of all these concepts by developing your own priority queue, node, binary tree, array and/or linked list, and use of recursion to support the Huffman Code encryption algorithm. Read through the theory of the Huffman Code in the text and then write a program that can take a String and encrypt it. For example, given a String “Hello World”, the program should apply the Huffman Code algorithm on that String to create the corresponding encrypted code sequence. In addition, you must be able to show the various components that support creating the encrypted String. For the Huffman Code, this requires the following: Creating a frequency table for each character of the String (I suggest this to be an array but can be done as a linked list) Creating a Huffman Tree from the frequency table (This will require use of a priority queue and a binary tree) Creating the Huffman Code table (This should be an array and will…
How did you decide to handle the possibility of queue underflow in java? A. Assume as a precondition that it will not occur. B. Provide an isEmpty operation so a client can prevent underflow. C. Ignore it. D. Throw a QueueUnderflowException if it occurs. E. Throw a QueueUnderflowException if it occurs, and provide an isEmpty operation so a client can prevent underflow
Hi, asked a question earlier regarding the following problem! So sorry, I was able to understand the explanation of the expert, however the code was in C++ which I am still unfamiliar with. Wanted to ask how we can go about solving this problem in java? Question: You have probably heard about the deque (double-ended queue) data structure, which allows for efficient pushing and popping of elements from both the front and back of the queue. Depending on the implementation, it also allows for efficient random access to any index element of the queue as well. Now, we want you to bring this data structure up to the next level, the teque (triple-ended queue)! The teque supports the following four operations: push_back x: insert the element ?x into the back of the teque. push_front x: insert the element ?x into the front of the teque. push_middle x: insert the element ?x into the middle of the teque. The inserted element ?x now becomes the new middle element of the teque. If ?k is the…
c++ a Queue Class that allows users to push strings or integer values into it. For example, when running the following code: SpecialQueue Q; Q.push("Albert"); Q.push("Jose"); Q.push(123); Q.pop(); Q.pop(); Q.pop(); The output should be: Albert Jose 123 Submit a TEXT file that contains your class. By class, I mean everything EXCEPT your main function. DO NOT SUBMIT YOUR MAIN().
The list (a b c) , write a Racket operation which, when interpreted, returns ‘(a b c ((a) b c) a b c). Put the code that does this here:
Write a program in C/C++ that takes a password of ‘n’ length from the standard input terminal and returns the number of characters in the password. Use ‘#’ in your code to indicate the end of the password. Note that ‘#’ is not a part of the password Your program must use linked list to store the characters of the password entered by the user. Your program must use a recursive function to determine the length of the password. Your output format should be as shown in the test runs Your program must contain the following user-defined functions: - makeList – this function creates a linked list from the user input. - listCount – this function is a recursive function that determines and returns the length of the password recursively. - printList – this function prints the user inputted password. Test Run 1: Password can be alphanumeric value. '#' indicates the end of the password. Enter your password: R5ad# The password your entered: R5ad Password length: 4 Test Run 2:…
Can you please help update this? //A6Utilities.java import java.io.IOException;import java.nio.file.Files;import java.nio.file.Paths;import java.security.SecureRandom;import java.util.List;import java.util.TreeMap;import java.util.function.Function;import java.util.stream.Collectors;public class A6Utilities {/*** Returns the corresponding letter grade. Don't modify this method, simply use it when converting single* grades to their equivalent letter grade** @param grade the integer grade to convert* @return the letter grade equivalent to the integer grade*/private static char letterGrade(final int grade) {if (grade < 0) return '?';else if (grade < 60) return 'F';else if (grade < 70) return 'D';else if (grade < 80) return 'C';else if (grade < 90) return 'B';else if (grade <= 100) return 'A';else return '?';}/*** The method uses Java Streams only. Don't use any looping structures, conditional statements are OK (IF, TERNARY, SWITCH)* <p>* Generates a list of secure…