7. What is output by the following code section? QueueInterface aQueue = new QueueReference Based(); int numl, num2; for (int i = 1; i <= 5; i++) { aQueue.enqueue(i); } // end for for (int i = 1; i <= 5; i++) { numl= (Integer) aQueue.dequeue (); num2 = (Integer) aQueue.dequeue (); aQueue.enqueue (numl + num2); aQueue.enqueue (num2 numl); } // end for while (!aQueue.isEmpty()) { System.out.print (aQueue.dequeue () + " "); } // end for

struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };

Every time you write a non-const member function for a linked list, you should always think about if that function is preserving your class invariants. Group of answer choices A. True B. False

please fix code to match "enter patients name in lbs"   thank you import java.util.LinkedList;import java.util.Queue;import java.util.Scanner; interface Patient {     public String displayBMICategory(double bmi);     public String displayInsuranceCategory(double bmi);} public class BMI implements Patient {     public static void main(String[] args) {         /*         * local variable for saving the patient information         */        double weight = 0;        String birthDate = "", name = "";        int height = 0;        Scanner scan = new Scanner(System.in);        String cont = "";        Queue<String> patients = new LinkedList<>();         // do while loop for keep running program till user not entered q        do {             System.out.print("Press Y for continue (Press q for exit!) ");            cont = scan.nextLine();            if (cont.equalsIgnoreCase("q")) {                 System.out.println("Thank you for using BMI calculator");                break;…

In C++.

When an element is removed from a queue, where is it removed from?

For any element in keysList with a value greater than 50, print the corresponding value in itemsList, followed by a comma (no spaces). Ex: If the input is: 32 105 101 35 10 20 30 40 the output is: 20,30, 1 #include 2 3 int main(void) { const int SIZE_LIST = 4; int keysList[SIZE_LIST]; int itemsList[SIZE_LIST]; int i; 4 6 7 8 scanf("%d", &keysList[0]); scanf ("%d", &keysList[1]); scanf("%d", &keysList[2]); scanf("%d", &keysList[3]); 10 11 12 13 scanf ("%d", &itemsList[0]); scanf ("%d", &itemsList[1]); scanf("%d", &itemsList[2]); scanf ("%d", &itemsList[3]); 14 15 16 17 18 19 /* Your code goes here */ 20 21 printf("\n"); 22 23 return 0; 24 }

#include <iostream> using namespace std; #define SIZE 5   //creating the queue using array int A[SIZE]; int front = -1; int rear = -1;   //function to check if the queue is empty bool isempty() { if(front == -1 && rear == -1) return true; else return false; }   //function to enter elements in queue void enqueue ( int value ) { //if queue is full if ((rear + 1)%SIZE == front)    cout<<"Queue is full \n"; else {  //now the first element is inserted  if( front == -1)     front = 0; //inserting element at rear end rear = (rear+1)%SIZE;   A[rear] = value; } }   //function to remove elements from queue void dequeue ( ) { if( isempty() )  cout<<"Queue is empty\n"; else //only one element if( front == rear )  front = rear = -1; else  front = ( front + 1)%SIZE; }   //function to show the element at front void showfront() { if( isempty()) cout<<"Queue is empty\n"; else cout<<"element at front is:"<<A[front]; }   //function to display the queue void…

b. Write out the order of elements that are contained in a queue after the following operations are performed. myQueue.enqueue(new Integer(16)); myQueue.enqueue(new Integer(12)); Integer num1 = myQueue.dequeue(); myQueue.enqueue(new Integer(6)); myQueue.enqueue(new Integer(8)); myQueue.enqueue(new Integer(30)); myQueue.enqueue(new Integer(24)); myQueue.enqueue(new Integer(18)); myQueue.dequeue(); myQueue.dequeue(); myQueue.dequeue(); myQueue.enqueue(new Integer(38); Show how step by step process of arriving at your answer.

Given the following code, assume the myQueue object is a queue that can hold integers and that value is an int variable.1   myQueue.enqueue(0);2   myQueue.enqueue(1);3   myQueue.enqueue(2);4   myQueue.dequeue(value);5   Console.WriteLine(value);Assume that the dequeue function, called on line 4, stores the number removed from the queue in the value variable. What will the statement on line 5 display? Question 43 options:   a)  2   b)  0   c)  1   d)  none of these