Write a Console Java program that inserts 25 random integers in the range of 0 to 100 into a Linked List. (Use SecureRandom class from java.security package. SecureRandom rand = new SecureRandom(); - creates the random number object rand.nextInt(100) - generates random integers in the 0 to 100 range) Using a ListItreator output the contents of the LinkedList in the original order. Using a ListItreator output the contents of the LinkedList in the reverse order.

Define stubs for the functions get_user_num() and compute_avg(). Each stub should print "FIXME: Finish function_name)" followed by a newline, and should return -1. Each stub must also contain the function's parameters. Sample output with two calls to get_user_num() and one call to compute_avg(): FIXME: Finish get_user_num() | FIXME: Finish get_user_num() FIXME: Finish compute_avg() Avg: -1 354684.2266598.qx3zgy7 2 Your solution goes here ''' 4 user_num1 5 user_num2 6 avg_result get_user_num() get_user_num) compute_avg(user_num1, user_num2) 8 user_num1 9 user_num2 10 avg_result %3D 11 12 print('Avg:', avg_result)

USING THE FOLLOWING METHOD SWAP CODE: import java.util.*; class ListIndexOutOfBoundsException extends IndexOutOfBoundsException {     public ListIndexOutOfBoundsException(String s) {         super(s);     } } class ListUtil {     public static int maxValue(List<Integer> aList) {         if(aList == null || aList.size() == 0) {             throw new IllegalArgumentException("List cannot be null or empty");         }         int max = aList.get(0);         for(int i = 1; i < aList.size(); i++) {             if(aList.get(i) > max) {                 max = aList.get(i);             }         }         return max;     }     public static void swap(List<Integer> aList, int i, int j) throws ListIndexOutOfBoundsException {         if(aList == null) {             throw new IllegalArgumentException("List cannot be null");         }           if(i < 0 || i >= aList.size() || j < 0 || j >= aList.size()) {             throw new ListIndexOutOfBoundsException("Index out…

What is the best way to implement a stack or a queue so that it can hold an arbitrary number of elements? Select one: a. Using an array, and throwing an exception when the stack or queue is full. b. By creating a bigger array when the stack or queue is full, and copying the elements from the original array. c. Using linked lists to store the collection of elements.

In Java please help with the following:   Sees whether this list is empty.@return True if the list is empty, or false if not. */ public boolean isEmpty(); } // end ListInterface Hint:Node class definition should look something like: public class Node<T> { T element; Node next; Node prev; public Node(T element, Node next, Node prev) { this.element = element;this.next = next;this.prev = prev; } }

Given that an ArrayList of Strings named friendList has already been created and names have already been inserted, write the statement necessary to change the name "Tyler", stored at index 8, to "Bud".     This is needed in Java

Review the Wireshark TCP data flow shown here: Host A -- SYN --> Host B Seg =0 Ack = 919412342 Host A Host B Seq = 1 Ack = 1 Host A PSH, ACK Len: 512 --> Host B Seg = 1 Ack = 1 --- Host A Host B Seg = 901 Ack = 1342 --- Host A Host B Seq = 901 Ack = 2992 --- Host A <--- ACK Len: 1452 --- Host B Seq = 2992 Ack = 901 Which of the following statements is correct and represents the next appropriate acknowledgment from Host A? C. Sequence number 4444, Acknowledgment number 901 Selected Answer: Answers: A. Sequence number 2993, Acknowledgment number 901 B. Sequence number 901, Acknowledgment number 2993 C. Sequence number 4444, Acknowledgment number 901 Activate D. Sequence number 901, Acknowledgment number 4444 Go to Setti

This is using Data Structures in Java

// The language is java, please take a screenshot of your output, and make sure your code is run.

IN JAVA PLEASE, need help finding an element in the list     /**     * Returns whether the given value exists in the list.     * @param value - value to be searched.     * @return true if specified value is present in the list, false otherwise.     */     public int indexOf(int value) {        //Implement this method                return -1;    }