This is a java question Given an efficient circular bent array-based queue q capable of holding 7 objects. Show the final contents of the array after the following code is executed: for (int k = 1; k <= 6; k++) q.enqueue(k); for (int k = 1; k <= 3; k++) { q.dequeue( ); q.enqueue(q.dequeue( )); }

Question 1 Analyze the following code: import java.util.*: public class Test { public static void main (String[] args){ PriorityQueue queue = new PriorityQueue( Arrays.asList (60, 10, 50, 30, 40, 20)): while (!queue.isEmpty()) System.out.print(queue.poll () + " "); O The program displays 10 20 30 40 50 60 O The program displays 60 50 40 30 20 10 The program displays 60 10 50 30 40 20 O There is no guarantee that the program displays 10 20 30 40 50 60 A Moving to the next question prevents changes to this answer

public class ArraySection {     static void arraySection(int a[], int b[]) {        int k =  0;        int [] c = new int[a.length];        for(int i = 0; i < a.length; i++) {            for(int j = 0; j < b.length; j++)                if(a[i] == b[j])                    c[k++] = a[i];                                        }        for(int i = 0; i < k; i++)            System.out.println(c[i]);            System.out.println();    }    public static void main(String[] args) {         int a[] = { 1, 2, 3, 4, 5 };        int b[] = { 0, 2, 4,5 };                        arraySection(a,b);        }}   Calculate the algorithm step number and algorithm time complexity of the above program?

Java programming homework please help

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…

int sum, k, i, j; int x[4] [4]={1,2,3,4}, {5,6,7,8},{9,8,7,3},{2, 1,7,1}; sum=x[0] [0]; for (k=1; k<=3;k++) sum+=x[k] [k]; Give the value in sum after the statements are executed:

1. Write a linear (0(n)) running time complexity program in Java to find all the dominant elements in the given array of n distinct integer elements. An element is a dominant element if it is greater than all the elements to its right side. The rightmost element in the array is always a dominant element. For example, in the array {16, 17, 4, 3, 5, 2}, dominant elements are 17, 5 and 2. 2. Prove that your algorithm takes (0(n)) running time to compute this task. Formulate the sum equation for this proof.