import java.util.ArrayList;public class ArrayListADT { public .pdf
•
0 likes•5 views
import java.util.ArrayList; public class ArrayListADT { public static void printArray(ArrayList numsList, int numOfElem) { int i = 0; for (i = 0; i < numOfElem; ++i) { System.out.print(numsList.get(i)); System.out.print(\" \"); } System.out.println(\"\"); } public static void main (String [] args) { ArrayList numsList = new ArrayList(); int numOfElem = 4; numsList.add(new Integer(101)); numsList.add(new Integer(200)); numsList.add(new Integer(103)); numsList.remove(1); //remove 200 at index 1 as index starts from 0 numsList.add(0,new Integer(100)); //add 100 at index 0 so 101 will move to index 1 numsList.add(2,new Integer(102)); // add 102 at index 2 so 103 will move down to index 3 printArray(numsList, numOfElem); return; } } Output Solution import java.util.ArrayList; public class ArrayListADT { public static void printArray(ArrayList numsList, int numOfElem) { int i = 0; for (i = 0; i < numOfElem; ++i) { System.out.print(numsList.get(i)); System.out.print(\" \"); } System.out.println(\"\"); } public static void main (String [] args) { ArrayList numsList = new ArrayList(); int numOfElem = 4; numsList.add(new Integer(101)); numsList.add(new Integer(200)); numsList.add(new Integer(103)); numsList.remove(1); //remove 200 at index 1 as index starts from 0 numsList.add(0,new Integer(100)); //add 100 at index 0 so 101 will move to index 1 numsList.add(2,new Integer(102)); // add 102 at index 2 so 103 will move down to index 3 printArray(numsList, numOfElem); return; } } Output.
Report
Share
Report
Share
Download to read offline
![import java.util.ArrayList;
public class ArrayListADT {
public static void printArray(ArrayList numsList, int numOfElem) {
int i = 0;
for (i = 0; i < numOfElem; ++i) {
System.out.print(numsList.get(i));
System.out.print(" ");
}
System.out.println("");
}
public static void main (String [] args) {
ArrayList numsList = new ArrayList();
int numOfElem = 4;
numsList.add(new Integer(101));
numsList.add(new Integer(200));
numsList.add(new Integer(103));
numsList.remove(1); //remove 200 at index 1 as index starts from 0
numsList.add(0,new Integer(100)); //add 100 at index 0 so 101 will move to index 1
numsList.add(2,new Integer(102)); // add 102 at index 2 so 103 will move down to
index 3
printArray(numsList, numOfElem);
return;
}
}
Output
Solution
import java.util.ArrayList;
public class ArrayListADT {
public static void printArray(ArrayList numsList, int numOfElem) {
int i = 0;](https://image.slidesharecdn.com/importjava-230629130213-065c044f/85/import-java-util-ArrayList-public-class-ArrayListADT-public-pdf-1-320.jpg)
![for (i = 0; i < numOfElem; ++i) {
System.out.print(numsList.get(i));
System.out.print(" ");
}
System.out.println("");
}
public static void main (String [] args) {
ArrayList numsList = new ArrayList();
int numOfElem = 4;
numsList.add(new Integer(101));
numsList.add(new Integer(200));
numsList.add(new Integer(103));
numsList.remove(1); //remove 200 at index 1 as index starts from 0
numsList.add(0,new Integer(100)); //add 100 at index 0 so 101 will move to index 1
numsList.add(2,new Integer(102)); // add 102 at index 2 so 103 will move down to
index 3
printArray(numsList, numOfElem);
return;
}
}
Output](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
public static ArrayListInteger doArrayListInsertAtMedian(int nu.pdf
public static ArrayList doArrayListInsertAtMedian(int numItems) {
System.out.print(\"doArrayListInsertAtMedian: \");
ArrayList list = new ArrayList<>();
// TODO Write code that adds integers 0 through (numitems - 1)
// to list, inside a loop.
long startTime = getTimestamp();
// TODO Write code that adds -1 to list at index
// (list.size() / 2)
long endTime = getTimestamp();
long totalTime = endTime - startTime;
System.out.println(totalTime);
return list;
}
Solution
import java.util.ArrayList;
import java.util.Date;
public class ArrayUtils {
public static void main(String[] args) {
System.out.println(doArrayListInsertAtMedian(10));
}
/**
* @param numItems
* @return
*/
public static ArrayList doArrayListInsertAtMedian(int numItems) {
System.out.print(\"doArrayListInsertAtMedian: \");
ArrayList list = new ArrayList();
// TODO Write code that adds integers 0 through (numitems - 1)
// to list, inside a loop.
Date date = new Date();
long startTime = date.getTime();
for (int i = 0; i < numItems; i++) {
list.add(i);
}
// TODO Write code that adds -1 to list at index
// (list.size() / 2)
list.set(list.size() / 2, -1);
long endTime = date.getTime();
long totalTime = endTime - startTime;
System.out.println(totalTime);
return list;
}
}
OUTPUT:
doArrayListInsertAtMedian: 0
[0, 1, 2, 3, 4, -1, 6, 7, 8, 9].
import java-util-ArrayList- import java-util-Collections- import java-.pdf
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.
.
Please add-modify the following to the original code using C# 1- Delet.docx
Pick any employer in Canada and you should pick employers in your familiar area if possible.
1. Summarize the benefits offered by both organizations.
2. Summarise the employee eligibility for both packages.
3. Compare and contrast the benefit packages.
In your opinion, which benefit package is more attractive? Why?
.
JAVALAB #8 - ARRAY BASED LISTSThe next exercise is based on this.pdf
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.
import java.util.ArrayList;public class Checkout{private.docx
import java.util.ArrayList;public class Checkout{private.docx
Engineering lecture ppt by venay magen
Venay Magen likes the shading red, particularly on Tuesdays. He cherishes to drink bourbon (on all days). He figured out how to drink whisky from his youth companion Zippo, when they went to class together at Mount Temple Comprehensive School. He is best known as the lead vocalist for the band MN3.
import java.util.ArrayList; import java.util.Scanner;public clas.pdf
import java.util.ArrayList;
import java.util.Scanner;
public class Pairs {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println(\"Enter 12 digit number:\");
long num=sc.nextLong();
if(count(num)!=12){
System.out.println(\"Invalid input\");
}
else{
ArrayList al=new ArrayList();
String s=\"\"+num;
int i=0;
while(i!=12){
al.add(Long.parseLong(s.substring(i, i+2)));
i=i+2;
}
ArrayList al1=new ArrayList();
String s1=\"\"+num;
int i1=0;
while(i1!=12){
al1.add(Long.parseLong(s1.substring(i1, i1+3)));
i1=i1+3;
}
ArrayList al2=new ArrayList();
String s2=\"\"+num;
int i2=0;
while(i2!=12){
al2.add(Long.parseLong(s2.substring(i2, i2+4)));
i2=i2+4;
}
ArrayList al3=new ArrayList();
String s3=\"\"+num;
int i3=0;
while(i3!=12){
al3.add(Long.parseLong(s3.substring(i3, i3+6)));
i3=i3+6;
}
boolean flag=true;
loop: for(long j:al){
for(long k:al){
if(j>k){
flag=false;
break loop;
}
}
}
if(flag){
System.out.println(al);
}
else{
System.out.println(\"6 2digit numbers are not in increasing order\");
}
boolean flag1=true;
loop1: for(long j:al1){
for(long k:al1){
if(j>k){
flag1=false;
break loop1;
}
}
}
if(flag1){
System.out.println(al1);
}
else{
System.out.println(\"4 3digit numbers are not in increasing order\");
}
boolean flag2=true;
loop2: for(long j:al2){
for(long k:al2){
if(j>k){
flag2=false;
break loop2;
}
}
}
if(flag2){
System.out.println(al2);
}
else{
System.out.println(\"3 4digit numbers are not in increasing order\");
}
boolean flag3=true;
loop3: for(long j:al3){
for(long k:al3){
if(j>k){
flag3=false;
break loop3;
}
}
}
if(flag3){
System.out.println(al3);
}
else{
System.out.println(\"2 6digit numbers are not in increasing order\");
}
}
}
public static long count(long num){
long count=0;
while(num!=0){
num=num/10;
count++;
}
return count;
}
}
Solution
import java.util.ArrayList;
import java.util.Scanner;
public class Pairs {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println(\"Enter 12 digit number:\");
long num=sc.nextLong();
if(count(num)!=12){
System.out.println(\"Invalid input\");
}
else{
ArrayList al=new ArrayList();
String s=\"\"+num;
int i=0;
while(i!=12){
al.add(Long.parseLong(s.substring(i, i+2)));
i=i+2;
}
ArrayList al1=new ArrayList();
String s1=\"\"+num;
int i1=0;
while(i1!=12){
al1.add(Long.parseLong(s1.substring(i1, i1+3)));
i1=i1+3;
}
ArrayList al2=new ArrayList();
String s2=\"\"+num;
int i2=0;
while(i2!=12){
al2.add(Long.parseLong(s2.substring(i2, i2+4)));
i2=i2+4;
}
ArrayList al3=new ArrayList();
String s3=\"\"+num;
int i3=0;
while(i3!=12){
al3.add(Long.parseLong(s3.substring(i3, i3+6)));
i3=i3+6;
}
boolean flag=true;
loop: for(long j:al){
for(long k:al){
if(j>k){
flag=false;
break loop;
}
}
}
if(flag){
System.out.println(al);
}
else{
System.out.println(\"6 2digit numbers are not in increasing order\");
}
boolean flag1=true;
loop1: for(long j:al1){
for(long k:al1){
if(j>k){
flag1=false;
br.
Recommended
public static ArrayListInteger doArrayListInsertAtMedian(int nu.pdf
public static ArrayList doArrayListInsertAtMedian(int numItems) {
System.out.print(\"doArrayListInsertAtMedian: \");
ArrayList list = new ArrayList<>();
// TODO Write code that adds integers 0 through (numitems - 1)
// to list, inside a loop.
long startTime = getTimestamp();
// TODO Write code that adds -1 to list at index
// (list.size() / 2)
long endTime = getTimestamp();
long totalTime = endTime - startTime;
System.out.println(totalTime);
return list;
}
Solution
import java.util.ArrayList;
import java.util.Date;
public class ArrayUtils {
public static void main(String[] args) {
System.out.println(doArrayListInsertAtMedian(10));
}
/**
* @param numItems
* @return
*/
public static ArrayList doArrayListInsertAtMedian(int numItems) {
System.out.print(\"doArrayListInsertAtMedian: \");
ArrayList list = new ArrayList();
// TODO Write code that adds integers 0 through (numitems - 1)
// to list, inside a loop.
Date date = new Date();
long startTime = date.getTime();
for (int i = 0; i < numItems; i++) {
list.add(i);
}
// TODO Write code that adds -1 to list at index
// (list.size() / 2)
list.set(list.size() / 2, -1);
long endTime = date.getTime();
long totalTime = endTime - startTime;
System.out.println(totalTime);
return list;
}
}
OUTPUT:
doArrayListInsertAtMedian: 0
[0, 1, 2, 3, 4, -1, 6, 7, 8, 9].
import java-util-ArrayList- import java-util-Collections- import java-.pdf
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.
.
Please add-modify the following to the original code using C# 1- Delet.docx
Pick any employer in Canada and you should pick employers in your familiar area if possible.
1. Summarize the benefits offered by both organizations.
2. Summarise the employee eligibility for both packages.
3. Compare and contrast the benefit packages.
In your opinion, which benefit package is more attractive? Why?
.
JAVALAB #8 - ARRAY BASED LISTSThe next exercise is based on this.pdf
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.
import java.util.ArrayList;public class Checkout{private.docx
import java.util.ArrayList;public class Checkout{private.docx
Engineering lecture ppt by venay magen
Venay Magen likes the shading red, particularly on Tuesdays. He cherishes to drink bourbon (on all days). He figured out how to drink whisky from his youth companion Zippo, when they went to class together at Mount Temple Comprehensive School. He is best known as the lead vocalist for the band MN3.
import java.util.ArrayList; import java.util.Scanner;public clas.pdf
import java.util.ArrayList;
import java.util.Scanner;
public class Pairs {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println(\"Enter 12 digit number:\");
long num=sc.nextLong();
if(count(num)!=12){
System.out.println(\"Invalid input\");
}
else{
ArrayList al=new ArrayList();
String s=\"\"+num;
int i=0;
while(i!=12){
al.add(Long.parseLong(s.substring(i, i+2)));
i=i+2;
}
ArrayList al1=new ArrayList();
String s1=\"\"+num;
int i1=0;
while(i1!=12){
al1.add(Long.parseLong(s1.substring(i1, i1+3)));
i1=i1+3;
}
ArrayList al2=new ArrayList();
String s2=\"\"+num;
int i2=0;
while(i2!=12){
al2.add(Long.parseLong(s2.substring(i2, i2+4)));
i2=i2+4;
}
ArrayList al3=new ArrayList();
String s3=\"\"+num;
int i3=0;
while(i3!=12){
al3.add(Long.parseLong(s3.substring(i3, i3+6)));
i3=i3+6;
}
boolean flag=true;
loop: for(long j:al){
for(long k:al){
if(j>k){
flag=false;
break loop;
}
}
}
if(flag){
System.out.println(al);
}
else{
System.out.println(\"6 2digit numbers are not in increasing order\");
}
boolean flag1=true;
loop1: for(long j:al1){
for(long k:al1){
if(j>k){
flag1=false;
break loop1;
}
}
}
if(flag1){
System.out.println(al1);
}
else{
System.out.println(\"4 3digit numbers are not in increasing order\");
}
boolean flag2=true;
loop2: for(long j:al2){
for(long k:al2){
if(j>k){
flag2=false;
break loop2;
}
}
}
if(flag2){
System.out.println(al2);
}
else{
System.out.println(\"3 4digit numbers are not in increasing order\");
}
boolean flag3=true;
loop3: for(long j:al3){
for(long k:al3){
if(j>k){
flag3=false;
break loop3;
}
}
}
if(flag3){
System.out.println(al3);
}
else{
System.out.println(\"2 6digit numbers are not in increasing order\");
}
}
}
public static long count(long num){
long count=0;
while(num!=0){
num=num/10;
count++;
}
return count;
}
}
Solution
import java.util.ArrayList;
import java.util.Scanner;
public class Pairs {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println(\"Enter 12 digit number:\");
long num=sc.nextLong();
if(count(num)!=12){
System.out.println(\"Invalid input\");
}
else{
ArrayList al=new ArrayList();
String s=\"\"+num;
int i=0;
while(i!=12){
al.add(Long.parseLong(s.substring(i, i+2)));
i=i+2;
}
ArrayList al1=new ArrayList();
String s1=\"\"+num;
int i1=0;
while(i1!=12){
al1.add(Long.parseLong(s1.substring(i1, i1+3)));
i1=i1+3;
}
ArrayList al2=new ArrayList();
String s2=\"\"+num;
int i2=0;
while(i2!=12){
al2.add(Long.parseLong(s2.substring(i2, i2+4)));
i2=i2+4;
}
ArrayList al3=new ArrayList();
String s3=\"\"+num;
int i3=0;
while(i3!=12){
al3.add(Long.parseLong(s3.substring(i3, i3+6)));
i3=i3+6;
}
boolean flag=true;
loop: for(long j:al){
for(long k:al){
if(j>k){
flag=false;
break loop;
}
}
}
if(flag){
System.out.println(al);
}
else{
System.out.println(\"6 2digit numbers are not in increasing order\");
}
boolean flag1=true;
loop1: for(long j:al1){
for(long k:al1){
if(j>k){
flag1=false;
br.
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
// 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
*/.
Write a method called uniqueNumbers that takes an int array as param.pdf
Write a method called uniqueNumbers that takes an int array as parameter, and returns a
different int array, which only contains the list of unique numbers in the original array. Hint: Use
the isPresent method defined below to accomplish your
here is the code we need to add too
Solution
solution
package com.mt.classes;
import java.util.ArrayList;
import java.util.List;
public class Lab8e {
public static void main(String[] args) {
int[] numbers = new int[20];
// Generate random numbers between 0 and 99 and fill up the array
for (int i = 0; i < numbers.length; i++) {
numbers[i] = (int) (Math.random() * 50);
}
System.out.println(\"The list is:\");
printNumbers(numbers);
// Task 1
System.out.println(\"The smallest number in the list is \"
+ smallestNumber(numbers));
// Task 2
System.out.println(\"The largest number in the list is \"
+ largestNumber(numbers));
// Task 3
System.out.println(\"The average of numbers in the list is \"
+ averageOfNumbers(numbers));
// Task 4: Extra Credit. Uncomment the following
// two lines if you complete this task.
System.out.println(\"The list of unique numbers is:\");
uniqueNumbers(numbers);
}
private static void uniqueNumbers(int[] numbers) {
for (int i = 0; i < numbers.length; i++) {
boolean isDuplicate = false;
for (int j = 0; j < i; j++) {
if (numbers[i] == numbers[j]) {
isDuplicate = true;
break;
}
}
if (!isDuplicate) {
System.out.print(numbers[i] + \" \");
}
}
}
public static void printNumbers(int[] list) {
for (int i = 0; i < list.length; i++) {
System.out.print(list[i] + \" \");
}
System.out.println();
}
// 1. Write a method called smallestNumber that
// takes an int array as parameter, and returns the
// smallest number
public static int smallestNumber(int[] list) {
int small = 100;
for (int i = 0; i < list.length; i++) {
if (list[i] < small) {
small = list[i];
}
}
return small;
}
// 2. Write a method called largestNumber that
// takes an int array as parameter, and returns the
// largest number
public static int largestNumber(int[] list) {
int large = 0;
for (int i = 0; i < list.length; i++) {
if (list[i] > large) {
large = list[i];
}
}
return large;
}
// 3. Write a method called averageOfNumbers that
// takes an int array as parameter, and returns the
// average of the numbers
public static double averageOfNumbers(int[] list) {
double average = 0.0;
for (int i = 0; i < list.length; i++) {
average = average + list[i];
}
average = average / list.length;
return average;
}
public static boolean isPresent(int[] list, int target) {
boolean found = false;
for (int i = 0; i < list.length && !found && list[i] != 0; i++) {
if (list[i] == target) {
found = true;
}
}
return found;
}
}
output
The list is:
16 14 11 31 7 8 18 49 27 43 9 39 38 18 6 16 8 30 32 15
The smallest number in the list is 6
The largest number in the list is 49
The average of numbers in the list is 21.75
The list of unique numbers is:
16 14 11 31 7 8 18 49 27 43 9 39 38 6 30 32 15.
I am stuck on parts E and FExercise 1 NumberListTester.java.pdf
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 ;
/.
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...Sunil Kumar Gunasekaran
OrderTest.javapublic class OrderTest { Get an arra.pdf
OrderTest.java
public class OrderTest {
/**
* Get an array of specified size and pass it to Order.order().
* Report the results.
*/
public static void main(String[] args) {
if (args.length != 1) {//1
System.out.println(\"Usage: java OrderTest sizeOfArray\ \"
+ \"\\tor\ \\tjava OrderTest arrayFile\");
System.exit(1);
}
// create or read the int[]
int size = 0;
int[] array = new int[0];//5
try {
size = Integer.parseInt(args[0]);
array = ArrayOfInts.randomizedArray(size);
} catch (NumberFormatException nfe) {//8
try {
array = ArrayOfInts.arrayFromFile(args[0]);
size = array.length;
} catch (Exception e) {
System.err.println(\"unable to read array from \" + args[0]);
System.exit(1);//14
}
}
System.out.println(\"before:\");//15
for (int i = 0; i < array.length; i++) {//2 n
System.out.printf(((i+1) % 10 > 0) ? \" %d\" : \" %d\ \", array[i]);//1
}
int myNum = Order.order(array); //this is the call we want to measure
System.out.println(\"\ after:\");//18
for (int i = 0; i < array.length; i++) {//2 n
System.out.printf(((i+1) % 10 > 0) ? \" %d\" : \" %d\ \", array[i]);
}
System.out.println(myNum);
}
}
ArrayOfInts.java
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.InputMismatchException;
import java.util.Scanner;
public class ArrayOfInts {
/**
* Returns an array of consecutive ints from 1 to size.
*/
public static int[] orderedArray(int size) {
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = i+1;
}
return a;
}
/**
* Returns a randomized array containing ints from 1 to size.
*/
public static int[] randomizedArray(int size) {
ArrayList aL = new ArrayList();
for (int i = 0; i < size; i++) {
aL.add(i+1);
}
Collections.shuffle(aL);
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = aL.get(i);
}
return a;
}
/**
* Writes an int[] to a plain-text file with ints separated by spaces.
* Useful for creating input files for repeatable tests.
*/
public static void arrayToFile(int[] array, String outfile) {
try {
FileWriter fw = new FileWriter(outfile);
BufferedWriter bw = new BufferedWriter(fw);
PrintWriter outFile = new PrintWriter(bw);
for (int i : array) {
outFile.print(i + \" \");
}
outFile.close();
} catch (IOException e) {
System.err.println(\"Could not write to \" + outfile + \"\ \" + e);
}
}
/**
* Read ints from a file and return them in an int[]
*/
public static int[] arrayFromFile(String infile) throws FileNotFoundException,
InputMismatchException {
Scanner scan = new Scanner(new File(infile));
ArrayList aL = new ArrayList();
while (scan.hasNext()) {
aL.add(scan.nextInt());
}
scan.close();
int[] a = new int[aL.size()];
for (int i = 0; i < a.length; i++) {
a[i] = aL.get(i);
}
return a;
}
}
Order.java
public class Order {
/**
* Take an int[] and reorganize it so they are in ascending order.
*/
public static int order(int[] array) .
sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
sumOfSquares
import java.util.*;
public class Arraylistoperation
{
public static void main(String args[])
{
ArrayList list = createSquaresList(10);
printList(list);
}
public static ArrayList createSquaresList(int n)
{
ArrayList squares= new ArrayList<>();
double s = 0.0;
for (double i = 0.0; i <= n-1; i++)
{
s = i*i;
squares.add(s);
}
return squares;
for(int i = 0; i < m.size(); i++)
{
s+= m.get(i);
}
return s;
}
}
Like wise sumOfCubes
Solution
sumOfSquares
import java.util.*;
public class Arraylistoperation
{
public static void main(String args[])
{
ArrayList list = createSquaresList(10);
printList(list);
}
public static ArrayList createSquaresList(int n)
{
ArrayList squares= new ArrayList<>();
double s = 0.0;
for (double i = 0.0; i <= n-1; i++)
{
s = i*i;
squares.add(s);
}
return squares;
for(int i = 0; i < m.size(); i++)
{
s+= m.get(i);
}
return s;
}
}
Like wise sumOfCubes.
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 .
1. import java.util.Scanner; public class Alphabetical_Order {.pdf
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(\'\ \');
}
}
}.
Why following sort does not work (It does not sort last 2 - 3 numbe.pdf
Why following sort does not work? (It does not sort last 2 - 3 numbers)
//Sort order
class SortNumbListener implements ActionListener
{
@Override
public void actionPerformed(ActionEvent e)
{
Collections.sort(list);
for(int i = 0; i < list.size(); i++)
{
textfield2.setText(list.toString());
}
System.out.print(list + \"\ \");
}
}
Solution
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import javax.swing.JTextField;
public class SorAction {
public JTextField textfield2;
public List list;
public SorAction() {
// TODO Auto-generated constructor stub
textfield2 = new JTextField();
list = new ArrayList();
list.add(20);
list.add(12);
list.add(32);
list.add(3);
new SortNumbListener().actionPerformed(new ActionEvent(\"\", 0, null));
}
public static void main(String[] args) {
try {
new SorAction();
} catch (Exception e) {
// TODO: handle exception
e.printStackTrace();
}
}
class SortNumbListener implements ActionListener {
@Override
public void actionPerformed(ActionEvent e) {
Collections.sort(list);
textfield2.setText(list.toString());
System.out.print(list + \"\ \");
}
}
}
OUTPUT:
[3, 12, 20, 32]
NOTE: please check the above example, sorting fine, but what is the need of loop,
if you want to add the text to textbox use setText() method of textfield.
import java.util.; public class ClientMerge_2 { static Scan.pdf
import java.util.*;
public class ClientMerge_2 {
static Scanner input = new Scanner(System.in);
public static void main(String[] args) {
UnorderedLinkedListInt list1 = new UnorderedLinkedListInt();
UnorderedLinkedListInt list2 = new UnorderedLinkedListInt();
UnorderedLinkedListInt list3 = new UnorderedLinkedListInt();
int num;
System.out.println(\"Enter integers for the first list(999 to stop)\");
num = input.nextInt();
while (num != 999) {
list1.insertLast((Integer) num);
num = input.nextInt();
}
System.out.println(\"Enter integers for the second list(999 to stop)\");
num = input.nextInt();
while (num != 999) {
list2.insertLast((Integer) num);
num = input.nextInt();
}
System.out.print(\"\ The first list is: \");
list1.print();
System.out.println(\"\ The length of the first list is: \" + list1.length());
if (!list1.isEmptyList()) {
System.out.println(\"First element/list1: \" + list1.front());
System.out.println(\"Last element/list1: \" + list1.back());
}
System.out.print(\"\ The second list is: \");
list2.print();
System.out.println(\"\ The length of the second list is: \" + list2.length());
if (!list2.isEmptyList()) {
System.out.println(\"First element/list2: \" + list2.front());
System.out.println(\"Last element/list2: \" + list2.back());
}
list3 = list1.merge2(list2);
System.out.print(\"\ After concatenating the 2 lists, the merged list1 is: \");
list3.print();
System.out.println(\"\ The length of the merged list is: \" + list3.length());
if (!list3.isEmptyList()) {
System.out.println(\"First element/merged list: \" + list3.front());
System.out.println(\"Last element/merged list: \" + list3.back());
}
System.out.println(\"Enter key for split: \");
num = input.nextInt();
list3.split(list1, list2, num);
System.out.print(\"\ The first list after split is: \");
list1.print();
System.out.print(\"\ The second list after split is: \");
list2.print();
System.out.println();
}
}
Solution
import java.util.*;
public class ClientMerge_2 {
static Scanner input = new Scanner(System.in);
public static void main(String[] args) {
UnorderedLinkedListInt list1 = new UnorderedLinkedListInt();
UnorderedLinkedListInt list2 = new UnorderedLinkedListInt();
UnorderedLinkedListInt list3 = new UnorderedLinkedListInt();
int num;
System.out.println(\"Enter integers for the first list(999 to stop)\");
num = input.nextInt();
while (num != 999) {
list1.insertLast((Integer) num);
num = input.nextInt();
}
System.out.println(\"Enter integers for the second list(999 to stop)\");
num = input.nextInt();
while (num != 999) {
list2.insertLast((Integer) num);
num = input.nextInt();
}
System.out.print(\"\ The first list is: \");
list1.print();
System.out.println(\"\ The length of the first list is: \" + list1.length());
if (!list1.isEmptyList()) {
System.out.println(\"First element/list1: \" + list1.front());
System.out.println(\"Last element/list1: \" + list1.back());
}
System.out.print(\"\ The second list is: \");
list2.print();
System.out.println(\"\ The length of the second li.
Please create the appropriate JUnit test cases to thoroughly.pdf
Please create the appropriate JUnit test cases to thoroughly unit test the following
program:
IntegerSet.java
import java.util.*;
public class IntegerSet{
private ArrayList<Integer> list= new ArrayList<>();
public IntegerSet(ArrayList list) {
this.list=list;
}
// clears the all representation of class
public void clear() {
list.clear();
}
// returns the length of set
public int length() {
return list.size();
}
// return true if 2 lists are equal
public boolean equals(IntegerSet b) {
ArrayList<Integer> list2=b.list;
if(list.size()!=list2.size()) {
return false;
}
ArrayList<Integer> temp1=list;
ArrayList<Integer> temp2=list2;
Collections.sort(temp1);
Collections.sort(temp2);
for(int i=0;i<temp1.size();i++) {
if(temp1.get(i)!=temp2.get(i)) {
return false;
}
}
return true;
}
// returns a largest item and throw exception if list is empty
public int largest() throws IntegerSetException {
if(list.size()==0) {
IntegerSetException e= new IntegerSetException();
throw e;
}
int max=0;
for(int i=0;i<list.size();i++) {
if(list.get(i)>max) {
max=list.get(i);
}
}
return max;
}
// returns a largest item and throw exception if list is empty
public int smallest() throws IntegerSetException {
if(list.size()==0) {
IntegerSetException e= new IntegerSetException();
throw e;
}
int min=Integer.MAX_VALUE;
for(int i=0;i<list.size();i++) {
if(list.get(i)<min) {
min=list.get(i);
}
}
return min;
}
// add item if already not exist in list
public void addItem(int item ) {
boolean exist=false;
for(int i=0;i<list.size();i++) {
if(list.get(i)==item) {
exist=true;
}
}
if(exist==false) {
list.add(item);
}
}
// remove item if already not exist in list
public void removeItem(int item ) {
for(int i=0;i<list.size();i++) {
if(list.get(i)==item) {
list.remove(i);
}
}
}
// return union of of 2 sets
public IntegerSet union(IntegerSet list2) {
ArrayList<Integer> temp=list2.getlist();
Set<Integer> set = new HashSet<>();
set.addAll(list);
set.addAll(temp);
ArrayList<Integer> list3= new ArrayList<>(set);
IntegerSet list4= new IntegerSet(list3);
return list4;
}
// return intersection of of 2 sets
public IntegerSet intersection(IntegerSet list2) {
ArrayList<Integer> temp=list2.getlist();
list.retainAll(temp);
IntegerSet list4= new IntegerSet(list);
return list4;
}
// returns difference of 2 sets
public IntegerSet difference (IntegerSet list2) {
ArrayList<Integer> temp=list2.getlist();
// Remove all elements in list2 from list
list.removeAll(temp);
IntegerSet list4= new IntegerSet(list);
return list4;
}
public ArrayList<Integer> getlist(){
return list;
}
}
IntegerSetException.java
class IntegerSetException extends Exception {
Driver.java
import java.util.*;
public class Driver {
public static void main(String[] args) throws IntegerSetException {
ArrayList<Integer> list1= new ArrayList<>();
ArrayList<Integer> list2= new ArrayList<>();
// make 2 instance of integerset class for implementation
IntegerSet set1= new IntegerSet(list1);
IntegerSet set2= new IntegerSet(list2);
set1.addItem(1);
set1.ad.
Programming Java - Lection 07 - Puzzlers - Lavrentyev Fedor
Курс "Программирование на Java". Лекция 07 "Бонус - Головоломки".
Java Puzzlers. Синхронизация и многопоточность. Примитивы. Объекты и классы. Исключения и финализация.
МФТИ, 2016 год. Лектор - Лаврентьев Федор Сергеевич
ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf
ArrayTest.java
import java.util.Arrays;
import java.util.Scanner;
public class ArrayTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int table[] = new int[10];
int count = 0;
Scanner scan = new Scanner(System.in);
for(int i=0; i<10; i++){
System.out.println(\"Enter Array Element:\");
int n = scan.nextInt();
if(n < 0){
System.out.println(\"Invalid Number.\");
i--;
if(count >= 5)
break;
}else{
table[i] = n;
count++;
}
}
int sum = 0;
System.out.println(\"Array Elements are: \"+Arrays.toString(table));
for(int i=0; i avg){
high++;
}
else{
equal++;
}
}
System.out.println(\"Number of elements less than average \"+less);
System.out.println(\"Number of elements greater than average \"+high);
System.out.println(\"Number of elements equal to average \"+equal);
for(;;){
System.out.println(\"Enter Search Element (-1 to quit): \");
int searchNum = scan.nextInt();
if(searchNum == -1){
break;
}
int index = find(searchNum, table, count);
if(index == -1){
System.out.println(\"Element not found\");
}
else{
System.out.println(\"Element found at \"+index);
}
}
smallest(table, count);
}
public static int find (int valueToSearchFor, int intArray[ ], int numberOfValidEnties){
for(int i=0; i a[i]){
min = a[i];
index = i;
}
}
System.out.println(\"The smallest element is \"+min+\" index is \"+index);
int temp = a[0];
a[0] = a[index];
a[index] = temp;
System.out.println(\"After swap array elements are :\"+Arrays.toString(a));
}
}
Output:
Enter Array Element:
3
Enter Array Element:
4
Enter Array Element:
5
Enter Array Element:
2
Enter Array Element:
1
Enter Array Element:
6
Enter Array Element:
7
Enter Array Element:
8
Enter Array Element:
-1
Invalid Number.
Array Elements are: [3, 4, 5, 2, 1, 6, 7, 8, 0, 0]
The Sum is 36
The Average is : 4.5
Number of elements less than average 4
Number of elements greater than average 4
Number of elements equal to average 0
Enter Search Element (-1 to quit):
2
Element found at 3
Enter Search Element (-1 to quit):
3
Element found at 0
Enter Search Element (-1 to quit):
1
Element found at 4
Enter Search Element (-1 to quit):
6
Element found at 5
Enter Search Element (-1 to quit):
-1
The smallest element is 1 index is 4
After swap array elements are :[1, 4, 5, 2, 3, 6, 7, 8, 0, 0]
Solution
ArrayTest.java
import java.util.Arrays;
import java.util.Scanner;
public class ArrayTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int table[] = new int[10];
int count = 0;
Scanner scan = new Scanner(System.in);
for(int i=0; i<10; i++){
System.out.println(\"Enter Array Element:\");
int n = scan.nextInt();
if(n < 0){
System.out.println(\"Invalid Number.\");
i--;
if(count >= 5)
break;
}else{
table[i] = n;
count++;
}
}
int sum = 0;
System.out.println(\"Array Elements are: \"+Arrays.toString(table));
for(int i=0; i avg){
high++;
}
else{
equal++;
}
}
System.out.println(\"Number of elements less than average \"+less);
System.out.println(\"Number of.
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
2.(Sorted list: array implementation)This sorted list ADT discussed in class should be extended
by the addition of two new methods:
//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] .
import java-util--- public class MyLinkedList{ public static void.pdf
import java.util.*; public class MyLinkedList{ public static void main(String[] args){ } } //copy
MyList to here interface MyList extends Collection { /* MyList will inherite all methods from
Collection public boolean add(E e); public boolean addAll(Collection extends E> c); public void
clear(); public boolean contains(Object o); public boolean containsAll(Collection> c); public
boolean isEmpty(); public boolean remove(Object o); public boolean removeAll(Collection> c);
public boolean retainAll(Collection> c); public int size(); public Object[] toArray(); public T[]
toArray(T[] arr); */ //abstract method public void add(int index, E e); public E get(int index);
public int indexOf(Object e); public int lastIndexOf(E e); public E remove(int index); public E
set(int index, E e); //default method @Override public default boolean add(E e){ add(size(), e);
return true; } @Override public default boolean isEmpty(){ return size()==0; } @Override
public default boolean remove(Object e){ if(indexOf(e) >= 0){ remove(indexOf(e)); return true;
} else{ return false; } } @Override public default boolean containsAll(Collection> c){
for(Object e : c){ if(!contains(e)){ return false; } } return true; } @Override public default
boolean addAll( Collection extends E> c){ for(E e : c){ add(e); } return true; } /* removeAll:
this[1,1,2,3] c[1,2,4] this.removeAll(c) [3] */ @Override public default boolean removeAll(
Collection> c){ for(Object e : c){ while(contains(e)){ this.remove(e); } } return true; } /*
retainAll this[1,1,2,3] c[1,2,4] this.retainAll(c) [1,1,2] */ @Override public default boolean
retainAll( Collection> c){ for(E e : this){ if(!c.contains(e)){ this.remove(e); } } return true; }
@Override public default Object[] toArray(){ Object[] results = new Object[size()]; int i = 0;
for(E e : this){ results[i++] = e; } return results; } /* T[] array */ @Override public default T[]
toArray(T[] array){ int i = 0; for(E e : this){ array[i++] = (T)e; } return array; } } class
TwoWayLinkedList implements MyList { //inner static class Node public class Node { E
element; Node next; Node previous; public Node(E e){ element = e; } } private Node head, tail;
private int size = 0; public TwoWayLinkedList(){ /* head = null; tail = null; size = 0; */ } public
TwoWayLinkedList(E[] objects){ } public E getFirst(){ return null; } public E getLast(){ return
null; } public void addFirst(E e){ } public void addLast(E e){ } public E removeFirst(){ return
null; } public E removeLast(){ return null; } @Override public void add(int index, E e){ }
@Override public E remove(int index){ return null; } @Override public void clear(){ }
@Override public boolean contains(Object e){ return false; } @Override public E get(int index){
return null; } @Override public int indexOf(Object e){ return -1; } @Override public int
lastIndexOf(Object e){ return -1; } @Override public E set(int index, E e){ return null; }
@Override public int size(){ return size; } //toString() @Override public String.
I need help creating a parametized JUnit test case for the following.pdf
I need help creating a parametized JUnit test case for the following class.
import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedList;
import java.util.List;
import static java.lang.Integer.valueOf;
public class IntegerSet {
/**
* The only instance variable in the class. No other variables allowed.
*/
private List list;
public int size() {
return list.size();
}
public boolean isEmpty() {
return list.isEmpty();
}
/**
* Initializes the empty set.
*/
public IntegerSet() {
list = new LinkedList();
}
/**
* Initializes a set with the numbers in the argument.
*/
public IntegerSet(Integer[] integers) {
this();
if (integers == null) {
throw new NullPointerException(\"The argument cannot be null\");
} else {
for (Integer i : integers) {
if (!exists(i)) {
this.insertElement(i);
}
}
}
Collections.sort(list);
}
/**
* Inserts an integer to the set if the integer does not exist in the set
*/
public void insertElement(int i) {
if (!list.contains(i)) {
list.add(i);
}
}
/**
* Inserts to the set all the integers in the argument which do not exist in
* the set.
*/
public void insertAll(Integer[] data) {
if (data == null) {
throw new NullPointerException(\"The argument cannot be null\");
// throw new
// IllegalArgumentException(\"The argument cannot be null\");
} else {
Arrays.sort(data);
for (Integer num : data) {
if (!exists(num)) {
insertElement(num);
}
}
}
}
/**
* Deletes an integer from the set if it exists in the set.
*/
public void deleteElement(int i) {
list.remove(i);
}
/**
* Deletes all the elements in the set.
*/
public void deleteAll() {
list.clear();
}
/**
* Returns true if the argument exists in the set, false otherwise.
*/
public boolean exists(int i) {
return list.contains(i);
}
public String toString() {
char delimiter = \' \';
String str = \"[\";
for (Integer i : list) {
str += i;
str += delimiter;
}
return str + \"]\";
}
/**
* Finds the union of two sets. A null pointer is considered an empty set.
*
* Return \"new IntegerSet()\" when the result is an empty set.
*/
public static IntegerSet union(IntegerSet set1, IntegerSet set2) {
IntegerSet union = new IntegerSet();
if (set1.isEmpty() && set2.isEmpty()) {
return union;
}
if (!set1.list.isEmpty()) {
for (Integer num : set1.list) {
if (!union.list.contains(num)) {
union.list.add(num);
}
}
}
if (!set2.isEmpty()) {
for (Integer num : set2.list) {
if (!union.list.contains(num)) {
union.list.add(num);
}
}
}
return union;
}
/**
* Finds the intersection of two sets. A null pointer is considered an empty
* set.
*
* Return \"new IntegerSet()\" when the result is an empty set.
*/
public static IntegerSet intersection(IntegerSet set1, IntegerSet set2) {
IntegerSet intersection = new IntegerSet();
// check for null pointers
if (set1.list.isEmpty() || set2.list.isEmpty()) {
return intersection;
}
for (Integer num : set1.list) {
if ((!intersection.list.contains(num)) && set2.list.contains(num)) {
intersection.list.add(num);
}
}
return intersection;
}
/**
* Builds an array with the ele.
WAP to store 10 numbers in an array and find out the largest and the smallest...
WAP to store 10 numbers in an array and find out the largest and the smallest...One97 Communications Limited
WAP to store 10 numbers in an array and find out the largest and the smallest element of the array in JavaWrite a method countUnique that takes a List of integers as a parame.pdf
Write a method countUnique that takes a List of integers as a parameter and returns the number
of unique integer values in the list. Use a Set as auxiliary storage to help you solve this problem.
For example, if a list contains the values [3, 7, 3, -1, 2, 3, 7, 2, 15, 15], your method should
return 5. The empty list contains 0 unique values.
Solution
package arraylistexample;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;
public class ARRAYLISTEXAMPLE {
public static void main(String[] args) {
List list = new ArrayList<>();
Scanner scanner = new Scanner(System.in);
System.out.print(\"Enter some numbers..\");
System.out.println(\"Press any non integer(Either Float or character ) for ending the input\");
while (scanner.hasNextInt()) {
int i = scanner.nextInt();
list.add(i);
}
int k = alok.countUnique(list);
System.out.print(\" Total number of unique elements Are : \\t\" + k);
}
}
class alok {
public static int countUnique(List lst) {
Set set = new HashSet<>(lst);
System.out.println(\"Set values .....\");
set.stream().forEach((temp) -> {
System.out.print(temp + \"\\t\");
});
int n = set.size();
return n;
}
}.
2. Ligamentum arteriosumThe aortic arch loops over the left pulmo.pdf
2. Ligamentum arteriosum:
The aortic arch loops over the left pulmonary artery and the bifurcation of the pulmonary trunk,
to which it remains connected by the ligamentum arteriosum, a remnant of the fetal circulation
that is obliterated a few days after birth.
3. Caecum:
The cecum is a pouch-like dead-end passage that branches inferiorly from the end of the ileum
(end part of small intestine). Fecal matter entering the large intestine from the ileum passes into
the cecum before being pushed superiorly into the ascending colon. The appendix is attached to
the inferior end of the cecum and is believed to store beneficial bacteria that help break down
undigested food.
Solution
2. Ligamentum arteriosum:
The aortic arch loops over the left pulmonary artery and the bifurcation of the pulmonary trunk,
to which it remains connected by the ligamentum arteriosum, a remnant of the fetal circulation
that is obliterated a few days after birth.
3. Caecum:
The cecum is a pouch-like dead-end passage that branches inferiorly from the end of the ileum
(end part of small intestine). Fecal matter entering the large intestine from the ileum passes into
the cecum before being pushed superiorly into the ascending colon. The appendix is attached to
the inferior end of the cecum and is believed to store beneficial bacteria that help break down
undigested food..
moles should be equal to complete consumption so.pdf
moles should be equal to complete consumption so v*0.250 = 0.150*0.100 /2 ( 2 is
for - as Pb(NO3)2 gives 2 moles of NO3- when dissociate) so v = 0.03 L ANSWER
Solution
moles should be equal to complete consumption so v*0.250 = 0.150*0.100 /2 ( 2 is
for - as Pb(NO3)2 gives 2 moles of NO3- when dissociate) so v = 0.03 L ANSWER.
More Related Content
Similar to import java.util.ArrayList;public class ArrayListADT { public .pdf
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
// 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
*/.
Write a method called uniqueNumbers that takes an int array as param.pdf
Write a method called uniqueNumbers that takes an int array as parameter, and returns a
different int array, which only contains the list of unique numbers in the original array. Hint: Use
the isPresent method defined below to accomplish your
here is the code we need to add too
Solution
solution
package com.mt.classes;
import java.util.ArrayList;
import java.util.List;
public class Lab8e {
public static void main(String[] args) {
int[] numbers = new int[20];
// Generate random numbers between 0 and 99 and fill up the array
for (int i = 0; i < numbers.length; i++) {
numbers[i] = (int) (Math.random() * 50);
}
System.out.println(\"The list is:\");
printNumbers(numbers);
// Task 1
System.out.println(\"The smallest number in the list is \"
+ smallestNumber(numbers));
// Task 2
System.out.println(\"The largest number in the list is \"
+ largestNumber(numbers));
// Task 3
System.out.println(\"The average of numbers in the list is \"
+ averageOfNumbers(numbers));
// Task 4: Extra Credit. Uncomment the following
// two lines if you complete this task.
System.out.println(\"The list of unique numbers is:\");
uniqueNumbers(numbers);
}
private static void uniqueNumbers(int[] numbers) {
for (int i = 0; i < numbers.length; i++) {
boolean isDuplicate = false;
for (int j = 0; j < i; j++) {
if (numbers[i] == numbers[j]) {
isDuplicate = true;
break;
}
}
if (!isDuplicate) {
System.out.print(numbers[i] + \" \");
}
}
}
public static void printNumbers(int[] list) {
for (int i = 0; i < list.length; i++) {
System.out.print(list[i] + \" \");
}
System.out.println();
}
// 1. Write a method called smallestNumber that
// takes an int array as parameter, and returns the
// smallest number
public static int smallestNumber(int[] list) {
int small = 100;
for (int i = 0; i < list.length; i++) {
if (list[i] < small) {
small = list[i];
}
}
return small;
}
// 2. Write a method called largestNumber that
// takes an int array as parameter, and returns the
// largest number
public static int largestNumber(int[] list) {
int large = 0;
for (int i = 0; i < list.length; i++) {
if (list[i] > large) {
large = list[i];
}
}
return large;
}
// 3. Write a method called averageOfNumbers that
// takes an int array as parameter, and returns the
// average of the numbers
public static double averageOfNumbers(int[] list) {
double average = 0.0;
for (int i = 0; i < list.length; i++) {
average = average + list[i];
}
average = average / list.length;
return average;
}
public static boolean isPresent(int[] list, int target) {
boolean found = false;
for (int i = 0; i < list.length && !found && list[i] != 0; i++) {
if (list[i] == target) {
found = true;
}
}
return found;
}
}
output
The list is:
16 14 11 31 7 8 18 49 27 43 9 39 38 18 6 16 8 30 32 15
The smallest number in the list is 6
The largest number in the list is 49
The average of numbers in the list is 21.75
The list of unique numbers is:
16 14 11 31 7 8 18 49 27 43 9 39 38 6 30 32 15.
I am stuck on parts E and FExercise 1 NumberListTester.java.pdf
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 ;
/.
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...Sunil Kumar Gunasekaran
OrderTest.javapublic class OrderTest { Get an arra.pdf
OrderTest.java
public class OrderTest {
/**
* Get an array of specified size and pass it to Order.order().
* Report the results.
*/
public static void main(String[] args) {
if (args.length != 1) {//1
System.out.println(\"Usage: java OrderTest sizeOfArray\ \"
+ \"\\tor\ \\tjava OrderTest arrayFile\");
System.exit(1);
}
// create or read the int[]
int size = 0;
int[] array = new int[0];//5
try {
size = Integer.parseInt(args[0]);
array = ArrayOfInts.randomizedArray(size);
} catch (NumberFormatException nfe) {//8
try {
array = ArrayOfInts.arrayFromFile(args[0]);
size = array.length;
} catch (Exception e) {
System.err.println(\"unable to read array from \" + args[0]);
System.exit(1);//14
}
}
System.out.println(\"before:\");//15
for (int i = 0; i < array.length; i++) {//2 n
System.out.printf(((i+1) % 10 > 0) ? \" %d\" : \" %d\ \", array[i]);//1
}
int myNum = Order.order(array); //this is the call we want to measure
System.out.println(\"\ after:\");//18
for (int i = 0; i < array.length; i++) {//2 n
System.out.printf(((i+1) % 10 > 0) ? \" %d\" : \" %d\ \", array[i]);
}
System.out.println(myNum);
}
}
ArrayOfInts.java
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.InputMismatchException;
import java.util.Scanner;
public class ArrayOfInts {
/**
* Returns an array of consecutive ints from 1 to size.
*/
public static int[] orderedArray(int size) {
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = i+1;
}
return a;
}
/**
* Returns a randomized array containing ints from 1 to size.
*/
public static int[] randomizedArray(int size) {
ArrayList aL = new ArrayList();
for (int i = 0; i < size; i++) {
aL.add(i+1);
}
Collections.shuffle(aL);
int[] a = new int[size];
for (int i = 0; i < size; i++) {
a[i] = aL.get(i);
}
return a;
}
/**
* Writes an int[] to a plain-text file with ints separated by spaces.
* Useful for creating input files for repeatable tests.
*/
public static void arrayToFile(int[] array, String outfile) {
try {
FileWriter fw = new FileWriter(outfile);
BufferedWriter bw = new BufferedWriter(fw);
PrintWriter outFile = new PrintWriter(bw);
for (int i : array) {
outFile.print(i + \" \");
}
outFile.close();
} catch (IOException e) {
System.err.println(\"Could not write to \" + outfile + \"\ \" + e);
}
}
/**
* Read ints from a file and return them in an int[]
*/
public static int[] arrayFromFile(String infile) throws FileNotFoundException,
InputMismatchException {
Scanner scan = new Scanner(new File(infile));
ArrayList aL = new ArrayList();
while (scan.hasNext()) {
aL.add(scan.nextInt());
}
scan.close();
int[] a = new int[aL.size()];
for (int i = 0; i < a.length; i++) {
a[i] = aL.get(i);
}
return a;
}
}
Order.java
public class Order {
/**
* Take an int[] and reorganize it so they are in ascending order.
*/
public static int order(int[] array) .
sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
sumOfSquares
import java.util.*;
public class Arraylistoperation
{
public static void main(String args[])
{
ArrayList list = createSquaresList(10);
printList(list);
}
public static ArrayList createSquaresList(int n)
{
ArrayList squares= new ArrayList<>();
double s = 0.0;
for (double i = 0.0; i <= n-1; i++)
{
s = i*i;
squares.add(s);
}
return squares;
for(int i = 0; i < m.size(); i++)
{
s+= m.get(i);
}
return s;
}
}
Like wise sumOfCubes
Solution
sumOfSquares
import java.util.*;
public class Arraylistoperation
{
public static void main(String args[])
{
ArrayList list = createSquaresList(10);
printList(list);
}
public static ArrayList createSquaresList(int n)
{
ArrayList squares= new ArrayList<>();
double s = 0.0;
for (double i = 0.0; i <= n-1; i++)
{
s = i*i;
squares.add(s);
}
return squares;
for(int i = 0; i < m.size(); i++)
{
s+= m.get(i);
}
return s;
}
}
Like wise sumOfCubes.
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 .
1. import java.util.Scanner; public class Alphabetical_Order {.pdf
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(\'\ \');
}
}
}.
Why following sort does not work (It does not sort last 2 - 3 numbe.pdf
Why following sort does not work? (It does not sort last 2 - 3 numbers)
//Sort order
class SortNumbListener implements ActionListener
{
@Override
public void actionPerformed(ActionEvent e)
{
Collections.sort(list);
for(int i = 0; i < list.size(); i++)
{
textfield2.setText(list.toString());
}
System.out.print(list + \"\ \");
}
}
Solution
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import javax.swing.JTextField;
public class SorAction {
public JTextField textfield2;
public List list;
public SorAction() {
// TODO Auto-generated constructor stub
textfield2 = new JTextField();
list = new ArrayList();
list.add(20);
list.add(12);
list.add(32);
list.add(3);
new SortNumbListener().actionPerformed(new ActionEvent(\"\", 0, null));
}
public static void main(String[] args) {
try {
new SorAction();
} catch (Exception e) {
// TODO: handle exception
e.printStackTrace();
}
}
class SortNumbListener implements ActionListener {
@Override
public void actionPerformed(ActionEvent e) {
Collections.sort(list);
textfield2.setText(list.toString());
System.out.print(list + \"\ \");
}
}
}
OUTPUT:
[3, 12, 20, 32]
NOTE: please check the above example, sorting fine, but what is the need of loop,
if you want to add the text to textbox use setText() method of textfield.
import java.util.; public class ClientMerge_2 { static Scan.pdf
import java.util.*;
public class ClientMerge_2 {
static Scanner input = new Scanner(System.in);
public static void main(String[] args) {
UnorderedLinkedListInt list1 = new UnorderedLinkedListInt();
UnorderedLinkedListInt list2 = new UnorderedLinkedListInt();
UnorderedLinkedListInt list3 = new UnorderedLinkedListInt();
int num;
System.out.println(\"Enter integers for the first list(999 to stop)\");
num = input.nextInt();
while (num != 999) {
list1.insertLast((Integer) num);
num = input.nextInt();
}
System.out.println(\"Enter integers for the second list(999 to stop)\");
num = input.nextInt();
while (num != 999) {
list2.insertLast((Integer) num);
num = input.nextInt();
}
System.out.print(\"\ The first list is: \");
list1.print();
System.out.println(\"\ The length of the first list is: \" + list1.length());
if (!list1.isEmptyList()) {
System.out.println(\"First element/list1: \" + list1.front());
System.out.println(\"Last element/list1: \" + list1.back());
}
System.out.print(\"\ The second list is: \");
list2.print();
System.out.println(\"\ The length of the second list is: \" + list2.length());
if (!list2.isEmptyList()) {
System.out.println(\"First element/list2: \" + list2.front());
System.out.println(\"Last element/list2: \" + list2.back());
}
list3 = list1.merge2(list2);
System.out.print(\"\ After concatenating the 2 lists, the merged list1 is: \");
list3.print();
System.out.println(\"\ The length of the merged list is: \" + list3.length());
if (!list3.isEmptyList()) {
System.out.println(\"First element/merged list: \" + list3.front());
System.out.println(\"Last element/merged list: \" + list3.back());
}
System.out.println(\"Enter key for split: \");
num = input.nextInt();
list3.split(list1, list2, num);
System.out.print(\"\ The first list after split is: \");
list1.print();
System.out.print(\"\ The second list after split is: \");
list2.print();
System.out.println();
}
}
Solution
import java.util.*;
public class ClientMerge_2 {
static Scanner input = new Scanner(System.in);
public static void main(String[] args) {
UnorderedLinkedListInt list1 = new UnorderedLinkedListInt();
UnorderedLinkedListInt list2 = new UnorderedLinkedListInt();
UnorderedLinkedListInt list3 = new UnorderedLinkedListInt();
int num;
System.out.println(\"Enter integers for the first list(999 to stop)\");
num = input.nextInt();
while (num != 999) {
list1.insertLast((Integer) num);
num = input.nextInt();
}
System.out.println(\"Enter integers for the second list(999 to stop)\");
num = input.nextInt();
while (num != 999) {
list2.insertLast((Integer) num);
num = input.nextInt();
}
System.out.print(\"\ The first list is: \");
list1.print();
System.out.println(\"\ The length of the first list is: \" + list1.length());
if (!list1.isEmptyList()) {
System.out.println(\"First element/list1: \" + list1.front());
System.out.println(\"Last element/list1: \" + list1.back());
}
System.out.print(\"\ The second list is: \");
list2.print();
System.out.println(\"\ The length of the second li.
Please create the appropriate JUnit test cases to thoroughly.pdf
Please create the appropriate JUnit test cases to thoroughly unit test the following
program:
IntegerSet.java
import java.util.*;
public class IntegerSet{
private ArrayList<Integer> list= new ArrayList<>();
public IntegerSet(ArrayList list) {
this.list=list;
}
// clears the all representation of class
public void clear() {
list.clear();
}
// returns the length of set
public int length() {
return list.size();
}
// return true if 2 lists are equal
public boolean equals(IntegerSet b) {
ArrayList<Integer> list2=b.list;
if(list.size()!=list2.size()) {
return false;
}
ArrayList<Integer> temp1=list;
ArrayList<Integer> temp2=list2;
Collections.sort(temp1);
Collections.sort(temp2);
for(int i=0;i<temp1.size();i++) {
if(temp1.get(i)!=temp2.get(i)) {
return false;
}
}
return true;
}
// returns a largest item and throw exception if list is empty
public int largest() throws IntegerSetException {
if(list.size()==0) {
IntegerSetException e= new IntegerSetException();
throw e;
}
int max=0;
for(int i=0;i<list.size();i++) {
if(list.get(i)>max) {
max=list.get(i);
}
}
return max;
}
// returns a largest item and throw exception if list is empty
public int smallest() throws IntegerSetException {
if(list.size()==0) {
IntegerSetException e= new IntegerSetException();
throw e;
}
int min=Integer.MAX_VALUE;
for(int i=0;i<list.size();i++) {
if(list.get(i)<min) {
min=list.get(i);
}
}
return min;
}
// add item if already not exist in list
public void addItem(int item ) {
boolean exist=false;
for(int i=0;i<list.size();i++) {
if(list.get(i)==item) {
exist=true;
}
}
if(exist==false) {
list.add(item);
}
}
// remove item if already not exist in list
public void removeItem(int item ) {
for(int i=0;i<list.size();i++) {
if(list.get(i)==item) {
list.remove(i);
}
}
}
// return union of of 2 sets
public IntegerSet union(IntegerSet list2) {
ArrayList<Integer> temp=list2.getlist();
Set<Integer> set = new HashSet<>();
set.addAll(list);
set.addAll(temp);
ArrayList<Integer> list3= new ArrayList<>(set);
IntegerSet list4= new IntegerSet(list3);
return list4;
}
// return intersection of of 2 sets
public IntegerSet intersection(IntegerSet list2) {
ArrayList<Integer> temp=list2.getlist();
list.retainAll(temp);
IntegerSet list4= new IntegerSet(list);
return list4;
}
// returns difference of 2 sets
public IntegerSet difference (IntegerSet list2) {
ArrayList<Integer> temp=list2.getlist();
// Remove all elements in list2 from list
list.removeAll(temp);
IntegerSet list4= new IntegerSet(list);
return list4;
}
public ArrayList<Integer> getlist(){
return list;
}
}
IntegerSetException.java
class IntegerSetException extends Exception {
Driver.java
import java.util.*;
public class Driver {
public static void main(String[] args) throws IntegerSetException {
ArrayList<Integer> list1= new ArrayList<>();
ArrayList<Integer> list2= new ArrayList<>();
// make 2 instance of integerset class for implementation
IntegerSet set1= new IntegerSet(list1);
IntegerSet set2= new IntegerSet(list2);
set1.addItem(1);
set1.ad.
Programming Java - Lection 07 - Puzzlers - Lavrentyev Fedor
Курс "Программирование на Java". Лекция 07 "Бонус - Головоломки".
Java Puzzlers. Синхронизация и многопоточность. Примитивы. Объекты и классы. Исключения и финализация.
МФТИ, 2016 год. Лектор - Лаврентьев Федор Сергеевич
ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf
ArrayTest.java
import java.util.Arrays;
import java.util.Scanner;
public class ArrayTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int table[] = new int[10];
int count = 0;
Scanner scan = new Scanner(System.in);
for(int i=0; i<10; i++){
System.out.println(\"Enter Array Element:\");
int n = scan.nextInt();
if(n < 0){
System.out.println(\"Invalid Number.\");
i--;
if(count >= 5)
break;
}else{
table[i] = n;
count++;
}
}
int sum = 0;
System.out.println(\"Array Elements are: \"+Arrays.toString(table));
for(int i=0; i avg){
high++;
}
else{
equal++;
}
}
System.out.println(\"Number of elements less than average \"+less);
System.out.println(\"Number of elements greater than average \"+high);
System.out.println(\"Number of elements equal to average \"+equal);
for(;;){
System.out.println(\"Enter Search Element (-1 to quit): \");
int searchNum = scan.nextInt();
if(searchNum == -1){
break;
}
int index = find(searchNum, table, count);
if(index == -1){
System.out.println(\"Element not found\");
}
else{
System.out.println(\"Element found at \"+index);
}
}
smallest(table, count);
}
public static int find (int valueToSearchFor, int intArray[ ], int numberOfValidEnties){
for(int i=0; i a[i]){
min = a[i];
index = i;
}
}
System.out.println(\"The smallest element is \"+min+\" index is \"+index);
int temp = a[0];
a[0] = a[index];
a[index] = temp;
System.out.println(\"After swap array elements are :\"+Arrays.toString(a));
}
}
Output:
Enter Array Element:
3
Enter Array Element:
4
Enter Array Element:
5
Enter Array Element:
2
Enter Array Element:
1
Enter Array Element:
6
Enter Array Element:
7
Enter Array Element:
8
Enter Array Element:
-1
Invalid Number.
Array Elements are: [3, 4, 5, 2, 1, 6, 7, 8, 0, 0]
The Sum is 36
The Average is : 4.5
Number of elements less than average 4
Number of elements greater than average 4
Number of elements equal to average 0
Enter Search Element (-1 to quit):
2
Element found at 3
Enter Search Element (-1 to quit):
3
Element found at 0
Enter Search Element (-1 to quit):
1
Element found at 4
Enter Search Element (-1 to quit):
6
Element found at 5
Enter Search Element (-1 to quit):
-1
The smallest element is 1 index is 4
After swap array elements are :[1, 4, 5, 2, 3, 6, 7, 8, 0, 0]
Solution
ArrayTest.java
import java.util.Arrays;
import java.util.Scanner;
public class ArrayTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int table[] = new int[10];
int count = 0;
Scanner scan = new Scanner(System.in);
for(int i=0; i<10; i++){
System.out.println(\"Enter Array Element:\");
int n = scan.nextInt();
if(n < 0){
System.out.println(\"Invalid Number.\");
i--;
if(count >= 5)
break;
}else{
table[i] = n;
count++;
}
}
int sum = 0;
System.out.println(\"Array Elements are: \"+Arrays.toString(table));
for(int i=0; i avg){
high++;
}
else{
equal++;
}
}
System.out.println(\"Number of elements less than average \"+less);
System.out.println(\"Number of.
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
2.(Sorted list: array implementation)This sorted list ADT discussed in class should be extended
by the addition of two new methods:
//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] .
import java-util--- public class MyLinkedList{ public static void.pdf
import java.util.*; public class MyLinkedList{ public static void main(String[] args){ } } //copy
MyList to here interface MyList extends Collection { /* MyList will inherite all methods from
Collection public boolean add(E e); public boolean addAll(Collection extends E> c); public void
clear(); public boolean contains(Object o); public boolean containsAll(Collection> c); public
boolean isEmpty(); public boolean remove(Object o); public boolean removeAll(Collection> c);
public boolean retainAll(Collection> c); public int size(); public Object[] toArray(); public T[]
toArray(T[] arr); */ //abstract method public void add(int index, E e); public E get(int index);
public int indexOf(Object e); public int lastIndexOf(E e); public E remove(int index); public E
set(int index, E e); //default method @Override public default boolean add(E e){ add(size(), e);
return true; } @Override public default boolean isEmpty(){ return size()==0; } @Override
public default boolean remove(Object e){ if(indexOf(e) >= 0){ remove(indexOf(e)); return true;
} else{ return false; } } @Override public default boolean containsAll(Collection> c){
for(Object e : c){ if(!contains(e)){ return false; } } return true; } @Override public default
boolean addAll( Collection extends E> c){ for(E e : c){ add(e); } return true; } /* removeAll:
this[1,1,2,3] c[1,2,4] this.removeAll(c) [3] */ @Override public default boolean removeAll(
Collection> c){ for(Object e : c){ while(contains(e)){ this.remove(e); } } return true; } /*
retainAll this[1,1,2,3] c[1,2,4] this.retainAll(c) [1,1,2] */ @Override public default boolean
retainAll( Collection> c){ for(E e : this){ if(!c.contains(e)){ this.remove(e); } } return true; }
@Override public default Object[] toArray(){ Object[] results = new Object[size()]; int i = 0;
for(E e : this){ results[i++] = e; } return results; } /* T[] array */ @Override public default T[]
toArray(T[] array){ int i = 0; for(E e : this){ array[i++] = (T)e; } return array; } } class
TwoWayLinkedList implements MyList { //inner static class Node public class Node { E
element; Node next; Node previous; public Node(E e){ element = e; } } private Node head, tail;
private int size = 0; public TwoWayLinkedList(){ /* head = null; tail = null; size = 0; */ } public
TwoWayLinkedList(E[] objects){ } public E getFirst(){ return null; } public E getLast(){ return
null; } public void addFirst(E e){ } public void addLast(E e){ } public E removeFirst(){ return
null; } public E removeLast(){ return null; } @Override public void add(int index, E e){ }
@Override public E remove(int index){ return null; } @Override public void clear(){ }
@Override public boolean contains(Object e){ return false; } @Override public E get(int index){
return null; } @Override public int indexOf(Object e){ return -1; } @Override public int
lastIndexOf(Object e){ return -1; } @Override public E set(int index, E e){ return null; }
@Override public int size(){ return size; } //toString() @Override public String.
I need help creating a parametized JUnit test case for the following.pdf
I need help creating a parametized JUnit test case for the following class.
import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedList;
import java.util.List;
import static java.lang.Integer.valueOf;
public class IntegerSet {
/**
* The only instance variable in the class. No other variables allowed.
*/
private List list;
public int size() {
return list.size();
}
public boolean isEmpty() {
return list.isEmpty();
}
/**
* Initializes the empty set.
*/
public IntegerSet() {
list = new LinkedList();
}
/**
* Initializes a set with the numbers in the argument.
*/
public IntegerSet(Integer[] integers) {
this();
if (integers == null) {
throw new NullPointerException(\"The argument cannot be null\");
} else {
for (Integer i : integers) {
if (!exists(i)) {
this.insertElement(i);
}
}
}
Collections.sort(list);
}
/**
* Inserts an integer to the set if the integer does not exist in the set
*/
public void insertElement(int i) {
if (!list.contains(i)) {
list.add(i);
}
}
/**
* Inserts to the set all the integers in the argument which do not exist in
* the set.
*/
public void insertAll(Integer[] data) {
if (data == null) {
throw new NullPointerException(\"The argument cannot be null\");
// throw new
// IllegalArgumentException(\"The argument cannot be null\");
} else {
Arrays.sort(data);
for (Integer num : data) {
if (!exists(num)) {
insertElement(num);
}
}
}
}
/**
* Deletes an integer from the set if it exists in the set.
*/
public void deleteElement(int i) {
list.remove(i);
}
/**
* Deletes all the elements in the set.
*/
public void deleteAll() {
list.clear();
}
/**
* Returns true if the argument exists in the set, false otherwise.
*/
public boolean exists(int i) {
return list.contains(i);
}
public String toString() {
char delimiter = \' \';
String str = \"[\";
for (Integer i : list) {
str += i;
str += delimiter;
}
return str + \"]\";
}
/**
* Finds the union of two sets. A null pointer is considered an empty set.
*
* Return \"new IntegerSet()\" when the result is an empty set.
*/
public static IntegerSet union(IntegerSet set1, IntegerSet set2) {
IntegerSet union = new IntegerSet();
if (set1.isEmpty() && set2.isEmpty()) {
return union;
}
if (!set1.list.isEmpty()) {
for (Integer num : set1.list) {
if (!union.list.contains(num)) {
union.list.add(num);
}
}
}
if (!set2.isEmpty()) {
for (Integer num : set2.list) {
if (!union.list.contains(num)) {
union.list.add(num);
}
}
}
return union;
}
/**
* Finds the intersection of two sets. A null pointer is considered an empty
* set.
*
* Return \"new IntegerSet()\" when the result is an empty set.
*/
public static IntegerSet intersection(IntegerSet set1, IntegerSet set2) {
IntegerSet intersection = new IntegerSet();
// check for null pointers
if (set1.list.isEmpty() || set2.list.isEmpty()) {
return intersection;
}
for (Integer num : set1.list) {
if ((!intersection.list.contains(num)) && set2.list.contains(num)) {
intersection.list.add(num);
}
}
return intersection;
}
/**
* Builds an array with the ele.
WAP to store 10 numbers in an array and find out the largest and the smallest...
WAP to store 10 numbers in an array and find out the largest and the smallest...One97 Communications Limited
WAP to store 10 numbers in an array and find out the largest and the smallest element of the array in JavaWrite a method countUnique that takes a List of integers as a parame.pdf
Write a method countUnique that takes a List of integers as a parameter and returns the number
of unique integer values in the list. Use a Set as auxiliary storage to help you solve this problem.
For example, if a list contains the values [3, 7, 3, -1, 2, 3, 7, 2, 15, 15], your method should
return 5. The empty list contains 0 unique values.
Solution
package arraylistexample;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;
public class ARRAYLISTEXAMPLE {
public static void main(String[] args) {
List list = new ArrayList<>();
Scanner scanner = new Scanner(System.in);
System.out.print(\"Enter some numbers..\");
System.out.println(\"Press any non integer(Either Float or character ) for ending the input\");
while (scanner.hasNextInt()) {
int i = scanner.nextInt();
list.add(i);
}
int k = alok.countUnique(list);
System.out.print(\" Total number of unique elements Are : \\t\" + k);
}
}
class alok {
public static int countUnique(List lst) {
Set set = new HashSet<>(lst);
System.out.println(\"Set values .....\");
set.stream().forEach((temp) -> {
System.out.print(temp + \"\\t\");
});
int n = set.size();
return n;
}
}.
Similar to import java.util.ArrayList;public class ArrayListADT { public .pdf (20)
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
Write a method called uniqueNumbers that takes an int array as param.pdf
Write a method called uniqueNumbers that takes an int array as param.pdf
I am stuck on parts E and FExercise 1 NumberListTester.java.pdf
I am stuck on parts E and FExercise 1 NumberListTester.java.pdf
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
Java programs - bubble sort, iterator, linked list, hash set, reverse string,...
OrderTest.javapublic class OrderTest { Get an arra.pdf
OrderTest.javapublic class OrderTest { Get an arra.pdf
sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
sumOfSquaresimport java.util.;public class Arraylistoperation.pdf
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
1. import java.util.Scanner; public class Alphabetical_Order {.pdf
1. import java.util.Scanner; public class Alphabetical_Order {.pdf
Why following sort does not work (It does not sort last 2 - 3 numbe.pdf
Why following sort does not work (It does not sort last 2 - 3 numbe.pdf
import java.util.; public class ClientMerge_2 { static Scan.pdf
import java.util.; public class ClientMerge_2 { static Scan.pdf
Please create the appropriate JUnit test cases to thoroughly.pdf
Please create the appropriate JUnit test cases to thoroughly.pdf
Programming Java - Lection 07 - Puzzlers - Lavrentyev Fedor
Programming Java - Lection 07 - Puzzlers - Lavrentyev Fedor
ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf
ArrayTest.java import java.util.Arrays; import java.util.Scann.pdf
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
import java-util--- public class MyLinkedList{ public static void.pdf
import java-util--- public class MyLinkedList{ public static void.pdf
I need help creating a parametized JUnit test case for the following.pdf
I need help creating a parametized JUnit test case for the following.pdf
WAP to store 10 numbers in an array and find out the largest and the smallest...
WAP to store 10 numbers in an array and find out the largest and the smallest...
Write a method countUnique that takes a List of integers as a parame.pdf
Write a method countUnique that takes a List of integers as a parame.pdf
More from mohammadirfan136964
2. Ligamentum arteriosumThe aortic arch loops over the left pulmo.pdf
2. Ligamentum arteriosum:
The aortic arch loops over the left pulmonary artery and the bifurcation of the pulmonary trunk,
to which it remains connected by the ligamentum arteriosum, a remnant of the fetal circulation
that is obliterated a few days after birth.
3. Caecum:
The cecum is a pouch-like dead-end passage that branches inferiorly from the end of the ileum
(end part of small intestine). Fecal matter entering the large intestine from the ileum passes into
the cecum before being pushed superiorly into the ascending colon. The appendix is attached to
the inferior end of the cecum and is believed to store beneficial bacteria that help break down
undigested food.
Solution
2. Ligamentum arteriosum:
The aortic arch loops over the left pulmonary artery and the bifurcation of the pulmonary trunk,
to which it remains connected by the ligamentum arteriosum, a remnant of the fetal circulation
that is obliterated a few days after birth.
3. Caecum:
The cecum is a pouch-like dead-end passage that branches inferiorly from the end of the ileum
(end part of small intestine). Fecal matter entering the large intestine from the ileum passes into
the cecum before being pushed superiorly into the ascending colon. The appendix is attached to
the inferior end of the cecum and is believed to store beneficial bacteria that help break down
undigested food..
moles should be equal to complete consumption so.pdf
moles should be equal to complete consumption so v*0.250 = 0.150*0.100 /2 ( 2 is
for - as Pb(NO3)2 gives 2 moles of NO3- when dissociate) so v = 0.03 L ANSWER
Solution
moles should be equal to complete consumption so v*0.250 = 0.150*0.100 /2 ( 2 is
for - as Pb(NO3)2 gives 2 moles of NO3- when dissociate) so v = 0.03 L ANSWER.
TrueOne of the fundamental rules which control the PLSS system is .pdf
True
One of the fundamental rules which control the PLSS system is that the boundaries of the public
land once approved and accepted is unchangeable.
Solution
True
One of the fundamental rules which control the PLSS system is that the boundaries of the public
land once approved and accepted is unchangeable..
The stronger the attractions betweenparticles (mo.pdf
The stronger the attractions betweenparticles (molecules or ions), the more difficult
it will be toseparate the particles. When substances melt, the particles arestill close to one
another but the forces of attraction that heldthe particles rigidly together in the solid state have
beensufficiently overcome to allow the particles to move. Whensubstances boil, the particles are
completely separated from oneanother and the attractions between molecules are
completelyovercome. The energy required to cause substances to melt and toboil, and thus
disrupt the forces of attraction, comes from theenvironment surrounding the material. If you
place a piece of icein your hand, the ice will melt more quickly than if it is placedon a cold
counter top. The energy required to melt the ice comesfrom your hand, your hand gets colder and
the ice gets warmer. for ice melting hydrogen bonding for sublimation of ice London
forcesAmmoniavaporisation having hydrogen bonding
Solution
The stronger the attractions betweenparticles (molecules or ions), the more difficult
it will be toseparate the particles. When substances melt, the particles arestill close to one
another but the forces of attraction that heldthe particles rigidly together in the solid state have
beensufficiently overcome to allow the particles to move. Whensubstances boil, the particles are
completely separated from oneanother and the attractions between molecules are
completelyovercome. The energy required to cause substances to melt and toboil, and thus
disrupt the forces of attraction, comes from theenvironment surrounding the material. If you
place a piece of icein your hand, the ice will melt more quickly than if it is placedon a cold
counter top. The energy required to melt the ice comesfrom your hand, your hand gets colder and
the ice gets warmer. for ice melting hydrogen bonding for sublimation of ice London
forcesAmmoniavaporisation having hydrogen bonding.
a. It gives benzalacetone b. acetone will underg.pdf
a. It gives benzalacetone b. acetone will undergo intermolecular aldol condensation
c. benzaldehyde undergoes claisen condensation d. addition over double bond in product takes
place
Solution
a. It gives benzalacetone b. acetone will undergo intermolecular aldol condensation
c. benzaldehyde undergoes claisen condensation d. addition over double bond in product takes
place.
what is the mean, median, mode and the midrange for 191, 167,257,1.pdf
what is the mean, median, mode and the midrange for : 191,
167,257,195,381,261,235,332,225,245
Solution
Mean = Sum of the numbers/n = 3174.6
Median = Since the no of values is 15 which is odd.. the median will be the middle value i.e. 8th
value in increasing order = 1479
Mode = Value with the highest frequency = All have the same frequency so all are modes
Midrange = ( max + min ) / 2 = (203 + 9822)/2 = 5012.5.
Disodium malonate is an ionic sodium salt that is soluble in water..pdf
Disodium malonate is an ionic sodium salt that is soluble in water.
Naphthalene is a molecular covalent organic solid that is insoluble in water.
To purify, add the mixture to water and stir to dissolve the disodium malonate and then filter.
The insoluble naphthalene residue will be trapped in the filter paper, while the pure disodium
malonate can be recovered by evaporating the filtrate.
Solution
Disodium malonate is an ionic sodium salt that is soluble in water.
Naphthalene is a molecular covalent organic solid that is insoluble in water.
To purify, add the mixture to water and stir to dissolve the disodium malonate and then filter.
The insoluble naphthalene residue will be trapped in the filter paper, while the pure disodium
malonate can be recovered by evaporating the filtrate..
They showed that GFP protein could be expressed in the organisms wit.pdf
They showed that GFP protein could be expressed in the organisms with which they can be used
as a gene expression marker and protein localisation.
They used GFP in transcriptional fusions to characterize the expression pattern of genes. They
used the transformation techniques using DNA encoding GFP.
Solution
They showed that GFP protein could be expressed in the organisms with which they can be used
as a gene expression marker and protein localisation.
They used GFP in transcriptional fusions to characterize the expression pattern of genes. They
used the transformation techniques using DNA encoding GFP..
Thepossible mechanism by which a 75kD nuclear protein is imported in.pdf
Thepossible mechanism by which a 75kD nuclear protein is imported into teh nucleus includes.
In eukaryotic cells the nucleus is physically separated from the cytoplasm by a double membrane
structure, the nuclear envelope (NE). The NE is crossed by multiple supramolecular structures
specialized in mediating the bidirectional traffic of molecules between the nucleus and the
cytoplasm. These structures are designated the nuclear pore complex (NPC), (Freitas, 2009).
Thus the nuclear pore complex (NPC), perhaps the largest protein complex in the cell, is
responsible for the protected exchange of components between the nucleus and cytoplasm and
for preventing the transport of material not destined to cross the nuclear envelope(UIUC).
Transport Cycle.In order to pass through the NPC, a large molecule (cargo) i.e. theteh cargo
proteinmust associate with another protein called a transport receptor. These transport receptors
then act as chaperones which shuttle cargo through the NPC. Recognition by the transport
receptor takes place via a specific sequence of amino acids in the cargo protein. Besides cargo
and transport receptors, the third ingredient necessary for nuclear transport is the signaling
protein Ran, which hydrolyzes GTP. Ran is responsible for regulating the interaction of transport
receptor and cargo and RanGDP/RanGTP concentration gradients across the nuclear envelope
drive nuclear import and export. Once a transport receptor identifies and binds its cargo, the
transport complex may be imported or exported through the NPC. Repeating amino acid
sequences involving phenyalanine (F) and glycine (G) have been thoroughly implicated in the
process selective import,(UIUC).
Solution
Thepossible mechanism by which a 75kD nuclear protein is imported into teh nucleus includes.
In eukaryotic cells the nucleus is physically separated from the cytoplasm by a double membrane
structure, the nuclear envelope (NE). The NE is crossed by multiple supramolecular structures
specialized in mediating the bidirectional traffic of molecules between the nucleus and the
cytoplasm. These structures are designated the nuclear pore complex (NPC), (Freitas, 2009).
Thus the nuclear pore complex (NPC), perhaps the largest protein complex in the cell, is
responsible for the protected exchange of components between the nucleus and cytoplasm and
for preventing the transport of material not destined to cross the nuclear envelope(UIUC).
Transport Cycle.In order to pass through the NPC, a large molecule (cargo) i.e. theteh cargo
proteinmust associate with another protein called a transport receptor. These transport receptors
then act as chaperones which shuttle cargo through the NPC. Recognition by the transport
receptor takes place via a specific sequence of amino acids in the cargo protein. Besides cargo
and transport receptors, the third ingredient necessary for nuclear transport is the signaling
protein Ran, which hydrolyzes GTP. Ran is responsible for regulating the inter.
The neurons are nervous cells which play the central role in generat.pdf
The neurons are nervous cells which play the central role in generating, holding and transmitting
information across the body. The information as we perceive is a physico-physiological aspect of
our reaction to an action but it is comprised of a complex set of cytological, electro-chemical and
bio-molecular state of entitites. To be specific, the mode of action of neurons can be functionally
understood as:
The neurons comprise of a complex set of neurological membranes and ion-channels. When a
stimulus is experienced by the body/brain, it changes the bio-chemical nature/concentrations of
various electrically stimulated ions present inside the neurons and outside their perphery. This
causes generation of a local ionic gradient in the neurons which further drives physical activity
of the neuron. The neurological membranes play important role in relay of information. These
membranes help in relay of these biochemical signals across various neurological membranes
and thus transit this information from one neuron to another via a matrix between the two, called
synapse. This process takes place in a very small fraction of seconds so that an immediate and
appropriate reaction could be made.
Thus, a neurological cell holds the information by means of generation of a local bio-chemical
potential and ionic gradient and relays/moves this information by means of channelizing these
local gradients in the form of electro-chemical signals from one neuron to the other through
synapse.
Solution
The neurons are nervous cells which play the central role in generating, holding and transmitting
information across the body. The information as we perceive is a physico-physiological aspect of
our reaction to an action but it is comprised of a complex set of cytological, electro-chemical and
bio-molecular state of entitites. To be specific, the mode of action of neurons can be functionally
understood as:
The neurons comprise of a complex set of neurological membranes and ion-channels. When a
stimulus is experienced by the body/brain, it changes the bio-chemical nature/concentrations of
various electrically stimulated ions present inside the neurons and outside their perphery. This
causes generation of a local ionic gradient in the neurons which further drives physical activity
of the neuron. The neurological membranes play important role in relay of information. These
membranes help in relay of these biochemical signals across various neurological membranes
and thus transit this information from one neuron to another via a matrix between the two, called
synapse. This process takes place in a very small fraction of seconds so that an immediate and
appropriate reaction could be made.
Thus, a neurological cell holds the information by means of generation of a local bio-chemical
potential and ionic gradient and relays/moves this information by means of channelizing these
local gradients in the form of electro-chemical signals from one neuron to the other through
synapse..
The parts of the respiratory tract which have nonkeratinized stratif.pdf
The parts of the respiratory tract which have nonkeratinized stratified squamous epithelium are
Larynx-vocal cords, Oropharynx and Laryngopharynx.
Solution
The parts of the respiratory tract which have nonkeratinized stratified squamous epithelium are
Larynx-vocal cords, Oropharynx and Laryngopharynx..
The impact of Brexit would be visible on the financial instituations.pdf
The impact of Brexit would be visible on the financial instituations of US and Europe. The
impact would be shorter and longer term both. The biggest of all is the uncertainty it has created.
So at first the financial firms would hold on to the likely investments they are going to make in
UK as they would go in wait and watch mode.
Also they are likely going to wrap up the operations or shift their base from UK to other
European country assuming that the base operations caters primarily to the European nations.
This also leads to a number of Mergers and acquisitions as the valuations of a lot of businesses
would turn attractive due to currency depreciation.
Solution
The impact of Brexit would be visible on the financial instituations of US and Europe. The
impact would be shorter and longer term both. The biggest of all is the uncertainty it has created.
So at first the financial firms would hold on to the likely investments they are going to make in
UK as they would go in wait and watch mode.
Also they are likely going to wrap up the operations or shift their base from UK to other
European country assuming that the base operations caters primarily to the European nations.
This also leads to a number of Mergers and acquisitions as the valuations of a lot of businesses
would turn attractive due to currency depreciation..
The alkaline earth metals burn in oxygen to form the monoxide, MO wh.pdf
The alkaline earth metals burn in oxygen to form the monoxide, MO which, except for BeO,
have rock-salt structure (BeO has wurtzite structure). The BeO is essentially covalent in nature.
The enthalpies of formation of these oxides are quite high and consequently they are very stable
to heat. BeO is amphoteric while oxides of other elements are ionic in nature. All these oxides
except BeO are basic in nature and react with water to form sparingly soluble hydroxides.
Solution
The alkaline earth metals burn in oxygen to form the monoxide, MO which, except for BeO,
have rock-salt structure (BeO has wurtzite structure). The BeO is essentially covalent in nature.
The enthalpies of formation of these oxides are quite high and consequently they are very stable
to heat. BeO is amphoteric while oxides of other elements are ionic in nature. All these oxides
except BeO are basic in nature and react with water to form sparingly soluble hydroxides..
Squid molluscCrab ArthropodsCrayfish ArthropodsPolychaete .pdf
Squid: mollusc
Crab: Arthropods
Crayfish: Arthropods
Polychaete: Annelids
Homologous organs are the one that develop from common ancestor and have diverged to
perform different functions according to the habitat and habit of the organisms. Lateral
appendages present in Crab (arthropod), crayfish (arthropod) and polychaete (annelid) exhibit
homology. The lateral appendages (parapodia) in polychaete worms extend from the body
segments and serve in locomotion. However, soft body plan does not fix them firmly. On the
other hand, arthropods have hard bodied skeleton. Crab and crayfish takes advantage of hard
bodied skeleton and their lateral appendages are fixed firmly in the skeleton to provide maximum
leverage. Development of parapodia in polychetes allowed them to thrive out of burrow in the
muddy oceanic sediments.
Solution
Squid: mollusc
Crab: Arthropods
Crayfish: Arthropods
Polychaete: Annelids
Homologous organs are the one that develop from common ancestor and have diverged to
perform different functions according to the habitat and habit of the organisms. Lateral
appendages present in Crab (arthropod), crayfish (arthropod) and polychaete (annelid) exhibit
homology. The lateral appendages (parapodia) in polychaete worms extend from the body
segments and serve in locomotion. However, soft body plan does not fix them firmly. On the
other hand, arthropods have hard bodied skeleton. Crab and crayfish takes advantage of hard
bodied skeleton and their lateral appendages are fixed firmly in the skeleton to provide maximum
leverage. Development of parapodia in polychetes allowed them to thrive out of burrow in the
muddy oceanic sediments..
The code you written is little bit confusing and lengthy. Here is th.pdf
The code you written is little bit confusing and lengthy. Here is the efficient code to your
problem.
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class ZooMonitor {
private static Scanner scanner=new Scanner(System.in);
public static void main(String[] args) {
int choice;
while(true){
System.out.println(\"------ Menu ------\");
System.out.println(\"1. Monitor an animal\");
System.out.println(\"2. Monitor a habitat\");
System.out.println(\"3. Exit\");
choice=scanner.nextInt();
switch(choice){
case 1:
monitorAnimal();
break;
case 2:
monitorHabitat();
break;
case 3:
System.exit(0);
default:
System.out.println(\"Invalid Input\");
}
}
}
public static void monitorAnimal(){
int choice;
BufferedReader br = null;
int count=0;
Map animals=new HashMap();
System.out.println(\"------ Animals ------\");
try {
String sCurrentLine;
br = new BufferedReader(new FileReader(\"animals.txt\"));
while ((sCurrentLine = br.readLine()) != null) {
if(sCurrentLine.startsWith(\"Details\")){
String animal=sCurrentLine.split(\" \")[2];
System.out.println(++count+\". \"+animal);
animals.put(count, animal);
}
}
br.close();
br = new BufferedReader(new FileReader(\"animals.txt\"));
System.out.println(\"Enter choice : \");
choice=scanner.nextInt();
String selectedAnimal=animals.get(choice);
if(selectedAnimal!=null){
while ((sCurrentLine = br.readLine()) != null) {
if(sCurrentLine.startsWith(\"Animal\")&&(sCurrentLine.split(\"
\")[2].equalsIgnoreCase(selectedAnimal)||selectedAnimal.startsWith(sCurrentLine.split(\"
\")[2].toLowerCase()))){
for(int i=0;i<5;i++){
if(sCurrentLine.startsWith(\"*\"))
System.err.println(sCurrentLine.substring(5));
else
System.out.println(sCurrentLine);
sCurrentLine=br.readLine();
}
}
}
}
} catch (IOException e) {
e.printStackTrace();
} finally {
try {
if (br != null)br.close();
} catch (IOException ex) {
ex.printStackTrace();
}
}
}
public static void monitorHabitat(){
int choice;
BufferedReader br = null;
int count=0;
Map habitats=new HashMap();
System.out.println(\"------ Habitats ------\");
try {
String sCurrentLine;
br = new BufferedReader(new FileReader(\"habitats.txt\"));
while ((sCurrentLine = br.readLine()) != null) {
if(sCurrentLine.startsWith(\"Details\")){
String habitat=sCurrentLine.split(\" \")[2];
System.out.println(++count+\". \"+habitat);
habitats.put(count, habitat);
}
}
br.close();
br = new BufferedReader(new FileReader(\"habitats.txt\"));
System.out.println(\"Enter choice : \");
choice=scanner.nextInt();
String selectedAnimal=habitats.get(choice);
if(selectedAnimal!=null){
while ((sCurrentLine = br.readLine()) != null) {
if(sCurrentLine.startsWith(\"Habitat\")&&(sCurrentLine.split(\"
\")[2].equalsIgnoreCase(selectedAnimal)||selectedAnimal.startsWith(sCurrentLine.split(\"
\")[2].toLowerCase()))){
for(int i=0;i<4;i++){
if(sCurrentLine.startsWith(\"*\"))
System.err.println(sCurrentLine.substring(5));
else
System.out..
Ques-1Normala flora and microbiota of nose and mouth are non-infe.pdf
Ques-1:
Normala flora and microbiota of nose and mouth are non-infectious in the region where they are
living in colonies at specific pH and temperature. However, if they reach other parts of human
body other than nose and mouth may induce “infection”
They do possess common characteristics of sensing known as “quorum sensing” in which
bacteria flora are going to communicate with each other in the region or habitat where they are
living. They have a specific property of “horizontal gene transfer”
Staphylococcus epidermis & lactobacillus are going to present in mouth Corynebacterium and
spirochetes are going to present in nose due to presence of moist environments
Ques-2:
Answer:
Yes, there are other microorganisms inside the mouth & nose other normal flora and microbiota.
There are some fungal microbial pathogens, spirochetes, aspergillus, blastomycosis at the time of
infection present in oral & nasal cavities
Solution
Ques-1:
Normala flora and microbiota of nose and mouth are non-infectious in the region where they are
living in colonies at specific pH and temperature. However, if they reach other parts of human
body other than nose and mouth may induce “infection”
They do possess common characteristics of sensing known as “quorum sensing” in which
bacteria flora are going to communicate with each other in the region or habitat where they are
living. They have a specific property of “horizontal gene transfer”
Staphylococcus epidermis & lactobacillus are going to present in mouth Corynebacterium and
spirochetes are going to present in nose due to presence of moist environments
Ques-2:
Answer:
Yes, there are other microorganisms inside the mouth & nose other normal flora and microbiota.
There are some fungal microbial pathogens, spirochetes, aspergillus, blastomycosis at the time of
infection present in oral & nasal cavities.
Solution.According to IASB framework INCOME is the one of element .pdf
Solution
.
According to IASB framework INCOME is the one of element of balance sheet which
increases in economic benefits during the accounting period in the form of inflows or
enhancements of assets or decreases of liabilities that result in increases in equity, other than
those relating to contributions from equity participants?.
7. Answer is A.Cytochromes are protien containing iron or heme gro.pdf
7. Answer is A.
Cytochromes are protien containing iron or heme groups and function as electron transfer agents
in many metabolic pathways in mitochondria and chloroplasts. It doesn\'t pump ATP, It doesn\'t
has sulfur groups and it doesn\'t reduce oxygen to water.
8. Answer is B.
Pyruvate to is converted to acetyl-coA by pyruvate dehydrogenase complex. First Pyruvate is
decarboxylated by pyruvate dehydrogenase with help from TPP. Then dihydrolipoyl
transacetylase with cofactor lipoamide oxidizes hydroxyethyl- to acetyl- and then transfers
acetyl- to CoA, forming acetyl-CoA. Finally dihydrolipoyl dehydrogenase oxidizes the thiol
groups of the dihydrolipoamide back to lipoamide reducing NAD to NADH.
9. Answer is E.
The strongest oxidizing agent is oxygen, the oxidation of reduced NADH by oxygen has
potential difference of 1.136 V; the electron flow will be from the most negative system, which
is the couple NAD+/NADH, to the least negative system which is the couple O2/H2O. Thus the
oxidation of the reduced form, NADH,oxygen is a spontaneous and a slow reaction, unless
enzymes are present to catalyze the reaction.
Solution
7. Answer is A.
Cytochromes are protien containing iron or heme groups and function as electron transfer agents
in many metabolic pathways in mitochondria and chloroplasts. It doesn\'t pump ATP, It doesn\'t
has sulfur groups and it doesn\'t reduce oxygen to water.
8. Answer is B.
Pyruvate to is converted to acetyl-coA by pyruvate dehydrogenase complex. First Pyruvate is
decarboxylated by pyruvate dehydrogenase with help from TPP. Then dihydrolipoyl
transacetylase with cofactor lipoamide oxidizes hydroxyethyl- to acetyl- and then transfers
acetyl- to CoA, forming acetyl-CoA. Finally dihydrolipoyl dehydrogenase oxidizes the thiol
groups of the dihydrolipoamide back to lipoamide reducing NAD to NADH.
9. Answer is E.
The strongest oxidizing agent is oxygen, the oxidation of reduced NADH by oxygen has
potential difference of 1.136 V; the electron flow will be from the most negative system, which
is the couple NAD+/NADH, to the least negative system which is the couple O2/H2O. Thus the
oxidation of the reduced form, NADH,oxygen is a spontaneous and a slow reaction, unless
enzymes are present to catalyze the reaction..
A and C. RGB analog component video uses no compression, imposes no .pdf
A and C. RGB analog component video uses no compression, imposes no real limit on color
depth and resolution, requires a large amount of bandwidth to carry a signal, and is being
superseded by DVI and HDMI, which provide better clarity.
Solution
A and C. RGB analog component video uses no compression, imposes no real limit on color
depth and resolution, requires a large amount of bandwidth to carry a signal, and is being
superseded by DVI and HDMI, which provide better clarity..
Public key authentication is the most secure colution and utilizes a.pdf
Public key authentication is the most secure colution and utilizes a public key cryptography(PKI)
system, using both public and private keys.A PKI is certainly the easiest solution from the users
prespective.It mainly supports the distribution and identification of public encryption keys,
enabling users and computers to both securely exchange data over networks such as the internet
and verify the identity of the other party.
Without PKI , sensitive information can still be encrypted ( ensuring confidentiality) and
exchanged but there would be no assurance of the identity(authentication) of the other party. Any
form of sensitive data exchanged over the internet is relianton PKI for security.
Elements of PKI
A typical PKI consists of hardware, software , policies and standards to manage the
creation,admisinstration , distribution and revocation of keys and digital certificates. Digital
certificates are at the heart of PKI as they affrim the identity of the certificate subject that bind
the identity to the public key contained in the certificate.
Following are the elements of the PKI:
Certificate Authority (CA)
Registration authority
A certificate database , it mainly stores the certificate requests and issues and revokes
certificates.
A certificate store , which resides on a local computer as a place to store issues certificates and
private keys.
--------------------------************************-----------------------------
To connect many distant employees at once, all office locations must be able to access the same
network resource. Most time iof we will would house the core infrastucture needed to establish
the network, such as the servers and databases. Generally Wide area network (WAN) to connect
the remote offices. WAN are used to connect Local area network(LAN) for disparate offices
together.
However installation and overhead of LNS and WANS is expensive.
To over come this Virtual private networks that run over the internet.
VPN it mainly provides secure connections between individual users and their organizations
network over and their organizations network over the internet, have several upsides. They
provide more secure site to site connections. They provide information transfer much faster that
WAN\'s and most importantly to small and medimum sized business, VPN\'s are much
lessexpensive since you can use a single leased line to the internet for each ofice, cutting down
on broadband cost.
While VPN\'s are highly recommended and trusted a new technology gaining traction with
compaines is the remote desktop. Remote dsktops requires software or an operating system that
allows aplications to run remotely on a server, but to be displayed locally simultaneously. This
network server hosts remote files and application in a secure location , ensuring your data is
never lost , even when something happens to device you are working on.
Solution
Public key authentication is the most secure colution and utilizes a public key cryptography(PKI)
sy.
More from mohammadirfan136964 (20)
2. Ligamentum arteriosumThe aortic arch loops over the left pulmo.pdf
2. Ligamentum arteriosumThe aortic arch loops over the left pulmo.pdf
moles should be equal to complete consumption so.pdf
moles should be equal to complete consumption so.pdf
TrueOne of the fundamental rules which control the PLSS system is .pdf
TrueOne of the fundamental rules which control the PLSS system is .pdf
The stronger the attractions betweenparticles (mo.pdf
The stronger the attractions betweenparticles (mo.pdf
a. It gives benzalacetone b. acetone will underg.pdf
a. It gives benzalacetone b. acetone will underg.pdf
what is the mean, median, mode and the midrange for 191, 167,257,1.pdf
what is the mean, median, mode and the midrange for 191, 167,257,1.pdf
Disodium malonate is an ionic sodium salt that is soluble in water..pdf
Disodium malonate is an ionic sodium salt that is soluble in water..pdf
They showed that GFP protein could be expressed in the organisms wit.pdf
They showed that GFP protein could be expressed in the organisms wit.pdf
Thepossible mechanism by which a 75kD nuclear protein is imported in.pdf
Thepossible mechanism by which a 75kD nuclear protein is imported in.pdf
The neurons are nervous cells which play the central role in generat.pdf
The neurons are nervous cells which play the central role in generat.pdf
The parts of the respiratory tract which have nonkeratinized stratif.pdf
The parts of the respiratory tract which have nonkeratinized stratif.pdf
The impact of Brexit would be visible on the financial instituations.pdf
The impact of Brexit would be visible on the financial instituations.pdf
The alkaline earth metals burn in oxygen to form the monoxide, MO wh.pdf
The alkaline earth metals burn in oxygen to form the monoxide, MO wh.pdf
Squid molluscCrab ArthropodsCrayfish ArthropodsPolychaete .pdf
Squid molluscCrab ArthropodsCrayfish ArthropodsPolychaete .pdf
The code you written is little bit confusing and lengthy. Here is th.pdf
The code you written is little bit confusing and lengthy. Here is th.pdf
Ques-1Normala flora and microbiota of nose and mouth are non-infe.pdf
Ques-1Normala flora and microbiota of nose and mouth are non-infe.pdf
Solution.According to IASB framework INCOME is the one of element .pdf
Solution.According to IASB framework INCOME is the one of element .pdf
7. Answer is A.Cytochromes are protien containing iron or heme gro.pdf
7. Answer is A.Cytochromes are protien containing iron or heme gro.pdf
A and C. RGB analog component video uses no compression, imposes no .pdf
A and C. RGB analog component video uses no compression, imposes no .pdf
Public key authentication is the most secure colution and utilizes a.pdf
Public key authentication is the most secure colution and utilizes a.pdf
Recently uploaded
Chapter -12, Antibiotics (One Page Notes).pdf
This is a notes for the D.Pharm students and related to the antibiotic drugs.
CACJapan - 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.
1.4 modern child centered education - mahatma gandhi-2.pptx
Child centred education is an educational approach that priorities the interest, needs and abilities of the child in the learning process.
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
Synthetic Fiber Construction in lab .pptx
Synthetic fiber production is a fascinating and complex field that blends chemistry, engineering, and environmental science. By understanding these aspects, students can gain a comprehensive view of synthetic fiber production, its impact on society and the environment, and the potential for future innovations. Synthetic fibers play a crucial role in modern society, impacting various aspects of daily life, industry, and the environment. ynthetic fibers are integral to modern life, offering a range of benefits from cost-effectiveness and versatility to innovative applications and performance characteristics. While they pose environmental challenges, ongoing research and development aim to create more sustainable and eco-friendly alternatives. Understanding the importance of synthetic fibers helps in appreciating their role in the economy, industry, and daily life, while also emphasizing the need for sustainable practices and innovation.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Event Link:-
https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-exploring-gemini-ai-and-integration-with-mulesoft/
Agenda
● Java 17 Upgrade Overview
● Why and by when do customers need to upgrade to Java 17?
● Is there any immediate impact to upgrading to Mule Runtime 4.6 and beyond?
● Which MuleSoft products are in scope?
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/
YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Shyam Raj Prasad-
https://www.linkedin.com/in/shyam-raj-prasad/
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Pavilions
NGV Architecture Commission Competition
MPavilion Commission Competition
Other Pavilion Designs
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...Nguyen Thanh Tu Collection
https://app.box.com/s/hqnndn05v4q5a4k4jd597rkdbda0fniiHow to Make a Field invisible in Odoo 17
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
2024.06.01 Introducing a competency framework for languag learning materials ...
http://sandymillin.wordpress.com/iateflwebinar2024
Published classroom materials form the basis of syllabuses, drive teacher professional development, and have a potentially huge influence on learners, teachers and education systems. All teachers also create their own materials, whether a few sentences on a blackboard, a highly-structured fully-realised online course, or anything in between. Despite this, the knowledge and skills needed to create effective language learning materials are rarely part of teacher training, and are mostly learnt by trial and error.
Knowledge and skills frameworks, generally called competency frameworks, for ELT teachers, trainers and managers have existed for a few years now. However, until I created one for my MA dissertation, there wasn’t one drawing together what we need to know and do to be able to effectively produce language learning materials.
This webinar will introduce you to my framework, highlighting the key competencies I identified from my research. It will also show how anybody involved in language teaching (any language, not just English!), teacher training, managing schools or developing language learning materials can benefit from using the framework.
Embracing GenAI - A Strategic Imperative
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.
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
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.
Recently uploaded (20)
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdf
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of Labour
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Digital Artifact 2 - Investigating Pavilion Designs
Digital Artifact 2 - Investigating Pavilion Designs
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
2024.06.01 Introducing a competency framework for languag learning materials ...
2024.06.01 Introducing a competency framework for languag learning materials ...
Group Presentation 2 Economics.Ariana Buscigliopptx
Group Presentation 2 Economics.Ariana Buscigliopptx
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
import java.util.ArrayList;public class ArrayListADT { public .pdf
- 1. import java.util.ArrayList; public class ArrayListADT { public static void printArray(ArrayList numsList, int numOfElem) { int i = 0; for (i = 0; i < numOfElem; ++i) { System.out.print(numsList.get(i)); System.out.print(" "); } System.out.println(""); } public static void main (String [] args) { ArrayList numsList = new ArrayList(); int numOfElem = 4; numsList.add(new Integer(101)); numsList.add(new Integer(200)); numsList.add(new Integer(103)); numsList.remove(1); //remove 200 at index 1 as index starts from 0 numsList.add(0,new Integer(100)); //add 100 at index 0 so 101 will move to index 1 numsList.add(2,new Integer(102)); // add 102 at index 2 so 103 will move down to index 3 printArray(numsList, numOfElem); return; } } Output Solution import java.util.ArrayList; public class ArrayListADT { public static void printArray(ArrayList numsList, int numOfElem) { int i = 0;
- 2. for (i = 0; i < numOfElem; ++i) { System.out.print(numsList.get(i)); System.out.print(" "); } System.out.println(""); } public static void main (String [] args) { ArrayList numsList = new ArrayList(); int numOfElem = 4; numsList.add(new Integer(101)); numsList.add(new Integer(200)); numsList.add(new Integer(103)); numsList.remove(1); //remove 200 at index 1 as index starts from 0 numsList.add(0,new Integer(100)); //add 100 at index 0 so 101 will move to index 1 numsList.add(2,new Integer(102)); // add 102 at index 2 so 103 will move down to index 3 printArray(numsList, numOfElem); return; } } Output