isFull operation when using the ArrayBoundedQueue

veswiti]za ILIQses it 10) Recall that in an ordered list L, the elements are stored in such a way that for any two positions i and j, if i

public ArrayList<Integer> depthFirstTraversal(int[][] adjacency_matrix, int source){//A matrix and a source index is passed in//The traversal will be performed on this matrix and begin from the source index //Stack is created//This stack will be used to process nodes in LIFO order when an unvisited node is foundStack<Integer> stack = new Stack<>();int numNodes = adjacency_matrix.length; //boolean array is created//This array will have a slot for each node//Whenever an unvisited node is visited it's slot in this array will be markedboolean[] visited = new boolean[numNodes]; //This variable will hold the index of the element currently being analyzedint element; //The result of the traversal will be stored in this arraylistArrayList<Integer> traversal = new ArrayList<Integer>(); //Since the source index is passed in it has already been visitedvisited[source] = true; //The source index is added to the queue to continue processing itstack.push(source); while…

Objectives: The code for the different stack and queue operations in both implementations (array and linked list) are discussed in the lectures: and are written in the lectures power point. So the main object of this assignment is to give the student more practice to increase their understanding of the different implementation of these operations. - The students also are asked to write by themselves the main methods in the different exercises below; The Lab procedures: The following files must be distributed to the students in the Lab - arrayImpOfStack.java // it represents an array implementation of the stack. - pointerImOfStack.java // it represents a Linked List implementation of the stack. - pointerImOfQueue.java // it represents a pointer implementation of the queue. Then the students by themselves are required to write the code for the following questions Ex1) Given the file arrayImpOfStack.java then write a main method to read a sequence of numbers           and using the stack…