import java-util-ArrayList- import java-util-Collections- import java-.pdf

•

0 likes•5 views

import java.util.ArrayList; import java.util.Collections; import java.util.List; import static java.lang.System.out; public class homework { public static void main(String[] args) { List<Integer> list = new ArrayList<>(); for (int i = 0; i < 10; i++) list.add(int) (Math.random()* 10) + 1); Collections.sort(list); System.out.println("The list id : " + list); int index =linearSearch(list, 10); if (index >+ 0) System.out.println("Linear search: the number 5 was found at index " + index); else System.out.println("Linear search: the number 5 is not found "); List<String> names = new ArrayList<>(); names.add("Tyson"); names.add("John"); names.add("Edgar"); names.add("LouLou"); Collections.sort(list); System.out.println("The names are : " + names); index = linearSearch(names, "JOhn"); if (index >= 0) System.out.println("Linear search: Edgar was found at index " + names); else System.out.println("Linear search: Edgar is not found" + names); } public static <E> int linearSearch(List<E> lsit, E data) { for (int i = 0; i < list.size(); i++) if (list.get(i).equals(data)) return i; return -1; } } Chapter 14 - Linear Search and Binary Search - Assignment Due Wednesday by 11:59pm P Points 100 Submitting a text entry box or a file upload Allowed Attempts 1 Available until Mar 1 at 11:59pm Modify the binarySearch method shown in the video lecture so that it's generic. Test it with at least two types to make sure it works. Hint 1: Examine the review problem and its solution, which modifies the linear search algorithm in the same way. Hint 2: Your binarySearch method signature should be: "private static < E extends Comparable > boolean binarySearch(List list, E data): Turn in the following, - The source files (no zip file, just the individual java files). - A screen shot of your program in action. It should show the result of the test run. .

Education

System.out.println("Linear search: the number 5 is not found ");
List<String> names = new ArrayList<>();
names.add("Tyson");
names.add("John");
names.add("Edgar");
names.add("LouLou");
Collections.sort(list);
System.out.println("The names are : " + names);
index = linearSearch(names, "JOhn");
if (index >= 0)
System.out.println("Linear search: Edgar was found at index " + names);
else

System.out.println("Linear search: Edgar is not found" + names);
}
public static <E> int linearSearch(List<E> lsit, E data) {
for (int i = 0; i < list.size(); i++)
if (list.get(i).equals(data))
return i;
return -1;
}
}
Chapter 14 - Linear Search and Binary Search - Assignment Due Wednesday by 11:59pm P
Points 100 Submitting a text entry box or a file upload Allowed Attempts 1 Available until Mar
1 at 11:59pm Modify the binarySearch method shown in the video lecture so that it's generic.
Test it with at least two types to make sure it works. Hint 1: Examine the review problem and its
solution, which modifies the linear search algorithm in the same way. Hint 2: Your binarySearch
method signature should be: "private static < E extends Comparable > boolean binarySearch(List
list, E data): Turn in the following, - The source files (no zip file, just the individual java files). -
A screen shot of your program in action. It should show the result of the test run.

Similar to import java-util-ArrayList- import java-util-Collections- import java-.pdf

