Write an application class (ArrayListApplication) that contains a main.docx
•Download as DOCX, PDF•
0 likes•2 views
Write an application class (ArrayListApplication) that contains a main(...) method. The method must perform the following. • Prompt user for 10 names and store in an \"ArrayList\" object • Shuffle the names using \"shuffle\"\" method of the \"Collections\" class • Display the smallest element in the collection use the \"Collections.min\" method. • Display the largest element in the collection use the \"Collections.max\" method. Solution import java.util.*; public class ArrayListNames { publicstaticvoid main(String[] args) { int i; ArrayList<String> name = new ArrayList<String>(); System.out.println(\"Enter 10 Names \"); for( i=0; i<10; i++ ) { Scanner s =newScanner(System.in); name add(s.next()); } System.out.println(\"Initial collection : \"+name); // shuffle the list Collections.shuffle(name); System.out.println(\"Final collection after shuffle: \"+name); Object minimum = Collections.min(name); System.out.println(\"Minimum Element of ArrayList name is : \" + minimum); Object maximum = Collections.max(name); System.out.println(\"Maximum Element of ArrayList name is : \" + maximum); } } .
Report
Share
Report
Share
![Write an application class (ArrayListApplication) that contains a main(...) method. The method
must perform the following.
• Prompt user for 10 names and store in an "ArrayList" object
• Shuffle the names using "shuffle"" method of the "Collections" class
• Display the smallest element in the collection use the "Collections.min" method.
• Display the largest element in the collection use the "Collections.max" method.
Solution
import java.util.*;
public class ArrayListNames
{
publicstaticvoid main(String[] args)
{
int i;
ArrayList<String> name = new ArrayList<String>();
System.out.println("Enter 10 Names ");
for( i=0; i<10; i++ )
{
Scanner s =newScanner(System.in);
name add(s.next());
}
System.out.println("Initial collection : "+name);](https://image.slidesharecdn.com/writeanapplicationclassarraylistapplicationthatcontainsamain-230205164719-3cba2ea3/85/Write-an-application-class-ArrayListApplication-that-contains-a-main-docx-1-320.jpg)
Recommended
Getting StartedCreate a class called Lab8. Use the same setup for .pdf
Getting Started
Create a class called Lab8. Use the same setup for setting up your class and main method as you
did for the previous assignments. Be sure to name your file Lab8.java. Additionally, make
another file called Arrays.java. This file will be an object, so simply start it off by declaring an
Arrays class. You can copy the following skeleton and fill in the appropriate code below each of
the comments:
public class Arrays {
/ Instance Variables
// Constructors
// findMin 1
// findMax
// calcSum
// calcAverage
// toString
}
Task Overview
Your task for this lab is to create a class called Arrays with some array processing methods. This
class will maintain an array and the number of elements present in it. Additionally, methods will
be available to display the current min and max elements along with the average of all of them.
Finally, a toString() method will be available to cleanly display all the array elements. Finally,
you will write a simple driver class to test out the above Arrays class.
Part 1: Instance Variables for Arrays
The first thing to do for the Arrays class is to set up its instance variables. Declare the following
(private) instance variables:
• An int array called array ? this will be the array we will be writing methods for.
• An int called count - this represents the number of valid elements in the array.
Part 2:
Constructors for Arrays The Arrays class will have two constructors. The first constructor takes
the maximum size of the array as input as a parameter and initializes the array instance variable
appropriately. It also sets count to size. Finally, it will initialize all of the array elements to some
values between 0 and 10, inclusive. To create this constructor, follow these steps:
• Import java.util.Random to make use of the random number generator.
• Create a constructor with the following header: public Arrays(int size)
• Initialize your array variable and set its size to size (see the chart on page 252 for reference on
initializing arrays). Be very careful that you are setting the value of your array instance variable,
as opposed to creating a new variable called array.
• Set the value of the count variable to size because we will be populating the entire array.
• Copy the following code to the constructor in order to generate random values between 0 and
10, inclusive:
Random rand = new Random();
for (int i = 0; i < count; i++)
{
array[i] = (rand.nextInt(10));
}
Next, create another constructor with the following header: public Arrays(int[] arr). This
constructor will initialize the class by using the passed arr argument in order to fill its instance
variables. The following things need to be done inside of this constructor:
• Set the array variable equal to arr.
• Set the count variable equal to the length of the array.
Part 3: Displaying the Output findMin()
The first method of this class will search the array for the minimum element. Copy the following
code for the findMin method. Note how the count i.
22.ppt
This document discusses the Java collections framework and algorithms for manipulating collections. It provides examples of using various collection classes like ArrayList, LinkedList, and methods from the Collections class like sort. Key points include:
- The collections framework contains interfaces and classes for common data structures like lists, sets, and maps.
- Classes like ArrayList and LinkedList implement the List interface and provide different implementations of lists.
- Static methods in the Collections class like sort, binarySearch, reverse provide common algorithms for manipulating collections.
- Examples demonstrate creating and initializing different collection types, adding/removing elements, sorting, searching collections using these algorithms.
Java Collections Tutorials
This document provides an overview of Java collections including common implementations like lists, maps, and queues. It discusses how collections allow storing and accessing multiple objects, the benefits of generics for type safety, and useful methods in the Collections class for sorting, shuffling, and copying collections. Code examples are provided for creating parameterized lists and maps, sorting lists using Comparator, and exercises for working with collections in practice.
Array properties
The Array class in ActionScript 3.0 allows you to create and manipulate arrays. Arrays can store any data type and are zero-indexed. You can create an Array using the new Array() constructor or array literal syntax ([]). Arrays are sparse, meaning they may have undefined elements. Array assignment is by reference. The Array class should not be used to create associative arrays, instead use the Object class.
Collections framework
The document discusses Java collection frameworks and their main interfaces and classes. It describes:
- Collection frameworks allow storing and managing heterogeneous data efficiently in memory using collection classes that implement the List, Set, and Map interfaces.
- Common List classes are ArrayList and LinkedList; Set classes are HashSet and LinkedHashSet; Map classes are HashMap and Hashtable.
- Each interface (List, Set, Map) and their classes have specific purposes - Lists allow duplicates and order, Sets don't allow duplicates, Maps store key-value pairs with unique keys.
Computer programming 2 Lesson 13
Arrays allow storing multiple values of the same type in a single variable. An array is declared by specifying the data type, followed by square brackets containing the array name. Individual elements in the array are accessed using their index number within square brackets after the array name. The Arrays class contains methods for sorting, searching, comparing, and filling arrays that are overloaded for all primitive data types.
Collection Core Concept
This document discusses Java collections frameworks. It covers core collection interfaces like List, Set, Queue and Map. It also discusses concrete collection classes that implement these interfaces like ArrayList, LinkedList, HashSet, TreeSet, HashMap and TreeMap. The document further explains concepts like iterators, generics in collections and differences between collections before and after generics.
Everything needs to be according to the instructions- thank you! SUPPO.pdf
Everything needs to be according to the instructions, thank you!
SUPPORTING CODE:
MyList.java
/**
This interface specifies the basic operations of any list-like object.
This interface contains a variation of the methods of the
standard java.util.List interface.
*/
public interface MyList {
/**
Adds an element at the end of the list.
*/
public void addToEnd(Object o);
/**
Inserts an element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void insertAt(int index, Object o);
/**
Removes the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void removeAt(int index);
/**
Returns the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public Object getAt(int index);
/**
Returns the size of the list.
@return the number of elements in the list
*/
public int getSize();
/**
Returns a list iterator for this list.
@return a list iterator for this list
*/
public MyListIterator getIterator();
}
MyListIterator.java
/**
A list iterator allows access of a position in a list.
This interface contains a subset of the methods of the
standard java.util.ListIterator interface. The methods for
backward traversal are not included.
*/
public interface MyListIterator
{
/**
Moves the iterator past the next element.
@return the traversed element
*/
Object next();
/**
Tests if there is an element after the iterator
position.
@return true if there is an element after the iterator
position
*/
boolean hasNext();
}
Main.java
// you may use this file to write and run code to test your MyArrayList class
public class Main {
public static void main(String[] args) {
}
}
FILE THAT NEEDS THAT NEEDS CODE:
MyArrayList.java
// Complete the implementation of your MyArrayList class in this file
public class MyArrayList implements MyList {
// Implement the required fields and methods here
private int capacity = 8;
private Object[ ] array = new Object [capacity];
private int size = 0;
@Override
public void add(Object o) {
if (size >= capacity){
Object[] temp = new Object[2*array.length];
for(int i=0;i<size;++i){
temp[i] = array[i];
}
this.capacity = 2*array.length;
array = temp;
array[size++] = o;
return;
}
else
{
array[size++] = o;
}
}
@Override
public int size() {
return size;
}
@Override
public Object at(int index) {
if (index >= capacity)
return null;
else
return array[index];
}
@Override
public void insertAt(int index, Object o) {
if (index >= capacity)
return;
else
{
size++;
for (int x = size - 1; x > index; x--) {
array[x] = array[x - 1];
}
array[index] = o;
}
}
@Override
public void removeAt(int index) {
if (index >= size || size == 0)
return;
else {
Object e = array[index];
for (int x = index; x < this.array.length - 1; x++) {
array[x] = array[x + 1];
}
size--;
}
}
public void ensureCapacity(int minCapacity) {
}
public void trimToSize() {
ensureCapacity(size);
}
// Do not alter the code below
@Override
public MyListIterator getIterator() {
return new MyA.
Recommended
Getting StartedCreate a class called Lab8. Use the same setup for .pdf
Getting Started
Create a class called Lab8. Use the same setup for setting up your class and main method as you
did for the previous assignments. Be sure to name your file Lab8.java. Additionally, make
another file called Arrays.java. This file will be an object, so simply start it off by declaring an
Arrays class. You can copy the following skeleton and fill in the appropriate code below each of
the comments:
public class Arrays {
/ Instance Variables
// Constructors
// findMin 1
// findMax
// calcSum
// calcAverage
// toString
}
Task Overview
Your task for this lab is to create a class called Arrays with some array processing methods. This
class will maintain an array and the number of elements present in it. Additionally, methods will
be available to display the current min and max elements along with the average of all of them.
Finally, a toString() method will be available to cleanly display all the array elements. Finally,
you will write a simple driver class to test out the above Arrays class.
Part 1: Instance Variables for Arrays
The first thing to do for the Arrays class is to set up its instance variables. Declare the following
(private) instance variables:
• An int array called array ? this will be the array we will be writing methods for.
• An int called count - this represents the number of valid elements in the array.
Part 2:
Constructors for Arrays The Arrays class will have two constructors. The first constructor takes
the maximum size of the array as input as a parameter and initializes the array instance variable
appropriately. It also sets count to size. Finally, it will initialize all of the array elements to some
values between 0 and 10, inclusive. To create this constructor, follow these steps:
• Import java.util.Random to make use of the random number generator.
• Create a constructor with the following header: public Arrays(int size)
• Initialize your array variable and set its size to size (see the chart on page 252 for reference on
initializing arrays). Be very careful that you are setting the value of your array instance variable,
as opposed to creating a new variable called array.
• Set the value of the count variable to size because we will be populating the entire array.
• Copy the following code to the constructor in order to generate random values between 0 and
10, inclusive:
Random rand = new Random();
for (int i = 0; i < count; i++)
{
array[i] = (rand.nextInt(10));
}
Next, create another constructor with the following header: public Arrays(int[] arr). This
constructor will initialize the class by using the passed arr argument in order to fill its instance
variables. The following things need to be done inside of this constructor:
• Set the array variable equal to arr.
• Set the count variable equal to the length of the array.
Part 3: Displaying the Output findMin()
The first method of this class will search the array for the minimum element. Copy the following
code for the findMin method. Note how the count i.
22.ppt
This document discusses the Java collections framework and algorithms for manipulating collections. It provides examples of using various collection classes like ArrayList, LinkedList, and methods from the Collections class like sort. Key points include:
- The collections framework contains interfaces and classes for common data structures like lists, sets, and maps.
- Classes like ArrayList and LinkedList implement the List interface and provide different implementations of lists.
- Static methods in the Collections class like sort, binarySearch, reverse provide common algorithms for manipulating collections.
- Examples demonstrate creating and initializing different collection types, adding/removing elements, sorting, searching collections using these algorithms.
Java Collections Tutorials
This document provides an overview of Java collections including common implementations like lists, maps, and queues. It discusses how collections allow storing and accessing multiple objects, the benefits of generics for type safety, and useful methods in the Collections class for sorting, shuffling, and copying collections. Code examples are provided for creating parameterized lists and maps, sorting lists using Comparator, and exercises for working with collections in practice.
Array properties
The Array class in ActionScript 3.0 allows you to create and manipulate arrays. Arrays can store any data type and are zero-indexed. You can create an Array using the new Array() constructor or array literal syntax ([]). Arrays are sparse, meaning they may have undefined elements. Array assignment is by reference. The Array class should not be used to create associative arrays, instead use the Object class.
Collections framework
The document discusses Java collection frameworks and their main interfaces and classes. It describes:
- Collection frameworks allow storing and managing heterogeneous data efficiently in memory using collection classes that implement the List, Set, and Map interfaces.
- Common List classes are ArrayList and LinkedList; Set classes are HashSet and LinkedHashSet; Map classes are HashMap and Hashtable.
- Each interface (List, Set, Map) and their classes have specific purposes - Lists allow duplicates and order, Sets don't allow duplicates, Maps store key-value pairs with unique keys.
Computer programming 2 Lesson 13
Arrays allow storing multiple values of the same type in a single variable. An array is declared by specifying the data type, followed by square brackets containing the array name. Individual elements in the array are accessed using their index number within square brackets after the array name. The Arrays class contains methods for sorting, searching, comparing, and filling arrays that are overloaded for all primitive data types.
Collection Core Concept
This document discusses Java collections frameworks. It covers core collection interfaces like List, Set, Queue and Map. It also discusses concrete collection classes that implement these interfaces like ArrayList, LinkedList, HashSet, TreeSet, HashMap and TreeMap. The document further explains concepts like iterators, generics in collections and differences between collections before and after generics.
Everything needs to be according to the instructions- thank you! SUPPO.pdf
Everything needs to be according to the instructions, thank you!
SUPPORTING CODE:
MyList.java
/**
This interface specifies the basic operations of any list-like object.
This interface contains a variation of the methods of the
standard java.util.List interface.
*/
public interface MyList {
/**
Adds an element at the end of the list.
*/
public void addToEnd(Object o);
/**
Inserts an element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void insertAt(int index, Object o);
/**
Removes the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void removeAt(int index);
/**
Returns the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public Object getAt(int index);
/**
Returns the size of the list.
@return the number of elements in the list
*/
public int getSize();
/**
Returns a list iterator for this list.
@return a list iterator for this list
*/
public MyListIterator getIterator();
}
MyListIterator.java
/**
A list iterator allows access of a position in a list.
This interface contains a subset of the methods of the
standard java.util.ListIterator interface. The methods for
backward traversal are not included.
*/
public interface MyListIterator
{
/**
Moves the iterator past the next element.
@return the traversed element
*/
Object next();
/**
Tests if there is an element after the iterator
position.
@return true if there is an element after the iterator
position
*/
boolean hasNext();
}
Main.java
// you may use this file to write and run code to test your MyArrayList class
public class Main {
public static void main(String[] args) {
}
}
FILE THAT NEEDS THAT NEEDS CODE:
MyArrayList.java
// Complete the implementation of your MyArrayList class in this file
public class MyArrayList implements MyList {
// Implement the required fields and methods here
private int capacity = 8;
private Object[ ] array = new Object [capacity];
private int size = 0;
@Override
public void add(Object o) {
if (size >= capacity){
Object[] temp = new Object[2*array.length];
for(int i=0;i<size;++i){
temp[i] = array[i];
}
this.capacity = 2*array.length;
array = temp;
array[size++] = o;
return;
}
else
{
array[size++] = o;
}
}
@Override
public int size() {
return size;
}
@Override
public Object at(int index) {
if (index >= capacity)
return null;
else
return array[index];
}
@Override
public void insertAt(int index, Object o) {
if (index >= capacity)
return;
else
{
size++;
for (int x = size - 1; x > index; x--) {
array[x] = array[x - 1];
}
array[index] = o;
}
}
@Override
public void removeAt(int index) {
if (index >= size || size == 0)
return;
else {
Object e = array[index];
for (int x = index; x < this.array.length - 1; x++) {
array[x] = array[x + 1];
}
size--;
}
}
public void ensureCapacity(int minCapacity) {
}
public void trimToSize() {
ensureCapacity(size);
}
// Do not alter the code below
@Override
public MyListIterator getIterator() {
return new MyA.
Collections
This document discusses generics in Java and the benefits they provide. It explains that before generics, collections like ArrayList could hold multiple different types of objects, risking ClassCastExceptions. With generics, the type is specified within angle brackets, allowing the compiler to catch type errors and ensuring a collection only holds the specified type. An example shows how a non-generic list can hold integers and strings, while a generic list specified to hold integers no longer allows strings. Generics eliminate casting and type safety issues.
Array based based implementation of the List ADT It uses an array o.pdf
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.
12. arrays
Arrays are a data structure that store a fixed-size sequential collection of elements of the same type. Arrays can be declared by specifying the type followed by square brackets, such as dataType[]. An array variable holds a reference to an array, which is created dynamically using new along with the type and size. Arrays allow storing and accessing related data sequentially using indices, and they can be passed to methods or returned from methods. Common array operations include traversing elements using for loops or foreach, and finding sum, max/min, or reversing elements.
java I am trying to run my code but it is not letting me .pdf
java
I am trying to run my code but it is not letting me i dont know what i should do or fix. Thank you so
much for your help. This is the problem and my code will be on the bottom.
Problem #1 and Only
Dynamic Array of Integers Class
Create a class named DynamicArray that will have convenient functionality similar to JavaScripts
Array object and Javas ArrayList class. The class allows to store array of integers that can grow
and shrink as needed, search for values, remove elements, etc.
You are not allowed to use ArrayList object as well as any methods from java.util.Arrays
class.
Please see the list of required features and methods below.
private int array[] You MUST store the data internally in a regular partially-filled array of integers.
Please DO NOT USE ArrayList. The size of the allocated array is its capacity and will be
discussed below.
private int size. This variable stores the number of occupied elements in the array. Set to 0 in the
constructor.
Constructor with parameter. The parameter defines the capacity (length) of initial array. Allocates
array of given capacity (length), sets size field to 0. In case the parameter given to constructor is 0
or negative, IllegalArgumentException is being thrown.
No-argument constructor. Allocates array of length 3, assigns it to the array field, sets size field to
0.
Copy constructor. The constructor takes an object of type DynamicArray as a parameter and
copies it into the object it creates. The constructor throws IllegalArgumentException if the object
that was passed to copy from is null.
int getSize() returns the number of occupied elements in the array.
int getCapacity() returns the actual size (length) of the partially-filled array
int [] getArray() accessor returns the entire partially-filled array. Make sure you DO NOT return the
private array field, make a copy of it.
int [] toArray() accessor returns an occupied part of the partially-filled array. Make sure you DO
NOT return the private array field. Instead, allocate memory for the new array, copy the occupied
portion of the field into that new object, and return the new array.
public void push(int num) adds a new element to the end of the array and increments the size
field. If the array is full, you need to increase the capacity of the array:
Create a new array with the size equal to double the capacity of the original one.
Copy all the elements from the array field to the new array.
Add the new element to the end of the new array.
Use new array as an array field.
Make sure your method works well when new elements are added to an empty DynamicArray.
public int pop() throws RuntimeException removes the last element of the array and returns it.
Decrements the size field. If the array is empty a RuntimeException with the message Array is
empty must be thrown. At this point check the capacity of the array. If the capacity is 4 times larger
than the number of occupied elements (size), it is time to shrink the array:
Create a new array wi.
Write a java class LIST that outputsmainpublic class Ass.pdf
The document describes Java List interfaces and common implementations like ArrayList and LinkedList. It provides examples of initializing List with different data types, adding/inserting elements, and sorting a List using Collections.sort(). Key points covered include declaring List with generic types, initializing capacity for ArrayList, copying elements between Lists, and sorting Lists into natural ascending order.
Presentation1
The document discusses the Java Collection Framework which provides interfaces and classes for storing and manipulating groups of objects, including Collection interfaces like List and Set, implementation classes like ArrayList, LinkedList, HashSet and TreeSet, and describes their features and usage.
Collections - Lists & sets
In this session you will learn:
List – ArrayList, LinkedList
Set – HashSet, LinkedHashSet, TreeSet
For more information: https://www.mindsmapped.com/courses/software-development/become-a-java-developer-hands-on-training/
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.java
LinkedList.java
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
*
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
*
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
public T getFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
public T getIterator() throws NullPointerException {
if (iterator != null) {
return iterator.data;
} else {
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
public int getLength() {
return length;
}
public boolean isEmpty() {
return length == 0;
}
public boolean offEnd() {
return iterator == null;
}
public void addFirst(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
public void addIterator(T data) throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("addIterator Iterator is off end.");
}
if (iterator == last) {
addLast(data);
} else {
Node newNode = new Node(data);
Node next = iterator.next;
newNode.next = next;
newNode.prev = iterator;
iterator.next = newNode;
next.prev = newNode;
length++;
}
}
public void removeFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == first) {
iterator = null;
}
first = first.next;
first.prev = null;
}
length--;
}
public void removeLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == last) {
iterator = null;
}
last = last.prev;
last.next = null;
}
length--;
}
public void removeIterator() throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("Iterator is off the end opf the list.");
}
if (iterator .
03-inheritance.ppt
This document summarizes a lecture on inheritance in Java. It discusses adding new methods like toString() to existing classes like ArrayIntList. It also covers defining multiple constructors, using the this and super keywords, and overriding and calling parent methods. The key aspects are:
1. The toString() method allows an object to return a String representation and avoids directly printing objects.
2. Multiple constructors can be defined and older ones can call newer ones using this().
3. Subclasses inherit fields and methods from parent classes and can override methods while still calling the parent version using super().
4. Constructors are not inherited so subclasses must define their own, but can call parent constructors using super().
collections
Collections in .NET allow storing and accessing multiple elements as a single unit. There are normal and generic collections, with the latter providing type safety without duplicating code. Common collection classes include stacks, queues, lists, and hash tables, with generic versions like Stack<T>, Queue<T>, and Dictionary<T> that allow specifying the element type. Collections implement interfaces like IEnumerable to support iteration over elements.
Java ArrayList Tutorial | Edureka
( ** Java Certification Training: https://www.edureka.co/java-j2ee-soa-training ** )
This Edureka tutorial on “Java ArrayList” (Java blog series: https://goo.gl/osrGrS) will give you a brief insight about ArrayList in Java and its various constructors and methods along with an example. Through this tutorial, you will learn the following topics:
Collections Framework
Hierarchy of ArrayList
What is ArrayList
Internal Working of ArrayList
Constructors of ArrayList
Constructors Example
ArrayList Methods
Methods Example and Demo
Advantages of ArrayList over Arrays
Check out our Java Tutorial blog series: https://goo.gl/osrGrS
Check out our complete Youtube playlist here: https://goo.gl/CRbgFann
Follow us to never miss an update in the future.
Instagram: https://www.instagram.com/edureka_learning/
Facebook: https://www.facebook.com/edurekaIN/
Twitter: https://twitter.com/edurekain
LinkedIn: https://www.linkedin.com/company/edureka
Collections Framework
This document provides information about Java collections framework. It discusses various collection interfaces like Collection, List, Set, Queue, Map and their implementations like ArrayList, LinkedList, HashSet, TreeSet, HashMap, TreeMap. It also covers topics like sorting collections using Comparable and Comparator interfaces, overriding equals() and hashCode() methods.
Write a program that will test a name) method no sorting routine from.docx
The document describes a Java program that uses an ArrayList to test a selection sort algorithm. It prompts the user to enter a number, fills the ArrayList with that many randomly generated integers from 1 to 50, prints the original ArrayList, calls a selection sort method to sort the ArrayList, and prints the sorted ArrayList. The selection sort method uses nested for loops to find the minimum element in the unsorted section and swap it with the current element being considered.
Java Collections Framework
This document provides an overview of the Java Collections Framework. It discusses core collection interfaces like List, Set, and Map and their common implementations like ArrayList, HashSet, and HashMap. It also covers sorting collections with Comparable and Comparator, searching collections with binary search, and using utility methods in the Collections class. Examples are provided to illustrate usage of various collection classes and methods.
ARRAYS.ppt
Arrays in Java allow for the storage of multiple values of the same data type. An array is declared by specifying the data type followed by square brackets, and memory is allocated using the new keyword followed by the data type and size of the array. Arrays have a length property that can be accessed using the length() method. Elements in an array are accessed using indexes that go from 0 to length-1. Two dimensional arrays can also be created to store elements in a tabular format with multiple rows and columns.
C# p9
The document discusses various aspects of arrays in C# including declaration, initialization, storing values, accessing values, passing arrays to methods, array properties and functions. It provides examples of one-dimensional and multi-dimensional arrays and covers topics like declaration, initialization, accessing values, passing arrays to methods and common array properties and functions.
Ecet 370 week 2 lab 2
This document outlines exercises for a class on array-based lists. It includes 5 exercises: 1) reviewing an array-based list class, 2) modifying the class to add new functions, 3) using the modified class to store random numbers with no duplicates, 4) reviewing the built-in ArrayList class, and 5) rewriting the random number storage using ArrayList.
Unit-2.Arrays and Strings.pptx.................
,,,,,,jhbhhhhhvggvvcccccccfghhhhhhhhhhhhhgggggggggyyyyy hhbbhhhhgggyhhsyddhdhhddhsiejdhajshdhdhdhdhdhdudufjdhyeyeg hhdhdhdhdhdhdhdhdh d bhsuhabuesjjsoeijshshdhsjajsijehfdhhdhdhdhdhhdxbbxxhxhhdja hi in najajajhwhr7fhhhhhhhhhhhhhhhhhuhhuwbshdhhddh8rhedi8fnf
Chapter 7.1
1) Arrays allow storing and accessing multiple values of the same data type. They are declared with the data type, followed by square brackets and the array name.
2) Array components are accessed using their index number within square brackets after the array name. Index numbers start at 0.
3) The length property returns the number of components in the array, which must be considered to avoid accessing components outside the bounds of the array.
01-intro_stacks.ppt
This document discusses the introduction to data structures and algorithms. It covers course objectives including learning basic data structures like stacks and abstract data types. It defines abstract data types and lists the stack abstract data type. It provides examples of stack operations and applications. It demonstrates using a Stack class in Java and limitations/idioms when using stacks. It poses an exercise to use a stack to check if parentheses and curly brackets are balanced in a string. Finally, it discusses Eclipse concepts like the workspace, projects, and perspectives.
Zone Diameter Interpretation Examine the zone diameter data in the tab.docx
Zone Diameter Interpretation
Examine the zone diameter data in the table. Choose the statement that represents a valid conclusion from these data.
a. Pseudomonas is less susceptible to carbenicillin than E. coli .
b. The relative susceptibility of these two organisms cannot be determined from these data.
c. Pseudomonas and E. coli are equally susceptible to carbenicillin.
d. Pseudomonas is more susceptible to carbenicillin than E. coli .
I tried selecting answer choice A, but it was wrong...
.
Your unknown bacteria maybe one of the following 13 bacteria- Proteus.docx
Your unknown bacteria maybe one of the following 13 bacteria: Proteus vulgaris, Edwardsiella tarda, Enterococcus faecalis, Escherichia coli, Bacillus sphaericus, Pseudomonas aeruginosa, Morganella morganii, Bacillus cereus, Staphylococcus aureus, Enterobacter aerogenes, Bacillus megaterium, Klebsiella pneumoniae, or Shigella flexneri.
please make a dichotomous key of these bacteria
.
More Related Content
Similar to Write an application class (ArrayListApplication) that contains a main.docx
Collections
This document discusses generics in Java and the benefits they provide. It explains that before generics, collections like ArrayList could hold multiple different types of objects, risking ClassCastExceptions. With generics, the type is specified within angle brackets, allowing the compiler to catch type errors and ensuring a collection only holds the specified type. An example shows how a non-generic list can hold integers and strings, while a generic list specified to hold integers no longer allows strings. Generics eliminate casting and type safety issues.
Array based based implementation of the List ADT It uses an array o.pdf
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.
12. arrays
Arrays are a data structure that store a fixed-size sequential collection of elements of the same type. Arrays can be declared by specifying the type followed by square brackets, such as dataType[]. An array variable holds a reference to an array, which is created dynamically using new along with the type and size. Arrays allow storing and accessing related data sequentially using indices, and they can be passed to methods or returned from methods. Common array operations include traversing elements using for loops or foreach, and finding sum, max/min, or reversing elements.
java I am trying to run my code but it is not letting me .pdf
java
I am trying to run my code but it is not letting me i dont know what i should do or fix. Thank you so
much for your help. This is the problem and my code will be on the bottom.
Problem #1 and Only
Dynamic Array of Integers Class
Create a class named DynamicArray that will have convenient functionality similar to JavaScripts
Array object and Javas ArrayList class. The class allows to store array of integers that can grow
and shrink as needed, search for values, remove elements, etc.
You are not allowed to use ArrayList object as well as any methods from java.util.Arrays
class.
Please see the list of required features and methods below.
private int array[] You MUST store the data internally in a regular partially-filled array of integers.
Please DO NOT USE ArrayList. The size of the allocated array is its capacity and will be
discussed below.
private int size. This variable stores the number of occupied elements in the array. Set to 0 in the
constructor.
Constructor with parameter. The parameter defines the capacity (length) of initial array. Allocates
array of given capacity (length), sets size field to 0. In case the parameter given to constructor is 0
or negative, IllegalArgumentException is being thrown.
No-argument constructor. Allocates array of length 3, assigns it to the array field, sets size field to
0.
Copy constructor. The constructor takes an object of type DynamicArray as a parameter and
copies it into the object it creates. The constructor throws IllegalArgumentException if the object
that was passed to copy from is null.
int getSize() returns the number of occupied elements in the array.
int getCapacity() returns the actual size (length) of the partially-filled array
int [] getArray() accessor returns the entire partially-filled array. Make sure you DO NOT return the
private array field, make a copy of it.
int [] toArray() accessor returns an occupied part of the partially-filled array. Make sure you DO
NOT return the private array field. Instead, allocate memory for the new array, copy the occupied
portion of the field into that new object, and return the new array.
public void push(int num) adds a new element to the end of the array and increments the size
field. If the array is full, you need to increase the capacity of the array:
Create a new array with the size equal to double the capacity of the original one.
Copy all the elements from the array field to the new array.
Add the new element to the end of the new array.
Use new array as an array field.
Make sure your method works well when new elements are added to an empty DynamicArray.
public int pop() throws RuntimeException removes the last element of the array and returns it.
Decrements the size field. If the array is empty a RuntimeException with the message Array is
empty must be thrown. At this point check the capacity of the array. If the capacity is 4 times larger
than the number of occupied elements (size), it is time to shrink the array:
Create a new array wi.
Write a java class LIST that outputsmainpublic class Ass.pdf
The document describes Java List interfaces and common implementations like ArrayList and LinkedList. It provides examples of initializing List with different data types, adding/inserting elements, and sorting a List using Collections.sort(). Key points covered include declaring List with generic types, initializing capacity for ArrayList, copying elements between Lists, and sorting Lists into natural ascending order.
Presentation1
The document discusses the Java Collection Framework which provides interfaces and classes for storing and manipulating groups of objects, including Collection interfaces like List and Set, implementation classes like ArrayList, LinkedList, HashSet and TreeSet, and describes their features and usage.
Collections - Lists & sets
In this session you will learn:
List – ArrayList, LinkedList
Set – HashSet, LinkedHashSet, TreeSet
For more information: https://www.mindsmapped.com/courses/software-development/become-a-java-developer-hands-on-training/
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.java
LinkedList.java
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterator;
/**** CONSTRUCTORS ****/
public LinkedList() {
first = null;
last = null;
iterator = null;
length = 0;
}
/**
* Converts the given array into a LinkedList
*
* @param array the array of values to insert into this LinkedList
* @postcondition
*/
public LinkedList(T[] array) {
}
/**
* Instantiates a new LinkedList by copying another List
*
* @param original the LinkedList to copy
* @postcondition a new List object, which is an identical,
* but separate, copy of the LinkedList original
*/
public LinkedList(LinkedList original) {
}
public T getFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return first.data;
}
public T getLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
return last.data;
}
public T getIterator() throws NullPointerException {
if (iterator != null) {
return iterator.data;
} else {
throw new NullPointerException("Iterator is off the end opf the list.");
}
}
public int getLength() {
return length;
}
public boolean isEmpty() {
return length == 0;
}
public boolean offEnd() {
return iterator == null;
}
public void addFirst(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
newNode.next = first;
first.prev = newNode;
first = newNode;
}
length++;
}
public void addLast(T data) {
Node newNode = new Node(data);
if (isEmpty()) {
first = newNode;
last = newNode;
} else {
last.next = newNode;
newNode.prev = last;
last = newNode;
}
length++;
}
public void addIterator(T data) throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("addIterator Iterator is off end.");
}
if (iterator == last) {
addLast(data);
} else {
Node newNode = new Node(data);
Node next = iterator.next;
newNode.next = next;
newNode.prev = iterator;
iterator.next = newNode;
next.prev = newNode;
length++;
}
}
public void removeFirst() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == first) {
iterator = null;
}
first = first.next;
first.prev = null;
}
length--;
}
public void removeLast() throws NoSuchElementException {
if (isEmpty()) {
throw new NoSuchElementException("The list is empty");
}
if (length == 1) {
first = null;
last = null;
iterator = null;
} else {
if (iterator == last) {
iterator = null;
}
last = last.prev;
last.next = null;
}
length--;
}
public void removeIterator() throws NullPointerException {
if (offEnd()) {
throw new NullPointerException("Iterator is off the end opf the list.");
}
if (iterator .
03-inheritance.ppt
This document summarizes a lecture on inheritance in Java. It discusses adding new methods like toString() to existing classes like ArrayIntList. It also covers defining multiple constructors, using the this and super keywords, and overriding and calling parent methods. The key aspects are:
1. The toString() method allows an object to return a String representation and avoids directly printing objects.
2. Multiple constructors can be defined and older ones can call newer ones using this().
3. Subclasses inherit fields and methods from parent classes and can override methods while still calling the parent version using super().
4. Constructors are not inherited so subclasses must define their own, but can call parent constructors using super().
collections
Collections in .NET allow storing and accessing multiple elements as a single unit. There are normal and generic collections, with the latter providing type safety without duplicating code. Common collection classes include stacks, queues, lists, and hash tables, with generic versions like Stack<T>, Queue<T>, and Dictionary<T> that allow specifying the element type. Collections implement interfaces like IEnumerable to support iteration over elements.
Java ArrayList Tutorial | Edureka
( ** Java Certification Training: https://www.edureka.co/java-j2ee-soa-training ** )
This Edureka tutorial on “Java ArrayList” (Java blog series: https://goo.gl/osrGrS) will give you a brief insight about ArrayList in Java and its various constructors and methods along with an example. Through this tutorial, you will learn the following topics:
Collections Framework
Hierarchy of ArrayList
What is ArrayList
Internal Working of ArrayList
Constructors of ArrayList
Constructors Example
ArrayList Methods
Methods Example and Demo
Advantages of ArrayList over Arrays
Check out our Java Tutorial blog series: https://goo.gl/osrGrS
Check out our complete Youtube playlist here: https://goo.gl/CRbgFann
Follow us to never miss an update in the future.
Instagram: https://www.instagram.com/edureka_learning/
Facebook: https://www.facebook.com/edurekaIN/
Twitter: https://twitter.com/edurekain
LinkedIn: https://www.linkedin.com/company/edureka
Collections Framework
This document provides information about Java collections framework. It discusses various collection interfaces like Collection, List, Set, Queue, Map and their implementations like ArrayList, LinkedList, HashSet, TreeSet, HashMap, TreeMap. It also covers topics like sorting collections using Comparable and Comparator interfaces, overriding equals() and hashCode() methods.
Write a program that will test a name) method no sorting routine from.docx
The document describes a Java program that uses an ArrayList to test a selection sort algorithm. It prompts the user to enter a number, fills the ArrayList with that many randomly generated integers from 1 to 50, prints the original ArrayList, calls a selection sort method to sort the ArrayList, and prints the sorted ArrayList. The selection sort method uses nested for loops to find the minimum element in the unsorted section and swap it with the current element being considered.
Java Collections Framework
This document provides an overview of the Java Collections Framework. It discusses core collection interfaces like List, Set, and Map and their common implementations like ArrayList, HashSet, and HashMap. It also covers sorting collections with Comparable and Comparator, searching collections with binary search, and using utility methods in the Collections class. Examples are provided to illustrate usage of various collection classes and methods.
ARRAYS.ppt
Arrays in Java allow for the storage of multiple values of the same data type. An array is declared by specifying the data type followed by square brackets, and memory is allocated using the new keyword followed by the data type and size of the array. Arrays have a length property that can be accessed using the length() method. Elements in an array are accessed using indexes that go from 0 to length-1. Two dimensional arrays can also be created to store elements in a tabular format with multiple rows and columns.
C# p9
The document discusses various aspects of arrays in C# including declaration, initialization, storing values, accessing values, passing arrays to methods, array properties and functions. It provides examples of one-dimensional and multi-dimensional arrays and covers topics like declaration, initialization, accessing values, passing arrays to methods and common array properties and functions.
Ecet 370 week 2 lab 2
This document outlines exercises for a class on array-based lists. It includes 5 exercises: 1) reviewing an array-based list class, 2) modifying the class to add new functions, 3) using the modified class to store random numbers with no duplicates, 4) reviewing the built-in ArrayList class, and 5) rewriting the random number storage using ArrayList.
Unit-2.Arrays and Strings.pptx.................
,,,,,,jhbhhhhhvggvvcccccccfghhhhhhhhhhhhhgggggggggyyyyy hhbbhhhhgggyhhsyddhdhhddhsiejdhajshdhdhdhdhdhdudufjdhyeyeg hhdhdhdhdhdhdhdhdh d bhsuhabuesjjsoeijshshdhsjajsijehfdhhdhdhdhdhhdxbbxxhxhhdja hi in najajajhwhr7fhhhhhhhhhhhhhhhhhuhhuwbshdhhddh8rhedi8fnf
Chapter 7.1
1) Arrays allow storing and accessing multiple values of the same data type. They are declared with the data type, followed by square brackets and the array name.
2) Array components are accessed using their index number within square brackets after the array name. Index numbers start at 0.
3) The length property returns the number of components in the array, which must be considered to avoid accessing components outside the bounds of the array.
01-intro_stacks.ppt
This document discusses the introduction to data structures and algorithms. It covers course objectives including learning basic data structures like stacks and abstract data types. It defines abstract data types and lists the stack abstract data type. It provides examples of stack operations and applications. It demonstrates using a Stack class in Java and limitations/idioms when using stacks. It poses an exercise to use a stack to check if parentheses and curly brackets are balanced in a string. Finally, it discusses Eclipse concepts like the workspace, projects, and perspectives.
Similar to Write an application class (ArrayListApplication) that contains a main.docx (20)
Array based based implementation of the List ADT It uses an array o.pdf
Array based based implementation of the List ADT It uses an array o.pdf
java I am trying to run my code but it is not letting me .pdf
java I am trying to run my code but it is not letting me .pdf
Write a java class LIST that outputsmainpublic class Ass.pdf
Write a java class LIST that outputsmainpublic class Ass.pdf
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Write a program that will test a name) method no sorting routine from.docx
Write a program that will test a name) method no sorting routine from.docx
More from karlynwih
Zone Diameter Interpretation Examine the zone diameter data in the tab.docx
Zone Diameter Interpretation
Examine the zone diameter data in the table. Choose the statement that represents a valid conclusion from these data.
a. Pseudomonas is less susceptible to carbenicillin than E. coli .
b. The relative susceptibility of these two organisms cannot be determined from these data.
c. Pseudomonas and E. coli are equally susceptible to carbenicillin.
d. Pseudomonas is more susceptible to carbenicillin than E. coli .
I tried selecting answer choice A, but it was wrong...
.
Your unknown bacteria maybe one of the following 13 bacteria- Proteus.docx
Your unknown bacteria maybe one of the following 13 bacteria: Proteus vulgaris, Edwardsiella tarda, Enterococcus faecalis, Escherichia coli, Bacillus sphaericus, Pseudomonas aeruginosa, Morganella morganii, Bacillus cereus, Staphylococcus aureus, Enterobacter aerogenes, Bacillus megaterium, Klebsiella pneumoniae, or Shigella flexneri.
please make a dichotomous key of these bacteria
.
Your friend got a notification on their iPhone letting them know they.docx
Your friend got a notification on their iPhone letting them know they are at risk of developing diabetes in the next six months. The notification also recommended some lifestyle changes they can make to live a healthler life. How did Apple get the information necessary to provide such insight? Go through the entire lifecycle of data in as much detall as possible.
.
Your reflection must be at least 400 words Examine habitat for humanit.docx
Your reflection must be at least 400 words
Examine habitat for humanity from the perspective of someone served by the organization. What does the organization do for them? For society? Why would a person served see value in what the organization does?
Examine habitat for humanity from the perspective of one of its employees, senior volunteers, or organizational leaders. Why is the person working there? What motivates the individual to be involved or to stay? How does the individual contribute to a good society by working with the group?
.
You will learn about the Chain of Infection and apply your learning to.docx
You will learn about the Chain of Infection and apply your learning to a particular disease, Covid-19.
Preventing and controlling infection involves understanding the Chain of Infection model and identifying places along the chain, for each distinct disease, where we can best intervene to stop the spread.
Watch the video below. Think about the COVID-19 pandemic and all of the public health measures that were used. Make a list of the links in the Chain of Infection. Then for each, try to identify one or more measures that individuals, communities, and/or experts can take/are taking to disrupt the Chain of Infection.
A list with bullets is fine. Paragraphs/essay format not required.
Write your response directly in the box provided.
.
Write definitions for the following terms- hydrograph- hyetograph- abs.docx
Write definitions for the following terms: hydrograph, hyetograph, abstractions, losses, baseflow, and excess precipitation. Cite your source for this information.
Solution
1) A hydrograph is a graph showing the rate of flow (discharge) versus time past a specific point in a river, or other channel or conduit carrying flow. The rate of flow is typically expressed in cubic meters or cubic feet per second (cms or cfs)
2) A hyetograph is a graphical representation of the relationship between the rainfall intensity and time. It is the plot of the rainfall intensity drawn on the ordinate axis against time on the abscissa axis. The hyetograph is a bar diagram
3) Abstractions/losses – difference between total rainfall hyetograph and excess rainfall hyetograph
4) Losses :
i) Depression Storage: The volume of water contained in natural depressions in the land surface, such as puddles.
ii) Interception : The process by which precipitation is caught and held by foliage, twigs, and branches of trees, shrubs, and other vegetation, and lost by evaporation, never reaching the surface of the ground. Interception equals the precipitation on the vegetation minus stream-flow and through fall.
5) Base flow:
Stream-flow which results from precipitation that infiltrates into the soil and eventually moves through the soil to the stream channel. This is also referred to as ground water flow, or dry-weather flow.
6) The volume of water from precipitation that is available for direct runoff
Direct runoff is the sum of overland flow and inter flow (water flow in the top soil layer).
.
Write code in C++ Write a program to perform a topological sort on a g.docx
Write code in C++
Write a program to perform a topological sort on a graph.
*Use adjacency matrix
Use these Variables: int L1, L2, L3, noVertices, adjMatrix[10][10], indegree[10], swap;
*Add Comments
Solution
#include #include using namespace std; struct node_info { int no; int lv_time, st_time; }*q = NULL, *r = NULL; struct node { node_info *pt; node *next; }*top = NULL, *p = NULL, *np = NULL; int c = 0; void push(node_info *ptr) { np = new node; np->pt = ptr; np->next = NULL; if (top == NULL) { top = np; } else { np->next = top; top = np; } } node_info *pop() { if (top == NULL) { cout<<\"underflow\ \"; } else { p = top; top = top->next; return(p->pt); delete(p); } } void topo(int *v,int am[][7],int i) { q = new node_info; q->no = i; q->st_time = c; cout<<\"start time for node no \"< no<<\":\"< no<<\":\"< >am[i][j]; } } topo(v,am,0); getch(); }
.
Write C++ program that when given a value N(read from cin)- produces a.docx
The document describes a C++ program that takes a positive integer N as input and prints a pictogram of the first N^2 numbers. For each number, if it is prime it prints "P", otherwise it prints "." if it has fewer than 2 prime factors or "2" if it has 2 or more prime factors. The program uses functions to check if a number is prime, find all its factors, and count its prime factors.
Write an SML function groupdupes that takes a list of integers as its.docx
Write an SML function groupdupes that takes a list of integers as its only argument. The function takes runs of values (i.e., consectuive, duplicated values) in the list, copying those runs into separate sublists, returning a list of those sublists. Examples:
groupdupes([4,4,4,2,3,3,7,7,7,7,2,3,4,4,4]) would return [[4,4,4],[2],[3,3],[7,7,7,7],[2],[3],[4,4,4]]
groupdupes([8,6,7,5]) would return [[8],[6],[7],[5]]
Solution
fun groupdupes_helper(L:int list, subL:int list, result:int list list) =
if (L = nil)
then
result @ [subL]
else if ( ( subL = nil ) orelse
( hd(subL) = hd(L) ) )
then
groupdupes_helper( tl(L), hd(L)::subL, result )
else
groupdupes_helper( tl(L), hd(L)::nil, result @ [subL] )
(* groupdupes Wrapper Function *)
fun groupdupes(L:int list) =
groupdupes_helper(L, nil, nil);
.
You and another tech are discussing the relative merits of SCSI interf.docx
You and another tech are discussing the relative merits of SCSI interfaces. You say that SCSI is dead, at least as far as drives go, and has been replaced by SAS and SATA. Your coworker says that SCSI has evolved and still has valid technical applications in today’s computing environment. Which modern applications does she say SCSI currently possesses? (Choose two.)
A. SCSI now can use serial as well as parallel interfaces.
B. SCSI now uses TCP/IP as a transport mechanism.
C. Some motherboard manufacturers still market SCSI interfaces supporting PCI Express and PCI-X.
D. SCSI Ultra-5 (parallel) now supports as 64-bit data width.
Solution
A. SCSI now can use serial as well as parallel interfaces.
C. Some motherboard manufacturers still market SCSI interfaces supporting PCI Express and PCI-X.
Although SCSI parallel (SPI) interfaces are still common, they are being replaced by Serial Attached SCSI (SAS), which retains the original SCSI technology but employs a serial design. Very few companies still market SCSI interfaces for motherboards supporting PCIe and PCI-X (PCI-X is a double-wide version of the PCI bus that satisfies the higher bandwidth requirements of servers).
.
Write an algorithm for a program that shows the use of all six math fu.docx
Write an algorithm for a program that shows the use of all six math functions. Write, test, and debug the program using Python. SAMPLE OUTPUT (not including author/program information) ADDITION: 2+2=4 SUBTRACTION: 4-2=2 MULTIPLICATION: 4*2=8 DIVISION: 4/2=2 EXPONENT: 2**3=8 REMAINDER: 5%2=1
Solution
#!/user/bin/python
def add(x, y):
return x + y
def subtract(x, y):
return x - y
def multiply(x, y):
return x * y
def divide(x, y):
return x / y
def exp(x, y):
return x ** y
def mod(x, y):
return x % y
print(\"Select any one operation what you want to perform.\")
print(\"1.Add\")
print(\"2.Subtract\")
print(\"3.Multiply\")
print(\"4.Divide\")
print(\"5.Exponent\")
print(\"6.Remainder\")
choice = input(\"Enter choice(1/2/3/4/5/6):\")
num1 = int(input(\"Enter first number: \"))
num2 = int(input(\"Enter second number: \"))
if choice == \'1\':
print(num1,\"+\",num2,\"=\", add(num1,num2))
elif choice == \'2\':
print(num1,\"-\",num2,\"=\", subtract(num1,num2))
elif choice == \'3\':
print(num1,\"*\",num2,\"=\", multiply(num1,num2))
elif choice == \'4\':
print(num1,\"/\",num2,\"=\", divide(num1,num2))
elif choice == \'5\':
print(num1,\"**\",num2,\"=\", exp(num1,num2))
elif choice == \'6\':
print(num1,\"%\",num2,\"=\", mod(num1,num2))
else:
print(\"Invalid input\")
.
write a topic about RFID in SCM and what you have learned about adopti.docx
write a topic about RFID in SCM and what you have learned about adoption of RFID in SCM
Solution
RFID(Radio frequency identification) in SRM is a technology that incorporates the use of electromagnetic or electrostatic coupling in the radio frequency portion of the electromagnetic spectrum to uniquely identify an object, animal, or person. RFDI is coming into increasing use in industry as an alternative to the barcode.
The advantage of RFDI is that it does not require direct contact or line of sight scanning.
It consists of three components - 1) Antenna, 2. Transreciever, 3. Transponder
The term supply chain covers all possible processes involved in the flow of goods from manufacturing to customers including manufacturing, distribution and transportaion. RFDI technology is risen to become a revolutionary elament in supply chain management. It is not replacement for barcodes. RFDI is an innovative technology that will make the supply chain faster and efficient with less human error.
There is a common trend when integrating the supply chain for many companies and provides a good model for better understanding of what the adoption of RFDI technology can do for supply chain network.
there are many factors that maybe considered for adoption in RFDI in SCM like
information technology - complexity, organization compatibility.
Industrial organization - firm performance is enabled or constrained by industry structure.
Resource based view- presence of resource that meet certain conditions, such as value, rarity, imperfect, imitability and lack of substituability.
.
Write up a simple c-program to find the median of any array-Solution#i.docx
Write up a simple c-program to find the median of any array?
Solution
#include <stdio.h>
#include <conio.h>
void sort (int[],int);
float median (int A[], int nElem);
int main()
{int A[14]={1,2,3,4,4,2,2,1,2,4,1,4,4,4},nElem=14,i,m;
float fm;
printf(\"The array:\ \");
for(i=0;i<nElem;i++)
printf(\"%d \",A[i]);
printf(\"\ \ \");
sort(A,nElem);
printf(\"The array sorted is:\ \");
for(i=0;i<nElem;i++)
printf(\"%d \",A[i]);
printf(\"\ \ \");
fm=median(A,nElem);
printf(\"The median is %.2f\ \",fm);
getch();
return 0;
}
void sort (int A[], int nElem)
{int i,j,t;
for(i=0;i<nElem-1;i++)
for(j=i+1;j<nElem;j++)
if(A[i]>A[j])
{t=A[i];
A[i]=A[j];
A[j]=t;
}
}
float median (int A[], int nElem)
{float m;
if(nElem%2==0)
return((float)(A[nElem/2-1]+A[nElem/2])/2.);
else
return A[nElem/2];
}
.
Write an assembly language program in the Pep-8 simulator that corresp.docx
Write an assembly language program in the Pep/8 simulator that corresponds to the following C++ program:
#include <iostream>
using namespace std;
int num1;
int num2;
int main() {
cin >> num1 >> num2;
cout << num2 << endl << num1 << endl;
return 0;
}
Solution
c++ Program:
#include<iostream>
using namespace std;
int num1;
int num2;
int main()
{
cin>>num1>>num2;
cout<<num2<<endl<<num1<<endl;
return 0;
}
Assembly Language:
BR main
Sum1: .WORD 0x0000
Sum2: .WORD 0x0000
Num1: .BLOCK 2
Num2: .BLOCK 2
Main: LDA sum1,sum2,d ; ‘d’ = direct
DECI num1,d
ADDA num1,d
STA sum1,d
DEC2 num2,d
STA sum2,d
DECO sum1,d
DECO sum2,d
STOP
.END
.
Write the for structure in JAVA coding to read and display all element.docx
Write the for structure in JAVA coding to read and display all elements in the third row of array x.
Solution
import java.util.Scanner;
public class Program1 {
public static void main(String[] args) {
Scanner sc= new Scanner(System.in);
System.out.print(\"Enter number of elements: \");
int n= sc.nextInt();
//creating an array of element n
int []x = new int[n];
//now reading array elements
System.out.println(\"Enter \"+n+\" elements: \");
for(int i=0; i<n; i++)
x[i] = sc.nextInt();
// now displaying using enhanced for loop
System.out.println();
System.out.println(\"Array elemets are: \");
for(int e: x)
System.out.print(e+\" \");
System.out.println();
}
}
/*
Sample Output:
Enter number of elements: 6
Enter 6 elements:
4
8
9
23
12
15
Array elemets are:
4 8 9 23 12 15
*/
.
Write the formal description of the following state machine (M) What.docx
Write the formal description of the following state machine (M) What is the language recognized by M;L(M)?
Solution
the language that is accepted is: 0 * 10 * 10 *
explanation:
start node contains the self loop with value \'0\' i.e it may iterate as many times as it needed zero or more number of times
* represents zero or more number of times
\' s 0 \' \': it must pass through \'1\' no other choice
it reaches s 1
when it is on s 1 it has self loop with \'0\'
so it will iterate zero or more number of times i.e 0 *
\' s 1 \' \': it must pass through \'1\' no other choice
it reaches s 2
when it is on s2 it has self loop with \'0\'
so it will iterate zero or more number of times i.e 0 *
s 2 is the end state
so we cannot go from here an further
.
Write the C++ code for a function getInput which will read in an unkno.docx
Write the C++ code for a function getInput which will read in an unknown of values from a file and store them in a one-dimensional array of integers. The function stores, in a reference parameter, the actual number of values it reads. The input file is declared and opened in main(), so the input filestream variable is needed as a function parameter. Write a C ++ function to find the minimum in a designated row of a 2-dimensional array which has 10 columns. The function parameters are the array, the row index of the row in which the minimum is to be found, and a reference parameter for the minimum value.
Solution
4.
#include<iostream.h>
#include<conio.h>
void min_row(int a[4][10],int row)
{
int m=a[row][0];
for(int i=1;i<10;i++)
{
if(a[row][i]<m)
m=a[row][i];
}
cout<<\"minimum number in row \"<<row<<\" is \"<<m;
}
void main()
{
int arr[4][10],i,j,r;
clrscr();
cout<<\"Enter Element to the matrix\";
for(i=0;i<4;i++)
{
cout<<\" Row \"<<i<<\" :\";
for(j=0;j<10;j++)
{
cout<<\"Column \"<<j<<\":\";
cin>>arr[i][j];
}
}
cout<<\"\ Enter the row number\";
cin>>r;
min_row(arr,r);
getch();
}
.
Write the balanced reaction where thiosulfate and protons are the only.docx
Write the balanced reaction where thiosulfate and protons are the only reactants; and water, elemental sulfur, sulfur trioxide, and water are the only products. (Hint: this easier if you start with the balanced half-reactions). How many electrons are transferred in the balanced oxidation half reaction? How many electrons are transferred in the balanced reduction half reaction? How many electrons are transferred in the overall reaction?
Solution
S2O3^2- (aq) + H^+ -------------> S + SO3 + H2O
Oxidation half reaction                                                                               reduction half reaction
S2O3^2- (aq) ------------> 2SO3(g)Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â S2O3^2- ------------> 2S
S2O3^2- (aq)+3H2O ------------> 2SO3(g)Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â S2O3^2- ------------> 2S+ 3H2O
S2O3^2- (aq)+3H2O ------------> 2SO3(g)+ 6H^+(aq) Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â S2O3^2- + 6H^+ (aq) ------------> 2S+ 3H2O
S2O3^2- (aq)+3H2O ------------> 2SO3(g)+ 6H^+(aq) + 8e^- Â Â Â Â Â Â Â Â S2O3^2- + 6H^+ (aq) +4e^- ------------> 2S+ 3H2O
S2O3^2- (aq)+3H2O ------------> 2SO3(g)+ 6H^+(aq) + 8e^- Â Â Â Â Â Â Â ( 8 electrons are transferred)
2S2O3^2- + 12H^+ (aq) +8e^- ------------> 4S+ 6H2OÂ Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â ( 8 electrons are transferred)
------------------------------------------------------------------------------------------------------
3S2O3^2- (aq) +6H^+ (aq) --------------> 2So3(g) + 4S +3H2O overall reaction
.
Write functions odd and even- which takes a list of symbols L- and pro.docx
Write functions odd and even, which takes a list of symbols L, and produces a sublist of L containing symbols located at odd and even positions repectively. E.g., (odd \'(a b c d)) = (a c) (even \'(a b c d)) = (b d) (odd \'(a)) = (a) (even \'(a)) = ()
Solution
//just assumed that the size of array is 10 you can chnage it accordingly
void oddAndEven(char arr[10])
{
char sublistodd[5],sublisteven[5];
int j,k;
for(int i=0; i <10 ; i++)
{
if(i/2 == 0 && i<=4)
{
sublisteven[i] = arr[i];
j = i;
j=j+1;
}
else if(i/2 != 0 && i<=4)
{
sublistodd[i] = arr[i];
k = i;
k++;
}
else if(i/2 == 0 && i>4 && j<5)
{
sublisteven[j] = arr[i];
j++;
}
else if(i/2 !=0 && i>4 && k<5)
{
sublistodd[k] = arr[i];
k++;
}
}
}
.
Write about the two sources of energy Write about the two sources of.docx
Write about the two sources of energy
Write about the two sources of energy
Solution
Two sources of energy can be solar energy and wind energy
Solar Energy
Sun is the primary source of all energy. Light given by Sun, sunlight, is a clean and renewable source of energy. It is a sustainable resource which means it doesn\'t run out, but it can be maintained because the sun is always giving off energy. Coal or gas are not categorized as sustainable or renewable because once they are used, there is none left. More and more people have been using clean, renewable energy such as solar, wind, geothermal steam and others. It is called \'Green Power\' .
Some Advantages of Solar Energy
Some Disadvantages of Solar Energy
Wind Energy
Another source of renewable energy is wind. Wind can be described as the natural movement of air across the land or sea. To produce electricity, wind is used to turn the blades of a wind mill turns the shaft to which they are attached. This movement of the windmill shaft through a pump or generator produces electricity.
Advantages
Disadvantages
.
More from karlynwih (20)
Zone Diameter Interpretation Examine the zone diameter data in the tab.docx
Zone Diameter Interpretation Examine the zone diameter data in the tab.docx
Your unknown bacteria maybe one of the following 13 bacteria- Proteus.docx
Your unknown bacteria maybe one of the following 13 bacteria- Proteus.docx
Your friend got a notification on their iPhone letting them know they.docx
Your friend got a notification on their iPhone letting them know they.docx
Your reflection must be at least 400 words Examine habitat for humanit.docx
Your reflection must be at least 400 words Examine habitat for humanit.docx
You will learn about the Chain of Infection and apply your learning to.docx
You will learn about the Chain of Infection and apply your learning to.docx
Write definitions for the following terms- hydrograph- hyetograph- abs.docx
Write definitions for the following terms- hydrograph- hyetograph- abs.docx
Write code in C++ Write a program to perform a topological sort on a g.docx
Write code in C++ Write a program to perform a topological sort on a g.docx
Write C++ program that when given a value N(read from cin)- produces a.docx
Write C++ program that when given a value N(read from cin)- produces a.docx
Write an SML function groupdupes that takes a list of integers as its.docx
Write an SML function groupdupes that takes a list of integers as its.docx
You and another tech are discussing the relative merits of SCSI interf.docx
You and another tech are discussing the relative merits of SCSI interf.docx
Write an algorithm for a program that shows the use of all six math fu.docx
Write an algorithm for a program that shows the use of all six math fu.docx
write a topic about RFID in SCM and what you have learned about adopti.docx
write a topic about RFID in SCM and what you have learned about adopti.docx
Write up a simple c-program to find the median of any array-Solution#i.docx
Write up a simple c-program to find the median of any array-Solution#i.docx
Write an assembly language program in the Pep-8 simulator that corresp.docx
Write an assembly language program in the Pep-8 simulator that corresp.docx
Write the for structure in JAVA coding to read and display all element.docx
Write the for structure in JAVA coding to read and display all element.docx
Write the formal description of the following state machine (M) What.docx
Write the formal description of the following state machine (M) What.docx
Write the C++ code for a function getInput which will read in an unkno.docx
Write the C++ code for a function getInput which will read in an unkno.docx
Write the balanced reaction where thiosulfate and protons are the only.docx
Write the balanced reaction where thiosulfate and protons are the only.docx
Write functions odd and even- which takes a list of symbols L- and pro.docx
Write functions odd and even- which takes a list of symbols L- and pro.docx
Write about the two sources of energy Write about the two sources of.docx
Write about the two sources of energy Write about the two sources of.docx
Recently uploaded
How to Manage Your Lost Opportunities in Odoo 17 CRM
Odoo 17 CRM allows us to track why we lose sales opportunities with "Lost Reasons." This helps analyze our sales process and identify areas for improvement. Here's how to configure lost reasons in Odoo 17 CRM
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama UniversityAkanksha trivedi rama nursing college kanpur.
Natural birth techniques are various type such as/ water birth , alexender method, hypnosis, bradley method, lamaze method etcANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
A Strategic Approach: GenAI in Education
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)Academy of Science of South Africa
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS Template 2023-2024 by: Irene S. Rueco
PCOS corelations and management through Ayurveda.
This presentation includes basic of PCOS their pathology and treatment and also Ayurveda correlation of PCOS and Ayurvedic line of treatment mentioned in classics.
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
How to Add Chatter in the odoo 17 ERP Module
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
Advantages and Disadvantages of CMS from an SEO Perspective
Advantages and Disadvantages of CMS from an SEO Perspective
The Diamonds of 2023-2024 in the IGRA collection
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
Introduction to AI for Nonprofits with Tapp Network
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar KanvariaCACJapan - GROUP Presentation 1- Wk 4.pdf
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
Recently uploaded (20)
How to Manage Your Lost Opportunities in Odoo 17 CRM
How to Manage Your Lost Opportunities in Odoo 17 CRM
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
Azure Interview Questions and Answers PDF By ScholarHat
Azure Interview Questions and Answers PDF By ScholarHat
Advantages and Disadvantages of CMS from an SEO Perspective
Advantages and Disadvantages of CMS from an SEO Perspective
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Group Presentation 2 Economics.Ariana Buscigliopptx
Group Presentation 2 Economics.Ariana Buscigliopptx
Write an application class (ArrayListApplication) that contains a main.docx
- 1. Write an application class (ArrayListApplication) that contains a main(...) method. The method must perform the following. • Prompt user for 10 names and store in an "ArrayList" object • Shuffle the names using "shuffle"" method of the "Collections" class • Display the smallest element in the collection use the "Collections.min" method. • Display the largest element in the collection use the "Collections.max" method. Solution import java.util.*; public class ArrayListNames { publicstaticvoid main(String[] args) { int i; ArrayList<String> name = new ArrayList<String>(); System.out.println("Enter 10 Names "); for( i=0; i<10; i++ ) { Scanner s =newScanner(System.in); name add(s.next()); } System.out.println("Initial collection : "+name);
- 2. // shuffle the list Collections.shuffle(name); System.out.println("Final collection after shuffle: "+name); Object minimum = Collections.min(name); System.out.println("Minimum Element of ArrayList name is : " + minimum); Object maximum = Collections.max(name); System.out.println("Maximum Element of ArrayList name is : " + maximum); } }