Write code for circular queues method (Deque) using array data structure which should: Delete the element from array(queue) from front and vacate space for new element to insert (Not Replace). Hint: Make a new queue to store remaining elements at previous positions of queue. Please consider above scenario as problem is above scenario otherwise the other method is clear. Please!!! (Code in C++ Don't use pointers)

Please use easy logic with proper indentations and comments for understanding!. Coding should be in C++. 3. Define a class which stores up to 10 integer values in an array.  The class should also define the following 4 public methods:       setNumber – accepts an integer value to store in the array.  The value is stored in the next available element of the array (first call to the method stores the value in element 0 with the second call storing the value in element 1.) The method returns true if there is room in the array and the integer was successfully stored.  Returns false otherwise.        clear – removes all values from the array so that the array can be reused.     displayNumbers – displays the values currently stored in the array.     getStats – determines the largest, smallest, and average of the values currently stored in the array.  These values are returned to the caller via reference parameters. All methods should produce correct results regardless of the order in which…

Please,help me by providing C++ programing solution. Do not use the LinkedList class or any classes that offers list functions. Implement a LinkList in C++. Pease,implement with an ItemType class and a NodeType structThe program should read a data file,and the data file has two lines of data as follow:100, 110, 120, 130, 140, 150, 160100, 130, 160The program will first add all of the numbers from the file,then display all of them,then delete.

You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…

in C++  Write a method ‘void addBack(double x)’ that adds value x to the back of a linked list. Assume you have access to a ‘head’ pointer pointing to the first node in the list.  Please note that you do NOT have a tail pointer.  Be sure to check for any special cases.

Need help making a java file that combines both linearSearch and binarySearch •Both search methods must use the Comparable<T> interface and the compareTo() method.•Your program must be able to handle different data types, i.e., use generics.•For binarySearch, if you decide to use a midpoint computation formula that is different fromthe textbook, explain that formula briefly as a comment within your code. //code from textbook //linearSearch public static <T>    boolean linearSearch(T[] data, int min, int max, T target) {        int index = min;        boolean found = false;        while (!found && index <= max) {            found = data [index].equals(target);            index++;        }        return found;    } //binarySearch     public static <T extends Comparable<T>>    boolean binarySearch(T[] data, int min, int max, T target) {        boolean found = false;        int midpoint = (min + max)/2;        if (data[midpoint].compareTo(target)==0)…