Part I Write the complete class definition (or server) for Unsorte.pdf
•
0 likes•2 views
The document describes a client program that uses an UnsortedStringList class to: 1. Create a list that can hold nine planets and add planets to the list. 2. Delete the first planet inserted and check if Earth is in the list, printing a message. 3. Print the names of all planets in the list. The solution provided defines the main method to perform these tasks, creating an ArrayList, adding planets, removing the first, checking for Earth, and printing the list.
Report
Share
Report
Share
Download to read offline
![Part I
Write the complete class definition (or server) for UnsortedStringList as described in Chapter 3
of the text.
Part II
Using UnsortedStringList, create a client program that performs the following tasks.
1. Create a list that can hold up to nine planets.
2. Add planets to the list.
3. Delete the first planet inserted into the list.
4. Check to see if Earth is in the list. If so, print "Earth is in the list", otherwise print "Earth is
not in the list".
5. Print the names of all planets in the list.
Solution
import java.util.*;
public class UnsortedStringList {
public static void main(String args[]) {
//Creation of list
ArrayList list = new ArrayList();
//Adding planets to the list
list.add("Mercury");
list.add("Venus");
list.add("Earth");
list.add("Mars");
list.add("Jupiter");
list.add("Saturn");
list.add("Urenus");
list.add("Neptune");
list.add("Pluto");
//Delete 1st element added to list
list.remove(0);
//Check to see if Earth is in the list.
if(list.contains("Earth"))
{
System.out.println("Earth is in the list");](https://image.slidesharecdn.com/partiwritethecompleteclassdefinitionorserverforunsorte-230708024522-5c4ae64d/85/Part-I-Write-the-complete-class-definition-or-server-for-Unsorte-pdf-1-320.jpg)
Recommended
Write a java class LIST that outputsmainpublic class Ass.pdf
The document describes Java List interfaces and common implementations like ArrayList and LinkedList. It provides examples of initializing List with different data types, adding/inserting elements, and sorting a List using Collections.sort(). Key points covered include declaring List with generic types, initializing capacity for ArrayList, copying elements between Lists, and sorting Lists into natural ascending order.
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 ;
/.
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.;public class FirstChars { public static vo.pdf
import java.util.*;
public class FirstChars {
public static void main(String args[]) {
/*Creation of ArrayList of type String */
ArrayList arrList = new ArrayList();
/*Add elements to ArrayList*/
arrList.add(\"Hello\");
arrList.add(\"World\");
arrList.add(\"goodbye\");
/* Displaying array list elements */
System.out.println(\"Element in Array List:\"+arrList);
// Calling
System.out.println(\"first letters of ArrayList:\"+f(arrList));
}
public static String f(ArrayList arrayList){
String s = \"\"; // empty string
for(int i=0;i
Solution
import java.util.*;
public class FirstChars {
public static void main(String args[]) {
/*Creation of ArrayList of type String */
ArrayList arrList = new ArrayList();
/*Add elements to ArrayList*/
arrList.add(\"Hello\");
arrList.add(\"World\");
arrList.add(\"goodbye\");
/* Displaying array list elements */
System.out.println(\"Element in Array List:\"+arrList);
// Calling
System.out.println(\"first letters of ArrayList:\"+f(arrList));
}
public static String f(ArrayList arrayList){
String s = \"\"; // empty string
for(int i=0;i.
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] .
For this lab you will complete the class MyArrayList by implementing.pdf
Find the time it takes the boat to travel the given distance. A ball is thrown vertically upward
with a speed of 40.0 m/s. How high does it rise? How long does it take to reach its highest
point? How long does the ball take to hit the ground after it reaches its highest point? What is
its velocity when it returns to the level from which it started? The center of mass moves with
constant acceleration when constant forces act on the object. A gym ground. How high above
this point is her center of mass at the following times? Ignore the effects
Solution
initial velocity, u = + 40 m/s
a = - 9.8 m/s^2
(a) it will rise until its velocity becomes zero.
hence final velocity, v = 0
Applying, v^2 - u^2 = 2 a h
0^2 - 40^2 = 2(-9.8)(h)
h = 81.63 m
(B) v = u + at
0 = 40 - 9.8 t
t = 4.08 sec
(C) now for motion from highest point to ground,
initial velocity, v (velocity at highets point) = 0
displacement, y = - 81.63 m
a = - 9.8 m/s^2
applying, y = u t + a t^2 /2
- 81.63 = 0 - 9.8 t^2 / 2
t = 4.08 s
(D) applying v = u + at
v = 0 + (-9.8)(4.08)
v = - 40 m/s
(minus sign indicates that direction is downwards).
Complete the provided partial C++ Linked List program. Main.cpp is g.pdf
Complete the provided partial C++ Linked List program. Main.cpp is given and Link list header
file is also given. The given testfile listmain.cpp is given for demonstration of unsorted list
functionality. The functions header file is also given. Complete the functions of the header file
linked_list.h below.
=========================================================
// listmain.cpp
#include \"Linked_List.h\"
int main(int argc, char **argv)
{
float f;
Linked_List *theList;
cout << \"Simple List Demonstration\ \";
cout << \"(List implemented as an Array - Do not try this at home)\ \ \";
cout << \"Create a list and add a few tasks to the list\";
theList = new Linked_List(); // Instantiate a list object
theList->Insert(5, 3.1f); // Note: The argument to the funtion should be a float
theList->Insert(1, 5.6f); // A constant real number like 3.1 is interpreted as
theList->Insert(3, 8.3f); // a double unless it is explicitly defined as a float
theList->Insert(2, 7.4f); // by adding an \'f\' to the end of the number.
theList->Insert(4, 2.5f);
// Show what is in the list
theList->PrintList();
// Test the list length function
cout << \"\ List now contains \" << theList->ListLength() << \"items.\ \ \";
// Test delete function
cout << \"Testing delete of last item in list.\ \";
theList->Delete(4);
theList->PrintList();
// Test delete function
cout << \"Testing delete of first item in list.\ \";
theList->Delete(5);
theList->PrintList();
// Test delete function
cout << \"Testing delete of a middle item in list.\ \";
theList->Delete(3);
theList->PrintList();
// Test delete function with a known failure argument
cout << \"Testing failure in delete function.\ \";
if(theList->Delete(4))
cout << \"Oops! Should not have been able to delete.\ \";
else
cout << \"Unable to locate item to delete.\ \";
// Test search (known failure)
cout << \"Testing Search function. Search for key 3\ \";
if(theList->Search(3, &f))
cout << \"Search result: theData = %f\ \", f;
else
cout << \"Search result: Unable to locate item in list\ \";
// Test search (known success)
cout << \"Testing Search function. Search for key 2\ \";
if(theList->Search(2, &f))
cout << \"Search result: theData = \" << f << \"\ \";
else
cout << \"Search result: Unable to locate item in list\ \";
cout << \"\ \ End list demonstration...\";
return 0;
}
=====================================================================
===================
// linked_list.h functions
#include
using namespace std;
// Define a structure to use as the list item
struct ListItem
{
int key;
float theData;
ListItem *next;
};
class Linked_List
{
private:
ListItem *head; // Pointer to head of the list
public:
Linked_List(); // Class constructor
~Linked_List(); // Class destuctor
void ClearList(); // Remove all items from the list
bool Insert(int key, float f);// Add an item to the list
bool Delete(int key); // Delete an item from the list
bool Search(int key, float *retVal); // Search for an item in the list
int ListLength(); // Return numb.
Recommended
Write a java class LIST that outputsmainpublic class Ass.pdf
The document describes Java List interfaces and common implementations like ArrayList and LinkedList. It provides examples of initializing List with different data types, adding/inserting elements, and sorting a List using Collections.sort(). Key points covered include declaring List with generic types, initializing capacity for ArrayList, copying elements between Lists, and sorting Lists into natural ascending order.
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 ;
/.
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.;public class FirstChars { public static vo.pdf
import java.util.*;
public class FirstChars {
public static void main(String args[]) {
/*Creation of ArrayList of type String */
ArrayList arrList = new ArrayList();
/*Add elements to ArrayList*/
arrList.add(\"Hello\");
arrList.add(\"World\");
arrList.add(\"goodbye\");
/* Displaying array list elements */
System.out.println(\"Element in Array List:\"+arrList);
// Calling
System.out.println(\"first letters of ArrayList:\"+f(arrList));
}
public static String f(ArrayList arrayList){
String s = \"\"; // empty string
for(int i=0;i
Solution
import java.util.*;
public class FirstChars {
public static void main(String args[]) {
/*Creation of ArrayList of type String */
ArrayList arrList = new ArrayList();
/*Add elements to ArrayList*/
arrList.add(\"Hello\");
arrList.add(\"World\");
arrList.add(\"goodbye\");
/* Displaying array list elements */
System.out.println(\"Element in Array List:\"+arrList);
// Calling
System.out.println(\"first letters of ArrayList:\"+f(arrList));
}
public static String f(ArrayList arrayList){
String s = \"\"; // empty string
for(int i=0;i.
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] .
For this lab you will complete the class MyArrayList by implementing.pdf
Find the time it takes the boat to travel the given distance. A ball is thrown vertically upward
with a speed of 40.0 m/s. How high does it rise? How long does it take to reach its highest
point? How long does the ball take to hit the ground after it reaches its highest point? What is
its velocity when it returns to the level from which it started? The center of mass moves with
constant acceleration when constant forces act on the object. A gym ground. How high above
this point is her center of mass at the following times? Ignore the effects
Solution
initial velocity, u = + 40 m/s
a = - 9.8 m/s^2
(a) it will rise until its velocity becomes zero.
hence final velocity, v = 0
Applying, v^2 - u^2 = 2 a h
0^2 - 40^2 = 2(-9.8)(h)
h = 81.63 m
(B) v = u + at
0 = 40 - 9.8 t
t = 4.08 sec
(C) now for motion from highest point to ground,
initial velocity, v (velocity at highets point) = 0
displacement, y = - 81.63 m
a = - 9.8 m/s^2
applying, y = u t + a t^2 /2
- 81.63 = 0 - 9.8 t^2 / 2
t = 4.08 s
(D) applying v = u + at
v = 0 + (-9.8)(4.08)
v = - 40 m/s
(minus sign indicates that direction is downwards).
Complete the provided partial C++ Linked List program. Main.cpp is g.pdf
Complete the provided partial C++ Linked List program. Main.cpp is given and Link list header
file is also given. The given testfile listmain.cpp is given for demonstration of unsorted list
functionality. The functions header file is also given. Complete the functions of the header file
linked_list.h below.
=========================================================
// listmain.cpp
#include \"Linked_List.h\"
int main(int argc, char **argv)
{
float f;
Linked_List *theList;
cout << \"Simple List Demonstration\ \";
cout << \"(List implemented as an Array - Do not try this at home)\ \ \";
cout << \"Create a list and add a few tasks to the list\";
theList = new Linked_List(); // Instantiate a list object
theList->Insert(5, 3.1f); // Note: The argument to the funtion should be a float
theList->Insert(1, 5.6f); // A constant real number like 3.1 is interpreted as
theList->Insert(3, 8.3f); // a double unless it is explicitly defined as a float
theList->Insert(2, 7.4f); // by adding an \'f\' to the end of the number.
theList->Insert(4, 2.5f);
// Show what is in the list
theList->PrintList();
// Test the list length function
cout << \"\ List now contains \" << theList->ListLength() << \"items.\ \ \";
// Test delete function
cout << \"Testing delete of last item in list.\ \";
theList->Delete(4);
theList->PrintList();
// Test delete function
cout << \"Testing delete of first item in list.\ \";
theList->Delete(5);
theList->PrintList();
// Test delete function
cout << \"Testing delete of a middle item in list.\ \";
theList->Delete(3);
theList->PrintList();
// Test delete function with a known failure argument
cout << \"Testing failure in delete function.\ \";
if(theList->Delete(4))
cout << \"Oops! Should not have been able to delete.\ \";
else
cout << \"Unable to locate item to delete.\ \";
// Test search (known failure)
cout << \"Testing Search function. Search for key 3\ \";
if(theList->Search(3, &f))
cout << \"Search result: theData = %f\ \", f;
else
cout << \"Search result: Unable to locate item in list\ \";
// Test search (known success)
cout << \"Testing Search function. Search for key 2\ \";
if(theList->Search(2, &f))
cout << \"Search result: theData = \" << f << \"\ \";
else
cout << \"Search result: Unable to locate item in list\ \";
cout << \"\ \ End list demonstration...\";
return 0;
}
=====================================================================
===================
// linked_list.h functions
#include
using namespace std;
// Define a structure to use as the list item
struct ListItem
{
int key;
float theData;
ListItem *next;
};
class Linked_List
{
private:
ListItem *head; // Pointer to head of the list
public:
Linked_List(); // Class constructor
~Linked_List(); // Class destuctor
void ClearList(); // Remove all items from the list
bool Insert(int key, float f);// Add an item to the list
bool Delete(int key); // Delete an item from the list
bool Search(int key, float *retVal); // Search for an item in the list
int ListLength(); // Return numb.
Array list
The document discusses ArrayLists in Java. Key points include:
- ArrayLists allow dynamic resizing as elements are added, with O(1) access time. They support methods for insertion, deletion, and updating elements.
- ArrayLists can be iterated over using a for-each loop or indexed access.
- Common ArrayList methods include add(), get(), contains(), clear(), remove(), and size().
- Iterators can be used to iterate over ArrayLists in a single direction. ListIterators allow bidirectional traversal and modification of elements.
package singlylinkedlist; public class Node { public String valu.pdf
package singlylinkedlist;
public class Node {
public String value;
public Node next;
public Node(String value) {
this.value = value;
}
@Override
public String toString() {
return value;
}
}
SingleyLinkedList.java :
package singlylinkedlist;
import java.io.*;
import java.util.*;
/**
* Defines the interface for a singly-linked list.
*
*/
public interface SinglyLinkedList {
/**
* @return Reference to the first node. If the list is empty, this method
* returns null.
*/
public Node getFirst();
/**
* @return Reference to the last node . If the list is empty, this method
* returns null.
*/
public Node getLast();
/**
* @return Number of nodes in the list
*/
public int size();
/**
* @return true if the list has no nodes; false otherwise
*/
public boolean isEmpty();
/**
* Removes all nodes in the list.
*/
public void clear();
/**
* Inserts a new node with the given value after cursor.
*
* @param cursor
* The node to insert after. Set this to null to insert value as
the
* new first Node.
* @param value
* The value to insert
* @return a reference to the newly inserted Node
*/
public Node insert(Node cursor, String value);
/**
* Inserts a new node with the given value at the "end" of the list.
*
* @param value
* @return a reference to the newly inserted Node
*/
public Node append(String value);
/**
* Removes the node after the specified Node (cursor) from the list.
*
* @param cursor
* A reference to the Node to remove.
*/
public void removeAfter(Node cursor);
/**
* Returns a reference to the first Node containing the key, starting from
the
* given Node.
*
* @param start
* @param key
* @return a reference to the first Node containing the key
*/
public Node find(Node start, String key);
/**
* Prints the values of all the items in a list
*/
public void printWholeList();
}
SinglyLinkedTester.java:
package sbccunittest;
import static java.lang.Math.*;
import static java.lang.System.*;
import static org.apache.commons.lang3.StringUtils.*;
import static org.junit.Assert.*;
import static sbcc.Core.*;
import java.io.*;
import java.lang.reflect.*;
import java.nio.file.*;
import java.util.*;
import java.util.stream.*;
import org.apache.commons.lang3.*;
import org.junit.*;
import org.w3c.dom.ranges.*;
import sbcc.*;
import singlylinkedlist.*;
/**
* 09/16/2021
*
* @author sstrenn
*
*/
public class SinglyLinkedListTester {
public static String newline = System.getProperty("line.separator");
public static int totalScore = 0;
public static int extraCredit = 0;
public static boolean isZeroScore = false;
public static String scorePreamble = "";
@BeforeClass
public static void beforeTesting() {
totalScore = 0;
extraCredit = 0;
}
@AfterClass
public static void afterTesting() {
if (isZeroScore) {
totalScore = 0;
extraCredit = 0;
}
println(scorePreamble + "Estimated score (w/o late penalties, etc.) is:
" + totalScore + " out of 25.");
// If the project follows the naming convention, save the results in a
folder on
// the desktop. (Alex Kohanim)
try {
String directory =
substri.
In this homework- you will write a program modify program you wrote in.pdf
In this homework, you will write a program modify program you wrote in Homework3.
2) Modify the MyList class that you wrote for Programming challenge 1 so the type parameter T
should accept any type that implements the Comparable interface. Test the class in a program
that creates one instance of MyList to store Integers, and another instance to store Strings. Input
two numbers from the user and insert them into the first instance of Modified MyList.
Input name and City and insert the two strings into the second instance of modified MyList class.
Then display the contents of the the two instances.
here is the program to modify
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// part 1 code.
// creating a Number list
MyList<Number> intList = new MyList<>();
// adding the numbers mentioned in the question
intList.add(2);
intList.add(5);
intList.add(-13);
intList.add(11);
intList.add(12);
// creating a Double list, adding double values to it
MyList<Double> doubleList = new MyList<>();
doubleList.add(27.3);
doubleList.add(5.7);
doubleList.add(-23.9);
doubleList.add(1.11);
doubleList.add(5.12);
System.out.println("PART 1");
// printing largest and smallest of both lists
System.out.println("The Integer largest: \n" + intList.largest());
System.out.println("The Integer smallest: \n" + intList.smallest());
System.out.println("The Double largest: \n" + doubleList.largest());
System.out.println("The Double smallest: \n" + doubleList.smallest());
}
}
//MyList class, which is defined outside Generics1 class BUT still within Generics1.java file.
class MyList<T extends Number> {
// defining an array list as storage
ArrayList<T> list;
// constructor initializing list
public MyList() {
// initializing array list
list = new ArrayList<>();
}
// method to add a value to the list
public void add(T value) {
list.add(value);
}
// method to return the largest element on the list
public T largest() {
// assuming list is not empty, taking first value as largest
T max = list.get(0);
for (int i = 1; i < list.size(); i++) {
// comparing element at i with max using doubleValue() of Number class
if (list.get(i).doubleValue() > max.doubleValue()) {
max = list.get(i);
}
}
return max;
}
// method to return the smallest element on the list
public T smallest() {
// assuming list is not empty, taking first value as smallest
T min = list.get(0);
for (int i = 1; i < list.size(); i++) {
// comparing element at i with min using doubleValue() of Number class
if (list.get(i).doubleValue() < min.doubleValue()) {
min = list.get(i);
}
}
return min;
}
// returns the elemnt at a given position
public T get(int index) {
return list.get(index);
}
}
Here is the sample input/outPut
TestCase1:
PART 2
Please enter a number:
30
Please another number:
20
Please enter your name:
John
Please enter your City:
Los Angeles
First number is 30
Second number is 20
Name is: John
City is: Los Angeles
TestCase2:
PART 2
Please enter a number:
.
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 .
Implement the interface you wrote for Lab B (EntryWayListInterface)..pdf
This document describes implementing an EntryWayListInterface using either an array or linked nodes. It provides the interface methods that must be implemented which include insertHead, insertTail, deleteHead, deleteTail, display, contains, isEmpty, and isFull. It also describes creating a driver program to test the implementation by adding and removing elements from the list and checking for elements. A second class is to implement the interface using an AList or LList object instead of an array or linked nodes.
Write a function which return a list of all of the n element subset .pdf
Write a function which return a list of all of the n element subset of a given set
Implement in JAVA Question 3 Write a function that returns a list of all of the n-element subsets
of a given set. For example, if the given set is [1,2,3] and n is 2, then the returned list should
contain [1,2], [1,3], and [2,3]. The order of the elements is not important.
Solution
The program for this problem is as follows:
Comments are included in the program for explaining the steps.
A sample output is attached below the program.
package com.temp;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/**
* Program to find sublists of a list.
* @author Rohit Phatak
*
*/
public class subset {
/**
* This list will contain the resultant sublists.
*/
static List list = new ArrayList<>();
public static void main(String arg[]){
/**
* Input a list comma separated.
*/
System.out.println(\"Enter a list : \");
Scanner scanner = new Scanner(System.in);
String s = scanner.nextLine();
String[] sArr = s.split(\",\");
/**
* Input a value of n.
*/
System.out.println(\"Enter value of n : \");
Integer n = scanner.nextInt();
/**
* Check if value of n is greater than entered list.
*/
if(sArr.length < n){
System.out.println(\"Length of list is less than value of n\");
} else if(sArr.length > 0){
getSubsetList(sArr,n);
System.out.println(\"List is as :\");
/**
* Printing the sublists.
*/
for(String[] str : list){
String printVar = \"\";
for(String temps : str)
printVar+=temps+\",\";
System.out.println(\"[\"+printVar.substring(0, printVar.length()-1)+\"]\");
}
} else {
System.out.println(\"Please enter atleast one element:\");
}
scanner.close();
}
/**
* This method calls the recursive function which is used to obtain the sublists.
* @param sArr
* @param n
* @return
*/
public static List getSubsetList(String[] sArr,Integer n){
List lista = new ArrayList<>();
sublist(sArr, 0, n, new String[n]);
return lista;
}
/**
* This is a recursive function.
* This function will iterate over itself for finding the sublist.
*
* Parameters are as follows:
*
* @param arr -> List entered by the user.
* @param n -> Value of sublist entered by user.
* @param startPosition -> index to start creating the sublist.
* @param result -> resultant sublist
*/
public static void sublist(String[] arr, int startPosition, int n, String[] result){
/**
* Check for the value of n ==0.
* If n==0 break from the recursion.
*/
if (n == 0){
/**
* Add the sublist \'result\' in the list.
*/
list.add(result.clone());
return;
}
/**
* Iterate through for loop starting from startPosition till length of list minus entered value
n.
*/
for (int i = startPosition; i <= arr.length-n; i++){
/**
* Here result is a temporary sublist.
* This for loop adds an element to the temporary sublist in each iteration.
* The element is added from the complete list entered by user.
* Location of element is iTh index.
*/
result[result.length - n] = arr[i];
/**
* After adding the element to the temporary sublist, the sublist an.
import java.util.; public class IteratorDemo {public static voi.pdf
import java.util.*;
public class IteratorDemo {
public static void main(String args[]) {
// Create an array list
ArrayList al = new ArrayList();
// add elements to the array list
al.add(\"C\");
al.add(\"A\");
al.add(\"E\");
al.add(\"B\");
al.add(\"D\");
al.add(\"F\");
// Use iterator to display contents of al
System.out.print(\"Original contents of al: \");
Iterator itr = al.iterator();
while(itr.hasNext()) {
Object element = itr.next();
System.out.print(element + \" \");
}
System.out.println();
// Modify objects being iterated
ListIterator litr = al.listIterator();
while(litr.hasNext()) {
Object element = litr.next();
litr.set(element + \"+\");
}
System.out.print(\"Modified contents of al: \");
itr = al.iterator();
while(itr.hasNext()) {
Object element = itr.next();
System.out.print(element + \" \");
}
System.out.println();
// Now, display the list backwards
System.out.print(\"Modified list backwards: \");
while(litr.hasPrevious()) {
Object element = litr.previous();
System.out.print(element + \" \");
}
System.out.println();
}
}
public class GenericMethodTest {
// generic method printArray
public static < E > void printArray( E[] inputArray ) {
// Display array elements
for(E element : inputArray) {
System.out.printf(\"%s \", element);
}
System.out.println();
}
public static void main(String args[]) {
// Create arrays of Integer, Double and Character
Integer[] intArray = { 1, 2, 3, 4, 5 };
Double[] doubleArray = { 1.1, 2.2, 3.3, 4.4 };
Character[] charArray = { \'H\', \'E\', \'L\', \'L\', \'O\' };
System.out.println(\"Array integerArray contains:\");
printArray(intArray); // pass an Integer array
System.out.println(\"\ Array doubleArray contains:\");
printArray(doubleArray); // pass a Double array
System.out.println(\"\ Array characterArray contains:\");
printArray(charArray); // pass a Character array
}
}
Solution
import java.util.*;
public class IteratorDemo {
public static void main(String args[]) {
// Create an array list
ArrayList al = new ArrayList();
// add elements to the array list
al.add(\"C\");
al.add(\"A\");
al.add(\"E\");
al.add(\"B\");
al.add(\"D\");
al.add(\"F\");
// Use iterator to display contents of al
System.out.print(\"Original contents of al: \");
Iterator itr = al.iterator();
while(itr.hasNext()) {
Object element = itr.next();
System.out.print(element + \" \");
}
System.out.println();
// Modify objects being iterated
ListIterator litr = al.listIterator();
while(litr.hasNext()) {
Object element = litr.next();
litr.set(element + \"+\");
}
System.out.print(\"Modified contents of al: \");
itr = al.iterator();
while(itr.hasNext()) {
Object element = itr.next();
System.out.print(element + \" \");
}
System.out.println();
// Now, display the list backwards
System.out.print(\"Modified list backwards: \");
while(litr.hasPrevious()) {
Object element = litr.previous();
System.out.print(element + \" \");
}
System.out.println();
}
}
public class GenericMethodTest {
// generic method printArray
public static < E > void printArray( E[].
Algo>Stacks
Stacks are a special type of list where insertions and deletions only occur at one end, called the top. There are two main types - static stacks have a fixed size and are implemented as arrays, while dynamic stacks can grow as needed and are implemented as linked lists. Common stack operations include push to insert at the top, pop to remove from the top, and functions to check if the stack is empty or return the top element. Stacks are useful data structures with LIFO (last in, first out) behavior and have various applications like implementing function call stacks in compilers.
I need help with this code working Create another project and add yo.pdf
I need help with this code working Create another project and add your jar file in this project. In
the main method of App class of this second project test your MyArrayList class. It is mandatory
to follow the instructions to get full credit. You need to perform the following actions. 1. Create
five strings, A1",,'B2",,'C3",'D4",'E5" 2. Save these Strings in your MyArrayList 3. Print a
message "Displaying List" 4. Display the list 5. Insert another String in your MyArrayList at
location 2 6. Print a message "Inserting Item" 7. Display the list 8. Remove String at location 0 9.
Print a message "Removing Item" 10. Display the list 11. Print a message "Setting a String" 12.
Set a new String in location 1 13. Display the list 14. Check whether "D4" is present in the list or
not, print an appropriate message 15. Find the index of "E5" in your list, print an appropriate
message 16. Print a message "Emptying List" 17. Empty the list 18. Print the size of the list
These steps check most of your MyArrayList functionality. I will also perform my own checks of
your code while grading. Deliverable: a. Copy the utils.jar file in your project folder. b. Make a
zip file of full project, not the src folder only or java files only. c. Submit the zip file. Grading
Rubric: The project is not submitted as required: 0 points
st.java J MyArrayList.java 2 J App.java 2 J MyFile.java 2 rc >J MyArrayList.java >q&
MyArrayList > get(int) public class MyArrayList implements MyList \{ Object [] obj = new
Object [1]; int size; public int size()\{ return size; \} public object get(int index) if (index <0
index >= size ){// throw new indexo return obj [index]; \} return index; // this should be deleted
after public void add (Object 0 ) \{ //if this test fails there is a space in the array. // it will pass
itself. if ( size == obj. length ){ Object [] obj2 = new 0 bject [obj. length 2]; for(int i=0;i<0bj.
length; i++){ obj2[i]=obj [i] ; \} obj=obj2; \} obj [ size ]=0; size++; \} public void add(int index,
Object o) \{ if(index > size || index <0 ) \{ throw new IndexOut0fBoundsException(index); \} if
(size == obj. length ){ Object [] obj2 = new Object [obj. length 2 ]; for(int i=0;i<0bj. length;
i++){ obj 2[i]=obj[i]; \} obj=obj2; \} if (index i=size;i>= index; i){ nhi [i=nhii1 : Ln 16, Col 56
Spaces: 4 UTF-8 LF \{\} Java
In this lab you will add an interface to the MyUtils project, and implement it in your
MyArrayList class in the MyUtils project. You will test the newly added functionality of your
MyArrayList class in another project. The UML for the Interface is as follows S Description of
methods Following method are self-explanatory: size(), get(int index), add (object o), remove
(int index), and isEmpty). Below is the description of all other methods. void add(int index,
Object o) inserts the given reference of object o at location index, making all entries move down
a spot. void remove (Object o) removes the first occurrence of object o in the list, moving all
entries .
I need help 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.
(Unordered Sets) As explained in this chapter, a set is a collection.pdf
The document describes a class called unorderedSetType that is derived from unorderedArrayListType to represent sets. The class redefines functions like insertAt, insertEnd, and replaceAt to handle sets appropriately by checking for duplicate elements. It also includes set operations like union and intersection. A program is provided to test the unorderedSetType class.
I really need help with the code for this in Java.Set operations u.pdf
I really need help with the code for this in Java.
Set operations using iterators: implement a program that creates the sets below (as ArrayLists of
Integers), and then finds the result of the operations below. You only need a single .java file with
the main routine; you do not have to put each set operation in its own method. Do NOT use the
toArray( ) method; you will only need the add( ), addAll( ), contains( ), iterator( ), isEmpty( ),
and remove( ) methods defined for the ArrayList. Recall that setscannot have duplicate entries; it
is up to you to enforce this! (Note: in Java a Set is an interface, but it can also be a class, as all
interfaces are also classes!) Sets:
U = {1,2,3,4,5,6,7,8,9,10} (universe set)
E = {2,4,6,8,10}
O = {1,3,5,7,9}
A = {3,4,5}
B = {5,6,7}
C = { } (empty set)
Operations: find
A union B
A intersect B
A complement
O minus B
E minus A
A symmetric difference B (the symmetric difference of 2 sets is the elements in either, but not in
their intersection)
Subsets: write a method that takes two sets, determines if the first is a subset of the second, and
returns true or false. Then answer these questions (by writing code): is C a subset of U; is E and
subset of U; and, is A a subset of B?
Solution
//code has been tested on eclipse
import java.util.ArrayList;
public class HelloWorld{
public static boolean isSubset(ArrayList A, ArrayList B) { //method to //check subset
return B.containsAll(A);
}
public static void main(String []args){ //main method
ArrayList U=new ArrayList(); //Arraylist for storing elements of union
U.add(1); U.add(2);U.add(3); U.add(4); U.add(5); U.add(6); U.add(7); U.add(8); U.add(9);
U.add(10);//entering //elements of union set
ArrayList E=new ArrayList(); //Arraylist for storing elements of set E
E.add(2); E.add(4); E.add(6); E.add(8); E.add(10); //entering elements of set E
ArrayList O=new ArrayList(); //Arraylist for storing elements of set O
O.add(1);O.add(3);O.add(5);O.add(7);O.add(9); //entering elements of set O
ArrayList A=new ArrayList(); //Arraylist for storing elements of set A
A.add(3); A.add(4); A.add(5); //entering elements of set A
ArrayList B=new ArrayList(); //Arraylist for storing elements of set B
B.add(5);B.add(6);B.add(7); //entering elements of set B
ArrayList C=new ArrayList(); //Arraylist for storing elements of set C
ArrayList UnionA_B=new ArrayList(); //Arraylist for storing elements of Union of A and B
UnionA_B.addAll(A); //Union operation using Addall
for(Integer x:B) //loop to find union of A and B
{
if(!(A.contains(x)))
UnionA_B.add(x); //add elements of union of A and B
}
System.out.println(\"Union of set A and B \"); //printing elements of union A and B
for(Integer x:UnionA_B)
System.out.println(x+\" \");
ArrayList IntsctA_B=new ArrayList(); //Arraylist for storing elements of //Intersection of A and
B
for(Integer x:A){ //loop to find Intersection of A and B
if(B.contains(x))
IntsctA_B.add(x); //add elements of Intersection of A and B
}
System.out.println(\"Intersection.
In C++Add the function min as an abstract function to the classar.pdf
In C++:
Add the function min as an abstract function to the classarrayListTypeto return the smallest
element of the list.
Also, write the definition of the function min in the classunorderedArrayListTypeand write a
program to test this function.
arrayListType.h
#ifndef H_arrayListType
#define H_arrayListType
class arrayListType
{
public:
bool isEmpty() const;
//Function to determine whether the list is empty
//Postcondition: Returns true if the list is empty;
// otherwise, returns false.
bool isFull() const;
//Function to determine whether the list is full
//Postcondition: Returns true if the list is full;
// otherwise, returns false.
int listSize() const;
//Function to determine the number of elements in
//the list.
//Postcondition: Returns the value of length.
int maxListSize() const;
//Function to determine the maximum size of the list
//Postcondition: Returns the value of maxSize.
void print() const;
//Function to output the elements of the list
//Postcondition: Elements of the list are output on the
// standard output device.
bool isItemAtEqual(int location, int item) const;
//Function to determine whether item is the same as
//the item in the list at the position specified
//by location.
//Postcondition: Returns true if list[location]
// is the same as item; otherwise,
// returns false.
// If location is out of range, an
// appropriate message is displayed.
virtual void insertAt(int location, int insertItem) = 0;
//Function to insert insertItem in the list at the
//position specified by location.
//Note that this is an abstract function.
//Postcondition: Starting at location, the elements of
// the list are shifted down,
// list[location] = insertItem; length++;
// If the list is full or location is out of
// range, an appropriate message is displayed.
virtual void insertEnd(int insertItem) = 0;
//Function to insert insertItem at the end of
//the list. Note that this is an abstract function.
//Postcondition: list[length] = insertItem; and length++;
// If the list is full, an appropriate
// message is displayed.
void removeAt(int location);
//Function to remove the item from the list at the
//position specified by location
//Postcondition: The list element at list[location] is
// removed and length is decremented by 1.
// If location is out of range, an
// appropriate message is displayed.
void retrieveAt(int location, int& retItem) const;
//Function to retrieve the element from the list at the
//position specified by location
//Postcondition: retItem = list[location]
// If location is out of range, an
// appropriate message is displayed.
virtual void replaceAt(int location, int repItem) = 0;
//Function to replace the elements in the list
//at the position specified by location.
//Note that this is an abstract function.
//Postcondition: list[location] = repItem
// If location is out of range, an
// appropriate message is displayed.
void clearList();
//Function to remove all the elements from the list
//After this operation, the size of t.
Create a JAVA Program that traverses through an array recursively- rat.docx
Create a JAVA Program that traverses through an array recursively, rather than with a loop, and prints out each element in the array. Java only, this will be a short program.
Solution
public void dosomethingtoall(List list)
{
//begin recurssion dosomethingtoall(list,0);
}
private void dosomethingtoall(Last list,int index)
{
//break recurssion when to proceed entire list.
if(index>=list.size())
return;
//do what ever you want with the list.
process(list.get(index));
//recursive step.process the next element.
dosomethingtoall(list,index+1);
}
or by using traversal
import java.util.Listiterator;
import java.util.Arraylist;
public class
traverseforwordingusingListiteratorexample
{
public static void main(String args[])
{
//create an array of object list
Arraylist alist=new Arraylist();
//add elements to arraylist object
alist.add(\"1\");
alist.add(\"2\");
alist.add(\"3\");
alist.add(\"4\");
alist.add(\"5\");
//get an object of Listiterator using listiteratot()
Listiterator listiterator=alist.listiterator();
/*traverse arraylist in forward direction using hasNext and next methods of listiterator.hasNEXT Returns true if Listiterator has more elements to traverse in forwrd direction.next methid returns next element in the list*/
Sysytem.out.println(\"traversing arraylist in forward direction using Listiterator\");
while(listiterator.hasNext())
system.out.println(listiterator.next());
}
}
.
ReversePoem.java ---------------------------------- public cl.pdf
ReversePoem.java :-
---------------------------------
public class ReversePoem {
/*This programs has you display a pessimistic poem from a list of phrases*/
// and then reverse the phrases to find another more optimistic poem.
public static void main(String[] args) throws Exception
{
//Queue object
MyQueue queue = new MyQueue<>();
//Stack object
MyStack stack = new MyStack<>();
//String buffer to apppend all Strings
StringBuffer sb = new StringBuffer();
// Create a single String object from the 16 Strings below
String set1 = \"I am part of a lost generation#and I refuse to believe that#\";
sb.append(set1);
String set2 = \"I can change the world#I realize this may be a shock but#\";
sb.append(set2);
String set3 = \"\'Happiness comes from within\'#is a lie, and#\";
sb.append(set3);
String set4 = \"\'Money will make me happy\'#So in 30 years I will tell my children#\";
sb.append(set4);
String set5 = \"they are not the most important thing in my life#\";
sb.append(set5);
String set6 = \"My employer will know that#I have my priorities straight because#\";
sb.append(set6);
String set7 = \"work#is more important than#family#I tell you this#\";
sb.append(set7);
String set8 = \"Once upon a time#Families stayed together#\";
sb.append(set8);
String set9 = \"but this will not be true in my era#\";
sb.append(set9);
String set10 = \"This is a quick fix society#Experts tell me#\";
sb.append(set10);
String set11 = \"30 years from now, I will be celebrating the 10th anniversary of my
divorce#\";
sb.append(set11);
String set12 = \"I do not concede that#I will live in a country of my own making#\";
sb.append(set12);
String set13 = \"In the future#Environmental destruction will be the norm#\";
sb.append(set13);
String set14 = \"No longer can it be said that#My peers and I care about this earth#\";
sb.append(set14);
String set15 = \"It will be evident that#My generation is apathetic and lethargic#\";
sb.append(set15);
String set16 = \"It is foolish to presume that#There is hope#\";
sb.append(set16);
String finalString = sb.toString();
String itmes[] = finalString.split(\"#\");
System.out.println(\"========== Original Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
queue.enqueue(itmes[i]);
System.out.println(itmes[i]);
}
for(int i = 0 ; i < itmes.length;i++){
stack.push(queue.dequeue());
}
System.out.println(\"========== Reverse Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
System.out.println(stack.pop());
}
/* You are given a list of phrases in Strings; the phrases
are separated by pound signs: \'#\':
1. Create a single String object from this list.
2. Then, split the String of phrases into an array of
phrases using the String split method.
3. Display a poem by walking through the array and
displaying each phrase one per line.
4. And, at the same time, place each phrase on a
MyQueue object using only the enqueue method.
5. After all the phrases have been placed on the queue,
transfer the phrases from the MyQueue object to a
MyS.
Implementation The starter code includes List.java. You should not c.pdf
Implementation The starter code includes List.java. You should not change anything in List.java.
Your task will be to create LinkedList.java, make LinkedList use generics and inherit from List,
and complete several methods in LinkedList.java. Create LinkedList.java in IntelliJ. Add a main
method to LinkedList.java containing the following code. Your program will not compile again.
public static void main(String[] args) { LinkedList list = new LinkedList();
System.out.println(list.getHead()); System.out.println(list.getTail()); list.add("first");
list.add("middle"); list.add("last"); System.out.println(list.getHead().value);
System.out.println(list.getTail().value); System.out.println(list); } The first issue is that your
LinkedList class does not have a way of specifying what type of data it should store. You can fix
this using Java Generics. Change the first line of your class to the following: LinkedList .
Confirm that the first line in your main method no longer has an error. On the line that declares
the LinkedList class, add extends List before the bracket that begins the class. The first line in
your class will now have a compile error because LinkedList does not implement the methods
required by the List abstract class. Press Ctrl-i to have IntelliJ insert stubs of these methods.
Ensure that Copy JavaDoc is selected so you get JavaDoc comments which describe the method
requirements, then click OK. Your code should now compile again. Next add fields for the head
and tail. These will be of type Node. Create a getHead method which returns your head field, and
a getTail method which returns your tail field. Run your main method now and you will see that
there is a NullPointerException because the add method does not actually add anything to the
list, so head and tail will always be null. Complete the method boolean add(T value) for which
IntelliJ gave you a stub. You need to create a new node with value to add at the end of the list.
This means you will need to connect it to the old tail and update tail to point to the node you
created. Make sure that you handle the case where the list is empty and both head and tail should
be set to the new node you've created. Note: For the full Map I assignment, add will need to
prevent duplicate values being added to the list and should return true or false based on whether
the value was added or not. For this lab, you can ignore this requirement and simply return true.
Add a toString method to your LinkedList class. It should start at the head of your list and
proceed through all the nodes in a loop, combining the values of each node with a comma
between each and square brackets containing the whole thing. When you run your main method,
the final thing printed should be: [first, middle, last] List.java: /** * Specification for a List
ADT. * @author Shubham Chatterjee * @version 03/07/2019 * @param Type */ public abstract
class List { /** * Appends the specified value to the end of this list. * * @para.
helpInstructionsAdd the function max as an abstract function to .pdf
help
Instructions
Add the function max as an abstract function to the class arrayListType to return the largest
element of the list.
Also, write the definition of the function max in the class unorderedArrayListType and write a
program to test this function.
files:
main.cpp:
//Data: 18 42 78 22 42 5 42 57
arrayListType.h:
#ifndef H_arrayListType
#define H_arrayListType
class arrayListType
{
public:
bool isEmpty() const;
//Function to determine whether the list is empty
//Postcondition: Returns true if the list is empty;
// otherwise, returns false.
bool isFull() const;
//Function to determine whether the list is full
//Postcondition: Returns true if the list is full;
// otherwise, returns false.
int listSize() const;
//Function to determine the number of elements in
//the list.
//Postcondition: Returns the value of length.
int maxListSize() const;
//Function to determine the maximum size of the list
//Postcondition: Returns the value of maxSize.
void print() const;
//Function to output the elements of the list
//Postcondition: Elements of the list are output on the
// standard output device.
bool isItemAtEqual(int location, int item) const;
//Function to determine whether item is the same as
//the item in the list at the position specified
//by location.
//Postcondition: Returns true if list[location]
// is the same as item; otherwise,
// returns false.
// If location is out of range, an
// appropriate message is displayed.
virtual void insertAt(int location, int insertItem) = 0;
//Function to insert insertItem in the list at the
//position specified by location.
//Note that this is an abstract function.
//Postcondition: Starting at location, the elements of
// the list are shifted down,
// list[location] = insertItem; length++;
// If the list is full or location is out of
// range, an appropriate message is displayed.
virtual void insertEnd(int insertItem) = 0;
//Function to insert insertItem at the end of
//the list. Note that this is an abstract function.
//Postcondition: list[length] = insertItem; and length++;
// If the list is full, an appropriate
// message is displayed.
void removeAt(int location);
//Function to remove the item from the list at the
//position specified by location
//Postcondition: The list element at list[location] is
// removed and length is decremented by 1.
// If location is out of range, an
// appropriate message is displayed.
void retrieveAt(int location, int& retItem) const;
//Function to retrieve the element from the list at the
//position specified by location
//Postcondition: retItem = list[location]
// If location is out of range, an
// appropriate message is displayed.
virtual void replaceAt(int location, int repItem) = 0;
//Function to replace the elements in the list
//at the position specified by location.
//Note that this is an abstract function.
//Postcondition: list[location] = repItem
// If location is out of range, an
// appropriate message is displayed.
void clearList();
//Function to remove all th.
Homework 05 - Linked Lists (C++)(1) Implement the concepts of a un.pdf
Homework 05 - Linked Lists (C++)
(1) Implement the concepts of a union, and difference as defined noted in Chapter 1 questions 6,
and 8 using a linked list. You should not use arrays, dynamic arrays or the STL vector or STL
list classes.
You will be linking a series of nodes together to implement a single linked list class. Define a
Node as a struct that holds a character (like they did in the book) and a pointer to another Node:
struct Node {
char data;
Node* next;
};
Then define a LinkedList class which has (at a minimum) these member functions:
LinkedList();
~LinkedList();
bool insertAtFront();
bool insertBeforePosition(int index);
bool insertAtBack();
bool deleteAtFront();
bool deleteBeforePosition(int index);
bool deleteAtBack();
Implement each of these functions to provide the correct functionality. These functions return
true if successful in inserting or deleting, otherwise they return false (indicating the operation
was not successful).
Finally, create an overloaded + operator to handle the Union of two linked lists and an
overloaded - operator to handle the Difference of two linked lists.
Because we are dealing with pointers you should have both a LinkedList Constructor and
Destructor. Remember that you do not directly call a Constructor or Destructor Function. The
Destructor is automatically called when the variable loses scope or the program ends.
Remember, that we are dealing with not just one dynamically allocated Node (with the new
operator), but many, so you will have to start at the head of the list and go until the Node points
to nullptr. Then keep deleting the previous Node pointer until there are no Nodes left to delete.
(2) To verify your set class, write a main function that takes two lines of characters from the
input file input.txt and store each line of characters into two separate linked lists. Then using
these two lists, perform the Union and set Difference of the characters from the file, and print the
results to the console.
(3) Please also complete an asymptotic (Big O) analysis of your insertAtFront() and
insertAtBack() member functions. Place this in a file called analysis.txt.
Solution
Here is the complete code for your question. Please do rate the aswer if you are happy with
program. Please read comments in the program. Also pay special attention to comments in + and
- operators. You WILL NEED to comment out if condition in + if you want all elements in both
lists irrespective of if they duplicates or no. For now implemented to have true behaviour of no
duplicates in union.
check the functions by creating some lists and playing around different fucntions like its done in
main and commented out.
As far as complexity:
for insertAtFront() its O(1) since it does not depend on the size of the list. It just replaces the start
of the list. Hence it is O(1) and independent of the size of list.
for insertAtBack(), its O(n) since it depends on the number of elements in the list. It should
traverse till end of list and .
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
This Java program defines a ReverseList class containing a static reverse method that takes an ArrayList and size as parameters. It reverses the order of elements in the list by swapping the first and last elements, second and second to last, and so on. The main method creates a sample list, prints it, calls reverse on the list, and prints the reversed list.
File LinkedList.java Defines a doubly-l.pdf
File: LinkedList.java
/**
* Defines a doubly-linked list class
*/
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 ****/
/**
* Instantiates a new LinkedList with default values
* @postcondition
*/
public LinkedList() {
}
/**
* 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) {
}
/**** ACCESSORS ****/
/**
* Returns the value stored in the first node
* @precondition
* @return the value stored at node first
* @throws NoSuchElementException
*/
public T getFirst() throws NoSuchElementException {
return null;
}
/**
* Returns the value stored in the last node
* @precondition
* @return the value stored in the node last
* @throws NoSuchElementException
*/
public T getLast() throws NoSuchElementException {
return null;
}
/**
* Returns the data stored in the iterator node
* @precondition
* @return the data stored in the iterator node
* @throw NullPointerException
*/
public T getIterator() throws NullPointerException {
return null;
}
/**
* Returns the current length of the LinkedList
* @return the length of the LinkedList from 0 to n
*/
public int getLength() {
return -1;
}
/**
* Returns whether the LinkedList is currently empty
* @return whether the LinkedList is empty
*/
public boolean isEmpty() {
return false;
}
/**
* Returns whether the iterator is offEnd, i.e. null
* @return whether the iterator is null
*/
public boolean offEnd() {
return false;
}
/**** MUTATORS ****/
/**
* Creates a new first element
* @param data the data to insert at the front of the LinkedList
* @postcondition
*/
public void addFirst(T data) {
return;
}
/**
* Creates a new last element
* @param data the data to insert at the end of the LinkedList
* @postcondition
*/
public void addLast(T data) {
return;
}
/**
* Inserts a new element after the iterator
* @param data the data to insert
* @precondition
* @throws NullPointerException
*/
public void addIterator(T data) throws NullPointerException{
return;
}
/**
* removes the element at the front of the LinkedList
* @precondition
* @postcondition
* @throws NoSuchElementException
*/
public void removeFirst() throws NoSuchElementException {
return;
}
/**
* removes the element at the end of the LinkedList
* @precondition
* @postcondition
* @throws NoSuchElementException
*/
public void removeLast() throws NoSuchElementException {
return;
}
/**
* removes the element referenced by the iterator
* @precondition
* @pos.
All programming assignments should include the name, or names, of th.pdf
All programming assignments should include the name, or names, of the
students. This information should be placed in the introductory comments
section. The introductory comments should also contain the purpose of the
program. Clear, concise, commenting is an important skill to develop and
will be part of the grade for each program. Programs should be submitted
via Blackboard as “.cpp” source programs. Each member of a team should
submit a copy of the program.
The purpose of PSA 7 is practice our programming style and techniques on
a fairly simple real world example of an application. PSA7.cpp is a program
that analyzes various aspects of the clients at an animal shelter. Your task
is to fill in the three routines that provide the necessary information to the
main routine. You may not alter the code in main. You must use the
interfaces as defined.
The first two routines are almost trivial and the only thing that is special
about one of them is the need to use a persistent variable.
The third one, shotRecord is a bit challenging. You must determine if each
animal has had the correct shots. These are for Parvovirus, Rabies, and
Bordetella. One confusion factor here is that they could have also received
a shot for Leptospirosis; that is not a required shot. Further complicating
things is the fact that the only thing that is important is that they received
the shot; they may have received their inoculations in differing orders.
Programme it using \"CODE::BLOCK and also use the main function below:
#include
#include
#include
#include
using namespace std;
#define numberSpecies 4
#define numberShots 3
enum species {dog, cat, bird, rabbit};
enum shots {Parvovirus, Rabies, Bordetella, Leptospirosis};
string outString;
struct animal
{
string name;
unsigned int stay;
enum species animalType;
enum shots status[numberShots];
};
int displayAnimal(struct animal *animal)
{
cout << \"Name:\\t\\t\" << animal->name << endl;
cout << \"Species:\\t\";
switch (animal->animalType)
{
case dog:
cout << \"Dog\";
break;
case cat:
cout << \"Cat\";
break;
case bird:
cout << \"Bird\";
break;
case rabbit:
cout << \"Rabbit\";
break;
default:
cout << \"Unknown\";
}
cout << endl;
cout << \"Length of stay: \" << animal->stay << endl << endl;
return 0;
}
double averageStay(struct animal *animal)
{
// Your code goes here.
// Hint you will need to use a type we have not used before.
}
int countPopulation(struct animal census[], enum species kindAnimal, unsigned int k)
{
unsigned int j, animalCount;
// Your code goes here.
return animalCount;
}
bool shotRecord(struct animal *animal)
{
unsigned int temp, m, shot;
temp = 0;
// Your code goes here.
// This is the trickiest one!
return (temp == 3) ? true: false;
}
int main()
{
#define censusSize 6
struct animal census[censusSize];
census[0].animalType = dog;
census[0].name = \"Fred\";
census[0].stay = 13;
census[0].status[0] = Rabies;
census[0].status[1] = Bordetella;
census[0].status[2] = Parvovirus;
census[1].animalType = cat;
census[.
After a (not very successful) trick or treating round, Candice has 1.pdf
After a (not very successful) trick or treating round, Candice has 10 Tootsie rolls and 12
Twizzlers in her pillow case. Her mother asks her to share the loot with her three younger
brothers.
(A) How many different ways can she do this?
(B) How many different ways can she do this after her Mother warns her to give at least one of
each type of candies to each of her brothers?
Solution.
More Related Content
Similar to Part I Write the complete class definition (or server) for Unsorte.pdf
Array list
The document discusses ArrayLists in Java. Key points include:
- ArrayLists allow dynamic resizing as elements are added, with O(1) access time. They support methods for insertion, deletion, and updating elements.
- ArrayLists can be iterated over using a for-each loop or indexed access.
- Common ArrayList methods include add(), get(), contains(), clear(), remove(), and size().
- Iterators can be used to iterate over ArrayLists in a single direction. ListIterators allow bidirectional traversal and modification of elements.
package singlylinkedlist; public class Node { public String valu.pdf
package singlylinkedlist;
public class Node {
public String value;
public Node next;
public Node(String value) {
this.value = value;
}
@Override
public String toString() {
return value;
}
}
SingleyLinkedList.java :
package singlylinkedlist;
import java.io.*;
import java.util.*;
/**
* Defines the interface for a singly-linked list.
*
*/
public interface SinglyLinkedList {
/**
* @return Reference to the first node. If the list is empty, this method
* returns null.
*/
public Node getFirst();
/**
* @return Reference to the last node . If the list is empty, this method
* returns null.
*/
public Node getLast();
/**
* @return Number of nodes in the list
*/
public int size();
/**
* @return true if the list has no nodes; false otherwise
*/
public boolean isEmpty();
/**
* Removes all nodes in the list.
*/
public void clear();
/**
* Inserts a new node with the given value after cursor.
*
* @param cursor
* The node to insert after. Set this to null to insert value as
the
* new first Node.
* @param value
* The value to insert
* @return a reference to the newly inserted Node
*/
public Node insert(Node cursor, String value);
/**
* Inserts a new node with the given value at the "end" of the list.
*
* @param value
* @return a reference to the newly inserted Node
*/
public Node append(String value);
/**
* Removes the node after the specified Node (cursor) from the list.
*
* @param cursor
* A reference to the Node to remove.
*/
public void removeAfter(Node cursor);
/**
* Returns a reference to the first Node containing the key, starting from
the
* given Node.
*
* @param start
* @param key
* @return a reference to the first Node containing the key
*/
public Node find(Node start, String key);
/**
* Prints the values of all the items in a list
*/
public void printWholeList();
}
SinglyLinkedTester.java:
package sbccunittest;
import static java.lang.Math.*;
import static java.lang.System.*;
import static org.apache.commons.lang3.StringUtils.*;
import static org.junit.Assert.*;
import static sbcc.Core.*;
import java.io.*;
import java.lang.reflect.*;
import java.nio.file.*;
import java.util.*;
import java.util.stream.*;
import org.apache.commons.lang3.*;
import org.junit.*;
import org.w3c.dom.ranges.*;
import sbcc.*;
import singlylinkedlist.*;
/**
* 09/16/2021
*
* @author sstrenn
*
*/
public class SinglyLinkedListTester {
public static String newline = System.getProperty("line.separator");
public static int totalScore = 0;
public static int extraCredit = 0;
public static boolean isZeroScore = false;
public static String scorePreamble = "";
@BeforeClass
public static void beforeTesting() {
totalScore = 0;
extraCredit = 0;
}
@AfterClass
public static void afterTesting() {
if (isZeroScore) {
totalScore = 0;
extraCredit = 0;
}
println(scorePreamble + "Estimated score (w/o late penalties, etc.) is:
" + totalScore + " out of 25.");
// If the project follows the naming convention, save the results in a
folder on
// the desktop. (Alex Kohanim)
try {
String directory =
substri.
In this homework- you will write a program modify program you wrote in.pdf
In this homework, you will write a program modify program you wrote in Homework3.
2) Modify the MyList class that you wrote for Programming challenge 1 so the type parameter T
should accept any type that implements the Comparable interface. Test the class in a program
that creates one instance of MyList to store Integers, and another instance to store Strings. Input
two numbers from the user and insert them into the first instance of Modified MyList.
Input name and City and insert the two strings into the second instance of modified MyList class.
Then display the contents of the the two instances.
here is the program to modify
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// part 1 code.
// creating a Number list
MyList<Number> intList = new MyList<>();
// adding the numbers mentioned in the question
intList.add(2);
intList.add(5);
intList.add(-13);
intList.add(11);
intList.add(12);
// creating a Double list, adding double values to it
MyList<Double> doubleList = new MyList<>();
doubleList.add(27.3);
doubleList.add(5.7);
doubleList.add(-23.9);
doubleList.add(1.11);
doubleList.add(5.12);
System.out.println("PART 1");
// printing largest and smallest of both lists
System.out.println("The Integer largest: \n" + intList.largest());
System.out.println("The Integer smallest: \n" + intList.smallest());
System.out.println("The Double largest: \n" + doubleList.largest());
System.out.println("The Double smallest: \n" + doubleList.smallest());
}
}
//MyList class, which is defined outside Generics1 class BUT still within Generics1.java file.
class MyList<T extends Number> {
// defining an array list as storage
ArrayList<T> list;
// constructor initializing list
public MyList() {
// initializing array list
list = new ArrayList<>();
}
// method to add a value to the list
public void add(T value) {
list.add(value);
}
// method to return the largest element on the list
public T largest() {
// assuming list is not empty, taking first value as largest
T max = list.get(0);
for (int i = 1; i < list.size(); i++) {
// comparing element at i with max using doubleValue() of Number class
if (list.get(i).doubleValue() > max.doubleValue()) {
max = list.get(i);
}
}
return max;
}
// method to return the smallest element on the list
public T smallest() {
// assuming list is not empty, taking first value as smallest
T min = list.get(0);
for (int i = 1; i < list.size(); i++) {
// comparing element at i with min using doubleValue() of Number class
if (list.get(i).doubleValue() < min.doubleValue()) {
min = list.get(i);
}
}
return min;
}
// returns the elemnt at a given position
public T get(int index) {
return list.get(index);
}
}
Here is the sample input/outPut
TestCase1:
PART 2
Please enter a number:
30
Please another number:
20
Please enter your name:
John
Please enter your City:
Los Angeles
First number is 30
Second number is 20
Name is: John
City is: Los Angeles
TestCase2:
PART 2
Please enter a number:
.
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 .
Implement the interface you wrote for Lab B (EntryWayListInterface)..pdf
This document describes implementing an EntryWayListInterface using either an array or linked nodes. It provides the interface methods that must be implemented which include insertHead, insertTail, deleteHead, deleteTail, display, contains, isEmpty, and isFull. It also describes creating a driver program to test the implementation by adding and removing elements from the list and checking for elements. A second class is to implement the interface using an AList or LList object instead of an array or linked nodes.
Write a function which return a list of all of the n element subset .pdf
Write a function which return a list of all of the n element subset of a given set
Implement in JAVA Question 3 Write a function that returns a list of all of the n-element subsets
of a given set. For example, if the given set is [1,2,3] and n is 2, then the returned list should
contain [1,2], [1,3], and [2,3]. The order of the elements is not important.
Solution
The program for this problem is as follows:
Comments are included in the program for explaining the steps.
A sample output is attached below the program.
package com.temp;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/**
* Program to find sublists of a list.
* @author Rohit Phatak
*
*/
public class subset {
/**
* This list will contain the resultant sublists.
*/
static List list = new ArrayList<>();
public static void main(String arg[]){
/**
* Input a list comma separated.
*/
System.out.println(\"Enter a list : \");
Scanner scanner = new Scanner(System.in);
String s = scanner.nextLine();
String[] sArr = s.split(\",\");
/**
* Input a value of n.
*/
System.out.println(\"Enter value of n : \");
Integer n = scanner.nextInt();
/**
* Check if value of n is greater than entered list.
*/
if(sArr.length < n){
System.out.println(\"Length of list is less than value of n\");
} else if(sArr.length > 0){
getSubsetList(sArr,n);
System.out.println(\"List is as :\");
/**
* Printing the sublists.
*/
for(String[] str : list){
String printVar = \"\";
for(String temps : str)
printVar+=temps+\",\";
System.out.println(\"[\"+printVar.substring(0, printVar.length()-1)+\"]\");
}
} else {
System.out.println(\"Please enter atleast one element:\");
}
scanner.close();
}
/**
* This method calls the recursive function which is used to obtain the sublists.
* @param sArr
* @param n
* @return
*/
public static List getSubsetList(String[] sArr,Integer n){
List lista = new ArrayList<>();
sublist(sArr, 0, n, new String[n]);
return lista;
}
/**
* This is a recursive function.
* This function will iterate over itself for finding the sublist.
*
* Parameters are as follows:
*
* @param arr -> List entered by the user.
* @param n -> Value of sublist entered by user.
* @param startPosition -> index to start creating the sublist.
* @param result -> resultant sublist
*/
public static void sublist(String[] arr, int startPosition, int n, String[] result){
/**
* Check for the value of n ==0.
* If n==0 break from the recursion.
*/
if (n == 0){
/**
* Add the sublist \'result\' in the list.
*/
list.add(result.clone());
return;
}
/**
* Iterate through for loop starting from startPosition till length of list minus entered value
n.
*/
for (int i = startPosition; i <= arr.length-n; i++){
/**
* Here result is a temporary sublist.
* This for loop adds an element to the temporary sublist in each iteration.
* The element is added from the complete list entered by user.
* Location of element is iTh index.
*/
result[result.length - n] = arr[i];
/**
* After adding the element to the temporary sublist, the sublist an.
import java.util.; public class IteratorDemo {public static voi.pdf
import java.util.*;
public class IteratorDemo {
public static void main(String args[]) {
// Create an array list
ArrayList al = new ArrayList();
// add elements to the array list
al.add(\"C\");
al.add(\"A\");
al.add(\"E\");
al.add(\"B\");
al.add(\"D\");
al.add(\"F\");
// Use iterator to display contents of al
System.out.print(\"Original contents of al: \");
Iterator itr = al.iterator();
while(itr.hasNext()) {
Object element = itr.next();
System.out.print(element + \" \");
}
System.out.println();
// Modify objects being iterated
ListIterator litr = al.listIterator();
while(litr.hasNext()) {
Object element = litr.next();
litr.set(element + \"+\");
}
System.out.print(\"Modified contents of al: \");
itr = al.iterator();
while(itr.hasNext()) {
Object element = itr.next();
System.out.print(element + \" \");
}
System.out.println();
// Now, display the list backwards
System.out.print(\"Modified list backwards: \");
while(litr.hasPrevious()) {
Object element = litr.previous();
System.out.print(element + \" \");
}
System.out.println();
}
}
public class GenericMethodTest {
// generic method printArray
public static < E > void printArray( E[] inputArray ) {
// Display array elements
for(E element : inputArray) {
System.out.printf(\"%s \", element);
}
System.out.println();
}
public static void main(String args[]) {
// Create arrays of Integer, Double and Character
Integer[] intArray = { 1, 2, 3, 4, 5 };
Double[] doubleArray = { 1.1, 2.2, 3.3, 4.4 };
Character[] charArray = { \'H\', \'E\', \'L\', \'L\', \'O\' };
System.out.println(\"Array integerArray contains:\");
printArray(intArray); // pass an Integer array
System.out.println(\"\ Array doubleArray contains:\");
printArray(doubleArray); // pass a Double array
System.out.println(\"\ Array characterArray contains:\");
printArray(charArray); // pass a Character array
}
}
Solution
import java.util.*;
public class IteratorDemo {
public static void main(String args[]) {
// Create an array list
ArrayList al = new ArrayList();
// add elements to the array list
al.add(\"C\");
al.add(\"A\");
al.add(\"E\");
al.add(\"B\");
al.add(\"D\");
al.add(\"F\");
// Use iterator to display contents of al
System.out.print(\"Original contents of al: \");
Iterator itr = al.iterator();
while(itr.hasNext()) {
Object element = itr.next();
System.out.print(element + \" \");
}
System.out.println();
// Modify objects being iterated
ListIterator litr = al.listIterator();
while(litr.hasNext()) {
Object element = litr.next();
litr.set(element + \"+\");
}
System.out.print(\"Modified contents of al: \");
itr = al.iterator();
while(itr.hasNext()) {
Object element = itr.next();
System.out.print(element + \" \");
}
System.out.println();
// Now, display the list backwards
System.out.print(\"Modified list backwards: \");
while(litr.hasPrevious()) {
Object element = litr.previous();
System.out.print(element + \" \");
}
System.out.println();
}
}
public class GenericMethodTest {
// generic method printArray
public static < E > void printArray( E[].
Algo>Stacks
Stacks are a special type of list where insertions and deletions only occur at one end, called the top. There are two main types - static stacks have a fixed size and are implemented as arrays, while dynamic stacks can grow as needed and are implemented as linked lists. Common stack operations include push to insert at the top, pop to remove from the top, and functions to check if the stack is empty or return the top element. Stacks are useful data structures with LIFO (last in, first out) behavior and have various applications like implementing function call stacks in compilers.
I need help with this code working Create another project and add yo.pdf
I need help with this code working Create another project and add your jar file in this project. In
the main method of App class of this second project test your MyArrayList class. It is mandatory
to follow the instructions to get full credit. You need to perform the following actions. 1. Create
five strings, A1",,'B2",,'C3",'D4",'E5" 2. Save these Strings in your MyArrayList 3. Print a
message "Displaying List" 4. Display the list 5. Insert another String in your MyArrayList at
location 2 6. Print a message "Inserting Item" 7. Display the list 8. Remove String at location 0 9.
Print a message "Removing Item" 10. Display the list 11. Print a message "Setting a String" 12.
Set a new String in location 1 13. Display the list 14. Check whether "D4" is present in the list or
not, print an appropriate message 15. Find the index of "E5" in your list, print an appropriate
message 16. Print a message "Emptying List" 17. Empty the list 18. Print the size of the list
These steps check most of your MyArrayList functionality. I will also perform my own checks of
your code while grading. Deliverable: a. Copy the utils.jar file in your project folder. b. Make a
zip file of full project, not the src folder only or java files only. c. Submit the zip file. Grading
Rubric: The project is not submitted as required: 0 points
st.java J MyArrayList.java 2 J App.java 2 J MyFile.java 2 rc >J MyArrayList.java >q&
MyArrayList > get(int) public class MyArrayList implements MyList \{ Object [] obj = new
Object [1]; int size; public int size()\{ return size; \} public object get(int index) if (index <0
index >= size ){// throw new indexo return obj [index]; \} return index; // this should be deleted
after public void add (Object 0 ) \{ //if this test fails there is a space in the array. // it will pass
itself. if ( size == obj. length ){ Object [] obj2 = new 0 bject [obj. length 2]; for(int i=0;i<0bj.
length; i++){ obj2[i]=obj [i] ; \} obj=obj2; \} obj [ size ]=0; size++; \} public void add(int index,
Object o) \{ if(index > size || index <0 ) \{ throw new IndexOut0fBoundsException(index); \} if
(size == obj. length ){ Object [] obj2 = new Object [obj. length 2 ]; for(int i=0;i<0bj. length;
i++){ obj 2[i]=obj[i]; \} obj=obj2; \} if (index i=size;i>= index; i){ nhi [i=nhii1 : Ln 16, Col 56
Spaces: 4 UTF-8 LF \{\} Java
In this lab you will add an interface to the MyUtils project, and implement it in your
MyArrayList class in the MyUtils project. You will test the newly added functionality of your
MyArrayList class in another project. The UML for the Interface is as follows S Description of
methods Following method are self-explanatory: size(), get(int index), add (object o), remove
(int index), and isEmpty). Below is the description of all other methods. void add(int index,
Object o) inserts the given reference of object o at location index, making all entries move down
a spot. void remove (Object o) removes the first occurrence of object o in the list, moving all
entries .
I need help 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.
(Unordered Sets) As explained in this chapter, a set is a collection.pdf
The document describes a class called unorderedSetType that is derived from unorderedArrayListType to represent sets. The class redefines functions like insertAt, insertEnd, and replaceAt to handle sets appropriately by checking for duplicate elements. It also includes set operations like union and intersection. A program is provided to test the unorderedSetType class.
I really need help with the code for this in Java.Set operations u.pdf
I really need help with the code for this in Java.
Set operations using iterators: implement a program that creates the sets below (as ArrayLists of
Integers), and then finds the result of the operations below. You only need a single .java file with
the main routine; you do not have to put each set operation in its own method. Do NOT use the
toArray( ) method; you will only need the add( ), addAll( ), contains( ), iterator( ), isEmpty( ),
and remove( ) methods defined for the ArrayList. Recall that setscannot have duplicate entries; it
is up to you to enforce this! (Note: in Java a Set is an interface, but it can also be a class, as all
interfaces are also classes!) Sets:
U = {1,2,3,4,5,6,7,8,9,10} (universe set)
E = {2,4,6,8,10}
O = {1,3,5,7,9}
A = {3,4,5}
B = {5,6,7}
C = { } (empty set)
Operations: find
A union B
A intersect B
A complement
O minus B
E minus A
A symmetric difference B (the symmetric difference of 2 sets is the elements in either, but not in
their intersection)
Subsets: write a method that takes two sets, determines if the first is a subset of the second, and
returns true or false. Then answer these questions (by writing code): is C a subset of U; is E and
subset of U; and, is A a subset of B?
Solution
//code has been tested on eclipse
import java.util.ArrayList;
public class HelloWorld{
public static boolean isSubset(ArrayList A, ArrayList B) { //method to //check subset
return B.containsAll(A);
}
public static void main(String []args){ //main method
ArrayList U=new ArrayList(); //Arraylist for storing elements of union
U.add(1); U.add(2);U.add(3); U.add(4); U.add(5); U.add(6); U.add(7); U.add(8); U.add(9);
U.add(10);//entering //elements of union set
ArrayList E=new ArrayList(); //Arraylist for storing elements of set E
E.add(2); E.add(4); E.add(6); E.add(8); E.add(10); //entering elements of set E
ArrayList O=new ArrayList(); //Arraylist for storing elements of set O
O.add(1);O.add(3);O.add(5);O.add(7);O.add(9); //entering elements of set O
ArrayList A=new ArrayList(); //Arraylist for storing elements of set A
A.add(3); A.add(4); A.add(5); //entering elements of set A
ArrayList B=new ArrayList(); //Arraylist for storing elements of set B
B.add(5);B.add(6);B.add(7); //entering elements of set B
ArrayList C=new ArrayList(); //Arraylist for storing elements of set C
ArrayList UnionA_B=new ArrayList(); //Arraylist for storing elements of Union of A and B
UnionA_B.addAll(A); //Union operation using Addall
for(Integer x:B) //loop to find union of A and B
{
if(!(A.contains(x)))
UnionA_B.add(x); //add elements of union of A and B
}
System.out.println(\"Union of set A and B \"); //printing elements of union A and B
for(Integer x:UnionA_B)
System.out.println(x+\" \");
ArrayList IntsctA_B=new ArrayList(); //Arraylist for storing elements of //Intersection of A and
B
for(Integer x:A){ //loop to find Intersection of A and B
if(B.contains(x))
IntsctA_B.add(x); //add elements of Intersection of A and B
}
System.out.println(\"Intersection.
In C++Add the function min as an abstract function to the classar.pdf
In C++:
Add the function min as an abstract function to the classarrayListTypeto return the smallest
element of the list.
Also, write the definition of the function min in the classunorderedArrayListTypeand write a
program to test this function.
arrayListType.h
#ifndef H_arrayListType
#define H_arrayListType
class arrayListType
{
public:
bool isEmpty() const;
//Function to determine whether the list is empty
//Postcondition: Returns true if the list is empty;
// otherwise, returns false.
bool isFull() const;
//Function to determine whether the list is full
//Postcondition: Returns true if the list is full;
// otherwise, returns false.
int listSize() const;
//Function to determine the number of elements in
//the list.
//Postcondition: Returns the value of length.
int maxListSize() const;
//Function to determine the maximum size of the list
//Postcondition: Returns the value of maxSize.
void print() const;
//Function to output the elements of the list
//Postcondition: Elements of the list are output on the
// standard output device.
bool isItemAtEqual(int location, int item) const;
//Function to determine whether item is the same as
//the item in the list at the position specified
//by location.
//Postcondition: Returns true if list[location]
// is the same as item; otherwise,
// returns false.
// If location is out of range, an
// appropriate message is displayed.
virtual void insertAt(int location, int insertItem) = 0;
//Function to insert insertItem in the list at the
//position specified by location.
//Note that this is an abstract function.
//Postcondition: Starting at location, the elements of
// the list are shifted down,
// list[location] = insertItem; length++;
// If the list is full or location is out of
// range, an appropriate message is displayed.
virtual void insertEnd(int insertItem) = 0;
//Function to insert insertItem at the end of
//the list. Note that this is an abstract function.
//Postcondition: list[length] = insertItem; and length++;
// If the list is full, an appropriate
// message is displayed.
void removeAt(int location);
//Function to remove the item from the list at the
//position specified by location
//Postcondition: The list element at list[location] is
// removed and length is decremented by 1.
// If location is out of range, an
// appropriate message is displayed.
void retrieveAt(int location, int& retItem) const;
//Function to retrieve the element from the list at the
//position specified by location
//Postcondition: retItem = list[location]
// If location is out of range, an
// appropriate message is displayed.
virtual void replaceAt(int location, int repItem) = 0;
//Function to replace the elements in the list
//at the position specified by location.
//Note that this is an abstract function.
//Postcondition: list[location] = repItem
// If location is out of range, an
// appropriate message is displayed.
void clearList();
//Function to remove all the elements from the list
//After this operation, the size of t.
Create a JAVA Program that traverses through an array recursively- rat.docx
Create a JAVA Program that traverses through an array recursively, rather than with a loop, and prints out each element in the array. Java only, this will be a short program.
Solution
public void dosomethingtoall(List list)
{
//begin recurssion dosomethingtoall(list,0);
}
private void dosomethingtoall(Last list,int index)
{
//break recurssion when to proceed entire list.
if(index>=list.size())
return;
//do what ever you want with the list.
process(list.get(index));
//recursive step.process the next element.
dosomethingtoall(list,index+1);
}
or by using traversal
import java.util.Listiterator;
import java.util.Arraylist;
public class
traverseforwordingusingListiteratorexample
{
public static void main(String args[])
{
//create an array of object list
Arraylist alist=new Arraylist();
//add elements to arraylist object
alist.add(\"1\");
alist.add(\"2\");
alist.add(\"3\");
alist.add(\"4\");
alist.add(\"5\");
//get an object of Listiterator using listiteratot()
Listiterator listiterator=alist.listiterator();
/*traverse arraylist in forward direction using hasNext and next methods of listiterator.hasNEXT Returns true if Listiterator has more elements to traverse in forwrd direction.next methid returns next element in the list*/
Sysytem.out.println(\"traversing arraylist in forward direction using Listiterator\");
while(listiterator.hasNext())
system.out.println(listiterator.next());
}
}
.
ReversePoem.java ---------------------------------- public cl.pdf
ReversePoem.java :-
---------------------------------
public class ReversePoem {
/*This programs has you display a pessimistic poem from a list of phrases*/
// and then reverse the phrases to find another more optimistic poem.
public static void main(String[] args) throws Exception
{
//Queue object
MyQueue queue = new MyQueue<>();
//Stack object
MyStack stack = new MyStack<>();
//String buffer to apppend all Strings
StringBuffer sb = new StringBuffer();
// Create a single String object from the 16 Strings below
String set1 = \"I am part of a lost generation#and I refuse to believe that#\";
sb.append(set1);
String set2 = \"I can change the world#I realize this may be a shock but#\";
sb.append(set2);
String set3 = \"\'Happiness comes from within\'#is a lie, and#\";
sb.append(set3);
String set4 = \"\'Money will make me happy\'#So in 30 years I will tell my children#\";
sb.append(set4);
String set5 = \"they are not the most important thing in my life#\";
sb.append(set5);
String set6 = \"My employer will know that#I have my priorities straight because#\";
sb.append(set6);
String set7 = \"work#is more important than#family#I tell you this#\";
sb.append(set7);
String set8 = \"Once upon a time#Families stayed together#\";
sb.append(set8);
String set9 = \"but this will not be true in my era#\";
sb.append(set9);
String set10 = \"This is a quick fix society#Experts tell me#\";
sb.append(set10);
String set11 = \"30 years from now, I will be celebrating the 10th anniversary of my
divorce#\";
sb.append(set11);
String set12 = \"I do not concede that#I will live in a country of my own making#\";
sb.append(set12);
String set13 = \"In the future#Environmental destruction will be the norm#\";
sb.append(set13);
String set14 = \"No longer can it be said that#My peers and I care about this earth#\";
sb.append(set14);
String set15 = \"It will be evident that#My generation is apathetic and lethargic#\";
sb.append(set15);
String set16 = \"It is foolish to presume that#There is hope#\";
sb.append(set16);
String finalString = sb.toString();
String itmes[] = finalString.split(\"#\");
System.out.println(\"========== Original Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
queue.enqueue(itmes[i]);
System.out.println(itmes[i]);
}
for(int i = 0 ; i < itmes.length;i++){
stack.push(queue.dequeue());
}
System.out.println(\"========== Reverse Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
System.out.println(stack.pop());
}
/* You are given a list of phrases in Strings; the phrases
are separated by pound signs: \'#\':
1. Create a single String object from this list.
2. Then, split the String of phrases into an array of
phrases using the String split method.
3. Display a poem by walking through the array and
displaying each phrase one per line.
4. And, at the same time, place each phrase on a
MyQueue object using only the enqueue method.
5. After all the phrases have been placed on the queue,
transfer the phrases from the MyQueue object to a
MyS.
Implementation The starter code includes List.java. You should not c.pdf
Implementation The starter code includes List.java. You should not change anything in List.java.
Your task will be to create LinkedList.java, make LinkedList use generics and inherit from List,
and complete several methods in LinkedList.java. Create LinkedList.java in IntelliJ. Add a main
method to LinkedList.java containing the following code. Your program will not compile again.
public static void main(String[] args) { LinkedList list = new LinkedList();
System.out.println(list.getHead()); System.out.println(list.getTail()); list.add("first");
list.add("middle"); list.add("last"); System.out.println(list.getHead().value);
System.out.println(list.getTail().value); System.out.println(list); } The first issue is that your
LinkedList class does not have a way of specifying what type of data it should store. You can fix
this using Java Generics. Change the first line of your class to the following: LinkedList .
Confirm that the first line in your main method no longer has an error. On the line that declares
the LinkedList class, add extends List before the bracket that begins the class. The first line in
your class will now have a compile error because LinkedList does not implement the methods
required by the List abstract class. Press Ctrl-i to have IntelliJ insert stubs of these methods.
Ensure that Copy JavaDoc is selected so you get JavaDoc comments which describe the method
requirements, then click OK. Your code should now compile again. Next add fields for the head
and tail. These will be of type Node. Create a getHead method which returns your head field, and
a getTail method which returns your tail field. Run your main method now and you will see that
there is a NullPointerException because the add method does not actually add anything to the
list, so head and tail will always be null. Complete the method boolean add(T value) for which
IntelliJ gave you a stub. You need to create a new node with value to add at the end of the list.
This means you will need to connect it to the old tail and update tail to point to the node you
created. Make sure that you handle the case where the list is empty and both head and tail should
be set to the new node you've created. Note: For the full Map I assignment, add will need to
prevent duplicate values being added to the list and should return true or false based on whether
the value was added or not. For this lab, you can ignore this requirement and simply return true.
Add a toString method to your LinkedList class. It should start at the head of your list and
proceed through all the nodes in a loop, combining the values of each node with a comma
between each and square brackets containing the whole thing. When you run your main method,
the final thing printed should be: [first, middle, last] List.java: /** * Specification for a List
ADT. * @author Shubham Chatterjee * @version 03/07/2019 * @param Type */ public abstract
class List { /** * Appends the specified value to the end of this list. * * @para.
helpInstructionsAdd the function max as an abstract function to .pdf
help
Instructions
Add the function max as an abstract function to the class arrayListType to return the largest
element of the list.
Also, write the definition of the function max in the class unorderedArrayListType and write a
program to test this function.
files:
main.cpp:
//Data: 18 42 78 22 42 5 42 57
arrayListType.h:
#ifndef H_arrayListType
#define H_arrayListType
class arrayListType
{
public:
bool isEmpty() const;
//Function to determine whether the list is empty
//Postcondition: Returns true if the list is empty;
// otherwise, returns false.
bool isFull() const;
//Function to determine whether the list is full
//Postcondition: Returns true if the list is full;
// otherwise, returns false.
int listSize() const;
//Function to determine the number of elements in
//the list.
//Postcondition: Returns the value of length.
int maxListSize() const;
//Function to determine the maximum size of the list
//Postcondition: Returns the value of maxSize.
void print() const;
//Function to output the elements of the list
//Postcondition: Elements of the list are output on the
// standard output device.
bool isItemAtEqual(int location, int item) const;
//Function to determine whether item is the same as
//the item in the list at the position specified
//by location.
//Postcondition: Returns true if list[location]
// is the same as item; otherwise,
// returns false.
// If location is out of range, an
// appropriate message is displayed.
virtual void insertAt(int location, int insertItem) = 0;
//Function to insert insertItem in the list at the
//position specified by location.
//Note that this is an abstract function.
//Postcondition: Starting at location, the elements of
// the list are shifted down,
// list[location] = insertItem; length++;
// If the list is full or location is out of
// range, an appropriate message is displayed.
virtual void insertEnd(int insertItem) = 0;
//Function to insert insertItem at the end of
//the list. Note that this is an abstract function.
//Postcondition: list[length] = insertItem; and length++;
// If the list is full, an appropriate
// message is displayed.
void removeAt(int location);
//Function to remove the item from the list at the
//position specified by location
//Postcondition: The list element at list[location] is
// removed and length is decremented by 1.
// If location is out of range, an
// appropriate message is displayed.
void retrieveAt(int location, int& retItem) const;
//Function to retrieve the element from the list at the
//position specified by location
//Postcondition: retItem = list[location]
// If location is out of range, an
// appropriate message is displayed.
virtual void replaceAt(int location, int repItem) = 0;
//Function to replace the elements in the list
//at the position specified by location.
//Note that this is an abstract function.
//Postcondition: list[location] = repItem
// If location is out of range, an
// appropriate message is displayed.
void clearList();
//Function to remove all th.
Homework 05 - Linked Lists (C++)(1) Implement the concepts of a un.pdf
Homework 05 - Linked Lists (C++)
(1) Implement the concepts of a union, and difference as defined noted in Chapter 1 questions 6,
and 8 using a linked list. You should not use arrays, dynamic arrays or the STL vector or STL
list classes.
You will be linking a series of nodes together to implement a single linked list class. Define a
Node as a struct that holds a character (like they did in the book) and a pointer to another Node:
struct Node {
char data;
Node* next;
};
Then define a LinkedList class which has (at a minimum) these member functions:
LinkedList();
~LinkedList();
bool insertAtFront();
bool insertBeforePosition(int index);
bool insertAtBack();
bool deleteAtFront();
bool deleteBeforePosition(int index);
bool deleteAtBack();
Implement each of these functions to provide the correct functionality. These functions return
true if successful in inserting or deleting, otherwise they return false (indicating the operation
was not successful).
Finally, create an overloaded + operator to handle the Union of two linked lists and an
overloaded - operator to handle the Difference of two linked lists.
Because we are dealing with pointers you should have both a LinkedList Constructor and
Destructor. Remember that you do not directly call a Constructor or Destructor Function. The
Destructor is automatically called when the variable loses scope or the program ends.
Remember, that we are dealing with not just one dynamically allocated Node (with the new
operator), but many, so you will have to start at the head of the list and go until the Node points
to nullptr. Then keep deleting the previous Node pointer until there are no Nodes left to delete.
(2) To verify your set class, write a main function that takes two lines of characters from the
input file input.txt and store each line of characters into two separate linked lists. Then using
these two lists, perform the Union and set Difference of the characters from the file, and print the
results to the console.
(3) Please also complete an asymptotic (Big O) analysis of your insertAtFront() and
insertAtBack() member functions. Place this in a file called analysis.txt.
Solution
Here is the complete code for your question. Please do rate the aswer if you are happy with
program. Please read comments in the program. Also pay special attention to comments in + and
- operators. You WILL NEED to comment out if condition in + if you want all elements in both
lists irrespective of if they duplicates or no. For now implemented to have true behaviour of no
duplicates in union.
check the functions by creating some lists and playing around different fucntions like its done in
main and commented out.
As far as complexity:
for insertAtFront() its O(1) since it does not depend on the size of the list. It just replaces the start
of the list. Hence it is O(1) and independent of the size of list.
for insertAtBack(), its O(n) since it depends on the number of elements in the list. It should
traverse till end of list and .
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
This Java program defines a ReverseList class containing a static reverse method that takes an ArrayList and size as parameters. It reverses the order of elements in the list by swapping the first and last elements, second and second to last, and so on. The main method creates a sample list, prints it, calls reverse on the list, and prints the reversed list.
File LinkedList.java Defines a doubly-l.pdf
File: LinkedList.java
/**
* Defines a doubly-linked list class
*/
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 ****/
/**
* Instantiates a new LinkedList with default values
* @postcondition
*/
public LinkedList() {
}
/**
* 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) {
}
/**** ACCESSORS ****/
/**
* Returns the value stored in the first node
* @precondition
* @return the value stored at node first
* @throws NoSuchElementException
*/
public T getFirst() throws NoSuchElementException {
return null;
}
/**
* Returns the value stored in the last node
* @precondition
* @return the value stored in the node last
* @throws NoSuchElementException
*/
public T getLast() throws NoSuchElementException {
return null;
}
/**
* Returns the data stored in the iterator node
* @precondition
* @return the data stored in the iterator node
* @throw NullPointerException
*/
public T getIterator() throws NullPointerException {
return null;
}
/**
* Returns the current length of the LinkedList
* @return the length of the LinkedList from 0 to n
*/
public int getLength() {
return -1;
}
/**
* Returns whether the LinkedList is currently empty
* @return whether the LinkedList is empty
*/
public boolean isEmpty() {
return false;
}
/**
* Returns whether the iterator is offEnd, i.e. null
* @return whether the iterator is null
*/
public boolean offEnd() {
return false;
}
/**** MUTATORS ****/
/**
* Creates a new first element
* @param data the data to insert at the front of the LinkedList
* @postcondition
*/
public void addFirst(T data) {
return;
}
/**
* Creates a new last element
* @param data the data to insert at the end of the LinkedList
* @postcondition
*/
public void addLast(T data) {
return;
}
/**
* Inserts a new element after the iterator
* @param data the data to insert
* @precondition
* @throws NullPointerException
*/
public void addIterator(T data) throws NullPointerException{
return;
}
/**
* removes the element at the front of the LinkedList
* @precondition
* @postcondition
* @throws NoSuchElementException
*/
public void removeFirst() throws NoSuchElementException {
return;
}
/**
* removes the element at the end of the LinkedList
* @precondition
* @postcondition
* @throws NoSuchElementException
*/
public void removeLast() throws NoSuchElementException {
return;
}
/**
* removes the element referenced by the iterator
* @precondition
* @pos.
Similar to Part I Write the complete class definition (or server) for Unsorte.pdf (20)
package singlylinkedlist; public class Node { public String valu.pdf
package singlylinkedlist; public class Node { public String valu.pdf
In this homework- you will write a program modify program you wrote in.pdf
In this homework- you will write a program modify program you wrote in.pdf
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Labprogram.javaLinkedList.javaimport java.util.NoSuchElementEx.pdf
Implement the interface you wrote for Lab B (EntryWayListInterface)..pdf
Implement the interface you wrote for Lab B (EntryWayListInterface)..pdf
Write a function which return a list of all of the n element subset .pdf
Write a function which return a list of all of the n element subset .pdf
import java.util.; public class IteratorDemo {public static voi.pdf
import java.util.; public class IteratorDemo {public static voi.pdf
I need help with this code working Create another project and add yo.pdf
I need help with this code working Create another project and add yo.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
(Unordered Sets) As explained in this chapter, a set is a collection.pdf
(Unordered Sets) As explained in this chapter, a set is a collection.pdf
I really need help with the code for this in Java.Set operations u.pdf
I really need help with the code for this in Java.Set operations u.pdf
In C++Add the function min as an abstract function to the classar.pdf
In C++Add the function min as an abstract function to the classar.pdf
Create a JAVA Program that traverses through an array recursively- rat.docx
Create a JAVA Program that traverses through an array recursively- rat.docx
ReversePoem.java ---------------------------------- public cl.pdf
ReversePoem.java ---------------------------------- public cl.pdf
Implementation The starter code includes List.java. You should not c.pdf
Implementation The starter code includes List.java. You should not c.pdf
helpInstructionsAdd the function max as an abstract function to .pdf
helpInstructionsAdd the function max as an abstract function to .pdf
Homework 05 - Linked Lists (C++)(1) Implement the concepts of a un.pdf
Homework 05 - Linked Lists (C++)(1) Implement the concepts of a un.pdf
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
ReverseList.javaimport java.util.ArrayList;public class Rever.pdf
More from fashioncollection2
All programming assignments should include the name, or names, of th.pdf
All programming assignments should include the name, or names, of the
students. This information should be placed in the introductory comments
section. The introductory comments should also contain the purpose of the
program. Clear, concise, commenting is an important skill to develop and
will be part of the grade for each program. Programs should be submitted
via Blackboard as “.cpp” source programs. Each member of a team should
submit a copy of the program.
The purpose of PSA 7 is practice our programming style and techniques on
a fairly simple real world example of an application. PSA7.cpp is a program
that analyzes various aspects of the clients at an animal shelter. Your task
is to fill in the three routines that provide the necessary information to the
main routine. You may not alter the code in main. You must use the
interfaces as defined.
The first two routines are almost trivial and the only thing that is special
about one of them is the need to use a persistent variable.
The third one, shotRecord is a bit challenging. You must determine if each
animal has had the correct shots. These are for Parvovirus, Rabies, and
Bordetella. One confusion factor here is that they could have also received
a shot for Leptospirosis; that is not a required shot. Further complicating
things is the fact that the only thing that is important is that they received
the shot; they may have received their inoculations in differing orders.
Programme it using \"CODE::BLOCK and also use the main function below:
#include
#include
#include
#include
using namespace std;
#define numberSpecies 4
#define numberShots 3
enum species {dog, cat, bird, rabbit};
enum shots {Parvovirus, Rabies, Bordetella, Leptospirosis};
string outString;
struct animal
{
string name;
unsigned int stay;
enum species animalType;
enum shots status[numberShots];
};
int displayAnimal(struct animal *animal)
{
cout << \"Name:\\t\\t\" << animal->name << endl;
cout << \"Species:\\t\";
switch (animal->animalType)
{
case dog:
cout << \"Dog\";
break;
case cat:
cout << \"Cat\";
break;
case bird:
cout << \"Bird\";
break;
case rabbit:
cout << \"Rabbit\";
break;
default:
cout << \"Unknown\";
}
cout << endl;
cout << \"Length of stay: \" << animal->stay << endl << endl;
return 0;
}
double averageStay(struct animal *animal)
{
// Your code goes here.
// Hint you will need to use a type we have not used before.
}
int countPopulation(struct animal census[], enum species kindAnimal, unsigned int k)
{
unsigned int j, animalCount;
// Your code goes here.
return animalCount;
}
bool shotRecord(struct animal *animal)
{
unsigned int temp, m, shot;
temp = 0;
// Your code goes here.
// This is the trickiest one!
return (temp == 3) ? true: false;
}
int main()
{
#define censusSize 6
struct animal census[censusSize];
census[0].animalType = dog;
census[0].name = \"Fred\";
census[0].stay = 13;
census[0].status[0] = Rabies;
census[0].status[1] = Bordetella;
census[0].status[2] = Parvovirus;
census[1].animalType = cat;
census[.
After a (not very successful) trick or treating round, Candice has 1.pdf
After a (not very successful) trick or treating round, Candice has 10 Tootsie rolls and 12
Twizzlers in her pillow case. Her mother asks her to share the loot with her three younger
brothers.
(A) How many different ways can she do this?
(B) How many different ways can she do this after her Mother warns her to give at least one of
each type of candies to each of her brothers?
Solution.
Why steroids can cross the cell membraneWhy steroids can cross .pdf
Why steroids can cross the cell membrane?
Why steroids can cross the cell membrane?
Solution
Steroids are organic molecules, found in our body in the form of cholesterol, steroid hormones,
vitamin D and also in the form of medicinal drugs. The steroids are non-polar and are similar to
lipids. These molecules play a very important role in cell membrane stability and also in signal
transduction in the body.
To carry out the different functions in the body, the steroid molecules must enter the cell and
bind to its target receptor and initiate the cascade of cellular response. The cell membrane is
made of phospholipids with polar head groups of lipids on the exterior of cell surface and
towards the cytosol, and the non-polar chains in the middle.
This architecture of the cell membrane allows steroids to cross the cell membrane being
lipophilic. The entry of steroids in the cell might take place with the help of receptors or carrier
proteins..
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.
Write a command in unixlinux to Display all the files whose names e.pdf
Write a command in unix/linux to Display all the files whose names end with lab1 in the
directory /home/dropbox by modification time. You should find all the variations of lab1 file,
such as Lab1, LAB1, laB1, etc.
Solution
- r : stand for recursive, so it will search all files and will not stop after first match
- n: line number
-w : match the word
-e : defines the pattern for which we want to search.
Why is “Profit” a problematic target Please consider in your answer.pdf
Why is “Profit” a problematic target? Please consider in your answer different types of profit, the
possible differences between profit and turnover (=sales) as a measure and also the definitions
and meaning of profit/capital ratio(s).
Solution
\"Profit\" is a problematic target because it includes wide range of emotions and and issues
among respondents i.e. they ranged acceptable profit to profit effect on decision making and
future variability of capitalization. in same way today\'s cash is driven by yesterday;s decision
making on pricing. Profit is the difference between income a business generates and expenses
incurred in business running.
Types of Profit -
1. Gross Profit - Gross profit is difference between all sales of the company and cost of
producing the products for a company. this mainly used by company officials when making
decision about pricing and what material to be used in manufacturing part of business.
2. Net Profit - Net profit subtracts all of the expenses of company from its gross sales. The net
profit is and indicator that how business performing over the time.
3. Net Profit after Interest and Tax - Net profit of a company further reduced when interest and
taxes are deducted from profit.
4. Retained Profit - Retained profit is any profit remaining after the shareholders receive their
dividends.most of the time this funds will reinvested in company.
Differences between profit and turnover -
Turnover is net sales generated by firm while profit is earning of a firm after all expenses have
been charged against net sales.Thus Turnover and Profit is beginning and ending points of the
income statements.
A difference between turnover and profit is that a rising in turnover may be a sign that business
is growing but profit is and indicator of health of business.
The definitions and meaning of profit/capital ratio - Profit capital ratio expressed as percentage,
complements ratio by add a company\'s debt liabilities, or funded debt, to equity to reflect
company\'s total capital. This ratio measures narrow focus to gain a better understanding of
company\'s ability to generate returns from available sources..
Which of the following statements about protists is falsea) There a.pdf
Which of the following statements about protists is false?a) There are protists that resemble fungi
and plants more than they do other protists
Solution
d) All protists are unicellular, microscopic forms of life.
Protists can be unicellular (single-celled) or multicellular (many-celled). Seaweed and kelp are
examples of multicellular, plant-like protists. Kelp can be as large as trees and form a \"forest\"
in the ocean.Plant-like protists include algae, kelp, and seaweed..
Which cable type would be used to connect a router to a switchA. .pdf
Which cable type would be used to connect a router to a switch?
A. Straight-through
B. Crossover
C. Rollover
D. None of the above
Solution
A is correct. Switches and routers have different pinouts; therefore, a straight-through cable
should be used.
B, C, and D are incorrect. B is incorrect because a crossover cable will not work between two
devices of different pinouts. C is incorrect because rollover cables are used between a PC and a
router/switch console port. D is incorrect..
What is the role of abiotic factors in the formation of biomesS.pdf
What is the role of abiotic factors in the formation of biomes?
Solution
A biome is a large terrestrial region characterized by a specific type of climate and dominant
plant life. There are a variety of terrestrial biomes contributing to the biodiversity on the earth.
The living components of a biome include the organisms with life such as plants, animals,
microbes and all living organisms. The non living components or abiotic factors include the
components without life such as water, air, nutrients, heat and solar energy.
For example, biomes like tropical rain forests are found at the equator with hot, moisture air rises
dumping the moisture in the land. These forests have warm temperatures, high humidity and
heavy rain fall daily. The forests are dominated by broad leaf ever green plants and much of
animal life specifically large insects, bats and birds are abundant. Tree climbing animals and
decomposers are heavily populated in tropical rain forests. These forests show great biodiversity
with suitable climatic conditions for survival of all type of animals.
The abiotic factors such as warm temperatures, moist air and rainfall daily keep the vegetation of
the forest growing to provide nutrition for all kinds of organisms live in the biome. The sunlight
helps the plants to synthesize nutrients and to provide them to plant dependent organisms. Thus,
abiotic factors like temperature, sunlight, air and nutrients influence the growth, reproduction
and survival of organisms in the ecological food chain in a biome..
What information needs to be encoded in a loadstorebranchALU inst.pdf
What information needs to be encoded in a load/store/branch/ALU instruction?
Solution
The information needed to be encoded in a load/store/branch/ALU instruction is information
about the operands. Because any instruction stores information about its operands. And performs
that operation on the stored operands. The operands in the registers needs to be encoded..
What are the major terrestrial adaptations of plants1- List the F.pdf
What are the major terrestrial adaptations of plants?
1- List the FOUR major challenges plants encountered as they evolved on to land.
2- Next to each challenge, provide at least ONE (or more) example(s) of an adaptation that meets
that challenge. Refer to Ch 17, Section 17.1 (pp 342-43)
Follow format below:
Challenge 1- Adaptation(s)
Challenge 2- Adaptation(s)
Challenge 3- Adaptation(s)
Challenge 4- Adaptation(s)
Solution
the four major challenges observed in all terrestrial plants include the following.
there is an alternation of generations,
a sporangium formation is seen,
a gametangium giving rise to haploid cells,
Apical meristem tissue which develops from roots and shoots.
challenge 1- Alternation of generations: Ferns reproduce using alteration of generations. it is a
diploid sporophyte and by meiosis produces single-celled haploid spores which are dispersed by
air, wind or floating water. after the spore reaches appropriate conditions, it will germinate and
form prothallus which carries out sexual reproduction forming a sporophyte.
challenge 2- Sporangia in the Seedless Plants: sporophytes of seedless plants are diploid and are
a result of syngamy or fusion of 2 gametes. sporophyte contains sporangia which are a
reproductive sac containing spores. inside the sporangia, diploid sporocytes or mother cells
produce haploids by meiosis thereby reducing chromosome number from 2n to n. These spores
get dispersed in the environment. ferns, mosses are one such
challenge 3- Gametangia in the Seedless Plants: seedless plants produce sperm with flagella and
swim into a moist environment to the archegonia which are the female gametangium. later, the
embryo develops inside as sporophyte. Liverwort plants are one example for such adaptation.
challenge 4- Apical Meristems: by rapid cell division in the tissues, the length of roots and
shoots increases which give rise to apical meristem. it is a small zone of cells present at the shoot
tip or root tip. Elongation of these shoots and roots helps the plants to access additional use
natural resources such as light by shoots and water by roots. Apple seedlings are examples where
apical meristems give rise to new shoots and root growth.
The total lung capacity of a patient is 5.5 liters. Find the patient.pdf
The total lung capacity of a patient is 5.5 liters. Find the patient’s inspiratory reserve volume if
the patient’s vital capacity was 4.2 liters, the tidal volume was 500 ml, and the expiratory reserve
volume was 1.2 liters.
Solution
Answer:
Inspiratory reseve volume (IRV )= VC - (TV + ERV)
VC= Vital capacity
TV= Tidal volume
ERV= Expiratory reseve volume
= 4.2- (0.5 + 1.2)
= 2.5 Liters.
The insatiable demand for everything wireless, video, and Web-enable.pdf
The insatiable demand for everything wireless, video, and Web-enabled everywhere will be the
driving force
behind developments in telecommunications, networking, and computing technologies for the
foreseeable
future. Do you agree or disagree? Why
Solution
There is undoubtedly the insatiable demand for everything wireless is a growth area.
This making is called internet generation since internet has got lots of control over our existence.
All we do, internet has got more to do with it. We converse study, work and learn during internet
so internet has been an essential part of our life. Growth of telecommunications was occurring
far before the development of internet; however internet has assisted in bringing the one form of
telecommunications into more than a few forms. The enlargement of telecommunications and its
fame has lot to do by internet. Internet completes the telecommunication procedure much easier
and earlier. As it attaches a system with another system, Network is in addition a form of
internet, we name it intranets. Internet was developed in 90s and that is the period since when
information technology has been getting expanded in a faster speed.
Internet has been the catalyst for the act and development as well as exactness, growth and fame
of telecommunications, networking and information technologies consequently I think its
praiseworthy to say that as of internet, development of telecommunications, networks and other
information technologies get the speed..
Technology is an ever-growing system that provides advantages and in.pdf
Technology is an ever-growing system that provides advantages and introduces disadvantages
into organizations. Identify an organization that has introduced new or improved technologies to
enhance its information systems. Discuss the technologies that were selected to enhance the
company\'s competitive advantage. Explore some advantages and related disadvantages
introduced through this technology integration.
Answer needs to be 200 - 300 words.
Solution
Health care organizations have had to adapt to many changes in the world around them, from
advances in diagnostic and therapeutic procedures to the emergence of administrative
innovations such as managed care and the invention of new information technologies. The
Internet represents a particularly profound change that will enable or force significant changes in
organizational form and processes—a transformation as profound as any that have gone before.
The Internet\'s capability to empower consumers, support dynamic information exchanges
among organizations, and \"flatten\" organizational hierarchies promises to result in new
operational strategies, business models, service delivery modes, and management mechanisms.
The changes will have such far-reaching implications that health care organizations need to start
preparing now to adopt the advanced Internet applications that are expected to appear in the near
future. Organizations need to evaluate the potential and implications of new Internet
technologies, adapt them to local needs and conditions, minimize the risks associated with new
product and service deployment, and plan to demonstrate the value of their efforts.
This chapter examines challenges to the adoption of Internet-based technologies by health care
organizations. It attempts to identity fundamental impediments to greater use of the Internet that
may be expected to persist for some time. The first section of the chapter provides a context for
the analysis by reviewing the experiences of other industries that have achieved some success in
changing business practices by adopting Internet technologies. The second section discusses in
general terms why more health care organizations should be interested in adopting the Internet:
because it can advance their strategic interests. The third section deals with organizational
barriers that hinder Internet use. The discussion there addresses internal and external factors,
such as policy and technical barriers, that influence and constrain the form and extent of Internet
use, as well as the range of uncertainties that inhibit decision making regarding the Internet. The
last section addresses the importance of organizational leadership..
Suppose that the proportions of blood phenotypes in a particular pop.pdf
Suppose that the proportions of blood phenotypes in a particular population are as follows:
Assuming that the phenotypes of two randomly selected individuals are independent of one
another, what is the probability that both phenotypes are O? (Enter your answer to four decimal
places.)
What is the probability that the phenotypes of two randomly selected individuals match? (Enter
your answer to four decimal places.)A B AB O0.41 0.13 0.02 0.44
Solution.
Select all of the following that are true regarding evolution. Altho.pdf
Select all of the following that are true regarding evolution. Although not all transitional
organsisms have been preserved, scientists have unearthed many, including the tiktaalik.
Evolution is a theory about how life originated Complex human structures did not evolves as a
single functioning unit, but slowly over millions of years, piece by piece. Evolution is a theory
or a well-established and accepted scientific model that is based on extensive experimentation
and observation. Mutations that cause variation originate spontaneously by chance, but natural
selections drives evolution and is not random. Evolution is both observable and testable;
populations have been observed evolving in the laboratory and in the field. Evolution is a theory
about how the diversity of life emerged after life originated. Human traits are too complex to
have originated by random chance. Evolution is not observable or testable. Evolution is just a
theory and therefore does not have much evidence to support it. There are no transitional fossils.
Solution
Following are the true statements regarding Evolution.
Role of involvement in consumer decision-making. Identify the level .pdf
Role of involvement in consumer decision-making. Identify the level of involvement a customer
might use to make a purchase/no purchase decision of a cell phone. Then, discuss which type of
buying behavior is most consistent with that level of involvement.
Solution
Consumer involvement refers to degree of information processing or extent of importance that a
consumer attaches to a product.The degree of involvement has a very significant effect on
consumer behaviour. When more expensive products are to be purchased, the consumer gets
more involved in purchase process but he may not be equally involved in a product which is just
a rupee or two priced.
When consumers decide to buy a product based on the interest and importance of the product to
them, this is defined as involvement level. In other words, it measures how personally, socially
and economically involved the customer is with the product in order to buy it.
Levels of Involvment:
LOW INVOLVEMENT- Low involvement purchases are not really important to consumers,
have little relevance and need very limited information processing.(Example:Tea,
toothbrush,Washing powder.)
SOME INVOLVEMENT- Some involvement purchases are of little bit importance to customers.
It includes some evaluation of alternatives.(Ex: Skin cream,Torch, snacks)
HIGH INVOLVEMENT- High involvement purchases are those which are important to
consumers such as complex, expensive, risky or ego-intensive products & require extensive
information processing.(Ex: Cars, diamond, cell phone)
Therefore, it is evidend from the above analysis that the decision to purchase a cell phone
requires high involvement.
Extensive decision making is most consistent with that level of involvement.
Questionsa What are some of the barriers to understanding an issu.pdf
Questions
a: What are some of the barriers to understanding an issue as complex as Climate Change?
b: Are you surprised by how people have ‘used’ the information about a hiatus?
c: Are arguments establishing global warming sufficient to promote action on climate change or
not?
d: Assuming you were to believe in anthropocentric climate change, using the arguments in this
subject, are you in favour of taxes or cap and trade for addressing climate change? Why or why
not? PLANETOZ BYGRAHAMREADFEARN Global warming has not stopped. People should
understand that the planet is a closed system. As we increase our emissions of greenhouse gases,
the fundamental thermal dynamics tells us we have added heat into the system. Once it\'s
trapped, it can go to a myriad of places-land surface, oceans, ice shelves, ice sheets, glaciers for
example HOSTED BY THE GUARDIAN England explained how the winds help the ocean to
absorb heat into the thermocline-that\'s roughly the area between 100 metres and 300 metres
deep. He says once the trade winds drop which is likely to come within years rather than decades
- then the averaged surface temperatures will rise sharply again. The \'pause\' in global warming
is not even a thing Media outlets across the world have extensively covered England\'s paper.
National Geographic told us the study revealed how the heat had been \"hiding\" in the oceans.
All signs point to an acceleration of human-caused climate change. So why all this talk of a
pause? Over at the ABC, we were told the paper gave an explanation for \"a pause in global
warming\" and that \"over the past 15 years the rate of global warming has slowed - and more
recently almost stalled.\" The IPCC in 2013 pointed out that more than 90% of the world?s extra
heat is being soaked up by the oceans, rather than lingering on the surface. Photograph:
Universal History Archive\'Getty Images On The Conversation, we had \"Global warming stalled
by strong winds driving heat into oceans The idea that global warming has \"paused\" or is
currently chillaxing in a comfy chair with the words \"hiatus\" written on it has been getting a
good run in the media of late. Even though these reports spoke in detail about the complexity of
the research (England feels the coverage generally has been very good), they could inadvertently
cement the idea that global warming has in some way stopped, when it hasn\'t. Much of this is
down to a new study analysing why one single measure of climate change- the temperatures on
the surface averaged out across the entire globe - might not have been rising quite so quickly as
some thought they might. But this is almost unavoidable. You can hardly blame journalists and
commentators for repeating the phrase that \"global warming is in a hiatus\" when the offending
word is in the itle of the scientific paper itself (Recent intensification of wind-driven circulation
in the Pacific and the ongoing warming hiatus But here\'s the thing. There never was a \"paus.
Rainfall Intensity Duration Frequency Graph ear Reture Period torm Du.pdf
Rainfall Intensity Duration Frequency Graph ear Reture Period torm Duration (minutes 3. The
Village of Aurora was never flooded before the Year 2016. Ever since a new development in the
neighboring city, the area started to experience the flood in 2017. An investigation was launched
and found that the new development was the cause of the flood for the downstream area
including the Aurora Village. What measures can be applied to mitigate the flood for the
downstream area?
Solution
The major development project which causes the flooding of the down stream areas are dams,
dams have both advantages and disadvantages in their own way, compared to the disadvantages
the advantages are more when compared in the long run, one of the major problem is flooding of
villages in the down stream areas and a lot of ecosystem is submerged while construction of the
dam, the following measures can be taken to prevent the flooding of areas in the down stream:
1. Design the dam in such a way that there would be minimum impact on the environment and
the population living nearby
2. If the soil is not fertile, then stabilize the soil if not done the erosion takes place
3. Remeandering of rivers is to be done so that they are in their natural course itself
4. Provide more reservouir for storing of water
5. Provide an alarming system for reducing of impact on the surrounding population
6. Provide sufficient number of crest gates to control the flow in case of floods
7. Construct the buildings above the ground level in flood prone areas, so that the houses will not
be damaged
The above measures would be sufficient enough to diminish the effect of flood in a given area..
Quality software project managementHow are tasks, activities, and .pdf
Quality software project management
How are tasks, activities, and phases most typically related to each other with respect to a
project? chapter 1
Solution
Answer :-
Software Project Management :
Tasks :
The during the development phase, everything that will be needed to implement the project is
arranged. Potential suppliers or subcontractors are brought in, a schedule is made, materials and
tools are ordered, instructions are given to the personnel and so forth. The development phase is
complete when implementation is ready to start. All matters must be clear for the parties that will
carry out the implementation
Activitie :
An activity is a major unit of work to be completed in achieving the objectives of a process. An
activity has precise starting and ending dates, incorporates a set of tasks to be completed,
consumes resources, and results in work products. An activity may have a precedence
relationship with other activities. For example, finish-to-start, start-to-start, finish-to-finish .
Phases :
The 5 Phases of a Project :
1) Project Initiation Phase :
A project is formally started, named and defined at a broad level during this phase. Project
sponsors and other important stakeholders due diligently decide whether or not to commit to a
project. Depending on the nature of the project, feasibility studies are conducted. Or, as it may
require, in an IT project – requirement gathering and analysis are performed in this phase. In the
construction industry a project charter is completed in this phase.
2) Project Planning Phase :
A project management plan is developed comprehensively of individual plans for – cost, scope,
duration, quality, communication, risk and resources. Some of the important activities that mark
this phase are -making WBS, development of schedule, milestone charts, GANTT charts,
estimating and reserving resources, planning dates and modes of communication with
stakeholders based on milestones, deadlines and important deliveries. A plan for managing
identified and unidentified risks is determined as this may affect aspects of a project later on.
Risk management planning includes: risk identification and analysis, risk mitigation approaches,
and risk response planning.
3) Project Execution Phase :
A project deliverable is developed and completed, adhering to a mapped-out plan. A lot of tasks
during this phase capture project metrics through tasks like status meetings and project status
updates, other status reports, human resource needs and performance reports. An important phase
as it will help you understand whether your project will be a success or failure.
4) Project Monitoring and Control Phase :
Project Monitoring and Control Phase occurring at the same time as the execution phase, this one
mostly deals with measuring the project performance and progression in accordance to the
project plan. Scope verification and control occur to check and monitor for scope creep, change
control to track and manage changes to proje.
More from fashioncollection2 (20)
All programming assignments should include the name, or names, of th.pdf
All programming assignments should include the name, or names, of th.pdf
After a (not very successful) trick or treating round, Candice has 1.pdf
After a (not very successful) trick or treating round, Candice has 1.pdf
Why steroids can cross the cell membraneWhy steroids can cross .pdf
Why steroids can cross the cell membraneWhy steroids can cross .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
Write a command in unixlinux to Display all the files whose names e.pdf
Write a command in unixlinux to Display all the files whose names e.pdf
Why is “Profit” a problematic target Please consider in your answer.pdf
Why is “Profit” a problematic target Please consider in your answer.pdf
Which of the following statements about protists is falsea) There a.pdf
Which of the following statements about protists is falsea) There a.pdf
Which cable type would be used to connect a router to a switchA. .pdf
Which cable type would be used to connect a router to a switchA. .pdf
What is the role of abiotic factors in the formation of biomesS.pdf
What is the role of abiotic factors in the formation of biomesS.pdf
What information needs to be encoded in a loadstorebranchALU inst.pdf
What information needs to be encoded in a loadstorebranchALU inst.pdf
What are the major terrestrial adaptations of plants1- List the F.pdf
What are the major terrestrial adaptations of plants1- List the F.pdf
The total lung capacity of a patient is 5.5 liters. Find the patient.pdf
The total lung capacity of a patient is 5.5 liters. Find the patient.pdf
The insatiable demand for everything wireless, video, and Web-enable.pdf
The insatiable demand for everything wireless, video, and Web-enable.pdf
Technology is an ever-growing system that provides advantages and in.pdf
Technology is an ever-growing system that provides advantages and in.pdf
Suppose that the proportions of blood phenotypes in a particular pop.pdf
Suppose that the proportions of blood phenotypes in a particular pop.pdf
Select all of the following that are true regarding evolution. Altho.pdf
Select all of the following that are true regarding evolution. Altho.pdf
Role of involvement in consumer decision-making. Identify the level .pdf
Role of involvement in consumer decision-making. Identify the level .pdf
Questionsa What are some of the barriers to understanding an issu.pdf
Questionsa What are some of the barriers to understanding an issu.pdf
Rainfall Intensity Duration Frequency Graph ear Reture Period torm Du.pdf
Rainfall Intensity Duration Frequency Graph ear Reture Period torm Du.pdf
Quality software project managementHow are tasks, activities, and .pdf
Quality software project managementHow are tasks, activities, and .pdf
Recently uploaded
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS Template 2023-2024 by: Irene S. Rueco
How to Make a Field Mandatory in Odoo 17
In Odoo, making a field required can be done through both Python code and XML views. When you set the required attribute to True in Python code, it makes the field required across all views where it's used. Conversely, when you set the required attribute in XML views, it makes the field required only in the context of that particular view.
Community pharmacy- Social and preventive pharmacy UNIT 5
Covered community pharmacy topic of the subject Social and preventive pharmacy for Diploma and Bachelor of pharmacy
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)Academy of Science of South Africa
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.Hindi varnamala | hindi alphabet PPT.pdf
हिंदी वर्णमाला पीपीटी, hindi alphabet PPT presentation, hindi varnamala PPT, Hindi Varnamala pdf, हिंदी स्वर, हिंदी व्यंजन, sikhiye hindi varnmala, dr. mulla adam ali, hindi language and literature, hindi alphabet with drawing, hindi alphabet pdf, hindi varnamala for childrens, hindi language, hindi varnamala practice for kids, https://www.drmullaadamali.com
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama UniversityAkanksha trivedi rama nursing college kanpur.
Natural birth techniques are various type such as/ water birth , alexender method, hypnosis, bradley method, lamaze method etcWhat is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Aberdeen
Main Java[All of the Base Concepts}.docx
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar KanvariaHow to Setup Warehouse & Location in Odoo 17 Inventory
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
ANATOMY AND BIOMECHANICS OF HIP JOINT.pdf
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
Advanced Java[Extra Concepts, Not Difficult].docx
This is part 2 of my Java Learning Journey. This contains Hashing, ArrayList, LinkedList, Date and Time Classes, Calendar Class and more.
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
Recently uploaded (20)
Digital Artefact 1 - Tiny Home Environmental Design
Digital Artefact 1 - Tiny Home Environmental Design
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
RPMS TEMPLATE FOR SCHOOL YEAR 2023-2024 FOR TEACHER 1 TO TEACHER 3
Community pharmacy- Social and preventive pharmacy UNIT 5
Community pharmacy- Social and preventive pharmacy UNIT 5
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
South African Journal of Science: Writing with integrity workshop (2024)
South African Journal of Science: Writing with integrity workshop (2024)
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
What is Digital Literacy? A guest blog from Andy McLaughlin, University of Ab...
Pride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School District
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
How to Setup Warehouse & Location in Odoo 17 Inventory
How to Setup Warehouse & Location in Odoo 17 Inventory
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Executive Directors Chat Leveraging AI for Diversity, Equity, and Inclusion
Part I Write the complete class definition (or server) for Unsorte.pdf
- 1. Part I Write the complete class definition (or server) for UnsortedStringList as described in Chapter 3 of the text. Part II Using UnsortedStringList, create a client program that performs the following tasks. 1. Create a list that can hold up to nine planets. 2. Add planets to the list. 3. Delete the first planet inserted into the list. 4. Check to see if Earth is in the list. If so, print "Earth is in the list", otherwise print "Earth is not in the list". 5. Print the names of all planets in the list. Solution import java.util.*; public class UnsortedStringList { public static void main(String args[]) { //Creation of list ArrayList list = new ArrayList(); //Adding planets to the list list.add("Mercury"); list.add("Venus"); list.add("Earth"); list.add("Mars"); list.add("Jupiter"); list.add("Saturn"); list.add("Urenus"); list.add("Neptune"); list.add("Pluto"); //Delete 1st element added to list list.remove(0); //Check to see if Earth is in the list. if(list.contains("Earth")) { System.out.println("Earth is in the list");
- 2. } else { System.out.println("Earth is not in the list"); } //Print the names of all planets in the list. System.out.println("List : "+list); } }