Link to assignment that I need help with is below httpweb.cse..pdf
•
0 likes•2 views
Link to assignment that I need help with is below: http://web.cse.ohio-state.edu/cse2123/currentsem/closedlabs/ClosedLab01.html Solution import java.util.*; import java.io.*; public class ClosedLab01a { // Method to find index of max element in list private static int findMin(ArrayList list) { int index = 0; double minValue = list.get(0); for (int i = 1; i < list.size(); i++) { if(list.get(i) < minValue) { minValue = list.get(i); index = i; } } return index; } // Method to find index of max element in list private static int findMax(ArrayList list) { int index = 0; double maxValue = list.get(0); for (int i = 1; i < list.size(); i++) { if(list.get(i) > maxValue) { maxValue = list.get(i); index = i; } } return index; } // Method to compute average of a list of values. private static double computeAverage(ArrayList list) { double average = 0; for (double value: list) { average += value; } average = average/list.size(); return average; } public static void main (String[] args) throws IOException { Scanner keyboard = new Scanner(System.in); System.out.print(\"Enter a filename: \"); String fname = keyboard.nextLine(); try { Scanner infile = new Scanner(new File(fname)); ArrayList purchases = new ArrayList(); while(infile.hasNext()) { double purch=infile.nextDouble(); purchases.add(purch); } infile.close(); double average = computeAverage(purchases); System.out.println(\"The average purchase value was \" + average); int maxIndex = findMax(purchases); System.out.println(\"The maximum purchase value is at index (\" + maxIndex + \") and value is \" + purchases.get(maxIndex)); int minIndex = findMin(purchases); System.out.println(\"The minimum purchase value is at index (\" + minIndex + \") and value is \" + purchases.get(minIndex)); } catch (IOException e) { System.out.println(\"Error reading file \"+fname+\" \"+e); } } }.
Report
Share
Report
Share
Download to read offline
![private static double computeAverage(ArrayList list) {
double average = 0;
for (double value: list) {
average += value;
}
average = average/list.size();
return average;
}
public static void main (String[] args) throws IOException {
Scanner keyboard = new Scanner(System.in);
System.out.print("Enter a filename: ");
String fname = keyboard.nextLine();
try {
Scanner infile = new Scanner(new File(fname));
ArrayList purchases = new ArrayList();
while(infile.hasNext()) {
double purch=infile.nextDouble();
purchases.add(purch);
}
infile.close();
double average = computeAverage(purchases);
System.out.println("The average purchase value was " + average);
int maxIndex = findMax(purchases);
System.out.println("The maximum purchase value is at index (" + maxIndex + ") and value is
" + purchases.get(maxIndex));
int minIndex = findMin(purchases);
System.out.println("The minimum purchase value is at index (" + minIndex + ") and value is
" + purchases.get(minIndex));
}
catch (IOException e) {
System.out.println("Error reading file "+fname+" "+e);
}
}
}](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recommended
i am looking for help on the method AddSorted and the method Copy only.pdf
I am in need of homework help please. Thank you!
For this assignment grade you will evaluate the similarities and differences between the AHIMA
code of ethics and other health professionals. Overview: 1. Healthcare Information and
Management Systems Society (HIMSS) https://www.ehra.org/resource-library/ehr-codeconduct
2. American Academy of Professional Coders (AAPC) https://www. aapc.com/aboutus/code-of-
ethics.aspx 3. American Nurses Association (ANA) http://nursingworld.org/codeofethics 4.
American College of Healthcare Executives (ACHE) http://ache.org/ABT_ACHE/code.cfm 5.
National Association for Healthcare Quality (NAHQ) https://nahq.org/about/code-of-ethics To
do: "Number your page from 1 to 5. *Compare the AHIMA code of ethics with the other health
organizations above. "Formulate a closing statement..
Engineering lecture ppt by venay magen
Venay Magen likes the shading red, particularly on Tuesdays. He cherishes to drink bourbon (on all days). He figured out how to drink whisky from his youth companion Zippo, when they went to class together at Mount Temple Comprehensive School. He is best known as the lead vocalist for the band MN3.
lec6.ppt
This document describes the ArrayLinearList class, which implements a linear list using an array. It includes methods for creating empty lists, adding and removing elements, checking sizes, and converting the list to a string. The class uses an array to store elements, and resizes the array when needed to add elements. Methods are provided for common list operations like get, indexOf, and remove.
Implement the ListArray ADT-Implement the following operations.pdf
Implement the ListArray ADT-
*Implement the following operations:
- constructor, assignment operator, destructor
-insert, remove, replace, clear
-isFull, isEmpty
-gotoBeginning, gotoEnd, gotoNext, gotoPrior, getCursor
#ifndef LISTARRAY_H
#define LISTARRAY_H
#include
#include
using namespace std;
#pragma warning( disable : 4290 )
template < typename DataType >
class List
{
public:
static const int MAX_LIST_SIZE = 10; // Default maximum list size
// Constructors
List ( int maxNumber = MAX_LIST_SIZE ); // Default constructor
List ( const List& source ); // Copy constructor
// Overloaded assignment operator
List& operator= ( const List& source );
// Destructor
virtual ~List ();
// List manipulation operations
virtual void insert ( const DataType& newDataItem ) // Insert after cursor
throw ( logic_error );
void remove () throw ( logic_error ); // Remove data item
virtual void replace ( const DataType& newDataItem ) // Replace data item
throw ( logic_error );
void clear (); // Clear list
// List status operations
bool isEmpty () const; // List is empty
bool isFull () const; // List is full
// List iteration operations
void gotoBeginning () // Go to beginning
throw ( logic_error );
void gotoEnd () // Go to end
throw ( logic_error );
bool gotoNext () // Go to next data item
throw ( logic_error );
bool gotoPrior () // Go to prior data item
throw ( logic_error );
DataType getCursor () const
throw ( logic_error ); // Return data item
// Output the list structure -- used in testing/debugging
virtual void showStructure () const;
// In-lab operations
void moveToNth ( int n ) // Move data item to pos. n
throw ( logic_error );
bool find ( const DataType& searchDataItem ) // Find data item
throw ( logic_error );
protected:
// Data members
int maxSize,
size, // Actual number of data item in the list
cursor; // Cursor array index
DataType *dataItems; // Array containing the list data item
};
#endif
Solution
#include \"ListArray.h\" Struct List List ::List(int maxNumber = MAX_LIST_SIZE) {
size = cursor = 0; maxSize = maxNumber; dataItems = new DataType
[maxNumber]; for(int i = 0; i < maxNumber; i++) dataItems[i] = NULL; }
List ::List(const List& source) { maxSize = MAX_LIST_SIZE;
dataItems = new DataType [MAX_LIST_SIZE]; for(int i = 0; i < MAX_LIST_SIZE;
i++) dataItems[i] = source.dataItems[i]; size = source.size; cursor =
source.cursor; } List ::operator= (const List &source) { this -> clear();
for(int i = 0; i < maxSize; i++) dataItems[i] = source.dataItems[i]; //return
source; } List::~List() { delete [] dataItems; } void List_insert(const
DataType &newDataItem) { if(size == 0) dataItems[cursor] = newDataItem;
else { dataItems[cursor + 1] = newDataItem; } size++;
cursor = size - 1; } void List_remove() { dataItems[cursor] = NULL; size--
; if(dataItems[cursor + 1] == NULL) cursor = 0; else
cursor++; } void List_replace(const DataType &newDataItem) { dataItems[cursor]
= newDataItem; } void List_clear() { for(int i = 0; i < size; i++)
dataItems[i] = NULL; size =.
The MyLinkedList class used in Listing 24.6 is a one-way directional .docx
The document describes modifying an existing Node class to create a doubly linked list implementation called TwoWayLinkedList. The Node class is updated to include a previous node reference. TwoWayLinkedList extends an existing abstract list class and implements list iterator methods to traverse the list in both directions. It overrides common list methods like add, remove, and size.
Hi,I have added the methods and main class as per your requirement.pdf
Hi,
I have added the methods and main class as per your requirement. it is working fine now.
Highlighted the code changes.
MyLinkedListTest.java
public class MyLinkedListTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
MyLinkedList list = new MyLinkedList();
list.addFirst(\"AAAAA\");
list.add(\"1\");
list.add(\"2\");
list.add(\"3\");
list.addLast(\"ZZZZZ\");
System.out.println(\"Linked List Elements : \"+list.toString());
System.out.println(\"First element: \"+list.getFirst());
System.out.println(\"Second element: \"+list.getLast());
System.out.println(\"Removed First Element: \"+list.removeFirst());
System.out.println(\"Now Linked List Elements : \"+list.toString());
System.out.println(\"Removed Last Element: \"+list.removeLast());
System.out.println(\"Now Linked List Elements : \"+list.toString());
System.out.println(\"Removed all element: \");
list.removeAll();
System.out.println(\"Now Linked List Elements : \"+list.toString());
}
}
MyLinkedList.java
public class MyLinkedList extends MyAbstractList {
private Node head, tail;
/** Create a default list */
public MyLinkedList() {
}
/** Create a list from an array of objects */
public MyLinkedList(E[] objects) {
super(objects);
}
/** Return the head element in the list */
public E getFirst() {
if (size == 0) {
return null;
}
else {
return (E)head.element;
}
}
/** Return the last element in the list */
public E getLast() {
if (size == 0) {
return null;
}
else {
return (E)tail.element;
}
}
/** Add an element to the beginning of the list */
public void addFirst(E e) {
Node newNode = new Node(e); // Create a new node
newNode.next = head; // link the new node with the head
head = newNode; // head points to the new node
size++; // Increase list size
if (tail == null) // the new node is the only node in list
tail = head;
}
/** Add an element to the end of the list */
public void addLast(E e) {
Node newNode = new Node(e); // Create a new for element e
if (tail == null) {
head = tail = newNode; // The new node is the only node in list
}
else {
tail.next = newNode; // Link the new with the last node
tail = tail.next; // tail now points to the last node
}
size++; // Increase size
}
/** Add a new element at the specified index in this list
* The index of the head element is 0 */
public void add(int index, E e) {
if (index == 0) {
addFirst(e);
}
else if (index >= size) {
addLast(e);
}
else {
Node current = head;
for (int i = 1; i < index; i++) {
current = current.next;
}
Node temp = current.next;
current.next = new Node(e);
(current.next).next = temp;
size++;
}
}
/** Remove the head node and
* return the object that is contained in the removed node. */
public E removeFirst() {
if (size == 0) {
return null;
}
else {
Node temp = head;
head = head.next;
size--;
if (head == null) {
tail = null;
}
return (E)temp.element;
}
}
/** Remove all elements from list */
public void removeAll() {
while(true) {
if (size == 0) {
break;
}
else {
Node temp = head;
head =.
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.
Unit iv(dsc++)
This document discusses various searching and sorting techniques. It begins by describing linear and binary search methods for searching arrays. It then discusses hashing techniques for storing data, including hash tables, hash functions, and methods for resolving collisions like chaining, linear probing, quadratic probing and double hashing. Finally, it covers different sorting algorithms like bubble sort, selection sort, insertion sort, quick sort and merge sort.
Recommended
i am looking for help on the method AddSorted and the method Copy only.pdf
I am in need of homework help please. Thank you!
For this assignment grade you will evaluate the similarities and differences between the AHIMA
code of ethics and other health professionals. Overview: 1. Healthcare Information and
Management Systems Society (HIMSS) https://www.ehra.org/resource-library/ehr-codeconduct
2. American Academy of Professional Coders (AAPC) https://www. aapc.com/aboutus/code-of-
ethics.aspx 3. American Nurses Association (ANA) http://nursingworld.org/codeofethics 4.
American College of Healthcare Executives (ACHE) http://ache.org/ABT_ACHE/code.cfm 5.
National Association for Healthcare Quality (NAHQ) https://nahq.org/about/code-of-ethics To
do: "Number your page from 1 to 5. *Compare the AHIMA code of ethics with the other health
organizations above. "Formulate a closing statement..
Engineering lecture ppt by venay magen
Venay Magen likes the shading red, particularly on Tuesdays. He cherishes to drink bourbon (on all days). He figured out how to drink whisky from his youth companion Zippo, when they went to class together at Mount Temple Comprehensive School. He is best known as the lead vocalist for the band MN3.
lec6.ppt
This document describes the ArrayLinearList class, which implements a linear list using an array. It includes methods for creating empty lists, adding and removing elements, checking sizes, and converting the list to a string. The class uses an array to store elements, and resizes the array when needed to add elements. Methods are provided for common list operations like get, indexOf, and remove.
Implement the ListArray ADT-Implement the following operations.pdf
Implement the ListArray ADT-
*Implement the following operations:
- constructor, assignment operator, destructor
-insert, remove, replace, clear
-isFull, isEmpty
-gotoBeginning, gotoEnd, gotoNext, gotoPrior, getCursor
#ifndef LISTARRAY_H
#define LISTARRAY_H
#include
#include
using namespace std;
#pragma warning( disable : 4290 )
template < typename DataType >
class List
{
public:
static const int MAX_LIST_SIZE = 10; // Default maximum list size
// Constructors
List ( int maxNumber = MAX_LIST_SIZE ); // Default constructor
List ( const List& source ); // Copy constructor
// Overloaded assignment operator
List& operator= ( const List& source );
// Destructor
virtual ~List ();
// List manipulation operations
virtual void insert ( const DataType& newDataItem ) // Insert after cursor
throw ( logic_error );
void remove () throw ( logic_error ); // Remove data item
virtual void replace ( const DataType& newDataItem ) // Replace data item
throw ( logic_error );
void clear (); // Clear list
// List status operations
bool isEmpty () const; // List is empty
bool isFull () const; // List is full
// List iteration operations
void gotoBeginning () // Go to beginning
throw ( logic_error );
void gotoEnd () // Go to end
throw ( logic_error );
bool gotoNext () // Go to next data item
throw ( logic_error );
bool gotoPrior () // Go to prior data item
throw ( logic_error );
DataType getCursor () const
throw ( logic_error ); // Return data item
// Output the list structure -- used in testing/debugging
virtual void showStructure () const;
// In-lab operations
void moveToNth ( int n ) // Move data item to pos. n
throw ( logic_error );
bool find ( const DataType& searchDataItem ) // Find data item
throw ( logic_error );
protected:
// Data members
int maxSize,
size, // Actual number of data item in the list
cursor; // Cursor array index
DataType *dataItems; // Array containing the list data item
};
#endif
Solution
#include \"ListArray.h\" Struct List List ::List(int maxNumber = MAX_LIST_SIZE) {
size = cursor = 0; maxSize = maxNumber; dataItems = new DataType
[maxNumber]; for(int i = 0; i < maxNumber; i++) dataItems[i] = NULL; }
List ::List(const List& source) { maxSize = MAX_LIST_SIZE;
dataItems = new DataType [MAX_LIST_SIZE]; for(int i = 0; i < MAX_LIST_SIZE;
i++) dataItems[i] = source.dataItems[i]; size = source.size; cursor =
source.cursor; } List ::operator= (const List &source) { this -> clear();
for(int i = 0; i < maxSize; i++) dataItems[i] = source.dataItems[i]; //return
source; } List::~List() { delete [] dataItems; } void List_insert(const
DataType &newDataItem) { if(size == 0) dataItems[cursor] = newDataItem;
else { dataItems[cursor + 1] = newDataItem; } size++;
cursor = size - 1; } void List_remove() { dataItems[cursor] = NULL; size--
; if(dataItems[cursor + 1] == NULL) cursor = 0; else
cursor++; } void List_replace(const DataType &newDataItem) { dataItems[cursor]
= newDataItem; } void List_clear() { for(int i = 0; i < size; i++)
dataItems[i] = NULL; size =.
The MyLinkedList class used in Listing 24.6 is a one-way directional .docx
The document describes modifying an existing Node class to create a doubly linked list implementation called TwoWayLinkedList. The Node class is updated to include a previous node reference. TwoWayLinkedList extends an existing abstract list class and implements list iterator methods to traverse the list in both directions. It overrides common list methods like add, remove, and size.
Hi,I have added the methods and main class as per your requirement.pdf
Hi,
I have added the methods and main class as per your requirement. it is working fine now.
Highlighted the code changes.
MyLinkedListTest.java
public class MyLinkedListTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
MyLinkedList list = new MyLinkedList();
list.addFirst(\"AAAAA\");
list.add(\"1\");
list.add(\"2\");
list.add(\"3\");
list.addLast(\"ZZZZZ\");
System.out.println(\"Linked List Elements : \"+list.toString());
System.out.println(\"First element: \"+list.getFirst());
System.out.println(\"Second element: \"+list.getLast());
System.out.println(\"Removed First Element: \"+list.removeFirst());
System.out.println(\"Now Linked List Elements : \"+list.toString());
System.out.println(\"Removed Last Element: \"+list.removeLast());
System.out.println(\"Now Linked List Elements : \"+list.toString());
System.out.println(\"Removed all element: \");
list.removeAll();
System.out.println(\"Now Linked List Elements : \"+list.toString());
}
}
MyLinkedList.java
public class MyLinkedList extends MyAbstractList {
private Node head, tail;
/** Create a default list */
public MyLinkedList() {
}
/** Create a list from an array of objects */
public MyLinkedList(E[] objects) {
super(objects);
}
/** Return the head element in the list */
public E getFirst() {
if (size == 0) {
return null;
}
else {
return (E)head.element;
}
}
/** Return the last element in the list */
public E getLast() {
if (size == 0) {
return null;
}
else {
return (E)tail.element;
}
}
/** Add an element to the beginning of the list */
public void addFirst(E e) {
Node newNode = new Node(e); // Create a new node
newNode.next = head; // link the new node with the head
head = newNode; // head points to the new node
size++; // Increase list size
if (tail == null) // the new node is the only node in list
tail = head;
}
/** Add an element to the end of the list */
public void addLast(E e) {
Node newNode = new Node(e); // Create a new for element e
if (tail == null) {
head = tail = newNode; // The new node is the only node in list
}
else {
tail.next = newNode; // Link the new with the last node
tail = tail.next; // tail now points to the last node
}
size++; // Increase size
}
/** Add a new element at the specified index in this list
* The index of the head element is 0 */
public void add(int index, E e) {
if (index == 0) {
addFirst(e);
}
else if (index >= size) {
addLast(e);
}
else {
Node current = head;
for (int i = 1; i < index; i++) {
current = current.next;
}
Node temp = current.next;
current.next = new Node(e);
(current.next).next = temp;
size++;
}
}
/** Remove the head node and
* return the object that is contained in the removed node. */
public E removeFirst() {
if (size == 0) {
return null;
}
else {
Node temp = head;
head = head.next;
size--;
if (head == null) {
tail = null;
}
return (E)temp.element;
}
}
/** Remove all elements from list */
public void removeAll() {
while(true) {
if (size == 0) {
break;
}
else {
Node temp = head;
head =.
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.
Unit iv(dsc++)
This document discusses various searching and sorting techniques. It begins by describing linear and binary search methods for searching arrays. It then discusses hashing techniques for storing data, including hash tables, hash functions, and methods for resolving collisions like chaining, linear probing, quadratic probing and double hashing. Finally, it covers different sorting algorithms like bubble sort, selection sort, insertion sort, quick sort and merge sort.
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] .
Lecture 18Dynamic Data Structures and Generics (II).docx
Lecture 18
Dynamic Data Structures and Generics (II)
*
*
Class ArrayListObject of an ArrayList can be used to store an unlimited number of objects.
*
Methods of ArrayList (I)
*
java.util.ArrayList
+ArrayList()
+add(o: Object) : void
+add(index: int, o: Object) : void
+clear(): void
+contains(o: Object): boolean
+get(index: int) : Object
+indexOf(o: Object) : int
+isEmpty(): boolean
+lastIndexOf(o: Object) : int
+remove(o: Object): boolean
+size(): int
+remove(index: int) : Object
+set(index: int, o: Object) : Object
Appends a new element o at the end of this list.
Adds a new element o at the specified index in this list.
Removes all the elements from this list.
Returns true if this list contains the element o.
Returns the element from this list at the specified index.
Returns the index of the first matching element in this list.
Returns true if this list contains no elements.
Returns the index of the last matching element in this list.
Removes the element o from this list.
Returns the number of elements in this list.
Removes the element at the specified index.
Sets the element at the specified index.
Creates an empty list.
Methods of ArrayList (II) Array is used to implement the methodsMethods get(int index) and set(int index, Object o) for accessing and modifying an element through an index and the add(Object o) for adding an element at the end of the list are efficient. Why?Methods add(int index, Object o) and remove(int index) are inefficient because it requires shifting potentially a large number of elements.
*
Linked Data StructureTo improve efficiency for adding and removing an element anywhere in a list.It containsCollection of objectsEach object contains data and a reference to another object in the collection
*
Linked ListA dynamic data structureA linked list consists of nodes. Each node contains an elementa link: linked to its next neighbor. Example: take notes in the class!
*
Linked List
*
ListNodes
ListNodes in Linked List
public class ListNode { // fill the comments
private String data; //
private ListNode link; //
/** */
public ListNode () {
link = null; //
data = null; //
}
/** */
public ListNode (String newData, ListNode linkValue) {
data = newData;
link = linkValue;
}
*
ListNodes in Linked List (cont’d)
/** */
public void setData (String newData) {
data = newData;
}
/** */
public String getData () {
return data;
...
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:
.
Selection sort
This document describes the selection sort algorithm. It works by iterating through an array, finding the maximum value, and swapping it with the current element to put it in the correct sorted position. This process is repeated, each time searching a smaller subarray, until the entire array is sorted from largest to smallest. Pseudocode is provided to demonstrate how selection sort iterates through the array, finds the max, and swaps elements to sort the list.
In this assignment you will implement insert() method for a singly l.pdf
In this assignment you will implement insert() method for a singly linked Link list. The code
MyLinkedlist.java is given , it uses generic type as the linked list can be created with any object
type. Some methods like add() and toString() are already implemented. The MyLinkedList class
has a private nested class called Node.
The objective of this assignment is to implement the insert() method that takes two inputs an
element of generic type to be inserted and an index (value of integer type) at which it should be
inserted. For this assignment we will assume the first element has the index 0. if the given index
is less than zero do nothing but if it is greater than the size of the list, insert the element at the
end of the list. if the index is between 0 and size , insert it in the appropriate location. You insert
code should correctly update the theSize data member of the linked list. Return type for insert()
method is boolean (true or false) depending on whether the insertion was successful or not. Use
the following method header.
}
Main.java
//add necessary libraries
public class Main
{
//add your function here
public static void main (String [] args)
{
}
}
MyLinkedList.java
public class MyLinkedList {
// A private nested Node class
private static class Node{
public AnyType data; // Data members are public, this is fine as the Node class itself is
private
public Node next;
public Node(AnyType d, Node n)
{
data = d;
next=n;
}
@Override
public String toString() {
return data.toString();
}
}
// Data Members
private Node head; // A node pointer to the first item in the List
private int theSize; // a integer variable to hold the size of the List
public MyLinkedList() {
doClear();
}
public void clear() {
doClear();
}
private void doClear() {
head = null;
theSize =0 ;
}
// An add method that will always add at the beginning of the List
public boolean add(AnyType x) {
if(head == null) // List is empty
{
head = new Node(x, null);
theSize++;
return true;
}
else // List has at least one item lets get to the end of it
{
Node newnode = new Node(x, head);
head = newnode;
theSize++;
return true;
}
}
@Override
public String toString() {
// This to String method will print the List from head to the end.
String theList = "";
if(head==null)
return theList;
Node cur = head;
while(cur.next!=null) {
theList = theList + cur.toString() + " ";
cur= cur.next;
}
return theList + cur.toString();
}
public int getTheSize() {
return theSize;
}
}
/*****************************************************************************
*
*
* SOLUTION CODE BELOW THIS HEADER
*
*****************************************************************************/
/*****************************************************************************
*
*
* SOLUTION CODE ABOVE THIS HEADER
*
*****************************************************************************/
}
Current file: Main.java Load default template... //add necessary Libraries public class Main \{
//add your function here public static vo.
Why following sort does not work (It does not sort last 2 - 3 numbe.pdf
Why following sort does not work? (It does not sort last 2 - 3 numbers)
//Sort order
class SortNumbListener implements ActionListener
{
@Override
public void actionPerformed(ActionEvent e)
{
Collections.sort(list);
for(int i = 0; i < list.size(); i++)
{
textfield2.setText(list.toString());
}
System.out.print(list + \"\ \");
}
}
Solution
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import javax.swing.JTextField;
public class SorAction {
public JTextField textfield2;
public List list;
public SorAction() {
// TODO Auto-generated constructor stub
textfield2 = new JTextField();
list = new ArrayList();
list.add(20);
list.add(12);
list.add(32);
list.add(3);
new SortNumbListener().actionPerformed(new ActionEvent(\"\", 0, null));
}
public static void main(String[] args) {
try {
new SorAction();
} catch (Exception e) {
// TODO: handle exception
e.printStackTrace();
}
}
class SortNumbListener implements ActionListener {
@Override
public void actionPerformed(ActionEvent e) {
Collections.sort(list);
textfield2.setText(list.toString());
System.out.print(list + \"\ \");
}
}
}
OUTPUT:
[3, 12, 20, 32]
NOTE: please check the above example, sorting fine, but what is the need of loop,
if you want to add the text to textbox use setText() method of textfield.
Which XXX condition generates the following output Not foun.pdf
Which XXX condition generates the following output? Not found
#include <stdio.h> int BinarySearch(int numberList[], int element, int lowVal, int highVal) { int
midVal; if (XXX) { midVal = (highVal + lowVal) / 2; if (numberList[midVal] == element) { return
midVal; } else if (numberList[midVal] > element) { return BinarySearch(numberList, element,
lowVal, midVal - 1); } else { return BinarySearch(numberList, element, midVal + 1, highVal); } }
else { return -1; } } int main(void) { int size = 10; int numberList[size]; int element = 20; int
matchPos; for (int i = 0; i < size; ++i) { numberList[i] = i; } matchPos = BinarySearch(numberList,
element, 0, size - 1); if (matchPos >= 0) { printf("Found at position %d.n", matchPos); } else {
printf("Not found.n"); } return 0; }
options:
lowVal >= highVal
lowVal == highVal
lowVal <= highVal
lowVal + highVal == 0.
Java ArrayList Tutorial | Edureka
( ** Java Certification Training: https://www.edureka.co/java-j2ee-soa-training ** )
This Edureka tutorial on “Java ArrayList” (Java blog series: https://goo.gl/osrGrS) will give you a brief insight about ArrayList in Java and its various constructors and methods along with an example. Through this tutorial, you will learn the following topics:
Collections Framework
Hierarchy of ArrayList
What is ArrayList
Internal Working of ArrayList
Constructors of ArrayList
Constructors Example
ArrayList Methods
Methods Example and Demo
Advantages of ArrayList over Arrays
Check out our Java Tutorial blog series: https://goo.gl/osrGrS
Check out our complete Youtube playlist here: https://goo.gl/CRbgFann
Follow us to never miss an update in the future.
Instagram: https://www.instagram.com/edureka_learning/
Facebook: https://www.facebook.com/edurekaIN/
Twitter: https://twitter.com/edurekain
LinkedIn: https://www.linkedin.com/company/edureka
week4_srcArrayMethods.javaweek4_srcArrayMethods.javapackage ed.docx
week4_src/ArrayMethods.javaweek4_src/ArrayMethods.javapackage edu.drexel.ct290;
publicclassArrayMethods{
/**
* Pass and array to a method that will search through it for a given value.
*
* @param elementToFind: This is the item we want to find in the array.
* @param stringArray: This is the array to search through.
* @return Returns: The index of the element, or -1 if not found.
*/
publicint findElement(String elementToFind,String[] stringArray ){
int index =-1;
for(int i=0; i<stringArray.length; i++){
if( elementToFind.equals(stringArray[i])){
// If the element is found, set index
index = i;
}
}
return index;
}
/**
* Replace a value in an array.
*
* @param indexToReplace: The index where the new value should be written.
* @param newValue: The new value.
* @param stringArray: Change a value in this array.
* @return True if the given index is valid
*/
publicboolean replace(int indexToReplace,String newValue,String[] stringArray ){
boolean replaced =false;
// Use the if condition to make sure the given index is valid
if( indexToReplace >0&& indexToReplace < stringArray.length ){
stringArray[indexToReplace]= newValue;
replaced =true;
}
return replaced;
}
/**
* Insert a value into the array. From the insertion point on, the
* data needs to be copied down one space to make room for the new
* element indices .
*
* @param index: The index where the new element should be inserted
* @param element: The element to insert in the array
* @param array: The array to insert into
* @param indicesUsed: the number of elements in the array already used
* @return the array with the new value inserted
*/
publicString[] insert(int index,String element,String[] array,int indicesUsed){
// First, check that there is enough room in the array for
// another element. The parameter indicesUsed indicates how
// many elements of the array are already filled.
String[] newArray = array;
if( indicesUsed == array.length ){
newArray = makeBiggerArray(array);
}
// Now that we know there is enough room, move the
// elements down one spot in the array until we get to the
// insertion point. Make sure the element at the insertion
// point gets moved too.
int indexToMove = indicesUsed;
while( indexToMove >= index ){
newArray[indexToMove+1]= newArray[indexToMove];
indexToMove--;
}
// Set the given index to the new element
newArray[index]= element;
// Return the new array
return newArray;
}
/**
* Since arrays are fixed size, if you run out of room, the
* only options is to create a new bigger array, then copy
* the old data over.
* @param oldArray: The old data to copy into the new array
* @return The new bigger array
*/
publicString[] makeBiggerArray(String[] oldArray){
// Make the new array twice the size of the old one.
int newArraySize .
I only need help with four methods in the EmployeeManager class the .pdf
I only need help with four methods in the EmployeeManager class the methods are addRequest,
viewNextRequest, grantNextRequest, and outputRequests. I posted all of the other uml for
refernce on items that could be called.
UML DIAGRAM FOR AND DISCUSSION FOR EmptyListException
EmptyListException extends RuntimeException
<>EmptyListException( )
<>EmptyListException(name : String)
Constructors
The constructor that takes a String as an argument calls upon the super class constructor with that
String concatenated with “ is Empty”. The constructor that takes no argument calls upon the
other constructor with the argument of “List”.
This class should belong to the exceptions package.
UML DIAGRAM FOR AND DISCUSSION FOR ListNode
ListNode>
data : E
nextNode: ListNode
<>ListNode(d : E)
<>ListNode(d : E, node : ListNode)
+ setData(d : E)
+getData() : E
+setNext(next : ListNode)
+getNext() : ListNode
Notes on ListNode
ListNode(d : E) sets the nextNode to null, the rest of the implementation of the ListNode class is
self-explanatory as discussed in class
UML DIAGRAM FOR AND DISCUSSION FOR LinkedList
LinkedList>
firstNode : ListNode
lastNode : ListNode
numElements : int
name : String
<>LinkedList()
<>LinkedList(name : String)
+ insertAtFront(item : E)
+ insertAtBack(item : E)
+ removeFromFront() : E throws EmptyListException
+ removeFromBack() : E throws EmptyListException
+ removeItem(index : int) : E throws IndexOutOfBoundsException
+ getItem(index : int) : E throws IndexOutOfBoundsException
+ setItem(index : int, item : E) throws IndexOutOfBoundsException
+ findAndRemove(item : E) : Boolean
+ findItem(item E) : int
+ lengthIs() : int
+ clear()
+ toString()
+ isEmpty() : Boolean
+ sort() throws EmptyListException
Notes on LinkedList
Constructors
Both constructors set firstNode and lastNode to null and numElements to 0. The constructor that
takes a String sets the name data member to the String that is passed
insertAtFront(E)
Inserts the passed item to the front of the list
void insertAtBack(E)
Inserts the passed item in the back of the list
void removeFromFront()
Removes the first item in the list, and returns it. If the list is empty throws a new
EmptyListException with the message: “(Name of list) is Empty”
removeFromBack()
Removes the last item in the list, and returns it. If the list is empty throws a new
EmptyListException with the message: “(Name of list) is Empty”
removeItem(int)
Removes the element from the list at the given index. If that index does not exist within the
LinkedList an IndexOutOfBoundsException is thrown with the message: “(Name of List) Index
out of Range”. Returns the item removed.
getItem(int)
Returns the element at the given index. If that index does not exist within the LinkedList an
IndexOutOfBoundsException is thrown with the message: “(Name of List) Index out of Range”.
public setItem(int index, E item)
Attempts to place the passed item into the given index. If that index does not exist within the
LinkedList an IndexOutOfBound.
(Sort ArrayList) Write the following method that sorts an ArrayList.pdf
(Sort ArrayList) Write the following method that sorts an ArrayList: public static >
void sort(ArrayList list
JAVA
Solution
import java.util.ArrayList;
/**
* @author
*
*/
public class GenericSort {
/**
* method to sort the list
*
* @param list
*/
public static > void sort(ArrayList list) {
Object currentMax;
int currentMaxIndex;
for (int i = list.size() - 1; i >= 1; i--) {
// Find the maximum in the list[0..i]
currentMax = list.get(i);
currentMaxIndex = i;
for (int j = i - 1; j >= 0; j--) {
if (((Comparable) currentMax).compareTo(list.get(j)) < 0) {
currentMax = list.get(j);
currentMaxIndex = j;
}
}
// Swap list[i] with list[currentMaxIndex] if necessary;
if (currentMaxIndex != i) {
list.set(currentMaxIndex, list.get(i));
list.set(i, (E) currentMax);
}
}
}
/**
* @param args
*/
public static void main(String[] args) {
Integer[] intArray = { new Integer(2), new Integer(4), new Integer(3) };
// Create a String List
ArrayList stringList = new ArrayList();
stringList.add(\"Srinivas\");
stringList.add(\"Pavan\");
stringList.add(\"Kishore\");
stringList.add(\"Rajesh\");
stringList.add(\"Charkri\");
// Create a int List
ArrayList intList = new ArrayList();
intList.add(20);
intList.add(30);
intList.add(10);
intList.add(40);
intList.add(90);
intList.add(50);
System.out.println(\"Before sorting :\");
System.out.println(stringList);
System.out.println(intList);
// Sort the arrays
sort(stringList);
sort(intList);
System.out.println(\"After sorting :\");
System.out.println(stringList);
System.out.println(intList);
}
}
OUTPUT:
Before sorting :
[Srinivas, Pavan, Kishore, Rajesh, Charkri]
[20, 30, 10, 40, 90, 50]
After sorting :
[Charkri, Kishore, Pavan, Rajesh, Srinivas]
[10, 20, 30, 40, 50, 90].
Class DiagramIn the Assignment #10, you are given three files Ass.pdf
Class Diagram:
In the Assignment #10, you are given three files Assignment10.java, LinkedList.java, and
ListIterator.java. You will need to add additional methods in the LinkedList class in the
LinkedList.java file. The LinkedList will be tested using strings only.
Specifically, the following methods must be implemented in the LinkedList class:
(You should utilize listIterator() method already defined in the LinkedList class to obtain its
LinkedListIterator object, and use the methods in the LinkedListIterator class to traverse from
the first element to the last element of the linked list to define the following methods.)
1.
public String toString()
The toString method should concatenate strings in the linked list, and return a string of the
following format:
{ Apple Banana Melon Orange }
Thus it starts with \"{\" and ends with \"}\", and there is a space between strings and \"{\" or
\"}\". If the list is empty, it returns \"{ }\" with a space in between.
2.
public boolean isEmpty()
The isEmpty method returns true of the linked list is empty, false otherwise.
3.
public void addElement(Object element)
The addElement adds the parameter element at the parameter in the linked list in alphabetical
order. For instance, if the linked list contains {Apple, Banana, Grape}, and a user tries to add
\"Carrot\", then it should be added as:
{Apple, Banana, Carrot, Grape}.
4.
public Object removeElement(int index)
The removeElement removes the string (Object) at the parameter index and returns it. Note that
this index starts with 0 just like array indices. For instance, if the linked list contains {Apple,
Banana, Carrot, Grape} and the parameter index is 3, then \"Grape\" should be remove. If the
parameter index is larger or smaller than the existing indices, it should throw an object of the
IndexOutOfBoundsException class (and the content of the linked list should remain unchanged).
5.
public Object getElement(int index)
The getElement searches the string (Object) at the parameter index and returns it. Note that this
index starts with 0 just like array indices. For instance, if the linked list contains {Apple, Banana,
Carrot, Grape} and the parameter index is 3, then \"Grape\" will be returned. If the parameter
index is larger or smaller than the existing indices, it should throw an object of the
IndexOutOfBoundsException class (and the content of the linked list should remain unchanged).
6.
public void searchAndReplace(Object oldString, Object newString)
The searchAndReplace method searches all occurrences of the first parameter string (object) in
the list, and replaces them with the second parameter string (object). If the parameter string does
not exist in the linked list, then the linked list content will not change.
7.
public int indexOfLast(Object searchString)
The indexOfLast searches the parameter string (object) with the largest index, and returns its
index. If the parameter string does not exist in the linked list, then it should return -1.
For i.
Aj unit2 notesjavadatastructures
- The document discusses various Java data structures including lists, arrays, stacks, queues, linked lists, binary trees, and binary search trees.
- It provides code examples for implementing a custom list using arrays, as well as examples for common list operations like adding, accessing, and removing elements.
- Additional code examples demonstrate binary tree traversal methods like inorder, preorder, and postorder traversals, as well as methods for inserting nodes and searching for nodes in a binary search tree.
Android Database Tutorial
Storing data is a basic and very common need in mobile apps. The Android application framework provides several storage options, one of which is SQLite databases.
In this tutorial you will see a simple Android database example. The example is based on the Android ListView Tutorial and the Android AsyncTask Tutorial, however these tutorials are not mandatory for the purpose of understanding the principles of proper Android database usage.
Everything needs to be according to the instructions- thank you! SUPPO.pdf
Everything needs to be according to the instructions, thank you!
SUPPORTING CODE:
MyList.java
/**
This interface specifies the basic operations of any list-like object.
This interface contains a variation of the methods of the
standard java.util.List interface.
*/
public interface MyList {
/**
Adds an element at the end of the list.
*/
public void addToEnd(Object o);
/**
Inserts an element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void insertAt(int index, Object o);
/**
Removes the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void removeAt(int index);
/**
Returns the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public Object getAt(int index);
/**
Returns the size of the list.
@return the number of elements in the list
*/
public int getSize();
/**
Returns a list iterator for this list.
@return a list iterator for this list
*/
public MyListIterator getIterator();
}
MyListIterator.java
/**
A list iterator allows access of a position in a list.
This interface contains a subset of the methods of the
standard java.util.ListIterator interface. The methods for
backward traversal are not included.
*/
public interface MyListIterator
{
/**
Moves the iterator past the next element.
@return the traversed element
*/
Object next();
/**
Tests if there is an element after the iterator
position.
@return true if there is an element after the iterator
position
*/
boolean hasNext();
}
Main.java
// you may use this file to write and run code to test your MyArrayList class
public class Main {
public static void main(String[] args) {
}
}
FILE THAT NEEDS THAT NEEDS CODE:
MyArrayList.java
// Complete the implementation of your MyArrayList class in this file
public class MyArrayList implements MyList {
// Implement the required fields and methods here
private int capacity = 8;
private Object[ ] array = new Object [capacity];
private int size = 0;
@Override
public void add(Object o) {
if (size >= capacity){
Object[] temp = new Object[2*array.length];
for(int i=0;i<size;++i){
temp[i] = array[i];
}
this.capacity = 2*array.length;
array = temp;
array[size++] = o;
return;
}
else
{
array[size++] = o;
}
}
@Override
public int size() {
return size;
}
@Override
public Object at(int index) {
if (index >= capacity)
return null;
else
return array[index];
}
@Override
public void insertAt(int index, Object o) {
if (index >= capacity)
return;
else
{
size++;
for (int x = size - 1; x > index; x--) {
array[x] = array[x - 1];
}
array[index] = o;
}
}
@Override
public void removeAt(int index) {
if (index >= size || size == 0)
return;
else {
Object e = array[index];
for (int x = index; x < this.array.length - 1; x++) {
array[x] = array[x + 1];
}
size--;
}
}
public void ensureCapacity(int minCapacity) {
}
public void trimToSize() {
ensureCapacity(size);
}
// Do not alter the code below
@Override
public MyListIterator getIterator() {
return new MyA.
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).
Write a program that will test a name) method no sorting routine from.docx
The document describes a Java program that uses an ArrayList to test a selection sort algorithm. It prompts the user to enter a number, fills the ArrayList with that many randomly generated integers from 1 to 50, prints the original ArrayList, calls a selection sort method to sort the ArrayList, and prints the sorted ArrayList. The selection sort method uses nested for loops to find the minimum element in the unsorted section and swap it with the current element being considered.
Write a program to find the number of comparisons using the binary se.docx
The document describes a program to compare the number of comparisons needed for binary search versus sequential search on an array of 1000 randomly generated elements. It includes functions to fill the array, perform sequential, binary, and binary with sequential search, and output the number of comparisons for each. The program prompts the user for elements to search for in different locations of the array and outputs the results.
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 .
Collections Api - Java
Core Java - Collections API - Methods of Traversing - Interfaces - MAP - SET - LIST - QUEUE and all its subtypes and methods.
Explain why multiple processes cannot share data easilySolution.pdf
Explain why multiple processes cannot share data easily?
Solution
threads share C.P.U. and just one thread active (running) at a time.
threads among a processes, threads among a processes execute consecutive.
thread will produce youngsters.
if one thread is blocked, another thread will run
hreads don\'t seem to be freelance of 1 another.
all threads will access each address within the task .
thread square measure style to help one alternative. Note that processes would possibly or may
not assist each other as a result of processes could originate from completely different users
A method with multiple threads build a good server for instance printer server.
Because threads will share common information, they are doing not have to be compelled to use
interprocess communication.
Because of the terribly nature, threads will cash in of multiprocessors.
They solely want a stack and storage for registers thus, threads square measure low-cost to form.
Threads use little resources of associate degree software system during which they\'re operating.
That is, threads don\'t want new address house, international information, program code or
software system resources.
Context change square measure quick once operating with threads. the rationale is that we tend
to solely ought to save and/or restore computer, SP and registers
User-level threads doesn\'t need modification to operative systems.
Simple Representation:
every thread is depicted just by a computer, registers, stack and atiny low management block, all
hold on within the user method address house.
Simple Management:
This merely implies that making a thread, change between threads and synchronization between
threads will all be shunned intervention of the kernel.
Fast and Efficient: Thread change isn\'t way more overpriced than a procedure decision.
There is a scarcity of coordination between threads and software system kernel. Therefore,
method as whole gets just one occasion slice irrespect of whether or not method has one thread
or a thousand threads among. it\'s up to every thread to relinquish management to alternative
threads.
User-level threads needs non-blocking systems decision i.e., a multithreaded kernel. Otherwise,
entire method can blocked within the kernel, albeit there square measure runable threads left
within the processes. for instance, if one thread causes a page fault, the method blocks..
executive summary for law enforcement using dronesSolutionUse .pdf
executive summary for law enforcement using drones
Solution
Use of drones makes the job of law enforcement easier as it enables access to real time
surveillance. Drones helps the police force conduct aeriel surveilance and the video can be
viewed real time or at a later point in time. This is a very useful tool during the investigative
process. Drones can be equipped with thermal cameras so as to keep an eye on anti-social
elements.
However, law enforcement agencies will have to make sure that use of drones do not violate the
privacy of citizens..
More Related Content
Similar to Link to assignment that I need help with is below httpweb.cse..pdf
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] .
Lecture 18Dynamic Data Structures and Generics (II).docx
Lecture 18
Dynamic Data Structures and Generics (II)
*
*
Class ArrayListObject of an ArrayList can be used to store an unlimited number of objects.
*
Methods of ArrayList (I)
*
java.util.ArrayList
+ArrayList()
+add(o: Object) : void
+add(index: int, o: Object) : void
+clear(): void
+contains(o: Object): boolean
+get(index: int) : Object
+indexOf(o: Object) : int
+isEmpty(): boolean
+lastIndexOf(o: Object) : int
+remove(o: Object): boolean
+size(): int
+remove(index: int) : Object
+set(index: int, o: Object) : Object
Appends a new element o at the end of this list.
Adds a new element o at the specified index in this list.
Removes all the elements from this list.
Returns true if this list contains the element o.
Returns the element from this list at the specified index.
Returns the index of the first matching element in this list.
Returns true if this list contains no elements.
Returns the index of the last matching element in this list.
Removes the element o from this list.
Returns the number of elements in this list.
Removes the element at the specified index.
Sets the element at the specified index.
Creates an empty list.
Methods of ArrayList (II) Array is used to implement the methodsMethods get(int index) and set(int index, Object o) for accessing and modifying an element through an index and the add(Object o) for adding an element at the end of the list are efficient. Why?Methods add(int index, Object o) and remove(int index) are inefficient because it requires shifting potentially a large number of elements.
*
Linked Data StructureTo improve efficiency for adding and removing an element anywhere in a list.It containsCollection of objectsEach object contains data and a reference to another object in the collection
*
Linked ListA dynamic data structureA linked list consists of nodes. Each node contains an elementa link: linked to its next neighbor. Example: take notes in the class!
*
Linked List
*
ListNodes
ListNodes in Linked List
public class ListNode { // fill the comments
private String data; //
private ListNode link; //
/** */
public ListNode () {
link = null; //
data = null; //
}
/** */
public ListNode (String newData, ListNode linkValue) {
data = newData;
link = linkValue;
}
*
ListNodes in Linked List (cont’d)
/** */
public void setData (String newData) {
data = newData;
}
/** */
public String getData () {
return data;
...
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:
.
Selection sort
This document describes the selection sort algorithm. It works by iterating through an array, finding the maximum value, and swapping it with the current element to put it in the correct sorted position. This process is repeated, each time searching a smaller subarray, until the entire array is sorted from largest to smallest. Pseudocode is provided to demonstrate how selection sort iterates through the array, finds the max, and swaps elements to sort the list.
In this assignment you will implement insert() method for a singly l.pdf
In this assignment you will implement insert() method for a singly linked Link list. The code
MyLinkedlist.java is given , it uses generic type as the linked list can be created with any object
type. Some methods like add() and toString() are already implemented. The MyLinkedList class
has a private nested class called Node.
The objective of this assignment is to implement the insert() method that takes two inputs an
element of generic type to be inserted and an index (value of integer type) at which it should be
inserted. For this assignment we will assume the first element has the index 0. if the given index
is less than zero do nothing but if it is greater than the size of the list, insert the element at the
end of the list. if the index is between 0 and size , insert it in the appropriate location. You insert
code should correctly update the theSize data member of the linked list. Return type for insert()
method is boolean (true or false) depending on whether the insertion was successful or not. Use
the following method header.
}
Main.java
//add necessary libraries
public class Main
{
//add your function here
public static void main (String [] args)
{
}
}
MyLinkedList.java
public class MyLinkedList {
// A private nested Node class
private static class Node{
public AnyType data; // Data members are public, this is fine as the Node class itself is
private
public Node next;
public Node(AnyType d, Node n)
{
data = d;
next=n;
}
@Override
public String toString() {
return data.toString();
}
}
// Data Members
private Node head; // A node pointer to the first item in the List
private int theSize; // a integer variable to hold the size of the List
public MyLinkedList() {
doClear();
}
public void clear() {
doClear();
}
private void doClear() {
head = null;
theSize =0 ;
}
// An add method that will always add at the beginning of the List
public boolean add(AnyType x) {
if(head == null) // List is empty
{
head = new Node(x, null);
theSize++;
return true;
}
else // List has at least one item lets get to the end of it
{
Node newnode = new Node(x, head);
head = newnode;
theSize++;
return true;
}
}
@Override
public String toString() {
// This to String method will print the List from head to the end.
String theList = "";
if(head==null)
return theList;
Node cur = head;
while(cur.next!=null) {
theList = theList + cur.toString() + " ";
cur= cur.next;
}
return theList + cur.toString();
}
public int getTheSize() {
return theSize;
}
}
/*****************************************************************************
*
*
* SOLUTION CODE BELOW THIS HEADER
*
*****************************************************************************/
/*****************************************************************************
*
*
* SOLUTION CODE ABOVE THIS HEADER
*
*****************************************************************************/
}
Current file: Main.java Load default template... //add necessary Libraries public class Main \{
//add your function here public static vo.
Why following sort does not work (It does not sort last 2 - 3 numbe.pdf
Why following sort does not work? (It does not sort last 2 - 3 numbers)
//Sort order
class SortNumbListener implements ActionListener
{
@Override
public void actionPerformed(ActionEvent e)
{
Collections.sort(list);
for(int i = 0; i < list.size(); i++)
{
textfield2.setText(list.toString());
}
System.out.print(list + \"\ \");
}
}
Solution
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import javax.swing.JTextField;
public class SorAction {
public JTextField textfield2;
public List list;
public SorAction() {
// TODO Auto-generated constructor stub
textfield2 = new JTextField();
list = new ArrayList();
list.add(20);
list.add(12);
list.add(32);
list.add(3);
new SortNumbListener().actionPerformed(new ActionEvent(\"\", 0, null));
}
public static void main(String[] args) {
try {
new SorAction();
} catch (Exception e) {
// TODO: handle exception
e.printStackTrace();
}
}
class SortNumbListener implements ActionListener {
@Override
public void actionPerformed(ActionEvent e) {
Collections.sort(list);
textfield2.setText(list.toString());
System.out.print(list + \"\ \");
}
}
}
OUTPUT:
[3, 12, 20, 32]
NOTE: please check the above example, sorting fine, but what is the need of loop,
if you want to add the text to textbox use setText() method of textfield.
Which XXX condition generates the following output Not foun.pdf
Which XXX condition generates the following output? Not found
#include <stdio.h> int BinarySearch(int numberList[], int element, int lowVal, int highVal) { int
midVal; if (XXX) { midVal = (highVal + lowVal) / 2; if (numberList[midVal] == element) { return
midVal; } else if (numberList[midVal] > element) { return BinarySearch(numberList, element,
lowVal, midVal - 1); } else { return BinarySearch(numberList, element, midVal + 1, highVal); } }
else { return -1; } } int main(void) { int size = 10; int numberList[size]; int element = 20; int
matchPos; for (int i = 0; i < size; ++i) { numberList[i] = i; } matchPos = BinarySearch(numberList,
element, 0, size - 1); if (matchPos >= 0) { printf("Found at position %d.n", matchPos); } else {
printf("Not found.n"); } return 0; }
options:
lowVal >= highVal
lowVal == highVal
lowVal <= highVal
lowVal + highVal == 0.
Java ArrayList Tutorial | Edureka
( ** Java Certification Training: https://www.edureka.co/java-j2ee-soa-training ** )
This Edureka tutorial on “Java ArrayList” (Java blog series: https://goo.gl/osrGrS) will give you a brief insight about ArrayList in Java and its various constructors and methods along with an example. Through this tutorial, you will learn the following topics:
Collections Framework
Hierarchy of ArrayList
What is ArrayList
Internal Working of ArrayList
Constructors of ArrayList
Constructors Example
ArrayList Methods
Methods Example and Demo
Advantages of ArrayList over Arrays
Check out our Java Tutorial blog series: https://goo.gl/osrGrS
Check out our complete Youtube playlist here: https://goo.gl/CRbgFann
Follow us to never miss an update in the future.
Instagram: https://www.instagram.com/edureka_learning/
Facebook: https://www.facebook.com/edurekaIN/
Twitter: https://twitter.com/edurekain
LinkedIn: https://www.linkedin.com/company/edureka
week4_srcArrayMethods.javaweek4_srcArrayMethods.javapackage ed.docx
week4_src/ArrayMethods.javaweek4_src/ArrayMethods.javapackage edu.drexel.ct290;
publicclassArrayMethods{
/**
* Pass and array to a method that will search through it for a given value.
*
* @param elementToFind: This is the item we want to find in the array.
* @param stringArray: This is the array to search through.
* @return Returns: The index of the element, or -1 if not found.
*/
publicint findElement(String elementToFind,String[] stringArray ){
int index =-1;
for(int i=0; i<stringArray.length; i++){
if( elementToFind.equals(stringArray[i])){
// If the element is found, set index
index = i;
}
}
return index;
}
/**
* Replace a value in an array.
*
* @param indexToReplace: The index where the new value should be written.
* @param newValue: The new value.
* @param stringArray: Change a value in this array.
* @return True if the given index is valid
*/
publicboolean replace(int indexToReplace,String newValue,String[] stringArray ){
boolean replaced =false;
// Use the if condition to make sure the given index is valid
if( indexToReplace >0&& indexToReplace < stringArray.length ){
stringArray[indexToReplace]= newValue;
replaced =true;
}
return replaced;
}
/**
* Insert a value into the array. From the insertion point on, the
* data needs to be copied down one space to make room for the new
* element indices .
*
* @param index: The index where the new element should be inserted
* @param element: The element to insert in the array
* @param array: The array to insert into
* @param indicesUsed: the number of elements in the array already used
* @return the array with the new value inserted
*/
publicString[] insert(int index,String element,String[] array,int indicesUsed){
// First, check that there is enough room in the array for
// another element. The parameter indicesUsed indicates how
// many elements of the array are already filled.
String[] newArray = array;
if( indicesUsed == array.length ){
newArray = makeBiggerArray(array);
}
// Now that we know there is enough room, move the
// elements down one spot in the array until we get to the
// insertion point. Make sure the element at the insertion
// point gets moved too.
int indexToMove = indicesUsed;
while( indexToMove >= index ){
newArray[indexToMove+1]= newArray[indexToMove];
indexToMove--;
}
// Set the given index to the new element
newArray[index]= element;
// Return the new array
return newArray;
}
/**
* Since arrays are fixed size, if you run out of room, the
* only options is to create a new bigger array, then copy
* the old data over.
* @param oldArray: The old data to copy into the new array
* @return The new bigger array
*/
publicString[] makeBiggerArray(String[] oldArray){
// Make the new array twice the size of the old one.
int newArraySize .
I only need help with four methods in the EmployeeManager class the .pdf
I only need help with four methods in the EmployeeManager class the methods are addRequest,
viewNextRequest, grantNextRequest, and outputRequests. I posted all of the other uml for
refernce on items that could be called.
UML DIAGRAM FOR AND DISCUSSION FOR EmptyListException
EmptyListException extends RuntimeException
<>EmptyListException( )
<>EmptyListException(name : String)
Constructors
The constructor that takes a String as an argument calls upon the super class constructor with that
String concatenated with “ is Empty”. The constructor that takes no argument calls upon the
other constructor with the argument of “List”.
This class should belong to the exceptions package.
UML DIAGRAM FOR AND DISCUSSION FOR ListNode
ListNode>
data : E
nextNode: ListNode
<>ListNode(d : E)
<>ListNode(d : E, node : ListNode)
+ setData(d : E)
+getData() : E
+setNext(next : ListNode)
+getNext() : ListNode
Notes on ListNode
ListNode(d : E) sets the nextNode to null, the rest of the implementation of the ListNode class is
self-explanatory as discussed in class
UML DIAGRAM FOR AND DISCUSSION FOR LinkedList
LinkedList>
firstNode : ListNode
lastNode : ListNode
numElements : int
name : String
<>LinkedList()
<>LinkedList(name : String)
+ insertAtFront(item : E)
+ insertAtBack(item : E)
+ removeFromFront() : E throws EmptyListException
+ removeFromBack() : E throws EmptyListException
+ removeItem(index : int) : E throws IndexOutOfBoundsException
+ getItem(index : int) : E throws IndexOutOfBoundsException
+ setItem(index : int, item : E) throws IndexOutOfBoundsException
+ findAndRemove(item : E) : Boolean
+ findItem(item E) : int
+ lengthIs() : int
+ clear()
+ toString()
+ isEmpty() : Boolean
+ sort() throws EmptyListException
Notes on LinkedList
Constructors
Both constructors set firstNode and lastNode to null and numElements to 0. The constructor that
takes a String sets the name data member to the String that is passed
insertAtFront(E)
Inserts the passed item to the front of the list
void insertAtBack(E)
Inserts the passed item in the back of the list
void removeFromFront()
Removes the first item in the list, and returns it. If the list is empty throws a new
EmptyListException with the message: “(Name of list) is Empty”
removeFromBack()
Removes the last item in the list, and returns it. If the list is empty throws a new
EmptyListException with the message: “(Name of list) is Empty”
removeItem(int)
Removes the element from the list at the given index. If that index does not exist within the
LinkedList an IndexOutOfBoundsException is thrown with the message: “(Name of List) Index
out of Range”. Returns the item removed.
getItem(int)
Returns the element at the given index. If that index does not exist within the LinkedList an
IndexOutOfBoundsException is thrown with the message: “(Name of List) Index out of Range”.
public setItem(int index, E item)
Attempts to place the passed item into the given index. If that index does not exist within the
LinkedList an IndexOutOfBound.
(Sort ArrayList) Write the following method that sorts an ArrayList.pdf
(Sort ArrayList) Write the following method that sorts an ArrayList: public static >
void sort(ArrayList list
JAVA
Solution
import java.util.ArrayList;
/**
* @author
*
*/
public class GenericSort {
/**
* method to sort the list
*
* @param list
*/
public static > void sort(ArrayList list) {
Object currentMax;
int currentMaxIndex;
for (int i = list.size() - 1; i >= 1; i--) {
// Find the maximum in the list[0..i]
currentMax = list.get(i);
currentMaxIndex = i;
for (int j = i - 1; j >= 0; j--) {
if (((Comparable) currentMax).compareTo(list.get(j)) < 0) {
currentMax = list.get(j);
currentMaxIndex = j;
}
}
// Swap list[i] with list[currentMaxIndex] if necessary;
if (currentMaxIndex != i) {
list.set(currentMaxIndex, list.get(i));
list.set(i, (E) currentMax);
}
}
}
/**
* @param args
*/
public static void main(String[] args) {
Integer[] intArray = { new Integer(2), new Integer(4), new Integer(3) };
// Create a String List
ArrayList stringList = new ArrayList();
stringList.add(\"Srinivas\");
stringList.add(\"Pavan\");
stringList.add(\"Kishore\");
stringList.add(\"Rajesh\");
stringList.add(\"Charkri\");
// Create a int List
ArrayList intList = new ArrayList();
intList.add(20);
intList.add(30);
intList.add(10);
intList.add(40);
intList.add(90);
intList.add(50);
System.out.println(\"Before sorting :\");
System.out.println(stringList);
System.out.println(intList);
// Sort the arrays
sort(stringList);
sort(intList);
System.out.println(\"After sorting :\");
System.out.println(stringList);
System.out.println(intList);
}
}
OUTPUT:
Before sorting :
[Srinivas, Pavan, Kishore, Rajesh, Charkri]
[20, 30, 10, 40, 90, 50]
After sorting :
[Charkri, Kishore, Pavan, Rajesh, Srinivas]
[10, 20, 30, 40, 50, 90].
Class DiagramIn the Assignment #10, you are given three files Ass.pdf
Class Diagram:
In the Assignment #10, you are given three files Assignment10.java, LinkedList.java, and
ListIterator.java. You will need to add additional methods in the LinkedList class in the
LinkedList.java file. The LinkedList will be tested using strings only.
Specifically, the following methods must be implemented in the LinkedList class:
(You should utilize listIterator() method already defined in the LinkedList class to obtain its
LinkedListIterator object, and use the methods in the LinkedListIterator class to traverse from
the first element to the last element of the linked list to define the following methods.)
1.
public String toString()
The toString method should concatenate strings in the linked list, and return a string of the
following format:
{ Apple Banana Melon Orange }
Thus it starts with \"{\" and ends with \"}\", and there is a space between strings and \"{\" or
\"}\". If the list is empty, it returns \"{ }\" with a space in between.
2.
public boolean isEmpty()
The isEmpty method returns true of the linked list is empty, false otherwise.
3.
public void addElement(Object element)
The addElement adds the parameter element at the parameter in the linked list in alphabetical
order. For instance, if the linked list contains {Apple, Banana, Grape}, and a user tries to add
\"Carrot\", then it should be added as:
{Apple, Banana, Carrot, Grape}.
4.
public Object removeElement(int index)
The removeElement removes the string (Object) at the parameter index and returns it. Note that
this index starts with 0 just like array indices. For instance, if the linked list contains {Apple,
Banana, Carrot, Grape} and the parameter index is 3, then \"Grape\" should be remove. If the
parameter index is larger or smaller than the existing indices, it should throw an object of the
IndexOutOfBoundsException class (and the content of the linked list should remain unchanged).
5.
public Object getElement(int index)
The getElement searches the string (Object) at the parameter index and returns it. Note that this
index starts with 0 just like array indices. For instance, if the linked list contains {Apple, Banana,
Carrot, Grape} and the parameter index is 3, then \"Grape\" will be returned. If the parameter
index is larger or smaller than the existing indices, it should throw an object of the
IndexOutOfBoundsException class (and the content of the linked list should remain unchanged).
6.
public void searchAndReplace(Object oldString, Object newString)
The searchAndReplace method searches all occurrences of the first parameter string (object) in
the list, and replaces them with the second parameter string (object). If the parameter string does
not exist in the linked list, then the linked list content will not change.
7.
public int indexOfLast(Object searchString)
The indexOfLast searches the parameter string (object) with the largest index, and returns its
index. If the parameter string does not exist in the linked list, then it should return -1.
For i.
Aj unit2 notesjavadatastructures
- The document discusses various Java data structures including lists, arrays, stacks, queues, linked lists, binary trees, and binary search trees.
- It provides code examples for implementing a custom list using arrays, as well as examples for common list operations like adding, accessing, and removing elements.
- Additional code examples demonstrate binary tree traversal methods like inorder, preorder, and postorder traversals, as well as methods for inserting nodes and searching for nodes in a binary search tree.
Android Database Tutorial
Storing data is a basic and very common need in mobile apps. The Android application framework provides several storage options, one of which is SQLite databases.
In this tutorial you will see a simple Android database example. The example is based on the Android ListView Tutorial and the Android AsyncTask Tutorial, however these tutorials are not mandatory for the purpose of understanding the principles of proper Android database usage.
Everything needs to be according to the instructions- thank you! SUPPO.pdf
Everything needs to be according to the instructions, thank you!
SUPPORTING CODE:
MyList.java
/**
This interface specifies the basic operations of any list-like object.
This interface contains a variation of the methods of the
standard java.util.List interface.
*/
public interface MyList {
/**
Adds an element at the end of the list.
*/
public void addToEnd(Object o);
/**
Inserts an element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void insertAt(int index, Object o);
/**
Removes the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public void removeAt(int index);
/**
Returns the element at the specified index
Throws NoSuchElementException if index is out of bounds.
*/
public Object getAt(int index);
/**
Returns the size of the list.
@return the number of elements in the list
*/
public int getSize();
/**
Returns a list iterator for this list.
@return a list iterator for this list
*/
public MyListIterator getIterator();
}
MyListIterator.java
/**
A list iterator allows access of a position in a list.
This interface contains a subset of the methods of the
standard java.util.ListIterator interface. The methods for
backward traversal are not included.
*/
public interface MyListIterator
{
/**
Moves the iterator past the next element.
@return the traversed element
*/
Object next();
/**
Tests if there is an element after the iterator
position.
@return true if there is an element after the iterator
position
*/
boolean hasNext();
}
Main.java
// you may use this file to write and run code to test your MyArrayList class
public class Main {
public static void main(String[] args) {
}
}
FILE THAT NEEDS THAT NEEDS CODE:
MyArrayList.java
// Complete the implementation of your MyArrayList class in this file
public class MyArrayList implements MyList {
// Implement the required fields and methods here
private int capacity = 8;
private Object[ ] array = new Object [capacity];
private int size = 0;
@Override
public void add(Object o) {
if (size >= capacity){
Object[] temp = new Object[2*array.length];
for(int i=0;i<size;++i){
temp[i] = array[i];
}
this.capacity = 2*array.length;
array = temp;
array[size++] = o;
return;
}
else
{
array[size++] = o;
}
}
@Override
public int size() {
return size;
}
@Override
public Object at(int index) {
if (index >= capacity)
return null;
else
return array[index];
}
@Override
public void insertAt(int index, Object o) {
if (index >= capacity)
return;
else
{
size++;
for (int x = size - 1; x > index; x--) {
array[x] = array[x - 1];
}
array[index] = o;
}
}
@Override
public void removeAt(int index) {
if (index >= size || size == 0)
return;
else {
Object e = array[index];
for (int x = index; x < this.array.length - 1; x++) {
array[x] = array[x + 1];
}
size--;
}
}
public void ensureCapacity(int minCapacity) {
}
public void trimToSize() {
ensureCapacity(size);
}
// Do not alter the code below
@Override
public MyListIterator getIterator() {
return new MyA.
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).
Write a program that will test a name) method no sorting routine from.docx
The document describes a Java program that uses an ArrayList to test a selection sort algorithm. It prompts the user to enter a number, fills the ArrayList with that many randomly generated integers from 1 to 50, prints the original ArrayList, calls a selection sort method to sort the ArrayList, and prints the sorted ArrayList. The selection sort method uses nested for loops to find the minimum element in the unsorted section and swap it with the current element being considered.
Write a program to find the number of comparisons using the binary se.docx
The document describes a program to compare the number of comparisons needed for binary search versus sequential search on an array of 1000 randomly generated elements. It includes functions to fill the array, perform sequential, binary, and binary with sequential search, and output the number of comparisons for each. The program prompts the user for elements to search for in different locations of the array and outputs the results.
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 .
Collections Api - Java
Core Java - Collections API - Methods of Traversing - Interfaces - MAP - SET - LIST - QUEUE and all its subtypes and methods.
Similar to Link to assignment that I need help with is below httpweb.cse..pdf (20)
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
2.(Sorted list array implementation)This sorted list ADT discussed .pdf
Lecture 18Dynamic Data Structures and Generics (II).docx
Lecture 18Dynamic Data Structures and Generics (II).docx
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
In this assignment you will implement insert() method for a singly l.pdf
In this assignment you will implement insert() method for a singly l.pdf
Why following sort does not work (It does not sort last 2 - 3 numbe.pdf
Why following sort does not work (It does not sort last 2 - 3 numbe.pdf
Which XXX condition generates the following output Not foun.pdf
Which XXX condition generates the following output Not foun.pdf
week4_srcArrayMethods.javaweek4_srcArrayMethods.javapackage ed.docx
week4_srcArrayMethods.javaweek4_srcArrayMethods.javapackage ed.docx
I only need help with four methods in the EmployeeManager class the .pdf
I only need help with four methods in the EmployeeManager class the .pdf
(Sort ArrayList) Write the following method that sorts an ArrayList.pdf
(Sort ArrayList) Write the following method that sorts an ArrayList.pdf
Class DiagramIn the Assignment #10, you are given three files Ass.pdf
Class DiagramIn the Assignment #10, you are given three files Ass.pdf
Everything needs to be according to the instructions- thank you! SUPPO.pdf
Everything needs to be according to the instructions- thank you! SUPPO.pdf
For this lab you will complete the class MyArrayList by implementing.pdf
For this lab you will complete the class MyArrayList by implementing.pdf
Write a program that will test a name) method no sorting routine from.docx
Write a program that will test a name) method no sorting routine from.docx
Write a program to find the number of comparisons using the binary se.docx
Write a program to find the number of comparisons using the binary se.docx
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
More from ezzi97
Explain why multiple processes cannot share data easilySolution.pdf
Explain why multiple processes cannot share data easily?
Solution
threads share C.P.U. and just one thread active (running) at a time.
threads among a processes, threads among a processes execute consecutive.
thread will produce youngsters.
if one thread is blocked, another thread will run
hreads don\'t seem to be freelance of 1 another.
all threads will access each address within the task .
thread square measure style to help one alternative. Note that processes would possibly or may
not assist each other as a result of processes could originate from completely different users
A method with multiple threads build a good server for instance printer server.
Because threads will share common information, they are doing not have to be compelled to use
interprocess communication.
Because of the terribly nature, threads will cash in of multiprocessors.
They solely want a stack and storage for registers thus, threads square measure low-cost to form.
Threads use little resources of associate degree software system during which they\'re operating.
That is, threads don\'t want new address house, international information, program code or
software system resources.
Context change square measure quick once operating with threads. the rationale is that we tend
to solely ought to save and/or restore computer, SP and registers
User-level threads doesn\'t need modification to operative systems.
Simple Representation:
every thread is depicted just by a computer, registers, stack and atiny low management block, all
hold on within the user method address house.
Simple Management:
This merely implies that making a thread, change between threads and synchronization between
threads will all be shunned intervention of the kernel.
Fast and Efficient: Thread change isn\'t way more overpriced than a procedure decision.
There is a scarcity of coordination between threads and software system kernel. Therefore,
method as whole gets just one occasion slice irrespect of whether or not method has one thread
or a thousand threads among. it\'s up to every thread to relinquish management to alternative
threads.
User-level threads needs non-blocking systems decision i.e., a multithreaded kernel. Otherwise,
entire method can blocked within the kernel, albeit there square measure runable threads left
within the processes. for instance, if one thread causes a page fault, the method blocks..
executive summary for law enforcement using dronesSolutionUse .pdf
executive summary for law enforcement using drones
Solution
Use of drones makes the job of law enforcement easier as it enables access to real time
surveillance. Drones helps the police force conduct aeriel surveilance and the video can be
viewed real time or at a later point in time. This is a very useful tool during the investigative
process. Drones can be equipped with thermal cameras so as to keep an eye on anti-social
elements.
However, law enforcement agencies will have to make sure that use of drones do not violate the
privacy of citizens..
Discuss how your life and experience with social mediaweb 2.0 compa.pdf
Discuss how your life and experience with social media/web 2.0 compares with it?
Solution
Social media has impacted everyone’s life in the era of digitization. Be an organization or be an
individual; the social media has left its significance on every affected element.
The social media mediums are diverse and they serve a variety of purposes. The organizations
reported that the mediums lucrative for following reasons:
Moreover, the information gathered through various sources social media, secondary research,
qualitative & quantitative information, business publications help companies to make appropriate
strategic decisions.
However, there are pros and cons of the same. On the individual front, below are the pros and
cons of the social media
On the organizational front:
Below companies are emphasizing on social media use and secondary research to expand their
business..
create a narrative budget blueprint for a local unit of government. .pdf
create a narrative budget blueprint for a local unit of government. Put yourself in the shoes of an
administrator in a newly formed municipality that has never developed a municipal budget
before. How would you complete the task? Where would you start? What process would you
follow? Who would be involved? What concerns do you have, how do you resolve them? How
do you budget for capital items and link them to the operational budget, etc.? Be as detailed as
possible to display a comprehensive understanding of the course material.
Solution
Municipal Budget :
A municipality is a general-purpose administrative subdivision. It is an urban area usally a city or
town .
Generally Municipalities create Budget on Annual basis. Budget consists of anticipation of
Expected Revenue and Estimated Expenditure.
Generally we start from
a) Revenue :
i) Revenue may be Grants received from Central Government for specific purpouse or general
purpouse.
ii) any local taxes collected from individuals etc will become revenue .
b) Expenditure :
As it is newly formed local unit it can take the basis of any muncipality which is already existing
so that it can cover all administrative expenses like electricity, water, Telephone charges etc.
Sometimes expenditure may be Planned or Unplanned . Therefore amount should be kept aside
as Contingency for UNplanned portion.
Proper authorisation should be there for each and every expenditure.
Expenditure may be for salaries, maintenance of road ways, public parks ,libraries or to provide
Safety services for public, funds for Schools etc
While preparing Budget there might be conflict of ideas.It can be overcomed by meeting the
concerned head of the department.
For Capital budgets Proper Approval, Sanction details Should be verified.
Every member in the unit should be aware of Guidelines respective to there Department.
Through which errors can be avoided.As requisition and payment process done from the unit ,
there should be proper segregation between CApital and revenue expenditure.This can be done if
there are seprate Rules and guidelines for capital and revenue expenditure.
So, in Budget major Focus will be on Revenue and Expenditure..
define three types of kernal-mode to user mode transfersSolution.pdf
define three types of kernal-mode to user mode transfers
Solution
1.Multitasking ; In order to excute multiple jobs , process switching is needed some times.In
order to load programmes CPU moves from kernal mode to user mode
2.Interrupt handling ; Modern architectures are interrupt driven.When an interrupt occurs, the
hardware automatically switches a part of the context (kernal-mode to user mode or usermode to
kernal-mode)
3.User and kernel mode switching ; A transfer between user mode and kernel mode is required in
an OS, then user and kernal mode switching takes place ..
Arrange the steps of DNA replication in the order that they occur. D.pdf
Arrange the steps of DNA replication in the order that they occur. DNA polymerase synthesizes
DNA. DNA ligase joins DNA fragments together. Single-stranded DNA-binding proteins bind
to each template strand. Helicase unwinds the DNA double helix. RNA primers are added.
RNA primers are removed.
Solution
Helicase unwinds the DNA double helix Single-stranded DNA-binding proteins bind to each
template strand RNA primers added DNA polymerase synthesizes DNA RNA primers are
removed DNA ligase joins DNA fragments together.
C++You will design a program to play a simplified version of war, .pdf
The document describes a simplified dice game of war simulation to be programmed in C++. There will be two simulated players, each with their own die that can have a different number of sides as specified by the user. The user will also specify if either die is loaded, meaning it is biased to roll higher on average. The program will simulate rounds of the two players rolling their dice, compare the results, track scores, and report the overall winner. Classes like Die, LoadedDie, and Game will be defined to represent the dice and game logic.
(c) After conducting several measurements, the Beijing Municipal Env.pdf
(c) After conducting several measurements, the Beijing Municipal Environmental Monitoring
Center issued a warning that indicated the density of PM2.5 (fine particulate matter, a measure of
air pollution) was over the safe limit.
Descriptive
Inferential
(d) International Living issued a report listing percentages of Americans retired and living in
each foreign country.
Descriptive
Inferential
Descriptive
Inferential
Solution
C) Descriptive
D) Inferential.
1. Which of the following statements would correctly print out t.pdf
The document contains 30 multiple choice questions about JavaScript concepts including:
- Printing text in a specific color using document.write()
- Creating alert dialogs with window.alert()
- Valid variable names
- If/else conditional statements
- While loops
- Array methods like length, indexing, and initialization
- String methods like split(), charAt(), and indexOf()
- Window methods for creating windows and prompting users
The questions cover a wide range of JavaScript topics from basic syntax to objects, methods, and built-in functions.
2.How important is it to involve physicians in financial improvement.pdf
2.How important is it to involve physicians in financial improvement efforts? What is the best
strategy for physician engagement?
Solution
Physicians are the key player in healthcare system. They have expert knowledge, skills , abilities,
experience, opinions etc. to suggest for formulating the policies related to healthcare
improvements practices. They actually know what is equitable, suitable, right , fair, transparent
and realistic pricing startegies for patients care as well as their payment part in the health care
system.
To engage the physician in healthcare system, the following efforts must be developed and
implemented by the hospital management and healthcare administrators,
1) They should have to report on daily basis to some central authorities related to their day to day
contribution.
2) Their payment and compensation should be kept best among the industry so that they do not
involve themselves in private practices.
3) They should be given some startegic role to analyze the best practices prevalent in the health
care industry.
4) Some training and development activities for future doctors and staffs must be organized by
the hospital so that these physicians can contribute their learning and experience.
5) They should be asked to write some blogs on social platforms so that more people can be
attracted for health care reforms and services offered by the hospital.
6) They should be given some flexibility to choose their plan for making and earning money by
being the part of the helath care system.
7) They must be engaged for setting code of ethics for health care reforms and quality conscious
services..
Write one page essay to explain how you relate signals and systems t.pdf
Write one page essay to explain how you relate signals and systems theory with current
technology advancement.
Support your argument by providing a case study and identify signals and systems theory plays a
major role on mentioned application.
Please post the website or database you found information. Thank you!
Solution
A signal as referred to in communication systems, signal processing, and electrical engineering is
a function that \"conveys information about the behavior or attributes of some phenomenon. In
the physical world, any quantity exhibiting variation in time or variation in space (such as an
image) is potentially a signal that might provide information on the status of a physical system,
or convey a message between observers, among other possibilities. The IEEE Transactions on
Signal Processing states that the term \"signal\" includes audio, video, speech, image,
communication, geophysical, sonar, radar, medical and musical signals.
Typically, signals are provided by a sensor, and often the original form of a signal is converted to
another form of energy using a transducer. For example, a microphone converts an acoustic
signal to a voltage waveform, and a speaker does the reverse.
The formal study of the information content of signals is the field of information theory. The
information in a signal is usually accompanied by noise. The term noise usually means an
undesirable random disturbance, but is often extended to include unwanted signals conflicting
with the desired signal (such as crosstalk). The prevention of noise is covered in part under the
heading of signal integrity. The separation of desired signals from a background is the field of
signal recovery, one branch of which is estimation theory, a probabilistic approach to
suppressing random disturbances.
Engineering disciplines such as electrical engineering have led the way in the design, study, and
implementation of systems involving transmission, storage, and manipulation of information. In
the latter half of the 20th century, electrical engineering itself separated into several disciplines,
specialising in the design and analysis of systems that manipulate physical signals; electronic
engineering and computer engineering as examples; while design engineering developed to deal
with functional design of man–machine interfaces.
Definitions specific to sub-fields are common. For example, in information theory, a signal is a
codified message, that is, the sequence of states in a communication channel that encodes a
message.
In the context of signal processing, arbitrary binary data streams are not considered as signals,
but only analog and digital signals that are representations of analog physical quantities.
In a communication system, a transmitter encodes a message to a signal, which is carried to a
receiver by the communications channel. For example, the words \"Mary had a little lamb\"
might be the message spoken into a telephone. The telephone transmitter converts th.
Why do IDPs & IDRs lack structure Lack a ligand or partner Denatu.pdf
Why do IDPs & IDRs lack structure? Lack a ligand or partner? Denatured during isolation?
Folding requires conditions found inside cells? Lack of folding encoded by amino acid
sequence?
Solution
IDPs (Intrinsically disordered protein) and IDRs (Intrinsically disordered regions) lack structure
due to lack of folding encoded by amino acid seuence. In general, IDPs are characterized by a
low content of bulky hydrophobic amino acids and a high proportion of polar and charged amino
acids, usually referred to as low hydrophobicity. This property leads to good interactions with
water. Furthermore, high net charges promote disorder because of electrostatic repulsion
resulting from equally charged residues. Thus disordered sequences cannot sufficiently bury a
hydrophobic core to fold into stable globular proteins. Some proteins are fully disordered while
some are partial. Partial disordered proteins have some disordered regions (IDRs). Hence, IDPs
and IDRs have no fix structure and cover a spectrum of states from fully unstructured to partially
structured and include random coils, (pre-)molten globules, and large multi-domain proteins
connected by flexible linkers..
Write 2 to 3 paragraphs aboutONE DDoS attack that occurred in 2016.pdf
Write 2 to 3 paragraphs about
ONE DDoS attack that occurred in 2016.
1-What techniques were used to launch the attack?
2- Who was the victim?
3-What was the vulnerability in the victim that led to the success of this attack?
4-What are some of the remedial measures, if any, that have been taken after the attack?
Solution
DDOS:
As you may known that DDOS is distribute denial of service which is a kind of DOS .
In a DDOS attack the victims use both the targeted end system and the all the system which are
being used and controlled by the hacker in this attack.
DDOS attack in 2016:
One of the DDOS attack that took place in 2016 is the Dyn cyber attack which took place on
october 21.This involved multiple DDOS aatacks which targets the DNS(Domainn Name
System)provider Dyn.
This attacK caused many internet platforms and services unavailable to the users of Europe and
North America.
Victim of this attack:
New world Hackers and the group anonymous claimed the responsibility for the Dyn cyber
attack.
Techniques used:
Dyn DNS provider is providing the service of mapping an internet domain name to the end
users.when the Dyn provider entered into the web browser they noticed the DDOS attack which
has been accomplished through large number of DNS request.
The attack has been executed through the botnet which consist of large number of internet
connected devices and that has been infected through Mirai malware.
vulnerability:
The vulnerability in the victim is the Mirai botnet with an estimated throughput of 1.2 terabits
per second.According to experts this is the largest DDOS attack.
This attack has been coordinated through internet of things(IOT)..
Why is methyl salicylate not appreciably soluble in waterSoluti.pdf
Why is methyl salicylate not appreciably soluble in water?
Solution
Methyl salicylate is not soluble in water due to the presence of benzene ring which is
hydrophobic in nature leading to dispersion forces between the ester molecules. Secondly, the
presence of OH group gives rise to hydrogen bonding with the water molecules. This hydrogen
bonding is weak in nature since the dispersion forces between the two benzene rings are more
leading to decreased solubility of methyl salicylate in water..
Who are stakeholders Define who they are and then please share what.pdf
Who are stakeholders? Define who they are and then please share what particular interest each of
these stakeholders have in the information shared on the income statement, retained earnings
statement, balance sheet and statement of cash flows. How do we analyze if a company is
healthy or not?
Solution
Stakeholders are those persons or group of persons who have a interest in the company. The
Interest that they have may be financial or non financial, such as an employee has a financial
interest but customers have non-financial interest. Stakeholders are concerned about the working
of a company. Stakeholders are of two types
Various Types of Stakeholders are as follows:-
Different stakeholders have different interests in the company. Various Stakeholders and their
Interests are given below.
1.Customers. Customers have a stake in the goods of the company. Customers need to know that
company is making progress; it increases their confidence in using company’s products. All a
Customer need is Good a quality product with future care. A customer can understand from
Income statements of a company that whether companies do any research expenses to make their
product better for consumption.
2. Employees. Employees wants to see what company pays to them as a compensation for their
hard work. Companies Value added statements show the percentage of revenue distributed to
employees of company. Employees are also concerned about their job security. A profit making
company is suppose to give a satisfaction to employee that he has a good future in company.
3.Government. Government Collects takes which can be ascertained by reviewing Income
statement. Moreover companies help government by providing employment to millions of
people. Government has interest in knowing that companies prepare their financial statements
truthfully and frauds like Enron are not done.
4. Stock Holders. Stock Holders are basically owners of a company, They take major decisions
in working of a company. Results shown by income statements, Balance sheets and cash Flow
Statements help them take future decisions with precision.
5. Society. Society is also concerned about the working of business organizations. They have a
stake in Corporate Social Responsibility policies of a company. Whether company is taking
necessary steps to minimize pollution of water, air, or total environment as a whole. The
employment rate is another example of society’s stake in businesses.
6. Suppliers. Suppliers are Concerned about that cash position of company. The Current ratio of
Company. They supply Inventory so they need to know whether company is able to pay their
dues in time. Cash Flow statements show a supplier the position of cash of a company.
7. Creditors. Creditors are concerned about the payment of their dues.
8. Lenders. Lenders such as Bond Holders or Preference stock holders are concerned about the
efficient of use of their money and the return on their money. No one wants to lend his money to
a c.
What was the biggest problem with the Articles of Confederation They.pdf
What was the biggest problem with the Articles of Confederation? They gave too much
authority to the executive branch The court system lacked judicial review and enforcement
abilities. (, They required unanimous ratification by the states before going into effect. They
swung too far in the direction of limited national government.
Solution
Question 1- Answer is option 4
Question 2- Answer is option 3
Question 3- Answer is option 4
Question 4- Answer is option 2
Question 5- Answer is option 3.
What is UWIN and what does it doSolutionUWin is a software .pdf
What is U/WIN and what does it do?
Solution
U/Win is a software package. It is used to run Unix applications in windows.
For eample if u have some programs which were written for the UNIX environment, you can use
U/WIN to run those programs in windows systems by making few or no changes.
U/WIN contains libraries that emulate UNIX environment by implementing the UNIX API.
Most of the Unix API is implemented by the POSIX.DLL dynamically loaded library (DLL).
Programs linked with POSIX.DLL run under the Win32 subsystem instead of the POSIX
subsystem.
so programs can freely intermix Unix and Win32 library calls..
What sort of archaeological remains have been discovered on the site.pdf
What sort of archaeological remains have been discovered on the site of the ancient city of
Pompeii?
Solution
Answer:
Pompeii located in the Campania region of Italy. It was an ancient Roman city situated near
(around 23 km southeast of) modern Naples which was destroyed (and buried under 4 to 6 meter
of volcanic ash and pumice) by the violent eruption of Mount Vesuvius in 79 AD.
The archaeological remains have been discovered on the site of the ancient city of Pompeii are :.
The Food Stamp Program is Americas first line of defense against hu.pdf
The Food Stamp Program is America\'s first line of defense against hunger for millions of
families. Over half of all participants, am children, one out of six is a low-income older adult.
The function, f(x), models the number of people, in millions, receiving food stamps x years after
1990. Use the graph of f(x) given above the answers to the following questions. How many
million people received food stamps in the year 2004? In which year(s) did 22 million people
receive food stamps?
Solution
a) 10 million
draw a vertical line at x=14 (because 2004 = 1990+14 and see where it intersects with the curve)
b)
year 1992 , 2000
draw a horizontal line at y=22 and see where it intersects with the curve
you would see, it intersects at x = 2 , 10
therefore, 1990 +2 , 1990+10
1992 , 2000.
The following code snipet contains some unfamiliar text#include .pdf
The following code snipet contains some unfamiliar text:
#include
#include
#include
/* ... */
WINTRUST_FILE_INFO FileData;
memset(&FileData, 0, sizeof(FileData));
FileData.cbStruct = sizeof(WINTRUST_FILE_INFO);
FileData.pcwszFilePath = pwszSourceFile;
FileData.hFile = NULL;
FileData.pgKnownSubject = NULL;
How could one go about discovering the definition of WINTRUST_FILE_INFO, and
how to interpret it?
Solution
#include
#include
#include
/* ... */
WINTRUST_FILE_INFO FileData;
memset(&FileData, 0, sizeof(FileData));
FileData.cbStruct = sizeof(WINTRUST_FILE_INFO);
FileData.pcwszFilePath = pwszSourceFile;
FileData.hFile = NULL;
FileData.pgKnownSubject = NULL;
Hi, You can find about \"WINTRUST_FILE_INFO\" in \'wintrust.h\'
\"WINTRUST_FILE_INFO\" is a typedef (alias) of some class name.
More from ezzi97 (20)
Explain why multiple processes cannot share data easilySolution.pdf
Explain why multiple processes cannot share data easilySolution.pdf
executive summary for law enforcement using dronesSolutionUse .pdf
executive summary for law enforcement using dronesSolutionUse .pdf
Discuss how your life and experience with social mediaweb 2.0 compa.pdf
Discuss how your life and experience with social mediaweb 2.0 compa.pdf
create a narrative budget blueprint for a local unit of government. .pdf
create a narrative budget blueprint for a local unit of government. .pdf
define three types of kernal-mode to user mode transfersSolution.pdf
define three types of kernal-mode to user mode transfersSolution.pdf
Arrange the steps of DNA replication in the order that they occur. D.pdf
Arrange the steps of DNA replication in the order that they occur. D.pdf
C++You will design a program to play a simplified version of war, .pdf
C++You will design a program to play a simplified version of war, .pdf
(c) After conducting several measurements, the Beijing Municipal Env.pdf
(c) After conducting several measurements, the Beijing Municipal Env.pdf
1. Which of the following statements would correctly print out t.pdf
1. Which of the following statements would correctly print out t.pdf
2.How important is it to involve physicians in financial improvement.pdf
2.How important is it to involve physicians in financial improvement.pdf
Write one page essay to explain how you relate signals and systems t.pdf
Write one page essay to explain how you relate signals and systems t.pdf
Why do IDPs & IDRs lack structure Lack a ligand or partner Denatu.pdf
Why do IDPs & IDRs lack structure Lack a ligand or partner Denatu.pdf
Write 2 to 3 paragraphs aboutONE DDoS attack that occurred in 2016.pdf
Write 2 to 3 paragraphs aboutONE DDoS attack that occurred in 2016.pdf
Why is methyl salicylate not appreciably soluble in waterSoluti.pdf
Why is methyl salicylate not appreciably soluble in waterSoluti.pdf
Who are stakeholders Define who they are and then please share what.pdf
Who are stakeholders Define who they are and then please share what.pdf
What was the biggest problem with the Articles of Confederation They.pdf
What was the biggest problem with the Articles of Confederation They.pdf
What is UWIN and what does it doSolutionUWin is a software .pdf
What is UWIN and what does it doSolutionUWin is a software .pdf
What sort of archaeological remains have been discovered on the site.pdf
What sort of archaeological remains have been discovered on the site.pdf
The Food Stamp Program is Americas first line of defense against hu.pdf
The Food Stamp Program is Americas first line of defense against hu.pdf
The following code snipet contains some unfamiliar text#include .pdf
The following code snipet contains some unfamiliar text#include .pdf
Recently uploaded
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.
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
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
DRUGS AND ITS classification slide share
Any substance (other than food) that is used to prevent, diagnose, treat, or relieve symptoms of a
disease or abnormal condition
How to Add Chatter in the odoo 17 ERP Module
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
How 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.
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 Aberdeen
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 KanvariaYour Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective UpskillingExcellence Foundation for South Sudan
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.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
How to Fix the Import Error in the Odoo 17
An import error occurs when a program fails to import a module or library, disrupting its execution. In languages like Python, this issue arises when the specified module cannot be found or accessed, hindering the program's functionality. Resolving import errors is crucial for maintaining smooth software operation and uninterrupted development processes.
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Recently uploaded (20)
Liberal Approach to the Study of Indian Politics.pdf
Liberal Approach to the Study of Indian Politics.pdf
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Chapter 4 - Islamic Financial Institutions in Malaysia.pptx
Community pharmacy- Social and preventive pharmacy UNIT 5
Community pharmacy- Social and preventive pharmacy UNIT 5
How to Setup Warehouse & Location in Odoo 17 Inventory
How to Setup Warehouse & Location in Odoo 17 Inventory
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...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Your Skill Boost Masterclass: Strategies for Effective Upskilling
Pride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School District
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Pengantar Penggunaan Flutter - Dart programming language1.pptx
Link to assignment that I need help with is below httpweb.cse..pdf
- 1. Link to assignment that I need help with is below: http://web.cse.ohio-state.edu/cse2123/currentsem/closedlabs/ClosedLab01.html Solution import java.util.*; import java.io.*; public class ClosedLab01a { // Method to find index of max element in list private static int findMin(ArrayList list) { int index = 0; double minValue = list.get(0); for (int i = 1; i < list.size(); i++) { if(list.get(i) < minValue) { minValue = list.get(i); index = i; } } return index; } // Method to find index of max element in list private static int findMax(ArrayList list) { int index = 0; double maxValue = list.get(0); for (int i = 1; i < list.size(); i++) { if(list.get(i) > maxValue) { maxValue = list.get(i); index = i; } } return index; } // Method to compute average of a list of values.
- 2. private static double computeAverage(ArrayList list) { double average = 0; for (double value: list) { average += value; } average = average/list.size(); return average; } public static void main (String[] args) throws IOException { Scanner keyboard = new Scanner(System.in); System.out.print("Enter a filename: "); String fname = keyboard.nextLine(); try { Scanner infile = new Scanner(new File(fname)); ArrayList purchases = new ArrayList(); while(infile.hasNext()) { double purch=infile.nextDouble(); purchases.add(purch); } infile.close(); double average = computeAverage(purchases); System.out.println("The average purchase value was " + average); int maxIndex = findMax(purchases); System.out.println("The maximum purchase value is at index (" + maxIndex + ") and value is " + purchases.get(maxIndex)); int minIndex = findMin(purchases); System.out.println("The minimum purchase value is at index (" + minIndex + ") and value is " + purchases.get(minIndex)); } catch (IOException e) { System.out.println("Error reading file "+fname+" "+e); } } }