Refer to my progress on this assignment below In this problem you will make it “more” object-oriented in the following ways: -You will change its name to SortedList -You will change the constructor that takes no arguments to be more traditional and initialize the member fields to dummy values. -You will add a constructor that takes in an initialized array and a size -You will add an insert function that adds a value to the list and maintains its sorted-ness -You will add a quicksort function check the below code. -You will make updates as necessary to the main function so that it still runs and tests your code. The code below seems to sort correctly but it skips over some items in the array and I am not sure what is happening. Please help! Thanks! import java.util.Scanner; class SortedList { private static int array[]; private static int n; public SortedList() { Scanner in = new Scanner(System.in); System.out.println(\"Enter number of elements\"); n = in.nextInt(); array = new int[n]; if(n == 0) { System.out.print(\"Since no arguments array set to: \"); } else { System.out.print(\"Creating array size \" + n + \": \"); } for(int i = 0; i < n; i++) { array[i] = 0; } //System.out.println(\"Enter \" + n + \" integers in ascending order\"); /*for (c = 0; c < n; c++) array[c] = in.nextInt();*/ for(int i = 0; i < n; i++) { System.out.print(array[i] + \" \"); } System.out.print(\"\ \"); } public SortedList(int a[], int size) { array = a; n = size; } public int binsearch(int search) { int first, last, middle; first = 0; last = n - 1; middle = (first + last)/2; while( first <= last ) { if ( array[middle] < search ) first = middle + 1; else if ( array[middle] == search ) { //System.out.println(search + \" found at location \" + (middle + 1) + \".\"); return middle+1;//+1 for the non-CS people who don\'t start counting at zero. } else last = middle - 1; middle = (first + last)/2; } return -1; //System.out.println(search + \" is not present in the list.\ \"); } public static int partition(int input[], int p, int r) { int pivot = input[r]; while(p < r) { while(input[p] < pivot) { p++; } while(input[r] > pivot) { r--; } if(input[p] == input[r]) { p++; } else if(p < r) { int tmp = input[p]; input[p] = input[r]; input[r] = tmp; } } return r; } public static void quicksort(int input[], int p, int r) { if(p < r) { int j = partition(input, p, r); quicksort(input, p, j-1); quicksort(input, j+1, r); } } public static void insert(int value, int cell) { array[cell] = value; quicksort(array, 0, n-1); } public static void main(String args[]) { int c; Scanner in = new Scanner(System.in); SortedList b = new SortedList(); System.out.println(\"Input numbers\"); for(int i = 0; i < n; i++) { c = in.nextInt(); in.nextLine(); insert(c, i); } in.close(); for(int j = 0; j < n; j++) { System.out.print(array[j] + \", \"); } } } Solution //the whole program that you wrote is correct except one line , when you call the quicksort everytime you insert a //value dont pass n pass the i.

Refer to my progress on this assignment belowIn this problem you w.pdf

arishmarketing21

JAVA LAB #8 - ARRAY BASED LISTS The next exercise is based on this implemetation for an UnorderedArrayList of integers: //Interface: ArrayListADT //works for int public interface ArrayListADT { public boolean isEmpty(); //Method to determine whether the list is empty. public boolean isFull(); //Method to determine whether the list is full. public int listSize(); //Method to return the number of elements in the list. public int maxListSize(); //Method to return the maximum size of the list. public void print(); //Method to output the elements of the list. public boolean isItemAtEqual(int location, int item); //Method to determine whether item is the same as the item in the list at location. public void insertAt(int location, int insertItem); //Method to insert insertItem in the list at the position public void insertEnd(int insertItem); //Method to insert insertItem at the end of the list. public void removeAt(int location); //Method to remove the item from the list at location. public int retrieveAt(int location); //Method to retrieve the element from the list at location. public void replaceAt(int location, int repItem); //Method to replace the element in the list at location with repItem. public void clearList(); //Method to remove all the elements from the list. public int search(int searchItem); //Method to determine whether searchItem is in the list. public void remove(int removeItem); //Method to remove an item from the list. } //Class: ArrayListClass implements //Interface: ArrayListADT public abstract class ArrayListClass implements ArrayListADT { protected int length; //to store the length of the list protected int maxSize; //to store the maximum size of the list protected int[] list; //array to hold the list elements //Default constructor public ArrayListClass() { maxSize = 100; length = 0; list = new int[maxSize]; } //Alternate Constructor public ArrayListClass(int size) { if(size <= 0) { System.err.println(\"The array size must be positive. Creating an array of size 100.\"); maxSize = 100; } else maxSize = size; length = 0; list = new int[maxSize]; } public boolean isEmpty() { return (length == 0); } public boolean isFull() { return (length == maxSize); } public int listSize() { return length; } public int maxListSize() { return maxSize; } public void print() { for (int i = 0; i < length; i++) System.out.print(list[i] + \" \"); System.out.println(); } public boolean isItemAtEqual(int location, int item) { if (location < 0 || location >= length) { System.err.println(\"The location of the item to be compared is out of range.\"); return false; } return list[location]== item; } public void clearList() { for (int i = 0; i < length; i++) list[i] = 0; length = 0; System.gc(); //invoke the Java garbage collector } public void removeAt(int location) { if (location < 0 || location >= length) System.err.println(\"The location of the item to be removed is out of range.\"); else { for(int i = location; i < length - 1; i++) list[i] = list[i + 1.

JAVALAB #8 - ARRAY BASED LISTSThe next exercise is based on this.pdf

arpaqindia

Java Generics

Zülfikar Karakaya

Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf

freddysarabia1

practical 9.docx

nilesh405711

I need help with this code working Create another project and add your jar file in this project. In the main method of App class of this second project test your MyArrayList class. It is mandatory to follow the instructions to get full credit. You need to perform the following actions. 1. Create five strings, A1",,'B2",,'C3",'D4",'E5" 2. Save these Strings in your MyArrayList 3. Print a message "Displaying List" 4. Display the list 5. Insert another String in your MyArrayList at location 2 6. Print a message "Inserting Item" 7. Display the list 8. Remove String at location 0 9. Print a message "Removing Item" 10. Display the list 11. Print a message "Setting a String" 12. Set a new String in location 1 13. Display the list 14. Check whether "D4" is present in the list or not, print an appropriate message 15. Find the index of "E5" in your list, print an appropriate message 16. Print a message "Emptying List" 17. Empty the list 18. Print the size of the list These steps check most of your MyArrayList functionality. I will also perform my own checks of your code while grading. Deliverable: a. Copy the utils.jar file in your project folder. b. Make a zip file of full project, not the src folder only or java files only. c. Submit the zip file. Grading Rubric: The project is not submitted as required: 0 points st.java J MyArrayList.java 2 J App.java 2 J MyFile.java 2 rc >J MyArrayList.java >q& MyArrayList > get(int) public class MyArrayList implements MyList \{ Object [] obj = new Object [1]; int size; public int size()\{ return size; \} public object get(int index) if (index <0 index >= size ){// throw new indexo return obj [index]; \} return index; // this should be deleted after public void add (Object 0 ) \{ //if this test fails there is a space in the array. // it will pass itself. if ( size == obj. length ){ Object [] obj2 = new 0 bject [obj. length 2]; for(int i=0;i<0bj. length; i++){ obj2[i]=obj [i] ; \} obj=obj2; \} obj [ size ]=0; size++; \} public void add(int index, Object o) \{ if(index > size || index <0 ) \{ throw new IndexOut0fBoundsException(index); \} if (size == obj. length ){ Object [] obj2 = new Object [obj. length 2 ]; for(int i=0;i<0bj. length; i++){ obj 2[i]=obj[i]; \} obj=obj2; \} if (index i=size;i>= index; i){ nhi [i=nhii1 : Ln 16, Col 56 Spaces: 4 UTF-8 LF \{\} Java In this lab you will add an interface to the MyUtils project, and implement it in your MyArrayList class in the MyUtils project. You will test the newly added functionality of your MyArrayList class in another project. The UML for the Interface is as follows S Description of methods Following method are self-explanatory: size(), get(int index), add (object o), remove (int index), and isEmpty). Below is the description of all other methods. void add(int index, Object o) inserts the given reference of object o at location index, making all entries move down a spot. void remove (Object o) removes the first occurrence of object o in the list, moving all entries .

I need help with this code working Create another project and add yo.pdf

fantoosh1

Aj unit2 notesjavadatastructures

Arthik Daniel

Oop lecture7

Shahriar Robbani

Array based based implementation of the List ADT: It uses an array of specific maximum length, and storage is allocated to before run time. public class ListArrayBased implements ListInterface { private static final int MAX_LIST = 50; private Object items[]; s private int numItems; public ListArrayBased() { items = new Object[MAX_LIST]; numItems = 0; } public boolean isEmpty() { return (numItems = = 0); } {return numItems; } { if (index >= 1 && index <= numItems) {return items[translate(index)]; } else {throws new ListIndexOutOfBoundsException(“index OutOfRange on get”); } } It is list of linear sequence of arbitary number of items together with the following procedures like createlist(): It is used to create an empty list Add(index,,item) remove(index) isempty get(index) size Solution Array based based implementation of the List ADT: It uses an array of specific maximum length, and storage is allocated to before run time. public class ListArrayBased implements ListInterface { private static final int MAX_LIST = 50; private Object items[]; s private int numItems; public ListArrayBased() { items = new Object[MAX_LIST]; numItems = 0; } public boolean isEmpty() { return (numItems = = 0); } {return numItems; } { if (index >= 1 && index <= numItems) {return items[translate(index)]; } else {throws new ListIndexOutOfBoundsException(“index OutOfRange on get”); } } It is list of linear sequence of arbitary number of items together with the following procedures like createlist(): It is used to create an empty list Add(index,,item) remove(index) isempty get(index) size.

Array based based implementation of the List ADT It uses an array o.pdf

anithacells

Please add-modify the following to the original code using C# 1- Delet.docx

Stewartt0kJohnstonh

1. import java.util.Scanner; public class Alphabetical_Order { public static void main(String[] args) { int n; String temp; Scanner s = new Scanner(System.in); n = 3; String names[] = new String[3]; Scanner s1 = new Scanner(System.in); System.out.println(\"Enter all the names:\"); for(int i = 0; i < n; i++) { names[i] = s1.nextLine(); } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (names[i].compareTo(names[j])>0) { temp = names[i]; names[i] = names[j]; names[j] = temp; } } } System.out.print(\"Names in Sorted Order:\"); for (int i = 0; i < n - 1; i++) { System.out.print(names[i] + \",\"); } System.out.print(names[n - 1]); } } 2. import java.util.Scanner; class prime { public static void main(String[] args) { int n,p; Scanner s=new Scanner(System.in); System.out.println(“Enter upto which number prime numbers are needed”); n=s.nextInt(); for(int i=2;i<=n;i++) { p=0; for(int j=2;j=1 && n<=10) break; } for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { System.out.print(i*j); } System.out.print(\'\ \'); } } } Solution 1. import java.util.Scanner; public class Alphabetical_Order { public static void main(String[] args) { int n; String temp; Scanner s = new Scanner(System.in); n = 3; String names[] = new String[3]; Scanner s1 = new Scanner(System.in); System.out.println(\"Enter all the names:\"); for(int i = 0; i < n; i++) { names[i] = s1.nextLine(); } for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (names[i].compareTo(names[j])>0) { temp = names[i]; names[i] = names[j]; names[j] = temp; } } } System.out.print(\"Names in Sorted Order:\"); for (int i = 0; i < n - 1; i++) { System.out.print(names[i] + \",\"); } System.out.print(names[n - 1]); } } 2. import java.util.Scanner; class prime { public static void main(String[] args) { int n,p; Scanner s=new Scanner(System.in); System.out.println(“Enter upto which number prime numbers are needed”); n=s.nextInt(); for(int i=2;i<=n;i++) { p=0; for(int j=2;j=1 && n<=10) break; } for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { System.out.print(i*j); } System.out.print(\'\ \'); } } }.

$1. import java.util.Scanner; public class Alphabetical_Order {.pdf$ $1. import java.util.Scanner; public class Alphabetical_Order {.pdf$

1. import java.util.Scanner; public class Alphabetical_Order {.pdf

Ankitchhabra28

output and explain There is Mylist; There is MyArrayList: package com.mycompany.myarraylist; import java.util.*; public class MyArrayList<E> implements MyList<E> { private class ArrayListIterator implements Iterator<E> { private int index; public ArrayListIterator() { index=0; } public boolean hasNext() { return index < size(); } public E next() { index++; return arr[index-1]; } public void remove() { throw new UnsupportedOperationException(); } } private E[] arr; private int logicalLength; public MyArrayList(int initCapacity) { arr = (E[]) new Object[initCapacity]; logicalLength = 0; } public MyArrayList() { this(4); } public boolean add(E e) { if(isFull()) grow(); arr[logicalLength] = e; logicalLength++; return true; } public void add(int index, E element) { if(isOutOfBounds(index)) throw new IndexOutOfBoundsException(index + " doesn't exist"); if(isFull()) grow(); for(int i=size()-1; i>=index; i--) arr[i+1] = arr[i]; arr[index] = element; logicalLength++; } public void clear() { logicalLength = 0; } public boolean contains(Object obj) { return indexOf(obj) != -1; } public boolean equals(Object obj) { if(!(obj instanceof MyArrayList)) return false; MyArrayList<E> another = (MyArrayList<E>)obj; if(size() != another.size()) return false; for(int i=0; i<size(); i++) if(! (arr[i].equals(another.arr[i]))) return false; return true; } public E get(int index) { if(isOutOfBounds(index)) throw new IndexOutOfBoundsException(index + " doesn't exist"); return arr[index]; } public E set(int index, E element) { if(isOutOfBounds(index)) throw new IndexOutOfBoundsException(index + " doesn't exist"); E answer = arr[index]; arr[index] = element; return answer; } public int indexOf(Object obj) { for(int i=0; i<size(); i++) if(arr[i].equals(obj)) return i; return -1; } public boolean isEmpty() { return size()==0; } public int size() { return logicalLength; } public Iterator<E> iterator() { return new ArrayListIterator(); } public int lastIndexOf(Object obj) { for(int i=size()-1; i>=0; i--) if(arr[i].equals(obj)) return i; return -1; } public E remove(int index) { if(isOutOfBounds(index)) throw new IndexOutOfBoundsException(index + " doesn't exist"); E data = arr[index]; for(int i=index+1; i<size(); i++) arr[i-1] = arr[i]; logicalLength--; return data; } public boolean remove(Object obj) { int index = indexOf(obj); if(index==-1) return false; remove(index); return true; } public String toString() { StringBuilder sb = new StringBuilder("[ "); for(int i=0; i<logicalLength; i++) { sb.append(arr[i]); if(i < logicalLength-1) sb.append(", "); } sb.append("]"); return sb.toString(); } private void grow() { int newCapacity = 2 * arr.length; E[] temp = (E[]) new Object[newCapacity]; for(int i=0; i<logicalLength; i++) temp[i] = arr[i]; arr = temp; } private boolean isFull() { return logicalLength == arr.length; } private boolean isOutOfBounds(int index) { return index<0 || index>=logicalLength; } public static void main(String[] args) { MyArrayList<Integer> list = new My.

output and explain There is Mylist There is MyArrayList pa.pdf

access2future1

import java.util.ArrayList; import java.util.Scanner;public clas.pdf

shettysachin2005

Write a program that creates a LinkedList object of 10 characters, then creates a second LinkedList object containing a copy of the first list, but in reverse order. Print out both LinkedListâ€™s starting with the first list in list order. Solution LinkedListTest.java import java.util.LinkedList; import java.util.Scanner; public class LinkedListTest { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub LinkedList<Character> list = new LinkedList<Character>(); Scanner scan = new Scanner(System.in); for(int i=1; i<=10; i++){ System.out.println(\"Enter Character \"+i+\" : \"); list.add(scan.next().charAt(0)); } System.out.println(\"Given Linked List is : \"+list); LinkedList<Character> reverseList = new LinkedList<Character>(); for(int i = list.size()-1; i>=0; i--){ reverseList.add(list.get(i)); } System.out.println(\"Reverse Linked List is : \"+reverseList); } } Output: Enter Character 1 : r Enter Character 2 : f Enter Character 3 : d Enter Character 4 : e Enter Character 5 : ws Enter Character 6 : a Enter Character 7 : c Enter Character 8 : b Enter Character 9 : h Enter Character 10 : j Given Linked List is : [r, f, d, e, w, a, c, b, h, j] Reverse Linked List is : [j, h, b, c, a, w, e, d, f, r] .

Write a program that creates a LinkedList object of 10 characters- the.docx

lez31palka

// ReverseList.java import java.util.ArrayList; public class ReverseList { // function to reverse arrylist public static void reverse(ArrayList list, int size) { for (int i = 0; i < size/2 ;i++ ) { Double temp = list.get(i); list.set(i, list.get(size-i-1)); list.set(size-i-1,temp); } } public static void main(String args[]){ ArrayList list = new ArrayList(); list.add(4.8); list.add(5.1); list.add(9.1); list.add(1.5); list.add(0.8); list.add(11.8); list.add(5.0); list.add(3.8); int size = list.size(); System.out.println(\"Original list:\"); for(Double number: list){ System.out.print (number + \" \"); } // reverse list reverse(list,size); System.out.println(\"\ \ After reversing the list:\"); for(Double number: list){ System.out.print (number + \" \"); } } } /* output: Original list: 4.8 5.1 9.1 1.5 0.8 11.8 5.0 3.8 After reversing the list: 3.8 5.0 11.8 0.8 1.5 9.1 5.1 4.8 */ Solution // ReverseList.java import java.util.ArrayList; public class ReverseList { // function to reverse arrylist public static void reverse(ArrayList list, int size) { for (int i = 0; i < size/2 ;i++ ) { Double temp = list.get(i); list.set(i, list.get(size-i-1)); list.set(size-i-1,temp); } } public static void main(String args[]){ ArrayList list = new ArrayList(); list.add(4.8); list.add(5.1); list.add(9.1); list.add(1.5); list.add(0.8); list.add(11.8); list.add(5.0); list.add(3.8); int size = list.size(); System.out.println(\"Original list:\"); for(Double number: list){ System.out.print (number + \" \"); } // reverse list reverse(list,size); System.out.println(\"\ \ After reversing the list:\"); for(Double number: list){ System.out.print (number + \" \"); } } } /* output: Original list: 4.8 5.1 9.1 1.5 0.8 11.8 5.0 3.8 After reversing the list: 3.8 5.0 11.8 0.8 1.5 9.1 5.1 4.8 */.

ReverseList.javaimport java.util.ArrayList;public class Rever.pdf

aryan9007

07 java collection

Abhishek Khune

import java.io.BufferedReader; import java.io.File; import java.io.FileReader; import java.io.IOException; import java.util.ArrayList; import java.util.List; import java.util.Scanner; public class FileEdit { public static List lines = new ArrayList(); public static void main(String[] args) throws IOException { Scanner s = new Scanner(System.in); System.out.print("EDIT: "); String fileName = s.nextLine(); BufferedReader br = new BufferedReader(new FileReader(new File(fileName))); String str=""; int count=0; while((str=br.readLine())!=null) { lines.add(count, str); System.out.println((++count) + "> "+ str); } String text=""; String command = ""; System.out.print((++count)+"> "); command=s.nextLine(); String commandArr[]; int flag; while(!command.equals("E")) { flag=0; commandArr = command.split("\\s"); if(commandArr[0].equals("I")) //Insertion { while(true) { if(commandArr.length==1&&flag!=2) { System.out.print((count)+"> "); text = s.nextLine(); insertLine(text,count-1); } else if(commandArr.length==2&&flag!=2) { System.out.print((commandArr[1])+"> "); count=Integer.parseInt(commandArr[1]); text = s.nextLine(); insertLine(text,Integer.parseInt(commandArr[1])-1); } else insertLine(text,count-1); System.out.print((++count)+"> "); command=s.nextLine(); commandArr = command.split("\\s"); if(commandArr[0].equals("I")||commandArr[0].equals("L")||commandArr[0].equals("D")||comm andArr[0].equals("E")) { flag=1; break; } else { flag=2; text=command; } } } else if(commandArr[0].equals("L")) //Listing { printList(); } else if(commandArr[0].equals("D")) //Deletion { if(commandArr.length==1) { deleteLine(count-1,count-1); } else if(commandArr.length==2) { deleteLine(Integer.parseInt(commandArr[1])-1,Integer.parseInt(commandArr[1])-1); } else if(commandArr.length==3) { deleteLine(Integer.parseInt(commandArr[1])-1,Integer.parseInt(commandArr[2])-1); } count=lines.size(); } if(flag!=1) { System.out.print((count++)+"> "); command = s.nextLine(); } } } public static void insertLine(String text,int count) { if (count >= lines.size()) { for(int i = lines.size(); i <= count; i++) { lines.add(null); } } lines.set(count,text); } public static void deleteLine(int start,int end) { for(int i=start;i<=end;i++) lines.remove(i); } public static void printList() { for(int i=0;i "+lines.get(i)); } } Here is my output: EDIT: textin.txt 1> The First Line 1> 2> And another line 3> I 3 3> The second line 4> One more line 5> L 1> null 2> null 3> The second line 4> One more line 5> D 2 3> L 1> null 2> The second line 3> One more line 4> E How can I keep it from printing "null" after ">" and it just be blank. I need the output to look like this: 1> The first line 2> 3> And another line 4> I 3 3> The second line 4> One more line 5> L 1> The first line 2> 3> The second line 4> One more line 5> And another line 5> D 2 4> L 1> The first line 2> The second line 3> One more line 4> And another line 5> E.

import java.io.BufferedReader;import java.io.File;import java.io.pdf

manojmozy

WAP to store 10 numbers in an array and find out the largest and the smallest...

One97 Communications Limited

I am stuck on parts E and F Exercise 1: NumberListTester.java Class NumberList implements a simple list of Integers, using an ArrayList. NumberListTester generates 10 random, positive, 2-digit ints, and adds them to the list. It then calls method printList which prints the items on the list. Run the program until you understand what it does. a. Write the body of the method printReversed, which prints the list items in reverse order. Add a statement in main to call printReversed after the call to printList. Check ______ b. Write the body of the method printEveryOther, which prints every other item on the list, beginning with the first one. In main, replace the statement that calls printReversed with one that calls printEveryOther. Check ______ c. Write the body of the method printEvens, which prints all the even-numbered ints on the list. In main, replace the statement that calls printEveryOther with one that calls printEvens. Check ______ All this printing is getting a bit tedious. Let\'s try some more fun operations. d. 0. Add a new ArrayList-of-integer instance variable called bigList to the NumberList class Add a statement to the NumberList constructor that creates an empty ArrayList object pointed to by bigList Delete the call to printEvens from main. Write the body of the method splitList, which copies all ints that are greater than or equal to 50 from aList to bigList. Add a method to the NumberList class to print bigList. Add a sequence of method calls in main to verify that the splitList method is working correctly. I.e., after calling splitList, call again the method that prints the original list and then call the method you wrote in step 4 to print the bigList. Check _____ E. Add a method insert to the NumberList class that takes two parameters of type int. The first parameter is the index at which to insert a new number into the list, and the second is the number to be inserted. E.g., if the first param is 4 and the second is 37, then 37 will be inserted at index 4 in aList (i.e., as the new 5th list element). The number inserted does not replace the number currently at that position, but is inserted just before it. Hint: The ArrayList class has a method that does exactly this. Call that method from your insert method. Now add statements to main to allow the user to specify the number to insert and the position at which to insert it. Then, after inserting the new number, print the updated list. Check _____ F. Finally, add code to your insert method that will assure that an IndexOutOfBoundsException cannot be thrown. I.e., your insert method should just print an appropriate error message if the first parameter --- the index at which to insert the new Integer --- is illegal. Hint: What are the legal indices for an ArrayList? What is the smallest? What is the largest? What about the special case of inserting a new value at the end of the list? Try it! Check _____ MY CODE SO FAR: import java.util.ArrayList ; import java.util.Random ; /.

I am stuck on parts E and FExercise 1 NumberListTester.java.pdf

RAJATCHUGH12

I am in need of homework help please. Thank you! For this assignment grade you will evaluate the similarities and differences between the AHIMA code of ethics and other health professionals. Overview: 1. Healthcare Information and Management Systems Society (HIMSS) https://www.ehra.org/resource-library/ehr-codeconduct 2. American Academy of Professional Coders (AAPC) https://www. aapc.com/aboutus/code-of- ethics.aspx 3. American Nurses Association (ANA) http://nursingworld.org/codeofethics 4. American College of Healthcare Executives (ACHE) http://ache.org/ABT_ACHE/code.cfm 5. National Association for Healthcare Quality (NAHQ) https://nahq.org/about/code-of-ethics To do: "Number your page from 1 to 5. *Compare the AHIMA code of ethics with the other health organizations above. "Formulate a closing statement..

i am looking for help on the method AddSorted and the method Copy only.pdf

sonunotwani

Similar to import java-util-ArrayList- import java-util-Collections- import java-.pdf (20)