Queues 4 Queue ADT You have already created and tested a queue class for strings. Now you have to convert it into templates, so it would work with any data type. To demonstrate the QueueADT class, create two queues: • the first queue contains the names of the students enrolled in CIS 220 the second queue contains the number of units each student is taking this quarter Write code in main to test these functions. Write a loop to enter an unknown number of names (assume one word strings). The loop stops when you enter #. As you are entering names, they are to be inserted into the first queue. To test the getLength function display the number of values in both queues, then write another loop to enter the number of units (double) into a parallel queue. Display the two queues in parallel. On the last two lines display the front element in the first queue and the rear element in the second queue respectively. Ex.: If the user enters Ann Tim Jamie Bob # for the first queue and 9 4.5 15 13.5 for the second queue, the output should be: Ann 9 Tim 4.5 Jamie 15 Bob 13.5 Ann 13.5 Ex.: If the user enters # the output should be: Empty queue! LAB ACTIVITY | *.0.1 v 4.6.1: Lab: Queues 4 Submission Instructions Downloadable files main. cpp Download Compile command g++ main. cpp -Wall -o a. out We will use this command to compile your code Upload your files below by dragging and dropping into the area or choosing a file on your hard drive. main. cpp QueueADT. h Drag file here Drag file here Choose on hard drive. Choose on hard drive.

Ihave an iphone 8plus should i get another phone like samsung note 9 or s9 ? ?

1. package newton’s method for approximating square roots (case study 3.6) in a function named newton. this function expects the input number as an argument and returns the estimate of its square root. the script should also include a main function that allows the user to compute square roots of inputs until she presses the enter/return key. 2. convert newton’s method for approximating square roots in project 1 to a recursive function named newton. (hint: the estimate of the square root should be passed as a second argument to the function.) 3. elena complains that the recursive newton function in project 2 includes an extra argument for the estimate. the function’s users should not have to provide this value, which is always the same, when they call this function. modify the definition of the function so that it uses a keyword parameter with the appropriate default value for this argument, and call the function without a second argument to demonstrate that it solves this problem. 4. restructure newton’s method (case study 3.6) by decomposing it into three cooperating functions. the newton function can use either the recursive strategy of project 1 or the iterative strategy of case study 3.6. the task of testing for the limit is assigned to a function named limitreached, whereas the task of computing a new approximation is assigned to a function named improveestimate. each function expects the relevant arguments and returns an appropriate value. 5. a list is sorted in ascending order if it is empty or each item except the last one is less than or equal to its successor. define a predicate issorted that expects a list as an argument and returns true if the list is sorted, or returns false otherwise. (hint: for a list of length 2 or greater, loop through the list and compare pairs of items, from left to right, and return false if the first item in a pair is greater.)

What is a scenario where records stored in a computer frequently need to be checked