public class AVLTreeT extends ComparableT extends BSTT { p.pdf
•
0 likes•3 views
public class AVLTree> extends BST { protected int height; public AVLTree() { super(); height = -1; } public AVLTree(BTNode root) { super(root); height = -1; } public void purge(){ super.purge(); } public int getHeight() { return getHeight(root); } private int getHeight(BTNode node) { if(node == null) return -1; else return 1 + Math.max(getHeight(node.left), getHeight(node.right)); } private AVLTree getLeftAVL() { AVLTree leftsubtree = new AVLTree(root.left); return leftsubtree; } private AVLTree getRightAVL() { AVLTree rightsubtree = new AVLTree(root.right); return rightsubtree; } protected int getBalanceFactor() { if(isEmpty()) return 0; else return getRightAVL().getHeight() - getLeftAVL().getHeight(); } public void insertAVL(T el) { super.insert(el); this.balance(); } public void deleteAVL(T el) { // to be completed by students } protected void balance() { if(!isEmpty()) { getLeftAVL().balance(); getRightAVL().balance(); adjustHeight(); int balanceFactor = getBalanceFactor(); if(balanceFactor == -2) { System.out.println("Balance factor = " + balanceFactor); System.out.println("Balancing node with el: "+root.data); if(getRightAVL().getBalanceFactor() == 0 && getLeftAVL().getBalanceFactor() == -1) /// special case rotateRight(); else if(getLeftAVL().getBalanceFactor() <= 0) rotateRight(); else rotateLeftRight(); } else if(balanceFactor == 2) { System.out.println("Balance factor = " + balanceFactor); System.out.println("Balancing node with el: "+root.data); if(getRightAVL().getBalanceFactor() == 0) /// special case that cannot be done rotateLeft(); /// by double rotations else if(getRightAVL().getBalanceFactor() > 0) rotateLeft(); else rotateRightLeft(); } } } protected void adjustHeight() { if(isEmpty()) height = -1; else height = 1 + Math.max(getLeftAVL().getHeight(), getRightAVL().getHeight()); } protected void rotateRight() { System.out.println("RIGHT ROTATION"); // to be completed by students } protected void rotateLeft() { System.out.println("LEFT ROTATION"); BTNode tempNode = root.left; root.left = root.right; root.right = root.left.right; root.left.right = root.left.left; root.left.left = tempNode; T val = (T) root.data; root.data = root.left.data; root.left.data = val; getLeftAVL().adjustHeight(); adjustHeight(); } protected void rotateLeftRight() { System.out.println("Double Rotation..."); getLeftAVL().rotateLeft(); getLeftAVL().adjustHeight(); this.rotateRight(); this.adjustHeight(); } protected void rotateRightLeft() { System.out.println("Double Rotation..."); // to be completed by students } public void levelOrderTraversal(){ levelOrderTraversal(root); } } public class AVLTreeDriver { public static void main(String[] args) { System.out.println("\nSINGLE LEFT ROTATION EXAMPLE: "); System.out.println("Insert 45 in the following AVL tree:"); AVLTree avlTree2 = new AVLTree(); Integer[] array1 = new Integer []{30, 5, 35, 32, 40}; for(int i = 0; i < array1.length ; i++) avlTree2.insertAVL(array1[i]); avlTree2.printTree(); System.out.pri.
Report
Share
Report
Share
Download to read offline
Recommended
b. (10 pts) Implement the rotate left method for AVL trees.c. (10 .pdf
b. (10 pts) Implement the rotate left method for AVL trees.
c. (10 pts) Implement the rotate right method for AVL trees.
d. (10 pts) Implement the rotate left-right method for AVL trees.
e. (10 pts) Implement the rotate right-left method for AVL trees.
f. (15 pts) Implement the rebalance method for AVL trees.
g. (3 pts) Implement pre-order, in-order, and post-order traversals for AVL trees.
All of this should be implemented in the below code, in C++, without changing any of the
parameters or functions as they are laid out.
#include
#include
#include "AVLTree.h"
#include "AVLNode.h"
using namespace std;
AVLTree::AVLTree() {
root = nullptr;
size = 0;
}
std::shared_ptr AVLTree::getRoot() {
return root;
}
int AVLTree::getSize() {
return size;
}
std::shared_ptr AVLTree::search(int val) {
return search(root, val);
}
std::shared_ptr AVLTree::search(std::shared_ptr n, int val) {
if (n == NULL) //if root node is null just return null value
{
return n;
}
//if target is less than root's value search in left half
if (val < n->value)
{
return search(n->left, val);
}
//if target is greater than root's value search in right half
else if (val > n->value)
{
return search(n->right, val);
}
//else if target is equal to root node just return the root node i.e n.
return n;
}
std::shared_ptr AVLTree::minimum() {
std::shared_ptr curr = root;
while (curr && curr->left) {
curr = curr->left;
}
return curr;
}
std::shared_ptr AVLTree::minimum(std::shared_ptr n) {
std::shared_ptr curr = n;
while (curr && curr->left) {
curr = curr->left;
}
return curr;
}
std::shared_ptr AVLTree::maximum() {
std::shared_ptr curr = root;
while (curr && curr->right) {
curr = curr->right;
}
return curr;
}
std::shared_ptr AVLTree::maximum(std::shared_ptr n) {
std::shared_ptr curr = n;
while (curr && curr->right) {
curr = curr->right;
}
return curr;
}
int getHeight(std::shared_ptr n) {
if (n == nullptr) {
return -1;
}
return n->height;
}
int getBalanceFactor(std::shared_ptr n) {
if (n == nullptr) {
return 0;
}
return getHeight(n->left) - getHeight(n->right);
}
void AVLTree::insertValue(int val) {
root = insertValue(root, val);
}
std::shared_ptr AVLTree::insertValue(std::shared_ptr n, int val) {
if (n == nullptr) {
shared_ptr newNode(new AVLNode(val));
size++;
return newNode;
}
if (val < n->value) {
n->left = insertValue(n->left, val);
}
else if (val > n->value) {
n->right = insertValue(n->right, val);
}
else {
// Duplicate value, no change
return n;
}
// Update the height of the current node
n->height = 1 + max(getHeight(n->left), getHeight(n->right));
// Rebalance the node if necessary
return rebalance(n);
}
void AVLTree::deleteValue(int val) {
root = deleteValue(root, val);
}
std::shared_ptr AVLTree::deleteValue(std::shared_ptr n, int val) {
if (n == nullptr) {
return nullptr;
}
if (val < n->value) {
n->left = deleteValue(n->left, val);
}
else if (val > n->value) {
n->right = deleteValue(n->right, val);
}
else {
// Found the value to delete
if (n->left == nullptr && n->right == nullptr) {
// .
Write a program that displays an AVL tree along with its balance fac.docx
This document provides code for an AVL tree implementation that:
1. Inserts nodes into the tree and rebalances it using rotations to maintain the AVL property.
2. Includes methods for searching, counting nodes, checking if the tree is empty, clearing the tree, and traversing the tree in different orders.
3. Contains a test program that uses the AVL tree to insert random numbers, perform operations on the tree, and display the results.
Given the following codepackage data1;import java.util.;p.pdf
Given the following code
package data1;
import java.util.*;
/*public class BST> implementing a set ADT and containing the following:
* private inner class BinaryNode representing a node with a (possibly) left child and a (possibly)
right child
** instance fields BinaryNode root, int size
* contains/insert/remove method - w/ O(height) complexity
** size O(1), isEmpty O(1), clear O(1),
*** findMin, findMax, findHeight methods - w/ O(height) complexity
**** toString() method printing set (in-order traversal) and the tree (BFS traversal)
**
*/
publicclass BST> {
private BinaryNode root;
privateint size;
//Search opertion of Set ADT
publicboolean contains(E value) {
return contains(root, value);
}
//Insert opertion of Set ADT
publicvoid insert(E value) {
root = insert(root, value);
size++;
}
//Remove operation of Set ADT
publicvoid remove(E value){
root = remove(root, value);
size--;
}
publicint size(){
return size;
}
publicboolean isEmpty(){
return root == null;
}
publicvoid clear(){
root = null;
size = 0;
}
public E findMin(){
return findMin(root);
}
public E findMax(){
return findMax(root);
}
publicint findHeight(){
return root.height();
}
public String toString(){
if(root == null)
return "set {} stored in an empty tree.\n";
String elements = root.inOrder().toString();
return "set {" + elements.substring(1,elements.length()-1) + "} stored in tree \n" + root;
}
private E findMin(BinaryNode node){
if(node == null)
returnnull;
if(node.left == null)
return node.element;
return findMin(node.left);
}
private E findMax(BinaryNode node){
if(node == null)
returnnull;
if(node.right == null)
return node.element;
return findMax(node.right);
}
privateboolean contains(BinaryNode node, E value) {
if (node == null)//node represents an empty substree
returnfalse;
int comparisonResult = value.compareTo(node.element);
if(comparisonResult < 0)//if value is less than root's value
return contains(node.left, value);
if(comparisonResult > 0)//if value is greater than root's value
return contains(node.right, value);
returntrue;//successful search
}
private BinaryNode insert(BinaryNode node, E value) {
if (node == null)//base case: empty tree
returnnew BinaryNode<>(value);
if (value.compareTo(node.element) < 0)
node.left = insert(node.left, value);//insert recursively to left-subtree
elseif (value.compareTo(node.element) > 0)
node.right = insert(node.right, value);//insert recursively to right-subtree
else {//duplicate value cannot be inserted in a BST implementing the Set ADT
size--;//insertion failed!
//System.out.print("BST.insert: Warning: " + value + " is already stored in the tree \n" + node);
}
return node;
}
private BinaryNode remove(BinaryNode node, E value) {
if (node == null) {//base case: empty tree
System.out.println("BST.remove: Warning: " + value + " doesn't exist in the tree.");
size++;//removal failed!
return node;
}
if (value.compareTo(node.element) < 0)
node.left = remove(node.left, value);
elseif (value.compareTo(node.element) > 0)
node.right = remov.
Create a class BinarySearchTree- A class that implements the ADT binar.pdf
Create a class BinarySearchTree. A class that implements the ADT binary search tree by
extending BinaryTree. Recursive version.
public class BinarySearchTree<T extends Comparable<? super T>>
extends BinaryTree<T> implements SearchTreeInterface<T>
{
public BinarySearchTree ()
{
super();
} // end default constructor
public BinarySearchTree (T rootEntry)
{
super();
setRootNode(new BinaryNode<>(rootEntry));
} // end constructor
public void setTree (T rootData) // Disable setTree (see Segment 25.6)
{
throw new UnsupportedOperationException();
} // end setTree
public void setTree (T rootData, BinaryTreeInterface<T> leftTree, BinaryTreeInterface<T>
rightTree)
{
throw new UnsupportedOperationException();
} // end setTree
//...
public T remove (T entry)
{
ReturnObject oldEntry = new ReturnObject(null);
BinaryNode<T> newRoot = removeEntry(getRootNode(), entry, oldEntry);
setRootNode(newRoot);
return oldEntry.get();
} // end remove
//...
private class ReturnObject
{
private T item;
private ReturnObject(T entry)
{
item = entry;
} // end constructor
public T get()
{
return item;
} // end get
public void set(T entry)
{
item = entry;
} // end set
} // end ReturnObject
} // end BinarySearchTree
HERE IS BinaryTree.java
import java.util.Iterator;
import java.util.NoSuchElementException;
public class BinaryTree<T> implements BinaryTreeInterface<T> {
private BinaryNode<T> root;
public BinaryTree() {
root = null;
}
public BinaryTree(T rootData) {
root = new BinaryNode<>(rootData);
}
public BinaryTree(T rootData, BinaryTree<T> leftTree, BinaryTree<T> rightTree) {
privateSetTree(rootData, leftTree, rightTree);
}
private void privateSetTree(T rootData, BinaryTree<T> leftTree, BinaryTree<T>
rightTree) {
root = new BinaryNode<>(rootData);
if (leftTree != null && !leftTree.isEmpty()) {
root.setLeftChild(leftTree.root);
}
if (rightTree != null && !rightTree.isEmpty()) {
if (rightTree != leftTree) {
root.setRightChild(rightTree.root);
} else {
root.setRightChild(rightTree.root.copy());
}
}
if (leftTree != null && leftTree != this) {
leftTree.clear();
}
if (rightTree != null && rightTree != this) {
rightTree.clear();
}
}
@Override
public T getRootData() {
if (isEmpty()) {
throw new EmptyTreeException("The tree is empty.");
}
return root.getData();
}
@Override
public int getHeight() {
return root.getHeight();
}
@Override
public int getNumberOfNodes() {
return root.getNumberOfNodes();
}
@Override
public boolean isEmpty() {
return root == null;
}
@Override
public void clear() {
root = null;
}
@Override
public Iterator<T> getPreorderIterator() {
return new PreorderIterator();
}
@Override
public Iterator<T> getInorderIterator() {
return new InorderIterator();
}
@Override
public Iterator<T> getPostorderIterator() {
return new PostorderIterator();
}
private class PreorderIterator implements Iterator<T> {
private StackInterface<BinaryNode<T>> nodeStack;
public PreorderIterator() {
nodeStack = new LinkedStack<>();
if (root != null) {
nodeStack.push(root);
}
}
public boolean hasNex.
srcArtifact.javasrcArtifact.javaclassArtifactextendsCave{pub.docx
src/Artifact.javasrc/Artifact.javaclassArtifactextendsCave{
publicint creatureIndex =0;
publicArtifact(int index,String type,int creatureIndex){
super(type, index);
this.creatureIndex = creatureIndex;
}
@Override
publicString toString(){
// Return neater output of the class data
return"[Artifact]: \n\tOwner Index = "
+Integer.toString(this.creatureIndex)
+" \n\tArtifact Type = "+this.type;
}
}
src/Cave.javasrc/Cave.javapublicclassCave{
publicint index =0;
publicString type =null;
publicString name =null;
/***
* Constructor
* @param index
*/
publicCave(int index){
this.index = index;
}
publicCave(int index,String type,String name){
this.index = index;
this.type = type;
this.name = name;
}
publicCave(int index,String name){
this.index = index;
this.name = name;
}
publicCave(String type,int index){
this.index = index;
this.type = type;
}
}
src/Creature.javasrc/Creature.javaimport java.awt.BorderLayout;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.ArrayList;
import javax.swing.JButton;
import javax.swing.JFrame;
import javax.swing.JLabel;
import javax.swing.JOptionPane;
import javax.swing.JPanel;
import javax.swing.JProgressBar;
classCreatureextendsCaveimplementsActionListener,Runnable{
publicint partyIndex =0;
publicint empathyValue;
publicint fearValue;
publicdouble carryingCapacity;
publicint age;
publicint weight;
publicdouble height;
publicArrayList<Treasure> treasures =newArrayList<Treasure>();
publicArrayList<Artifact> artifacts =newArrayList<Artifact>();
publicArrayList<Jobs> jobs =newArrayList<Jobs>();
publiclong jobTime =0;
publicJobs currentJob =null;
publicvolatileboolean runJob =false;
publicvolatileboolean cancelJob =false;
JButton cancelButton =newJButton("Cancel Job");
JButton startButton =newJButton("Start Job");
publicCreature(int index,String type,String name,int partyIndex,
int empathyValue,int fearValue,double carryingCapacity){
super(index, type, name);
this.partyIndex = partyIndex;
this.empathyValue = empathyValue;
this.fearValue = fearValue;
this.carryingCapacity = carryingCapacity;
}
publicCreature(int index,String type,String name,int partyIndex,
int empathyValue,int fearValue,double carryingCapacity,int age,
int weight,double height){
super(index, type, name);
this.partyIndex = partyIndex;
this.empathyValue = empathyValue;
this.fearValue = fearValue;
this.carryingCapacity = carryingCapacity;
this.age = age;
this.weight = weight;
this.height = height;
}
publicvoid addTreature(Treasure t){
if(t !=null&& t instanceofTreasure&& t.creatureIndex !=0){
this.treasures.add(t);
}
}
publicvoid addArtifact(Artifact a){
if(a !=null&& a instanceofArtifact&& a.creatureIndex !=0){
this.artifacts.add(a);
}
}
@Override
publicString toString(){
String output ="";
output +="[Creature]: \n\tType = "+this.type +" \n\tName = "
+this.name +" \n\tParty Index = "
+Integer.toString(this.partyIndex)+" \n\tEmpathy Value = "
+Integer.toString(this.empathyV.
Miracle of std lib
The document demonstrates the use of Kotlin collection functions like filter, map, flatMap, groupBy, sortedBy etc on sample data models of Category and Product. It shows how to search for one item, filter, map, group collections and sort data. Advanced techniques include filtering, mapping price with VAT, flattening category subcategories, grouping by category, sorting by price etc.
import java-util--- public class MyLinkedList{ public static void.pdf
import java.util.*; public class MyLinkedList{ public static void main(String[] args){ } } //copy
MyList to here interface MyList extends Collection { /* MyList will inherite all methods from
Collection public boolean add(E e); public boolean addAll(Collection extends E> c); public void
clear(); public boolean contains(Object o); public boolean containsAll(Collection> c); public
boolean isEmpty(); public boolean remove(Object o); public boolean removeAll(Collection> c);
public boolean retainAll(Collection> c); public int size(); public Object[] toArray(); public T[]
toArray(T[] arr); */ //abstract method public void add(int index, E e); public E get(int index);
public int indexOf(Object e); public int lastIndexOf(E e); public E remove(int index); public E
set(int index, E e); //default method @Override public default boolean add(E e){ add(size(), e);
return true; } @Override public default boolean isEmpty(){ return size()==0; } @Override
public default boolean remove(Object e){ if(indexOf(e) >= 0){ remove(indexOf(e)); return true;
} else{ return false; } } @Override public default boolean containsAll(Collection> c){
for(Object e : c){ if(!contains(e)){ return false; } } return true; } @Override public default
boolean addAll( Collection extends E> c){ for(E e : c){ add(e); } return true; } /* removeAll:
this[1,1,2,3] c[1,2,4] this.removeAll(c) [3] */ @Override public default boolean removeAll(
Collection> c){ for(Object e : c){ while(contains(e)){ this.remove(e); } } return true; } /*
retainAll this[1,1,2,3] c[1,2,4] this.retainAll(c) [1,1,2] */ @Override public default boolean
retainAll( Collection> c){ for(E e : this){ if(!c.contains(e)){ this.remove(e); } } return true; }
@Override public default Object[] toArray(){ Object[] results = new Object[size()]; int i = 0;
for(E e : this){ results[i++] = e; } return results; } /* T[] array */ @Override public default T[]
toArray(T[] array){ int i = 0; for(E e : this){ array[i++] = (T)e; } return array; } } class
TwoWayLinkedList implements MyList { //inner static class Node public class Node { E
element; Node next; Node previous; public Node(E e){ element = e; } } private Node head, tail;
private int size = 0; public TwoWayLinkedList(){ /* head = null; tail = null; size = 0; */ } public
TwoWayLinkedList(E[] objects){ } public E getFirst(){ return null; } public E getLast(){ return
null; } public void addFirst(E e){ } public void addLast(E e){ } public E removeFirst(){ return
null; } public E removeLast(){ return null; } @Override public void add(int index, E e){ }
@Override public E remove(int index){ return null; } @Override public void clear(){ }
@Override public boolean contains(Object e){ return false; } @Override public E get(int index){
return null; } @Override public int indexOf(Object e){ return -1; } @Override public int
lastIndexOf(Object e){ return -1; } @Override public E set(int index, E e){ return null; }
@Override public int size(){ return size; } //toString() @Override public String.
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program and set of functions (maybein
a library) that can be performed on a binary search tree.
Your program should allow user to insert/delete integer values into the binary search tree along
with several other operations on the binary search tree. You can use the code given in slides. But
this time your key will be int! Specifically, your program will ask user to enter a command and
related parameters (if any) in a loop, and then perform the given commands. Here is the list of
commands that your program must implement:
* insert
*find\'
*delete
*list inorder
*list preorder
*list postorder
*list levelorder
* max
* min
* height
*count
* sum
*quit
As always, make sure you release (free) the dynamically allocated memories if you allocate any
memory in your programs. So, before submitting your program, run it with valgrind to see if
there is any memory leakage
//my proggram in C
struct tree_node {
int data;
struct tree_node *left, *right;
}
typedef struct nodeT {
int key;
struct nodeT *left, *right;
} nodeT, *treeT;
int main(){
while (TRUE) {
printf(\"> \");
line = GetLine();
ch = toupper(line[0]);
switch (ch) {
case \'I\': insert(); break;
case \'F\': find(); break;
case \'D\': delete(); break;
case \'LI\': listInorder; break;
case \'LPR\': listPreorder(); break;
case \'LPO\': listPostorder(); break;
case \'MAX\': max(); break;
case \'min\': min(); break;
case \'H\': height(); break;
case \'C\': count(); break;
case \'S\': sum(); break;
case \'Q\': exit(0);
default:printf(\"Illegal command\ \"); break;
}
}
}
nodeT *FindNode(nodeT *t, int key){
while(t !=NULL) {
if (key == t->key) return t;
if (key < t->key) {
t = t->left;
} else {
t = t->right;
}
return NULL;
}
void delete(nodeT **p){
nodeT
*target;
target=*p;
if (target->left==NULL && target->right==NULL) {
*p=NULL;
} else if (target->left == NULL) {
*p=target->right;
} else
if (target->right == NULL) {
*p=target->left;
} else {
/* target has two children, see next slide */
}
free(target);
}
void listInorder(nodeT *T){
if (t != NULL) {
DisplayTree(t->left);
printf(“%d “, t->key);
DisplayTree(t->right);
}
}
void listPreorder(nodeT *t) {
if (t != NULL) {
printf(“%d “, t->key);
DisplayTree(t->left);
DisplayTree(t->right);
}
}
void listPostOrder(nodeT *t){
if (t != NULL) {
DisplayTree(t->left);
DisplayTree(t->right);
printf(“%d “, t->key);
}
}
void intsert(nodeT **tptr, int key){
nodeT*t, *tmp;
t=*tptr;
if (t == NULL) {
tmp=New(nodeT*);
tmp->key = key;
tmp->left=tmp->right=NULL;
*tptr=tmp;
return;
}
if (key < t->key) {
InsertNode
(&t->left, key);
} else {
InsertNode(&t->right, key);
}
}
int height(nodeT *t){
if (t == NULL)
return 0;
else
return (1 + maximumof(
height(t->left),
height(t->right)) );
}
int sum(struct tree_node *p){
if (p == NULL)
return 0;
else
return (p->data +
sum(p->left) +
sum(p->right) );
}
Solution
1. /*
2. * Java Program to Implement Binary Search Tree
3. */
4.
5. import java.util.Scanner;
6.
7. /* Class BSTNode */
8. cl.
Recommended
b. (10 pts) Implement the rotate left method for AVL trees.c. (10 .pdf
b. (10 pts) Implement the rotate left method for AVL trees.
c. (10 pts) Implement the rotate right method for AVL trees.
d. (10 pts) Implement the rotate left-right method for AVL trees.
e. (10 pts) Implement the rotate right-left method for AVL trees.
f. (15 pts) Implement the rebalance method for AVL trees.
g. (3 pts) Implement pre-order, in-order, and post-order traversals for AVL trees.
All of this should be implemented in the below code, in C++, without changing any of the
parameters or functions as they are laid out.
#include
#include
#include "AVLTree.h"
#include "AVLNode.h"
using namespace std;
AVLTree::AVLTree() {
root = nullptr;
size = 0;
}
std::shared_ptr AVLTree::getRoot() {
return root;
}
int AVLTree::getSize() {
return size;
}
std::shared_ptr AVLTree::search(int val) {
return search(root, val);
}
std::shared_ptr AVLTree::search(std::shared_ptr n, int val) {
if (n == NULL) //if root node is null just return null value
{
return n;
}
//if target is less than root's value search in left half
if (val < n->value)
{
return search(n->left, val);
}
//if target is greater than root's value search in right half
else if (val > n->value)
{
return search(n->right, val);
}
//else if target is equal to root node just return the root node i.e n.
return n;
}
std::shared_ptr AVLTree::minimum() {
std::shared_ptr curr = root;
while (curr && curr->left) {
curr = curr->left;
}
return curr;
}
std::shared_ptr AVLTree::minimum(std::shared_ptr n) {
std::shared_ptr curr = n;
while (curr && curr->left) {
curr = curr->left;
}
return curr;
}
std::shared_ptr AVLTree::maximum() {
std::shared_ptr curr = root;
while (curr && curr->right) {
curr = curr->right;
}
return curr;
}
std::shared_ptr AVLTree::maximum(std::shared_ptr n) {
std::shared_ptr curr = n;
while (curr && curr->right) {
curr = curr->right;
}
return curr;
}
int getHeight(std::shared_ptr n) {
if (n == nullptr) {
return -1;
}
return n->height;
}
int getBalanceFactor(std::shared_ptr n) {
if (n == nullptr) {
return 0;
}
return getHeight(n->left) - getHeight(n->right);
}
void AVLTree::insertValue(int val) {
root = insertValue(root, val);
}
std::shared_ptr AVLTree::insertValue(std::shared_ptr n, int val) {
if (n == nullptr) {
shared_ptr newNode(new AVLNode(val));
size++;
return newNode;
}
if (val < n->value) {
n->left = insertValue(n->left, val);
}
else if (val > n->value) {
n->right = insertValue(n->right, val);
}
else {
// Duplicate value, no change
return n;
}
// Update the height of the current node
n->height = 1 + max(getHeight(n->left), getHeight(n->right));
// Rebalance the node if necessary
return rebalance(n);
}
void AVLTree::deleteValue(int val) {
root = deleteValue(root, val);
}
std::shared_ptr AVLTree::deleteValue(std::shared_ptr n, int val) {
if (n == nullptr) {
return nullptr;
}
if (val < n->value) {
n->left = deleteValue(n->left, val);
}
else if (val > n->value) {
n->right = deleteValue(n->right, val);
}
else {
// Found the value to delete
if (n->left == nullptr && n->right == nullptr) {
// .
Write a program that displays an AVL tree along with its balance fac.docx
This document provides code for an AVL tree implementation that:
1. Inserts nodes into the tree and rebalances it using rotations to maintain the AVL property.
2. Includes methods for searching, counting nodes, checking if the tree is empty, clearing the tree, and traversing the tree in different orders.
3. Contains a test program that uses the AVL tree to insert random numbers, perform operations on the tree, and display the results.
Given the following codepackage data1;import java.util.;p.pdf
Given the following code
package data1;
import java.util.*;
/*public class BST> implementing a set ADT and containing the following:
* private inner class BinaryNode representing a node with a (possibly) left child and a (possibly)
right child
** instance fields BinaryNode root, int size
* contains/insert/remove method - w/ O(height) complexity
** size O(1), isEmpty O(1), clear O(1),
*** findMin, findMax, findHeight methods - w/ O(height) complexity
**** toString() method printing set (in-order traversal) and the tree (BFS traversal)
**
*/
publicclass BST> {
private BinaryNode root;
privateint size;
//Search opertion of Set ADT
publicboolean contains(E value) {
return contains(root, value);
}
//Insert opertion of Set ADT
publicvoid insert(E value) {
root = insert(root, value);
size++;
}
//Remove operation of Set ADT
publicvoid remove(E value){
root = remove(root, value);
size--;
}
publicint size(){
return size;
}
publicboolean isEmpty(){
return root == null;
}
publicvoid clear(){
root = null;
size = 0;
}
public E findMin(){
return findMin(root);
}
public E findMax(){
return findMax(root);
}
publicint findHeight(){
return root.height();
}
public String toString(){
if(root == null)
return "set {} stored in an empty tree.\n";
String elements = root.inOrder().toString();
return "set {" + elements.substring(1,elements.length()-1) + "} stored in tree \n" + root;
}
private E findMin(BinaryNode node){
if(node == null)
returnnull;
if(node.left == null)
return node.element;
return findMin(node.left);
}
private E findMax(BinaryNode node){
if(node == null)
returnnull;
if(node.right == null)
return node.element;
return findMax(node.right);
}
privateboolean contains(BinaryNode node, E value) {
if (node == null)//node represents an empty substree
returnfalse;
int comparisonResult = value.compareTo(node.element);
if(comparisonResult < 0)//if value is less than root's value
return contains(node.left, value);
if(comparisonResult > 0)//if value is greater than root's value
return contains(node.right, value);
returntrue;//successful search
}
private BinaryNode insert(BinaryNode node, E value) {
if (node == null)//base case: empty tree
returnnew BinaryNode<>(value);
if (value.compareTo(node.element) < 0)
node.left = insert(node.left, value);//insert recursively to left-subtree
elseif (value.compareTo(node.element) > 0)
node.right = insert(node.right, value);//insert recursively to right-subtree
else {//duplicate value cannot be inserted in a BST implementing the Set ADT
size--;//insertion failed!
//System.out.print("BST.insert: Warning: " + value + " is already stored in the tree \n" + node);
}
return node;
}
private BinaryNode remove(BinaryNode node, E value) {
if (node == null) {//base case: empty tree
System.out.println("BST.remove: Warning: " + value + " doesn't exist in the tree.");
size++;//removal failed!
return node;
}
if (value.compareTo(node.element) < 0)
node.left = remove(node.left, value);
elseif (value.compareTo(node.element) > 0)
node.right = remov.
Create a class BinarySearchTree- A class that implements the ADT binar.pdf
Create a class BinarySearchTree. A class that implements the ADT binary search tree by
extending BinaryTree. Recursive version.
public class BinarySearchTree<T extends Comparable<? super T>>
extends BinaryTree<T> implements SearchTreeInterface<T>
{
public BinarySearchTree ()
{
super();
} // end default constructor
public BinarySearchTree (T rootEntry)
{
super();
setRootNode(new BinaryNode<>(rootEntry));
} // end constructor
public void setTree (T rootData) // Disable setTree (see Segment 25.6)
{
throw new UnsupportedOperationException();
} // end setTree
public void setTree (T rootData, BinaryTreeInterface<T> leftTree, BinaryTreeInterface<T>
rightTree)
{
throw new UnsupportedOperationException();
} // end setTree
//...
public T remove (T entry)
{
ReturnObject oldEntry = new ReturnObject(null);
BinaryNode<T> newRoot = removeEntry(getRootNode(), entry, oldEntry);
setRootNode(newRoot);
return oldEntry.get();
} // end remove
//...
private class ReturnObject
{
private T item;
private ReturnObject(T entry)
{
item = entry;
} // end constructor
public T get()
{
return item;
} // end get
public void set(T entry)
{
item = entry;
} // end set
} // end ReturnObject
} // end BinarySearchTree
HERE IS BinaryTree.java
import java.util.Iterator;
import java.util.NoSuchElementException;
public class BinaryTree<T> implements BinaryTreeInterface<T> {
private BinaryNode<T> root;
public BinaryTree() {
root = null;
}
public BinaryTree(T rootData) {
root = new BinaryNode<>(rootData);
}
public BinaryTree(T rootData, BinaryTree<T> leftTree, BinaryTree<T> rightTree) {
privateSetTree(rootData, leftTree, rightTree);
}
private void privateSetTree(T rootData, BinaryTree<T> leftTree, BinaryTree<T>
rightTree) {
root = new BinaryNode<>(rootData);
if (leftTree != null && !leftTree.isEmpty()) {
root.setLeftChild(leftTree.root);
}
if (rightTree != null && !rightTree.isEmpty()) {
if (rightTree != leftTree) {
root.setRightChild(rightTree.root);
} else {
root.setRightChild(rightTree.root.copy());
}
}
if (leftTree != null && leftTree != this) {
leftTree.clear();
}
if (rightTree != null && rightTree != this) {
rightTree.clear();
}
}
@Override
public T getRootData() {
if (isEmpty()) {
throw new EmptyTreeException("The tree is empty.");
}
return root.getData();
}
@Override
public int getHeight() {
return root.getHeight();
}
@Override
public int getNumberOfNodes() {
return root.getNumberOfNodes();
}
@Override
public boolean isEmpty() {
return root == null;
}
@Override
public void clear() {
root = null;
}
@Override
public Iterator<T> getPreorderIterator() {
return new PreorderIterator();
}
@Override
public Iterator<T> getInorderIterator() {
return new InorderIterator();
}
@Override
public Iterator<T> getPostorderIterator() {
return new PostorderIterator();
}
private class PreorderIterator implements Iterator<T> {
private StackInterface<BinaryNode<T>> nodeStack;
public PreorderIterator() {
nodeStack = new LinkedStack<>();
if (root != null) {
nodeStack.push(root);
}
}
public boolean hasNex.
srcArtifact.javasrcArtifact.javaclassArtifactextendsCave{pub.docx
src/Artifact.javasrc/Artifact.javaclassArtifactextendsCave{
publicint creatureIndex =0;
publicArtifact(int index,String type,int creatureIndex){
super(type, index);
this.creatureIndex = creatureIndex;
}
@Override
publicString toString(){
// Return neater output of the class data
return"[Artifact]: \n\tOwner Index = "
+Integer.toString(this.creatureIndex)
+" \n\tArtifact Type = "+this.type;
}
}
src/Cave.javasrc/Cave.javapublicclassCave{
publicint index =0;
publicString type =null;
publicString name =null;
/***
* Constructor
* @param index
*/
publicCave(int index){
this.index = index;
}
publicCave(int index,String type,String name){
this.index = index;
this.type = type;
this.name = name;
}
publicCave(int index,String name){
this.index = index;
this.name = name;
}
publicCave(String type,int index){
this.index = index;
this.type = type;
}
}
src/Creature.javasrc/Creature.javaimport java.awt.BorderLayout;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.ArrayList;
import javax.swing.JButton;
import javax.swing.JFrame;
import javax.swing.JLabel;
import javax.swing.JOptionPane;
import javax.swing.JPanel;
import javax.swing.JProgressBar;
classCreatureextendsCaveimplementsActionListener,Runnable{
publicint partyIndex =0;
publicint empathyValue;
publicint fearValue;
publicdouble carryingCapacity;
publicint age;
publicint weight;
publicdouble height;
publicArrayList<Treasure> treasures =newArrayList<Treasure>();
publicArrayList<Artifact> artifacts =newArrayList<Artifact>();
publicArrayList<Jobs> jobs =newArrayList<Jobs>();
publiclong jobTime =0;
publicJobs currentJob =null;
publicvolatileboolean runJob =false;
publicvolatileboolean cancelJob =false;
JButton cancelButton =newJButton("Cancel Job");
JButton startButton =newJButton("Start Job");
publicCreature(int index,String type,String name,int partyIndex,
int empathyValue,int fearValue,double carryingCapacity){
super(index, type, name);
this.partyIndex = partyIndex;
this.empathyValue = empathyValue;
this.fearValue = fearValue;
this.carryingCapacity = carryingCapacity;
}
publicCreature(int index,String type,String name,int partyIndex,
int empathyValue,int fearValue,double carryingCapacity,int age,
int weight,double height){
super(index, type, name);
this.partyIndex = partyIndex;
this.empathyValue = empathyValue;
this.fearValue = fearValue;
this.carryingCapacity = carryingCapacity;
this.age = age;
this.weight = weight;
this.height = height;
}
publicvoid addTreature(Treasure t){
if(t !=null&& t instanceofTreasure&& t.creatureIndex !=0){
this.treasures.add(t);
}
}
publicvoid addArtifact(Artifact a){
if(a !=null&& a instanceofArtifact&& a.creatureIndex !=0){
this.artifacts.add(a);
}
}
@Override
publicString toString(){
String output ="";
output +="[Creature]: \n\tType = "+this.type +" \n\tName = "
+this.name +" \n\tParty Index = "
+Integer.toString(this.partyIndex)+" \n\tEmpathy Value = "
+Integer.toString(this.empathyV.
Miracle of std lib
The document demonstrates the use of Kotlin collection functions like filter, map, flatMap, groupBy, sortedBy etc on sample data models of Category and Product. It shows how to search for one item, filter, map, group collections and sort data. Advanced techniques include filtering, mapping price with VAT, flattening category subcategories, grouping by category, sorting by price etc.
import java-util--- public class MyLinkedList{ public static void.pdf
import java.util.*; public class MyLinkedList{ public static void main(String[] args){ } } //copy
MyList to here interface MyList extends Collection { /* MyList will inherite all methods from
Collection public boolean add(E e); public boolean addAll(Collection extends E> c); public void
clear(); public boolean contains(Object o); public boolean containsAll(Collection> c); public
boolean isEmpty(); public boolean remove(Object o); public boolean removeAll(Collection> c);
public boolean retainAll(Collection> c); public int size(); public Object[] toArray(); public T[]
toArray(T[] arr); */ //abstract method public void add(int index, E e); public E get(int index);
public int indexOf(Object e); public int lastIndexOf(E e); public E remove(int index); public E
set(int index, E e); //default method @Override public default boolean add(E e){ add(size(), e);
return true; } @Override public default boolean isEmpty(){ return size()==0; } @Override
public default boolean remove(Object e){ if(indexOf(e) >= 0){ remove(indexOf(e)); return true;
} else{ return false; } } @Override public default boolean containsAll(Collection> c){
for(Object e : c){ if(!contains(e)){ return false; } } return true; } @Override public default
boolean addAll( Collection extends E> c){ for(E e : c){ add(e); } return true; } /* removeAll:
this[1,1,2,3] c[1,2,4] this.removeAll(c) [3] */ @Override public default boolean removeAll(
Collection> c){ for(Object e : c){ while(contains(e)){ this.remove(e); } } return true; } /*
retainAll this[1,1,2,3] c[1,2,4] this.retainAll(c) [1,1,2] */ @Override public default boolean
retainAll( Collection> c){ for(E e : this){ if(!c.contains(e)){ this.remove(e); } } return true; }
@Override public default Object[] toArray(){ Object[] results = new Object[size()]; int i = 0;
for(E e : this){ results[i++] = e; } return results; } /* T[] array */ @Override public default T[]
toArray(T[] array){ int i = 0; for(E e : this){ array[i++] = (T)e; } return array; } } class
TwoWayLinkedList implements MyList { //inner static class Node public class Node { E
element; Node next; Node previous; public Node(E e){ element = e; } } private Node head, tail;
private int size = 0; public TwoWayLinkedList(){ /* head = null; tail = null; size = 0; */ } public
TwoWayLinkedList(E[] objects){ } public E getFirst(){ return null; } public E getLast(){ return
null; } public void addFirst(E e){ } public void addLast(E e){ } public E removeFirst(){ return
null; } public E removeLast(){ return null; } @Override public void add(int index, E e){ }
@Override public E remove(int index){ return null; } @Override public void clear(){ }
@Override public boolean contains(Object e){ return false; } @Override public E get(int index){
return null; } @Override public int indexOf(Object e){ return -1; } @Override public int
lastIndexOf(Object e){ return -1; } @Override public E set(int index, E e){ return null; }
@Override public int size(){ return size; } //toString() @Override public String.
in this assignment you are asked to write a simple driver program an.pdf
in this assignment you are asked to write a simple driver program and set of functions (maybein
a library) that can be performed on a binary search tree.
Your program should allow user to insert/delete integer values into the binary search tree along
with several other operations on the binary search tree. You can use the code given in slides. But
this time your key will be int! Specifically, your program will ask user to enter a command and
related parameters (if any) in a loop, and then perform the given commands. Here is the list of
commands that your program must implement:
* insert
*find\'
*delete
*list inorder
*list preorder
*list postorder
*list levelorder
* max
* min
* height
*count
* sum
*quit
As always, make sure you release (free) the dynamically allocated memories if you allocate any
memory in your programs. So, before submitting your program, run it with valgrind to see if
there is any memory leakage
//my proggram in C
struct tree_node {
int data;
struct tree_node *left, *right;
}
typedef struct nodeT {
int key;
struct nodeT *left, *right;
} nodeT, *treeT;
int main(){
while (TRUE) {
printf(\"> \");
line = GetLine();
ch = toupper(line[0]);
switch (ch) {
case \'I\': insert(); break;
case \'F\': find(); break;
case \'D\': delete(); break;
case \'LI\': listInorder; break;
case \'LPR\': listPreorder(); break;
case \'LPO\': listPostorder(); break;
case \'MAX\': max(); break;
case \'min\': min(); break;
case \'H\': height(); break;
case \'C\': count(); break;
case \'S\': sum(); break;
case \'Q\': exit(0);
default:printf(\"Illegal command\ \"); break;
}
}
}
nodeT *FindNode(nodeT *t, int key){
while(t !=NULL) {
if (key == t->key) return t;
if (key < t->key) {
t = t->left;
} else {
t = t->right;
}
return NULL;
}
void delete(nodeT **p){
nodeT
*target;
target=*p;
if (target->left==NULL && target->right==NULL) {
*p=NULL;
} else if (target->left == NULL) {
*p=target->right;
} else
if (target->right == NULL) {
*p=target->left;
} else {
/* target has two children, see next slide */
}
free(target);
}
void listInorder(nodeT *T){
if (t != NULL) {
DisplayTree(t->left);
printf(“%d “, t->key);
DisplayTree(t->right);
}
}
void listPreorder(nodeT *t) {
if (t != NULL) {
printf(“%d “, t->key);
DisplayTree(t->left);
DisplayTree(t->right);
}
}
void listPostOrder(nodeT *t){
if (t != NULL) {
DisplayTree(t->left);
DisplayTree(t->right);
printf(“%d “, t->key);
}
}
void intsert(nodeT **tptr, int key){
nodeT*t, *tmp;
t=*tptr;
if (t == NULL) {
tmp=New(nodeT*);
tmp->key = key;
tmp->left=tmp->right=NULL;
*tptr=tmp;
return;
}
if (key < t->key) {
InsertNode
(&t->left, key);
} else {
InsertNode(&t->right, key);
}
}
int height(nodeT *t){
if (t == NULL)
return 0;
else
return (1 + maximumof(
height(t->left),
height(t->right)) );
}
int sum(struct tree_node *p){
if (p == NULL)
return 0;
else
return (p->data +
sum(p->left) +
sum(p->right) );
}
Solution
1. /*
2. * Java Program to Implement Binary Search Tree
3. */
4.
5. import java.util.Scanner;
6.
7. /* Class BSTNode */
8. cl.
Modify HuffmanTree.java and HuffmanNode.java to allow the user to se.pdf
Modify HuffmanTree.java and HuffmanNode.java to allow the user to select the value of n 9 to
construct an n ary Huffman Tree. Once finished, verify the accuracy of your tree by running it
for the English Alphabet for n = 3, 4, 5, 6, 7, 8, 9. For each value of n, compute the average
codeword length. Write these in a table (n vs. ACW L(Cn)).
/ HuffmanTree.java
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.Scanner;
public class HuffmanTree {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
System.out.print(\"Enter the file name: \");
String fileName = in.nextLine();
ArrayList nodes = new ArrayList<>();
ArrayList temp = new ArrayList<>();
try {
Scanner fin = new Scanner(new FileReader(fileName));
String symbol;
double prob;
while(fin.hasNext()){
symbol = fin.next();
prob = fin.nextDouble();
nodes.add(findInsertIndex(nodes, prob), new HuffmanNode(symbol, prob));
}
fin.close();
temp.addAll(nodes);
HuffmanNode root = createHuffmanTree(temp);
setCodeWords(root);
double avg = 0;
for (HuffmanNode node : nodes) {
System.out.println(node.getS() + \": \" + node.getC() + \": \" + node.getL());
avg += node.getL();
}
if(avg != 0)
avg /= nodes.size();
System.out.println(\"Average code length is: \" + avg);
} catch (FileNotFoundException e) {
e.printStackTrace();
}
}
private static HuffmanNode createHuffmanTree(ArrayList nodes){
HuffmanNode root = null;
if(nodes.size() > 0) {
HuffmanNode node0, node1, node;
while (nodes.size() > 1) {
node0 = nodes.get(0);
node1 = nodes.get(1);
node = new HuffmanNode(null, node0.getP() + node1.getP());
node.setLeft(node0);
node.setRight(node1);
nodes.remove(0);
nodes.remove(0);
nodes.add(findInsertIndex(nodes, node.getP()), node);
}
root = nodes.get(0);
}
return root;
}
private static void setCodeWords(HuffmanNode root){
if(root != null){
setCodeWords(root, \"\");
}
}
private static void setCodeWords(HuffmanNode root, String codeWord){
if(root.getS() != null){
root.setC(codeWord);
root.setL(codeWord.length());
}
else{
setCodeWords(root.getLeft(), codeWord + \"0\");
setCodeWords(root.getRight(), codeWord + \"1\");
}
}
private static int findInsertIndex(ArrayList nodes, double prob){
for(int i = 0; i < nodes.size(); ++i){
if(prob < nodes.get(i).getP()){
return i;
}
}
return nodes.size();
}
}
// HuffmanNode.java
public class HuffmanNode {
private String S;
private double P;
private String C;
private int L;
private HuffmanNode left, right;
public HuffmanNode(String s, double p) {
S = s;
P = p;
}
public String getS() {
return S;
}
public void setS(String s) {
S = s;
}
public double getP() {
return P;
}
public void setP(double p) {
P = p;
}
public String getC() {
return C;
}
public void setC(String c) {
C = c;
}
public int getL() {
return L;
}
public void setL(int l) {
L = l;
}
public HuffmanNode getLeft() {
return left;
}
public void setLeft(HuffmanNode left) {
this.left = left;
}
public HuffmanNode getRight() {
return right;
}
public void se.
Blocks+gcd入門
The document contains code snippets demonstrating the use of blocks and Grand Central Dispatch (GCD) in C. It shows examples of creating and using blocks, dispatch queues, dispatch groups, semaphores, and other GCD features for concurrency and parallelism.
I dont know what is wrong with this roulette program I cant seem.pdf
I don\'t know what is wrong with this roulette program I can\'t seem to get it to run.
Game Class:
public class Game {
public static void main(String[] args) {
Table table = new Table();
BinBuilder bb = new BinBuilder();
Outcome black = new Outcome(\"Black\", 35);
Bet bet = new Bet(10, black);
table.placeBet(bet);
Bin bin = bb.wheel.get(8);
System.out.println(bin.toString());
System.out.println(table.bets.toString());
System.out.println(black.toString());
ListIterator i = table.bets.listIterator();
Iterator b = bin.outcomes.iterator();
while(i.hasNext()) {
System.out.println(i.next().outcome.name.toString());
while(b.hasNext()){
System.out.println(b.next().name.toString());
if(i.next().outcome.equals(b.next())){
System.out.println(\"Win!\");
}
else{
System.out.println(\"Win :/\");
}
}
}
}
}
Player Class
public class Player {
public Table table;
public Outcome black;
public Bet bet;
public Player(Table table) {
table = new Table();
black = new Outcome(\"Black\", 1);
}
void placeBets() {
Bet bet = new Bet(100, black);
table.placeBet(bet);
}
void win(Bet bet) {
System.out.println(\"You\'ve won: \" + bet.winAmount());
}
void lose(Bet bet) {
System.out.println(\"You lost!\" + bet.loseAmount() + \":/\");
}
}
Outcome class
public class Outcome implements Comparable {
public String name;
public int odds;
public Outcome(String name, int odds){
this.name = name;
this.odds = odds;
}
public int winAmount(int amount){
return amount*this.odds;
}
public boolean equals(Outcome other){
return (this.name.equals(other.name));
}
public String toString() {
Object[] values= { name, new Integer(odds) };
String msgTempl= \"{0} ({1}:1)\";
return MessageFormat.format( msgTempl, values );
}
@Override
public int compareTo(E arg0) {
if(this.equals(arg0)){
return 0;
}
return 1;
}
}
Table Class
public class Table {
public int limit = 1000;
public LinkedList bets;
public Table() {
bets = new LinkedList();
}
public boolean isValid(Bet bet) {
int sum = 0;
for(Bet bett: bets) {
sum += bett.amountBet;
}
return (sum>limit);
}
public void placeBet(Bet bet) {
bets.add(bet);
}
ListIterator iterator() {
return bets.listIterator();
}
}
Wheel Class
public class Wheel extends TreeSet {
Vector bins;
NonRandom rng;
Set all_outcomes;
Wheel(NonRandom rng){
this.rng = rng;
rng = new NonRandom();
all_outcomes = new TreeSet();
bins = new Vector(38);
for (int i=0; i<38; i++){
bins.add(i, new Bin());
}
}
Bin next(){
int rand = rng.next(38);
return bins.elementAt(rand);
}
Bin get(int bin){
return bins.elementAt(bin);
}
public Outcome getOutcome( String name ){
TreeSet result= new TreeSet();
for( Iterator i = all_outcomes.iterator(); i.hasNext(); ) {
Outcome oc= i.next();
if( oc.name.contains(name) ) {result.add( oc );}
}
return result.first();
}
public void addOutcome(int bin, Outcome outcome) {
all_outcomes.add(outcome);
this.bins.elementAt(bin).add(outcome);
}
}
Bet Class
public class Bet {
public int amountBet;
public Outcome outcome;
public Bet(int amount, Outcome outcome) {
this.outcome = o.
PHPUnit でよりよくテストを書くために
The document defines a fib function that recursively calculates Fibonacci numbers and prints the 10th Fibonacci number. It then defines some unit tests for a Calculator class that test the add method by asserting the expected result. Finally, it defines some unit tests for a User class that test validating a user object.
ANSimport java.util.Scanner; class Bina_node { Bina_node .pdf
This document contains Java code that defines a binary tree class with methods for inserting nodes, searching for values, counting nodes, checking if the tree is empty, and traversing the tree in preorder, inorder and postorder manners. A main method is included that allows a user to test the binary tree operations by selecting options from a menu to insert nodes, search, count nodes or check emptiness and displays the results of tree traversals.
6. Generics. Collections. Streams
This document discusses Java generics, collections, streams and related concepts. It provides code examples of:
- Defining generic classes and methods
- Using common collection interfaces like List, Set, Map and their implementations
- Working with streams to perform operations on data in a declarative way
- Using lambda expressions and functional interfaces with streams
import java.util.Scanner;class BinaryNode{ BinaryNode left.pdf
This Java program defines classes to represent nodes and binary search trees. It implements methods to insert, delete, search for nodes in the tree as well as traverse the tree using inorder, preorder and postorder traversal. The main method tests the binary search tree operations by prompting the user to insert, delete, search for nodes and check if the tree is empty.
Here is the code given in the instructionsclass AVL {.pdf
Here is the code given in the instructions:
class AVL {
Node root;
private class Node {
int data;
Node left, right;
int height;
private Node(int D, Node L, Node R, int H) {
data=D;
left=L;
right=R;
height=H; // user has to set height
} // of constructor Node
} //of Node
static private void UpdateHeight(Node T) {
if (T ==null) return;
else T.height = Math.max(HEIGHT(T.left),HEIGHT(T.right)) + 1;
} // UPdate Height
static private int HEIGHT(Node T) {
if (T== null ) return(-1);
else return (T.height);
}
// we need to more our right child up
static private Node LeftRotate(Node T) {
System.out.println(\"left rotate with data \" + T.data);
Node Tr;
Tr=T.right; // right child
T.right=Tr.left; // our right child IS NOW hhh
Tr.left=T; // move T down to the left
UpdateHeight(Tr.left); // update the height of T
UpdateHeight(Tr); // update hte height of the new root
return Tr;
} // of LeftRotate
// we move our immediate left node up.
// in doing so, we are now immediat right of our left child
static private Node RightRotate(Node T) {
Node Tl;
System.out.println(\"left rotate with data \" + T.data);
Tl=T.left; // left child
T.left=Tl.right; // our left child is now what our left was pointing to
Tl.right=T; // move T down to the right
UpdateHeight(Tl.right); // update the height of T
UpdateHeight(Tl); // update hte height of the new root
return Tl;
} // of RightRotate
public AVL() {
root=null;
} // of constructor AVL
// method to allow external entity to insert an element into the tree
public void insert(int D)
{
root=insert_internal(D, root);
} // of insert
private Node insert_internal(int D, Node T) {
if (T==null) return( new Node (D, null, null, 0));
if (T.data == D) return T; // the data is already in there
if ( D < T. data ) // go left
{ if (T.left == null)
{
T.left = insert_internal(D,null);
UpdateHeight(T);
}
else { //interior node
T.left = insert_internal(D, T.left);
}
} // of go left
else // D goes to the right
{ if (T.right == null)
{
T.right = insert_internal(D,null);
UpdateHeight(T);
}
else { //interior node
T.right = insert_internal(D, T.right);
}
} // of go right
// now we have to figure out if things are out of
// balance
int diff= HEIGHT(T.right) - HEIGHT(T.left);
System.out.println(\"difference is \" + diff + \" data is \" + T.data);
if ( Math.abs(diff) <= 1) // we are good to go at this level
{
UpdateHeight(T);
return(T);
}
// only if diff is bigger than 1
if ( diff > 1)// right leaning
{ // look at right child and figure out how it is leaning
} // of right leaning
else // left leaning
{ // look at left child to see how it is leaning
Node child = T.left;
int cdiff;
cdiff = HEIGHT(child.right) - HEIGHT(child.left);
System.out.println(\"cdiff is \" + cdiff);
if ( cdiff < 0 ) // left left lean
{ T=RightRotate(T); }
else
{
System.out.println(\"SHAUN\");
preorder_internal(T);
T.left = LeftRotate(T.left);
System.out.println(\"SHAUN\");
preorder_internal(T);
T=RightRotate(T);
}
} // of left leaning
// at this point we have rotated, so we need to.
Reactive programming on Android
The document discusses reactive programming and how it can be used on Android. It explains that reactive programming uses observable sequences and asynchronous data flows. It introduces RxJava as a library for reactive programming that uses Observables to compose flows of asynchronous data. It provides examples of how RxJava can be used on Android to perform background tasks, handle errors and activity lifecycles, load images asynchronously, and create and transform Observables.
Complete the C++ program and implement the routines that are not .docx
The document describes a C++ program that implements a binary tree data structure with various node-related methods like insertion, searching, and traversal. It includes class definitions for the tree nodes (TreeStruct), the overall tree (Tree), and auxiliary stack and queue classes. Many methods are only declared, leaving their implementation incomplete. The main() function tests the various methods by building a sample tree and printing outputs.
Complete the C++ program and implement the routines that are not .docx
The document describes a C++ program that implements a binary tree data structure with various methods. It includes class definitions for a tree node (TreeStruct), the tree itself (Tree), and stacks and queues used in tree traversals. Many methods of the Tree class are only declared, leaving them to be implemented. The main() function inserts nodes into a sample tree and tests various tree operations. It provides output examples to check if the implemented methods are working correctly.
RxJava и Android. Плюсы, минусы, подводные камни
Ярослав Герьятович
Android Engineer в компании Attendify . Спикер на UA Mobile'14 . Идеолог функционального и реактивного подхода в проектировании Android приложений.
About java
This document provides an overview and agenda for a presentation about Java. It discusses Java history, object-oriented programming concepts like classes and interfaces, inheritance and polymorphism, exception handling, primitive types and wrappers, inner classes, generics, and new features introduced since Java 5 such as varargs, enhanced for loops, annotations, and auto boxing/unboxing. The presentation covers these topics over multiple slides with code examples.
import javautilQueue import javautilLinkedList import .pdf
import java.util.Queue;
import java.util.LinkedList;
import java.util.NoSuchElementException;
public class BinaryTree<T extends Comparable<T>> {
BTNode root;
public BinaryTree() {
root = null;
}
public BinaryTree(BTNode root) {
root = null;
}
public void purge(){
root = null;
}
public boolean isEmpty(){
return root == null;
}
public void insert(T key){
if (root == null) {
root = new BTNode(key);
return;
}
BTNode temp;
Queue<BTNode> q = new LinkedList<BTNode>();
q.add(root);
// Do level order traversal until we find the first empty left or right child.
while (!q.isEmpty()) {
temp = q.poll();
if (temp.left == null) {
temp.left = new BTNode(key);
break;
}
else
q.add(temp.left);
if (temp.right == null) {
temp.right = new BTNode(key);
break;
}
else
q.add(temp.right);
}
}
// delete by copying last node
public void deleteByCopying(T data){
if(root == null)
throw new UnsupportedOperationException("Tree is empty!");
else if(root.left == null && root.right == null){
if(root.data.equals(data))
root = null;
else
throw new NoSuchElementException(data + " not in the tree.");
return;
}
Queue<BTNode> queue = new LinkedList<BTNode>();
queue.add(root);
BTNode keyNode = null;
BTNode currentNode = null;
BTNode parentNode = root;
boolean found = false;
while(! queue.isEmpty()){
currentNode = queue.poll();
if(currentNode.data.equals(data)){
if(! found){
keyNode = currentNode;
found = true;
}
}
if(currentNode.left != null){
queue.add(currentNode.left);
parentNode = currentNode;
}
if(currentNode.right != null){
queue.add(currentNode.right);
parentNode = currentNode;
}
}
if(! found)
throw new NoSuchElementException(data + " not in tree.");
while(! queue.isEmpty()){
currentNode = queue.poll();
System.out.print(currentNode.data + " ");
if(currentNode.left != null){
queue.add(currentNode.left);
parentNode = currentNode;
}
if(currentNode.right != null){
queue.add(currentNode.right);
parentNode = currentNode;
}
}
keyNode.data = currentNode.data;
if(parentNode.left == currentNode)
parentNode.left = null;
else if(parentNode.right == currentNode)
parentNode.right = null;
}
public void levelOrderTraversal(){ // BreadthFirstTraversal
levelOrderTraversal(root);
}
// BreadthFirst Traversal
protected void levelOrderTraversal(BTNode root){
if(root == null)
return;
Queue<BTNode> queue = new LinkedList<BTNode>();
BTNode node = root;
queue.add(node);
while(! queue.isEmpty()){
node = queue.poll();
visit(node);
if(node.left != null)
queue.add(node.left);
if(node.right != null)
queue.add(node.right);
}
}
public void levelOrderTraversalByLevels(){
levelOrderTraversalByLevels(root);
}
protected void levelOrderTraversalByLevels(BTNode<T> root){
Queue q = new LinkedList();
int levelNodes = 0;
if(root==null)
return;
q.add(root);
while(!q.isEmpty()){
levelNodes = q.size();
while(levelNodes>0){
BTNode n = (BTNode)q.remove();
System.out.print(" " + n.data);
if(n.left!=null)
q.add(n.left);
if(n.right!=null)
q.add(n.right);
levelNodes--;
}
System.out.println("");
}
}
protected void visit(BTNode<T.
5. Design and implement a method contains 2 for BinarySearchTree, fu.pdf
5. Design and implement a method contains 2 for BinarySearchTree, functionall equivalent to
the contains method, that does not use recursion.
show the driver code and do this in java
this is the binarysearchtree
import java.util.*; // Iterator, Comparator
public class BinarySearchTree implements BSTInterface
{
protected BSTNode root; // reference to the root of this BST
protected Comparator comp; // used for all comparisons
protected boolean found; // used by remove
public BinarySearchTree()
// Precondition: T implements Comparable
// Creates an empty BST object - uses the natural order of elements.
{
root = null;
comp = new Comparator()
{
public int compare(T element1, T element2)
{
return ((Comparable)element1).compareTo(element2);
}
};
}
public BinarySearchTree(Comparator comp)
// Creates an empty BST object - uses Comparator comp for order
// of elements.
{
root = null;
this.comp = comp;
}
public boolean isFull()
// Returns false; this link-based BST is never full.
{
return false;
}
public boolean isEmpty()
// Returns true if this BST is empty; otherwise, returns false.
{
return (root == null);
}
public T min()
// If this BST is empty, returns null;
// otherwise returns the smallest element of the tree.
{
if (isEmpty())
return null;
else
{
BSTNode node = root;
while (node.getLeft() != null)
node = node.getLeft();
return node.getInfo();
}
}
public T max()
// If this BST is empty, returns null;
// otherwise returns the largest element of the tree.
{
if (isEmpty())
return null;
else
{
BSTNode node = root;
while (node.getRight() != null)
node = node.getRight();
return node.getInfo();
}
}
private int recSize(BSTNode node)
// Returns the number of elements in subtree rooted at node.
{
if (node == null)
return 0;
else
return 1 + recSize(node.getLeft()) + recSize(node.getRight());
}
public int size()
// Returns the number of elements in this BST.
{
return recSize(root);
}
public int size2()
// Returns the number of elements in this BST.
{
int count = 0;
if (root != null)
{
LinkedStack> nodeStack = new LinkedStack>();
BSTNode currNode;
nodeStack.push(root);
while (!nodeStack.isEmpty())
{
currNode = nodeStack.top();
nodeStack.pop();
count++;
if (currNode.getLeft() != null)
nodeStack.push(currNode.getLeft());
if (currNode.getRight() != null)
nodeStack.push(currNode.getRight());
}
}
return count;
}
private boolean recContains(T target, BSTNode node)
// Returns true if the subtree rooted at node contains info i such that
// comp.compare(target, i) == 0; otherwise, returns false.
{
if (node == null)
return false; // target is not found
else if (comp.compare(target, node.getInfo()) < 0)
return recContains(target, node.getLeft()); // Search left subtree
else if (comp.compare(target, node.getInfo()) > 0)
return recContains(target, node.getRight()); // Search right subtree
else
return true; // target is found
}
public boolean contains (T target)
// Returns true if this BST contains a node with info i such that
// comp.compare(target, i) == 0; otherwise, re.
Create a java project that - Draw a circle with three random init.pdf
Create a java project that:
- Draw a circle with three random initial points on the circle.
- Link the points to form a triangle.
- Print the angles values in the triangle.
- Use the mouse to drag a point along the perimeter of the circle. As you drag it, the triangle and
angles are redisplayed dynamically.
Here is the formula to compute angles:
A = acos((a * a - b * b - c * c) / (-2 * b * c))
B = acos((b * b - a * a - c * c) / (-2 * a * c))
C = acos((c * c - b * b - a * a) / (-2 * a * b))
Solution
@Suppresswarnings(\"WeakerAccess\")
public class DragPoints extends Application {
@Override
public void start(Stage primaryStage) {
final PointPane pane = new PointPane(640, 480);
pane.setStyle(\"-fx-background-color: wheat;\");
Label label = new Label(\"Click and drag the points.\");
BorderPane borderPane = new BorderPane(pane);
BorderPane.setAlignment(label, Pos.CENTER);
label.setPadding(new Insets(5));
borderPane.setBottom(label);
Scene scene = new Scene(borderPane);
primaryStage.setTitle(\"Exercise15_21\");
primaryStage.setScene(scene);
primaryStage.show();
}
private class PointPane extends Pane {
final Circle circle = new Circle();
final Vertex[] v = new Vertex[3];
final int strokeWidth = 2;
final Color circleStroke = Color.GRAY, legStroke = Color.BLACK;
@SuppressWarnings(\"SameParameterValue\")
PointPane(double w, double h) {
this.setPrefSize(w, h);
this.setWidth(w);
this.setHeight(h);
circle.setStroke(circleStroke);
circle.setFill(Color.TRANSPARENT);
circle.setStrokeWidth(strokeWidth);
circle.radiusProperty().bind(this.heightProperty().multiply(0.4));
circle.centerXProperty().bind(this.widthProperty().divide(2));
circle.centerYProperty().bind(this.heightProperty().divide(2));
this.getChildren().add(circle);
for (int i = 0; i < v.length; i++) {
v[i] = new Vertex(circle, 2 * Math.PI / v.length * (i + Math.random()));
v[i].radiusProperty().bind(circle.radiusProperty().divide(10));
v[i].setPosition();
v[i].setStroke(new Color(i == 0 ? 1 : 0, i == 1 ? 1 : 0, i == 2 ? 1 : 0, 1));
v[i].setFill(Color.TRANSPARENT);
v[i].setStrokeWidth(strokeWidth);
this.getChildren().add(v[i]);
v[i].setOnMouseDragged(new EventHandler() {
@Override
public void handle(MouseEvent event) {
int i;
for (i = 0; i < v.length; i++)
if (v[i] == event.getSource())
break;
v[i].setAngle(event.getX(), event.getY());
moveUpdate((Vertex) event.getSource());
}
});
}
for (int i = 0; i < v.length; i++) {
int j = i + 1 < v.length ? i + 1 : 0;
int k = j + 1 < v.length ? j + 1 : 0;
v[i].bindLeg(v[j], v[k]);
v[i].leg.setStroke(legStroke);
v[i].leg.setStrokeWidth(strokeWidth);
this.getChildren().add(v[i].leg);
this.getChildren().add(v[i].text);
}
for(DoubleProperty p: new DoubleProperty[]
{circle.radiusProperty(), circle.centerXProperty(), circle.centerYProperty()})
p.addListener(new ResizeListener());
moveUpdate(v[0]);
}
void moveUpdate(Vertex vert) {
vert.setPosition();
double[] legLength = new double[3];
for (int i = 0; i < v.length; i++)
legLength[i] = v[i].getLegLength();
for (int i = .
Here is the following code mentioned in the instructions.pdf
Here is the following code mentioned in the instructions:
class AVL {
Node root;
private class Node {
int data;
Node left, right;
int height;
private Node(int D, Node L, Node R, int H) {
data=D;
left=L;
right=R;
height=H; // user has to set height
} // of constructor Node
} //of Node
static private void UpdateHeight(Node T) {
if (T ==null) return;
else T.height = Math.max(HEIGHT(T.left),HEIGHT(T.right)) + 1;
} // UPdate Height
static private int HEIGHT(Node T) {
if (T== null ) return(-1);
else return (T.height);
}
// we need to more our right child up
static private Node LeftRotate(Node T) {
System.out.println(\"left rotate with data \" + T.data);
Node Tr;
Tr=T.right; // right child
T.right=Tr.left; // our right child IS NOW hhh
Tr.left=T; // move T down to the left
UpdateHeight(Tr.left); // update the height of T
UpdateHeight(Tr); // update hte height of the new root
return Tr;
} // of LeftRotate
// we move our immediate left node up.
// in doing so, we are now immediat right of our left child
static private Node RightRotate(Node T) {
Node Tl;
System.out.println(\"left rotate with data \" + T.data);
Tl=T.left; // left child
T.left=Tl.right; // our left child is now what our left was pointing to
Tl.right=T; // move T down to the right
UpdateHeight(Tl.right); // update the height of T
UpdateHeight(Tl); // update hte height of the new root
return Tl;
} // of RightRotate
public AVL() {
root=null;
} // of constructor AVL
// method to allow external entity to insert an element into the tree
public void insert(int D)
{
root=insert_internal(D, root);
} // of insert
private Node insert_internal(int D, Node T) {
if (T==null) return( new Node (D, null, null, 0));
if (T.data == D) return T; // the data is already in there
if ( D < T. data ) // go left
{ if (T.left == null)
{
T.left = insert_internal(D,null);
UpdateHeight(T);
}
else { //interior node
T.left = insert_internal(D, T.left);
}
} // of go left
else // D goes to the right
{ if (T.right == null)
{
T.right = insert_internal(D,null);
UpdateHeight(T);
}
else { //interior node
T.right = insert_internal(D, T.right);
}
} // of go right
// now we have to figure out if things are out of
// balance
int diff= HEIGHT(T.right) - HEIGHT(T.left);
System.out.println(\"difference is \" + diff + \" data is \" + T.data);
if ( Math.abs(diff) <= 1) // we are good to go at this level
{
UpdateHeight(T);
return(T);
}
// only if diff is bigger than 1
if ( diff > 1)// right leaning
{ // look at right child and figure out how it is leaning
} // of right leaning
else // left leaning
{ // look at left child to see how it is leaning
Node child = T.left;
int cdiff;
cdiff = HEIGHT(child.right) - HEIGHT(child.left);
System.out.println(\"cdiff is \" + cdiff);
if ( cdiff < 0 ) // left left lean
{ T=RightRotate(T); }
else
{
System.out.println(\"SHAUN\");
preorder_internal(T);
T.left = LeftRotate(T.left);
System.out.println(\"SHAUN\");
preorder_internal(T);
T=RightRotate(T);
}
} // of left leaning
// at this point we have rotated,.
1)(JAVA) Extend the Binary Search Tree ADT to include a public metho.pdf
The document extends a Binary Search Tree (BST) interface to include a new public method called leafCount that returns the number of leaf nodes in the tree. It also provides the BinarySearchTree and BSTInterface files that implement the BST with methods for common operations like adding and removing nodes, and traversing the tree in different orders.
ReversePoem.java ---------------------------------- public cl.pdf
ReversePoem.java :-
---------------------------------
public class ReversePoem {
/*This programs has you display a pessimistic poem from a list of phrases*/
// and then reverse the phrases to find another more optimistic poem.
public static void main(String[] args) throws Exception
{
//Queue object
MyQueue queue = new MyQueue<>();
//Stack object
MyStack stack = new MyStack<>();
//String buffer to apppend all Strings
StringBuffer sb = new StringBuffer();
// Create a single String object from the 16 Strings below
String set1 = \"I am part of a lost generation#and I refuse to believe that#\";
sb.append(set1);
String set2 = \"I can change the world#I realize this may be a shock but#\";
sb.append(set2);
String set3 = \"\'Happiness comes from within\'#is a lie, and#\";
sb.append(set3);
String set4 = \"\'Money will make me happy\'#So in 30 years I will tell my children#\";
sb.append(set4);
String set5 = \"they are not the most important thing in my life#\";
sb.append(set5);
String set6 = \"My employer will know that#I have my priorities straight because#\";
sb.append(set6);
String set7 = \"work#is more important than#family#I tell you this#\";
sb.append(set7);
String set8 = \"Once upon a time#Families stayed together#\";
sb.append(set8);
String set9 = \"but this will not be true in my era#\";
sb.append(set9);
String set10 = \"This is a quick fix society#Experts tell me#\";
sb.append(set10);
String set11 = \"30 years from now, I will be celebrating the 10th anniversary of my
divorce#\";
sb.append(set11);
String set12 = \"I do not concede that#I will live in a country of my own making#\";
sb.append(set12);
String set13 = \"In the future#Environmental destruction will be the norm#\";
sb.append(set13);
String set14 = \"No longer can it be said that#My peers and I care about this earth#\";
sb.append(set14);
String set15 = \"It will be evident that#My generation is apathetic and lethargic#\";
sb.append(set15);
String set16 = \"It is foolish to presume that#There is hope#\";
sb.append(set16);
String finalString = sb.toString();
String itmes[] = finalString.split(\"#\");
System.out.println(\"========== Original Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
queue.enqueue(itmes[i]);
System.out.println(itmes[i]);
}
for(int i = 0 ; i < itmes.length;i++){
stack.push(queue.dequeue());
}
System.out.println(\"========== Reverse Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
System.out.println(stack.pop());
}
/* You are given a list of phrases in Strings; the phrases
are separated by pound signs: \'#\':
1. Create a single String object from this list.
2. Then, split the String of phrases into an array of
phrases using the String split method.
3. Display a poem by walking through the array and
displaying each phrase one per line.
4. And, at the same time, place each phrase on a
MyQueue object using only the enqueue method.
5. After all the phrases have been placed on the queue,
transfer the phrases from the MyQueue object to a
MyS.
Chat application in java using swing and socket programming.
The document provides code for a chat application with client and server functionality. The server runs on port 1004 and handles socket connections from multiple clients. It maintains lists of connected clients and logged in user names. When a new client connects, threads are started to handle message receiving/sending and updating other clients on user name changes. The client GUI allows users to view online users, sent messages and send new messages which are broadcast to all connected clients by the server.
Question 1 (25 marks) The most recently audited Statement of Financi.pdf
Question 1 (25 marks) The most recently audited Statement of Financial Position of Papasa Ltd.
reads as follows: Papasa Ltd.
Statement of Financial Position as at 30th April 2022
Assets N$m Non-Current Assets 2 099
Land and Buildings 1 612
Plant and Equipment 412
Fixtures and Fittings 75
Current Assets 692
Inventories 215
Trade Receivables 465
Cash and Cash Equivalents 12
Total assets 2 791
Equity and Liabilities
Equity 2 112 N$ 2 Ordinary shares 500
12% N$5 Preference shares 750
Accumulated Profits 862
Non-Current Liabilities
500 8% Irredeemable Debentures 200
5% Debentures (Redeemable 30/04/2017) 300
Current LiabilitiesTrade Payables - 179
Short Term Borrowings - 179
Total equity and liabilities 2 791.
Question Please provide the links or the references where the info.pdf
Question: Please provide the links or the references where the info below was taken. Thanks!
Economic:
Economic Output: Australia's GDP was approximately 1.5 trillion USD in 2020, making it the
13th largest economy globally. Potential for Future Growth: Australia has a steady economy with
the potential for growth in various industries, including healthcare, technology, mining, and
agriculture. Ability to Attract FDI: Australia is an attractive destination for foreign direct
investment due to its stable political and economic environment, skilled workforce, and modern
infrastructure. Exchange Rate Stability: Australia has a floating exchange rate system, which
ensures that the exchange rate is determined by market forces, resulting in stability and a lack of
exchange rate risk for investors. Consumer Price Index (CPI): Australia's CPI is low, reflecting
stable economic conditions and favorable living standards. Balance of Trade: Australia has a
positive balance of trade, with exports outweighing imports, making it a favorable destination for
investors.
Politics:Ease of Doing Business: Australia is ranked 14th out of 190 countries in the World
Bank's Ease of Doing Business report for 2020, indicating that the country has a favorable
business environment. Legal and Regulatory: Australia has a well-established legal system that
provides investors with a reliable and secure environment for doing business. Additionally, the
government offers various incentives for foreign investors, making it an attractive destination for
investment. Political Stability: Australia has a stable political environment, which ensures a
predictable and safe investment climate for businesses. Intellectual Property Rights: Australia
has robust intellectual property laws that protect investors' intellectual property rights, making it
a favorable destination for investors.
Infrastructure: PhysicalEnergy: Australia has a reliable and diverse energy supply, with
renewable energy sources accounting for over 20% of the country's total electricity generation.
Telecommunications: Australia has a modern telecommunications infrastructure, including high-
speed internet and mobile networks, ensuring that businesses can communicate effectively and
efficiently.
Competence:-Labor Relations: Australia has a highly skilled workforce, with a robust education
system that produces highly qualified workers. Additionally, labor relations are relatively stable,
ensuring a reliable and productive workforce. Logistics Competence: Australia has a well-
developed logistics infrastructure, including modern ports, airports, and rail networks, making it
easy for businesses to transport goods. Educational Level: Australia has a highly educated
workforce, with a high percentage of the population having a tertiary education. Customs and
Security: Australia has a reliable and secure customs system that ensures the smooth flow of
goods and services. In conclusion, investing in Australia is a sound busines.
More Related Content
Similar to public class AVLTreeT extends ComparableT extends BSTT { p.pdf
Modify HuffmanTree.java and HuffmanNode.java to allow the user to se.pdf
Modify HuffmanTree.java and HuffmanNode.java to allow the user to select the value of n 9 to
construct an n ary Huffman Tree. Once finished, verify the accuracy of your tree by running it
for the English Alphabet for n = 3, 4, 5, 6, 7, 8, 9. For each value of n, compute the average
codeword length. Write these in a table (n vs. ACW L(Cn)).
/ HuffmanTree.java
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.Scanner;
public class HuffmanTree {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
System.out.print(\"Enter the file name: \");
String fileName = in.nextLine();
ArrayList nodes = new ArrayList<>();
ArrayList temp = new ArrayList<>();
try {
Scanner fin = new Scanner(new FileReader(fileName));
String symbol;
double prob;
while(fin.hasNext()){
symbol = fin.next();
prob = fin.nextDouble();
nodes.add(findInsertIndex(nodes, prob), new HuffmanNode(symbol, prob));
}
fin.close();
temp.addAll(nodes);
HuffmanNode root = createHuffmanTree(temp);
setCodeWords(root);
double avg = 0;
for (HuffmanNode node : nodes) {
System.out.println(node.getS() + \": \" + node.getC() + \": \" + node.getL());
avg += node.getL();
}
if(avg != 0)
avg /= nodes.size();
System.out.println(\"Average code length is: \" + avg);
} catch (FileNotFoundException e) {
e.printStackTrace();
}
}
private static HuffmanNode createHuffmanTree(ArrayList nodes){
HuffmanNode root = null;
if(nodes.size() > 0) {
HuffmanNode node0, node1, node;
while (nodes.size() > 1) {
node0 = nodes.get(0);
node1 = nodes.get(1);
node = new HuffmanNode(null, node0.getP() + node1.getP());
node.setLeft(node0);
node.setRight(node1);
nodes.remove(0);
nodes.remove(0);
nodes.add(findInsertIndex(nodes, node.getP()), node);
}
root = nodes.get(0);
}
return root;
}
private static void setCodeWords(HuffmanNode root){
if(root != null){
setCodeWords(root, \"\");
}
}
private static void setCodeWords(HuffmanNode root, String codeWord){
if(root.getS() != null){
root.setC(codeWord);
root.setL(codeWord.length());
}
else{
setCodeWords(root.getLeft(), codeWord + \"0\");
setCodeWords(root.getRight(), codeWord + \"1\");
}
}
private static int findInsertIndex(ArrayList nodes, double prob){
for(int i = 0; i < nodes.size(); ++i){
if(prob < nodes.get(i).getP()){
return i;
}
}
return nodes.size();
}
}
// HuffmanNode.java
public class HuffmanNode {
private String S;
private double P;
private String C;
private int L;
private HuffmanNode left, right;
public HuffmanNode(String s, double p) {
S = s;
P = p;
}
public String getS() {
return S;
}
public void setS(String s) {
S = s;
}
public double getP() {
return P;
}
public void setP(double p) {
P = p;
}
public String getC() {
return C;
}
public void setC(String c) {
C = c;
}
public int getL() {
return L;
}
public void setL(int l) {
L = l;
}
public HuffmanNode getLeft() {
return left;
}
public void setLeft(HuffmanNode left) {
this.left = left;
}
public HuffmanNode getRight() {
return right;
}
public void se.
Blocks+gcd入門
The document contains code snippets demonstrating the use of blocks and Grand Central Dispatch (GCD) in C. It shows examples of creating and using blocks, dispatch queues, dispatch groups, semaphores, and other GCD features for concurrency and parallelism.
I dont know what is wrong with this roulette program I cant seem.pdf
I don\'t know what is wrong with this roulette program I can\'t seem to get it to run.
Game Class:
public class Game {
public static void main(String[] args) {
Table table = new Table();
BinBuilder bb = new BinBuilder();
Outcome black = new Outcome(\"Black\", 35);
Bet bet = new Bet(10, black);
table.placeBet(bet);
Bin bin = bb.wheel.get(8);
System.out.println(bin.toString());
System.out.println(table.bets.toString());
System.out.println(black.toString());
ListIterator i = table.bets.listIterator();
Iterator b = bin.outcomes.iterator();
while(i.hasNext()) {
System.out.println(i.next().outcome.name.toString());
while(b.hasNext()){
System.out.println(b.next().name.toString());
if(i.next().outcome.equals(b.next())){
System.out.println(\"Win!\");
}
else{
System.out.println(\"Win :/\");
}
}
}
}
}
Player Class
public class Player {
public Table table;
public Outcome black;
public Bet bet;
public Player(Table table) {
table = new Table();
black = new Outcome(\"Black\", 1);
}
void placeBets() {
Bet bet = new Bet(100, black);
table.placeBet(bet);
}
void win(Bet bet) {
System.out.println(\"You\'ve won: \" + bet.winAmount());
}
void lose(Bet bet) {
System.out.println(\"You lost!\" + bet.loseAmount() + \":/\");
}
}
Outcome class
public class Outcome implements Comparable {
public String name;
public int odds;
public Outcome(String name, int odds){
this.name = name;
this.odds = odds;
}
public int winAmount(int amount){
return amount*this.odds;
}
public boolean equals(Outcome other){
return (this.name.equals(other.name));
}
public String toString() {
Object[] values= { name, new Integer(odds) };
String msgTempl= \"{0} ({1}:1)\";
return MessageFormat.format( msgTempl, values );
}
@Override
public int compareTo(E arg0) {
if(this.equals(arg0)){
return 0;
}
return 1;
}
}
Table Class
public class Table {
public int limit = 1000;
public LinkedList bets;
public Table() {
bets = new LinkedList();
}
public boolean isValid(Bet bet) {
int sum = 0;
for(Bet bett: bets) {
sum += bett.amountBet;
}
return (sum>limit);
}
public void placeBet(Bet bet) {
bets.add(bet);
}
ListIterator iterator() {
return bets.listIterator();
}
}
Wheel Class
public class Wheel extends TreeSet {
Vector bins;
NonRandom rng;
Set all_outcomes;
Wheel(NonRandom rng){
this.rng = rng;
rng = new NonRandom();
all_outcomes = new TreeSet();
bins = new Vector(38);
for (int i=0; i<38; i++){
bins.add(i, new Bin());
}
}
Bin next(){
int rand = rng.next(38);
return bins.elementAt(rand);
}
Bin get(int bin){
return bins.elementAt(bin);
}
public Outcome getOutcome( String name ){
TreeSet result= new TreeSet();
for( Iterator i = all_outcomes.iterator(); i.hasNext(); ) {
Outcome oc= i.next();
if( oc.name.contains(name) ) {result.add( oc );}
}
return result.first();
}
public void addOutcome(int bin, Outcome outcome) {
all_outcomes.add(outcome);
this.bins.elementAt(bin).add(outcome);
}
}
Bet Class
public class Bet {
public int amountBet;
public Outcome outcome;
public Bet(int amount, Outcome outcome) {
this.outcome = o.
PHPUnit でよりよくテストを書くために
The document defines a fib function that recursively calculates Fibonacci numbers and prints the 10th Fibonacci number. It then defines some unit tests for a Calculator class that test the add method by asserting the expected result. Finally, it defines some unit tests for a User class that test validating a user object.
ANSimport java.util.Scanner; class Bina_node { Bina_node .pdf
This document contains Java code that defines a binary tree class with methods for inserting nodes, searching for values, counting nodes, checking if the tree is empty, and traversing the tree in preorder, inorder and postorder manners. A main method is included that allows a user to test the binary tree operations by selecting options from a menu to insert nodes, search, count nodes or check emptiness and displays the results of tree traversals.
6. Generics. Collections. Streams
This document discusses Java generics, collections, streams and related concepts. It provides code examples of:
- Defining generic classes and methods
- Using common collection interfaces like List, Set, Map and their implementations
- Working with streams to perform operations on data in a declarative way
- Using lambda expressions and functional interfaces with streams
import java.util.Scanner;class BinaryNode{ BinaryNode left.pdf
This Java program defines classes to represent nodes and binary search trees. It implements methods to insert, delete, search for nodes in the tree as well as traverse the tree using inorder, preorder and postorder traversal. The main method tests the binary search tree operations by prompting the user to insert, delete, search for nodes and check if the tree is empty.
Here is the code given in the instructionsclass AVL {.pdf
Here is the code given in the instructions:
class AVL {
Node root;
private class Node {
int data;
Node left, right;
int height;
private Node(int D, Node L, Node R, int H) {
data=D;
left=L;
right=R;
height=H; // user has to set height
} // of constructor Node
} //of Node
static private void UpdateHeight(Node T) {
if (T ==null) return;
else T.height = Math.max(HEIGHT(T.left),HEIGHT(T.right)) + 1;
} // UPdate Height
static private int HEIGHT(Node T) {
if (T== null ) return(-1);
else return (T.height);
}
// we need to more our right child up
static private Node LeftRotate(Node T) {
System.out.println(\"left rotate with data \" + T.data);
Node Tr;
Tr=T.right; // right child
T.right=Tr.left; // our right child IS NOW hhh
Tr.left=T; // move T down to the left
UpdateHeight(Tr.left); // update the height of T
UpdateHeight(Tr); // update hte height of the new root
return Tr;
} // of LeftRotate
// we move our immediate left node up.
// in doing so, we are now immediat right of our left child
static private Node RightRotate(Node T) {
Node Tl;
System.out.println(\"left rotate with data \" + T.data);
Tl=T.left; // left child
T.left=Tl.right; // our left child is now what our left was pointing to
Tl.right=T; // move T down to the right
UpdateHeight(Tl.right); // update the height of T
UpdateHeight(Tl); // update hte height of the new root
return Tl;
} // of RightRotate
public AVL() {
root=null;
} // of constructor AVL
// method to allow external entity to insert an element into the tree
public void insert(int D)
{
root=insert_internal(D, root);
} // of insert
private Node insert_internal(int D, Node T) {
if (T==null) return( new Node (D, null, null, 0));
if (T.data == D) return T; // the data is already in there
if ( D < T. data ) // go left
{ if (T.left == null)
{
T.left = insert_internal(D,null);
UpdateHeight(T);
}
else { //interior node
T.left = insert_internal(D, T.left);
}
} // of go left
else // D goes to the right
{ if (T.right == null)
{
T.right = insert_internal(D,null);
UpdateHeight(T);
}
else { //interior node
T.right = insert_internal(D, T.right);
}
} // of go right
// now we have to figure out if things are out of
// balance
int diff= HEIGHT(T.right) - HEIGHT(T.left);
System.out.println(\"difference is \" + diff + \" data is \" + T.data);
if ( Math.abs(diff) <= 1) // we are good to go at this level
{
UpdateHeight(T);
return(T);
}
// only if diff is bigger than 1
if ( diff > 1)// right leaning
{ // look at right child and figure out how it is leaning
} // of right leaning
else // left leaning
{ // look at left child to see how it is leaning
Node child = T.left;
int cdiff;
cdiff = HEIGHT(child.right) - HEIGHT(child.left);
System.out.println(\"cdiff is \" + cdiff);
if ( cdiff < 0 ) // left left lean
{ T=RightRotate(T); }
else
{
System.out.println(\"SHAUN\");
preorder_internal(T);
T.left = LeftRotate(T.left);
System.out.println(\"SHAUN\");
preorder_internal(T);
T=RightRotate(T);
}
} // of left leaning
// at this point we have rotated, so we need to.
Reactive programming on Android
The document discusses reactive programming and how it can be used on Android. It explains that reactive programming uses observable sequences and asynchronous data flows. It introduces RxJava as a library for reactive programming that uses Observables to compose flows of asynchronous data. It provides examples of how RxJava can be used on Android to perform background tasks, handle errors and activity lifecycles, load images asynchronously, and create and transform Observables.
Complete the C++ program and implement the routines that are not .docx
The document describes a C++ program that implements a binary tree data structure with various node-related methods like insertion, searching, and traversal. It includes class definitions for the tree nodes (TreeStruct), the overall tree (Tree), and auxiliary stack and queue classes. Many methods are only declared, leaving their implementation incomplete. The main() function tests the various methods by building a sample tree and printing outputs.
Complete the C++ program and implement the routines that are not .docx
The document describes a C++ program that implements a binary tree data structure with various methods. It includes class definitions for a tree node (TreeStruct), the tree itself (Tree), and stacks and queues used in tree traversals. Many methods of the Tree class are only declared, leaving them to be implemented. The main() function inserts nodes into a sample tree and tests various tree operations. It provides output examples to check if the implemented methods are working correctly.
RxJava и Android. Плюсы, минусы, подводные камни
Ярослав Герьятович
Android Engineer в компании Attendify . Спикер на UA Mobile'14 . Идеолог функционального и реактивного подхода в проектировании Android приложений.
About java
This document provides an overview and agenda for a presentation about Java. It discusses Java history, object-oriented programming concepts like classes and interfaces, inheritance and polymorphism, exception handling, primitive types and wrappers, inner classes, generics, and new features introduced since Java 5 such as varargs, enhanced for loops, annotations, and auto boxing/unboxing. The presentation covers these topics over multiple slides with code examples.
import javautilQueue import javautilLinkedList import .pdf
import java.util.Queue;
import java.util.LinkedList;
import java.util.NoSuchElementException;
public class BinaryTree<T extends Comparable<T>> {
BTNode root;
public BinaryTree() {
root = null;
}
public BinaryTree(BTNode root) {
root = null;
}
public void purge(){
root = null;
}
public boolean isEmpty(){
return root == null;
}
public void insert(T key){
if (root == null) {
root = new BTNode(key);
return;
}
BTNode temp;
Queue<BTNode> q = new LinkedList<BTNode>();
q.add(root);
// Do level order traversal until we find the first empty left or right child.
while (!q.isEmpty()) {
temp = q.poll();
if (temp.left == null) {
temp.left = new BTNode(key);
break;
}
else
q.add(temp.left);
if (temp.right == null) {
temp.right = new BTNode(key);
break;
}
else
q.add(temp.right);
}
}
// delete by copying last node
public void deleteByCopying(T data){
if(root == null)
throw new UnsupportedOperationException("Tree is empty!");
else if(root.left == null && root.right == null){
if(root.data.equals(data))
root = null;
else
throw new NoSuchElementException(data + " not in the tree.");
return;
}
Queue<BTNode> queue = new LinkedList<BTNode>();
queue.add(root);
BTNode keyNode = null;
BTNode currentNode = null;
BTNode parentNode = root;
boolean found = false;
while(! queue.isEmpty()){
currentNode = queue.poll();
if(currentNode.data.equals(data)){
if(! found){
keyNode = currentNode;
found = true;
}
}
if(currentNode.left != null){
queue.add(currentNode.left);
parentNode = currentNode;
}
if(currentNode.right != null){
queue.add(currentNode.right);
parentNode = currentNode;
}
}
if(! found)
throw new NoSuchElementException(data + " not in tree.");
while(! queue.isEmpty()){
currentNode = queue.poll();
System.out.print(currentNode.data + " ");
if(currentNode.left != null){
queue.add(currentNode.left);
parentNode = currentNode;
}
if(currentNode.right != null){
queue.add(currentNode.right);
parentNode = currentNode;
}
}
keyNode.data = currentNode.data;
if(parentNode.left == currentNode)
parentNode.left = null;
else if(parentNode.right == currentNode)
parentNode.right = null;
}
public void levelOrderTraversal(){ // BreadthFirstTraversal
levelOrderTraversal(root);
}
// BreadthFirst Traversal
protected void levelOrderTraversal(BTNode root){
if(root == null)
return;
Queue<BTNode> queue = new LinkedList<BTNode>();
BTNode node = root;
queue.add(node);
while(! queue.isEmpty()){
node = queue.poll();
visit(node);
if(node.left != null)
queue.add(node.left);
if(node.right != null)
queue.add(node.right);
}
}
public void levelOrderTraversalByLevels(){
levelOrderTraversalByLevels(root);
}
protected void levelOrderTraversalByLevels(BTNode<T> root){
Queue q = new LinkedList();
int levelNodes = 0;
if(root==null)
return;
q.add(root);
while(!q.isEmpty()){
levelNodes = q.size();
while(levelNodes>0){
BTNode n = (BTNode)q.remove();
System.out.print(" " + n.data);
if(n.left!=null)
q.add(n.left);
if(n.right!=null)
q.add(n.right);
levelNodes--;
}
System.out.println("");
}
}
protected void visit(BTNode<T.
5. Design and implement a method contains 2 for BinarySearchTree, fu.pdf
5. Design and implement a method contains 2 for BinarySearchTree, functionall equivalent to
the contains method, that does not use recursion.
show the driver code and do this in java
this is the binarysearchtree
import java.util.*; // Iterator, Comparator
public class BinarySearchTree implements BSTInterface
{
protected BSTNode root; // reference to the root of this BST
protected Comparator comp; // used for all comparisons
protected boolean found; // used by remove
public BinarySearchTree()
// Precondition: T implements Comparable
// Creates an empty BST object - uses the natural order of elements.
{
root = null;
comp = new Comparator()
{
public int compare(T element1, T element2)
{
return ((Comparable)element1).compareTo(element2);
}
};
}
public BinarySearchTree(Comparator comp)
// Creates an empty BST object - uses Comparator comp for order
// of elements.
{
root = null;
this.comp = comp;
}
public boolean isFull()
// Returns false; this link-based BST is never full.
{
return false;
}
public boolean isEmpty()
// Returns true if this BST is empty; otherwise, returns false.
{
return (root == null);
}
public T min()
// If this BST is empty, returns null;
// otherwise returns the smallest element of the tree.
{
if (isEmpty())
return null;
else
{
BSTNode node = root;
while (node.getLeft() != null)
node = node.getLeft();
return node.getInfo();
}
}
public T max()
// If this BST is empty, returns null;
// otherwise returns the largest element of the tree.
{
if (isEmpty())
return null;
else
{
BSTNode node = root;
while (node.getRight() != null)
node = node.getRight();
return node.getInfo();
}
}
private int recSize(BSTNode node)
// Returns the number of elements in subtree rooted at node.
{
if (node == null)
return 0;
else
return 1 + recSize(node.getLeft()) + recSize(node.getRight());
}
public int size()
// Returns the number of elements in this BST.
{
return recSize(root);
}
public int size2()
// Returns the number of elements in this BST.
{
int count = 0;
if (root != null)
{
LinkedStack> nodeStack = new LinkedStack>();
BSTNode currNode;
nodeStack.push(root);
while (!nodeStack.isEmpty())
{
currNode = nodeStack.top();
nodeStack.pop();
count++;
if (currNode.getLeft() != null)
nodeStack.push(currNode.getLeft());
if (currNode.getRight() != null)
nodeStack.push(currNode.getRight());
}
}
return count;
}
private boolean recContains(T target, BSTNode node)
// Returns true if the subtree rooted at node contains info i such that
// comp.compare(target, i) == 0; otherwise, returns false.
{
if (node == null)
return false; // target is not found
else if (comp.compare(target, node.getInfo()) < 0)
return recContains(target, node.getLeft()); // Search left subtree
else if (comp.compare(target, node.getInfo()) > 0)
return recContains(target, node.getRight()); // Search right subtree
else
return true; // target is found
}
public boolean contains (T target)
// Returns true if this BST contains a node with info i such that
// comp.compare(target, i) == 0; otherwise, re.
Create a java project that - Draw a circle with three random init.pdf
Create a java project that:
- Draw a circle with three random initial points on the circle.
- Link the points to form a triangle.
- Print the angles values in the triangle.
- Use the mouse to drag a point along the perimeter of the circle. As you drag it, the triangle and
angles are redisplayed dynamically.
Here is the formula to compute angles:
A = acos((a * a - b * b - c * c) / (-2 * b * c))
B = acos((b * b - a * a - c * c) / (-2 * a * c))
C = acos((c * c - b * b - a * a) / (-2 * a * b))
Solution
@Suppresswarnings(\"WeakerAccess\")
public class DragPoints extends Application {
@Override
public void start(Stage primaryStage) {
final PointPane pane = new PointPane(640, 480);
pane.setStyle(\"-fx-background-color: wheat;\");
Label label = new Label(\"Click and drag the points.\");
BorderPane borderPane = new BorderPane(pane);
BorderPane.setAlignment(label, Pos.CENTER);
label.setPadding(new Insets(5));
borderPane.setBottom(label);
Scene scene = new Scene(borderPane);
primaryStage.setTitle(\"Exercise15_21\");
primaryStage.setScene(scene);
primaryStage.show();
}
private class PointPane extends Pane {
final Circle circle = new Circle();
final Vertex[] v = new Vertex[3];
final int strokeWidth = 2;
final Color circleStroke = Color.GRAY, legStroke = Color.BLACK;
@SuppressWarnings(\"SameParameterValue\")
PointPane(double w, double h) {
this.setPrefSize(w, h);
this.setWidth(w);
this.setHeight(h);
circle.setStroke(circleStroke);
circle.setFill(Color.TRANSPARENT);
circle.setStrokeWidth(strokeWidth);
circle.radiusProperty().bind(this.heightProperty().multiply(0.4));
circle.centerXProperty().bind(this.widthProperty().divide(2));
circle.centerYProperty().bind(this.heightProperty().divide(2));
this.getChildren().add(circle);
for (int i = 0; i < v.length; i++) {
v[i] = new Vertex(circle, 2 * Math.PI / v.length * (i + Math.random()));
v[i].radiusProperty().bind(circle.radiusProperty().divide(10));
v[i].setPosition();
v[i].setStroke(new Color(i == 0 ? 1 : 0, i == 1 ? 1 : 0, i == 2 ? 1 : 0, 1));
v[i].setFill(Color.TRANSPARENT);
v[i].setStrokeWidth(strokeWidth);
this.getChildren().add(v[i]);
v[i].setOnMouseDragged(new EventHandler() {
@Override
public void handle(MouseEvent event) {
int i;
for (i = 0; i < v.length; i++)
if (v[i] == event.getSource())
break;
v[i].setAngle(event.getX(), event.getY());
moveUpdate((Vertex) event.getSource());
}
});
}
for (int i = 0; i < v.length; i++) {
int j = i + 1 < v.length ? i + 1 : 0;
int k = j + 1 < v.length ? j + 1 : 0;
v[i].bindLeg(v[j], v[k]);
v[i].leg.setStroke(legStroke);
v[i].leg.setStrokeWidth(strokeWidth);
this.getChildren().add(v[i].leg);
this.getChildren().add(v[i].text);
}
for(DoubleProperty p: new DoubleProperty[]
{circle.radiusProperty(), circle.centerXProperty(), circle.centerYProperty()})
p.addListener(new ResizeListener());
moveUpdate(v[0]);
}
void moveUpdate(Vertex vert) {
vert.setPosition();
double[] legLength = new double[3];
for (int i = 0; i < v.length; i++)
legLength[i] = v[i].getLegLength();
for (int i = .
Here is the following code mentioned in the instructions.pdf
Here is the following code mentioned in the instructions:
class AVL {
Node root;
private class Node {
int data;
Node left, right;
int height;
private Node(int D, Node L, Node R, int H) {
data=D;
left=L;
right=R;
height=H; // user has to set height
} // of constructor Node
} //of Node
static private void UpdateHeight(Node T) {
if (T ==null) return;
else T.height = Math.max(HEIGHT(T.left),HEIGHT(T.right)) + 1;
} // UPdate Height
static private int HEIGHT(Node T) {
if (T== null ) return(-1);
else return (T.height);
}
// we need to more our right child up
static private Node LeftRotate(Node T) {
System.out.println(\"left rotate with data \" + T.data);
Node Tr;
Tr=T.right; // right child
T.right=Tr.left; // our right child IS NOW hhh
Tr.left=T; // move T down to the left
UpdateHeight(Tr.left); // update the height of T
UpdateHeight(Tr); // update hte height of the new root
return Tr;
} // of LeftRotate
// we move our immediate left node up.
// in doing so, we are now immediat right of our left child
static private Node RightRotate(Node T) {
Node Tl;
System.out.println(\"left rotate with data \" + T.data);
Tl=T.left; // left child
T.left=Tl.right; // our left child is now what our left was pointing to
Tl.right=T; // move T down to the right
UpdateHeight(Tl.right); // update the height of T
UpdateHeight(Tl); // update hte height of the new root
return Tl;
} // of RightRotate
public AVL() {
root=null;
} // of constructor AVL
// method to allow external entity to insert an element into the tree
public void insert(int D)
{
root=insert_internal(D, root);
} // of insert
private Node insert_internal(int D, Node T) {
if (T==null) return( new Node (D, null, null, 0));
if (T.data == D) return T; // the data is already in there
if ( D < T. data ) // go left
{ if (T.left == null)
{
T.left = insert_internal(D,null);
UpdateHeight(T);
}
else { //interior node
T.left = insert_internal(D, T.left);
}
} // of go left
else // D goes to the right
{ if (T.right == null)
{
T.right = insert_internal(D,null);
UpdateHeight(T);
}
else { //interior node
T.right = insert_internal(D, T.right);
}
} // of go right
// now we have to figure out if things are out of
// balance
int diff= HEIGHT(T.right) - HEIGHT(T.left);
System.out.println(\"difference is \" + diff + \" data is \" + T.data);
if ( Math.abs(diff) <= 1) // we are good to go at this level
{
UpdateHeight(T);
return(T);
}
// only if diff is bigger than 1
if ( diff > 1)// right leaning
{ // look at right child and figure out how it is leaning
} // of right leaning
else // left leaning
{ // look at left child to see how it is leaning
Node child = T.left;
int cdiff;
cdiff = HEIGHT(child.right) - HEIGHT(child.left);
System.out.println(\"cdiff is \" + cdiff);
if ( cdiff < 0 ) // left left lean
{ T=RightRotate(T); }
else
{
System.out.println(\"SHAUN\");
preorder_internal(T);
T.left = LeftRotate(T.left);
System.out.println(\"SHAUN\");
preorder_internal(T);
T=RightRotate(T);
}
} // of left leaning
// at this point we have rotated,.
1)(JAVA) Extend the Binary Search Tree ADT to include a public metho.pdf
The document extends a Binary Search Tree (BST) interface to include a new public method called leafCount that returns the number of leaf nodes in the tree. It also provides the BinarySearchTree and BSTInterface files that implement the BST with methods for common operations like adding and removing nodes, and traversing the tree in different orders.
ReversePoem.java ---------------------------------- public cl.pdf
ReversePoem.java :-
---------------------------------
public class ReversePoem {
/*This programs has you display a pessimistic poem from a list of phrases*/
// and then reverse the phrases to find another more optimistic poem.
public static void main(String[] args) throws Exception
{
//Queue object
MyQueue queue = new MyQueue<>();
//Stack object
MyStack stack = new MyStack<>();
//String buffer to apppend all Strings
StringBuffer sb = new StringBuffer();
// Create a single String object from the 16 Strings below
String set1 = \"I am part of a lost generation#and I refuse to believe that#\";
sb.append(set1);
String set2 = \"I can change the world#I realize this may be a shock but#\";
sb.append(set2);
String set3 = \"\'Happiness comes from within\'#is a lie, and#\";
sb.append(set3);
String set4 = \"\'Money will make me happy\'#So in 30 years I will tell my children#\";
sb.append(set4);
String set5 = \"they are not the most important thing in my life#\";
sb.append(set5);
String set6 = \"My employer will know that#I have my priorities straight because#\";
sb.append(set6);
String set7 = \"work#is more important than#family#I tell you this#\";
sb.append(set7);
String set8 = \"Once upon a time#Families stayed together#\";
sb.append(set8);
String set9 = \"but this will not be true in my era#\";
sb.append(set9);
String set10 = \"This is a quick fix society#Experts tell me#\";
sb.append(set10);
String set11 = \"30 years from now, I will be celebrating the 10th anniversary of my
divorce#\";
sb.append(set11);
String set12 = \"I do not concede that#I will live in a country of my own making#\";
sb.append(set12);
String set13 = \"In the future#Environmental destruction will be the norm#\";
sb.append(set13);
String set14 = \"No longer can it be said that#My peers and I care about this earth#\";
sb.append(set14);
String set15 = \"It will be evident that#My generation is apathetic and lethargic#\";
sb.append(set15);
String set16 = \"It is foolish to presume that#There is hope#\";
sb.append(set16);
String finalString = sb.toString();
String itmes[] = finalString.split(\"#\");
System.out.println(\"========== Original Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
queue.enqueue(itmes[i]);
System.out.println(itmes[i]);
}
for(int i = 0 ; i < itmes.length;i++){
stack.push(queue.dequeue());
}
System.out.println(\"========== Reverse Phrase ==============\");
for(int i = 0 ; i < itmes.length;i++){
System.out.println(stack.pop());
}
/* You are given a list of phrases in Strings; the phrases
are separated by pound signs: \'#\':
1. Create a single String object from this list.
2. Then, split the String of phrases into an array of
phrases using the String split method.
3. Display a poem by walking through the array and
displaying each phrase one per line.
4. And, at the same time, place each phrase on a
MyQueue object using only the enqueue method.
5. After all the phrases have been placed on the queue,
transfer the phrases from the MyQueue object to a
MyS.
Chat application in java using swing and socket programming.
The document provides code for a chat application with client and server functionality. The server runs on port 1004 and handles socket connections from multiple clients. It maintains lists of connected clients and logged in user names. When a new client connects, threads are started to handle message receiving/sending and updating other clients on user name changes. The client GUI allows users to view online users, sent messages and send new messages which are broadcast to all connected clients by the server.
Similar to public class AVLTreeT extends ComparableT extends BSTT { p.pdf (20)
Modify HuffmanTree.java and HuffmanNode.java to allow the user to se.pdf
Modify HuffmanTree.java and HuffmanNode.java to allow the user to se.pdf
I dont know what is wrong with this roulette program I cant seem.pdf
I dont know what is wrong with this roulette program I cant seem.pdf
ANSimport java.util.Scanner; class Bina_node { Bina_node .pdf
ANSimport java.util.Scanner; class Bina_node { Bina_node .pdf
import java.util.Scanner;class BinaryNode{ BinaryNode left.pdf
import java.util.Scanner;class BinaryNode{ BinaryNode left.pdf
Here is the code given in the instructionsclass AVL {.pdf
Here is the code given in the instructionsclass AVL {.pdf
Complete the C++ program and implement the routines that are not .docx
Complete the C++ program and implement the routines that are not .docx
Complete the C++ program and implement the routines that are not .docx
Complete the C++ program and implement the routines that are not .docx
import javautilQueue import javautilLinkedList import .pdf
import javautilQueue import javautilLinkedList import .pdf
5. Design and implement a method contains 2 for BinarySearchTree, fu.pdf
5. Design and implement a method contains 2 for BinarySearchTree, fu.pdf
Create a java project that - Draw a circle with three random init.pdf
Create a java project that - Draw a circle with three random init.pdf
Here is the following code mentioned in the instructions.pdf
Here is the following code mentioned in the instructions.pdf
1)(JAVA) Extend the Binary Search Tree ADT to include a public metho.pdf
1)(JAVA) Extend the Binary Search Tree ADT to include a public metho.pdf
ReversePoem.java ---------------------------------- public cl.pdf
ReversePoem.java ---------------------------------- public cl.pdf
Chat application in java using swing and socket programming.
Chat application in java using swing and socket programming.
More from agmobiles
Question 1 (25 marks) The most recently audited Statement of Financi.pdf
Question 1 (25 marks) The most recently audited Statement of Financial Position of Papasa Ltd.
reads as follows: Papasa Ltd.
Statement of Financial Position as at 30th April 2022
Assets N$m Non-Current Assets 2 099
Land and Buildings 1 612
Plant and Equipment 412
Fixtures and Fittings 75
Current Assets 692
Inventories 215
Trade Receivables 465
Cash and Cash Equivalents 12
Total assets 2 791
Equity and Liabilities
Equity 2 112 N$ 2 Ordinary shares 500
12% N$5 Preference shares 750
Accumulated Profits 862
Non-Current Liabilities
500 8% Irredeemable Debentures 200
5% Debentures (Redeemable 30/04/2017) 300
Current LiabilitiesTrade Payables - 179
Short Term Borrowings - 179
Total equity and liabilities 2 791.
Question Please provide the links or the references where the info.pdf
Question: Please provide the links or the references where the info below was taken. Thanks!
Economic:
Economic Output: Australia's GDP was approximately 1.5 trillion USD in 2020, making it the
13th largest economy globally. Potential for Future Growth: Australia has a steady economy with
the potential for growth in various industries, including healthcare, technology, mining, and
agriculture. Ability to Attract FDI: Australia is an attractive destination for foreign direct
investment due to its stable political and economic environment, skilled workforce, and modern
infrastructure. Exchange Rate Stability: Australia has a floating exchange rate system, which
ensures that the exchange rate is determined by market forces, resulting in stability and a lack of
exchange rate risk for investors. Consumer Price Index (CPI): Australia's CPI is low, reflecting
stable economic conditions and favorable living standards. Balance of Trade: Australia has a
positive balance of trade, with exports outweighing imports, making it a favorable destination for
investors.
Politics:Ease of Doing Business: Australia is ranked 14th out of 190 countries in the World
Bank's Ease of Doing Business report for 2020, indicating that the country has a favorable
business environment. Legal and Regulatory: Australia has a well-established legal system that
provides investors with a reliable and secure environment for doing business. Additionally, the
government offers various incentives for foreign investors, making it an attractive destination for
investment. Political Stability: Australia has a stable political environment, which ensures a
predictable and safe investment climate for businesses. Intellectual Property Rights: Australia
has robust intellectual property laws that protect investors' intellectual property rights, making it
a favorable destination for investors.
Infrastructure: PhysicalEnergy: Australia has a reliable and diverse energy supply, with
renewable energy sources accounting for over 20% of the country's total electricity generation.
Telecommunications: Australia has a modern telecommunications infrastructure, including high-
speed internet and mobile networks, ensuring that businesses can communicate effectively and
efficiently.
Competence:-Labor Relations: Australia has a highly skilled workforce, with a robust education
system that produces highly qualified workers. Additionally, labor relations are relatively stable,
ensuring a reliable and productive workforce. Logistics Competence: Australia has a well-
developed logistics infrastructure, including modern ports, airports, and rail networks, making it
easy for businesses to transport goods. Educational Level: Australia has a highly educated
workforce, with a high percentage of the population having a tertiary education. Customs and
Security: Australia has a reliable and secure customs system that ensures the smooth flow of
goods and services. In conclusion, investing in Australia is a sound busines.
QN. 3A sample of 111 mortgages approved during the current year sh.pdf
QN. 3
A sample of 111 mortgages approved during the current year showed that 32 were issued to a
single-earner family or individual. The historical percentage is 24 percent.
At the .05 level of significance in a right-tailed test, has the percentage of single-earner or
individual mortgages risen?
H0: .24 versus H1: > .24.
CALCULATE THE TEST STATIC (Round intermediate calculations to 2 decimal places.
Round your answer to 4 decimal places)..
QS 13-7 Contabilizaci�n de peque�os dividendos en acciones LO P2 A c.pdf
QS 13-7 Contabilizacin de pequeos dividendos en acciones LO P2 A continuacin se muestra la
seccin de capital contable del balance general de Jun Company al 1 de abril. El 2 de abril, Jun
declara y distribuye un dividendo en acciones del 20%. El valor de mercado de las acciones por
accin el 2 de abril es de $10 (antes del dividendo). Acciones comunes: $5 de valor nominal, 445
000 acciones autorizadas, 235 000 acciones emitidas y en circulacin $ 1 175 000 Capital pagado
en exceso del valor nominal, acciones comunes 560 000 Utilidades retenidas 868 000 Capital
contable total $ 2 603 000 Prepare la seccin de capital contable inmediatamente despus de las
acciones dividendo..
q60. u anda isiz olan iki kiiyi d��n�n. Tim �almak istiyor ama i a.pdf
q60.
u anda isiz olan iki kiiyi dnn. Tim almak istiyor ama i aramyor nk yaad yerde ok sayda iten
karma oldu ve i bulabileceini dnmyor. Bev u anda i aramyor ama bir i istiyor ve alt ay nce i arad.
alma statistikleri Brosu dikkate alr
Yant seenekleri grubu
ne Tim ne de Bev marjinal bal iiler olmayacak.
marjinal olarak bal bir alan olmak iin yalnzca Tim
hem Tim hem de Bev, marjinal olarak bal iiler olacak.
sadece Bev, marjinal olarak bal bir ii olabilir..
Q4 (Excel spreadsheet is available). From the data given in the fo.pdf
Q4 (Excel spreadsheet is available). From the data given in the following table, please construct
as many of the financial ratios discussed in this chapter as you can and then indicate what
dimension of a business firms performance each ratio represents. Make sure write down the
formula and the results in word file.
Business Assets
Annual revenue and Expense Items
Cash account
60.00
Net sales
600.00
Accounts receivable
155.00
Cost of goods sold
445.00
Inventories
128.00
Wages and salaries
52.00
Fixed assets
286.00
Interest expense
28.00
Miscellaneous assets
96.00
Overhead expenses
29.00
Total assets
725.00
Depreciation expenses
12.00
Liabilities and Equity
Selling, administrative, and other expenses
28.00
Short-term debt:
Before-tax net income
6.00
Accounts payable
108.00
Taxes owed
1.00
Notes payable*
117.00
After-tax net income
5.00
Long-term debt (bonds)*
325.00
Miscellaneous liabilities
15.00
Equity capital
160.00
Total Liabilities and Equity
725.00
*Annual principal pmts on bonds and nps
55.00
marginal tax rate
35.00%
Business Assets
Annual revenue and Expense Items
Cash account
60.00
Net sales
600.00
Accounts receivable
155.00
Cost of goods sold
445.00
Inventories
128.00
Wages and salaries
52.00
Fixed assets
286.00
Interest expense
28.00
Miscellaneous assets
96.00
Overhead expenses
29.00
Total assets
725.00
Depreciation expenses
12.00
Liabilities and Equity
Selling, administrative, and other expenses
28.00
Short-term debt:
Before-tax net income
6.00
Accounts payable
108.00
Taxes owed
1.00
Notes payable*
117.00
After-tax net income
5.00
Long-term debt (bonds)*
325.00
Miscellaneous liabilities
15.00
Equity capital
160.00
Total Liabilities and Equity
725.00
*Annual principal pmts on bonds and nps
55.00
marginal tax rate
35.00%.
Q1 Feasibility of applying audit data analytics 1) Name a situation.pdf
Q1: Feasibility of applying audit data analytics 1) Name a situation where you can use one of the
tools/techniques we discussed today in your work. 2) Discuss the frequency and perceived
effectiveness of audit data analytics in real engagements with internal controllers and external
auditors. 3) How to deal with the economic limitations of using data analytic methods in audits?
4) How can human and device competencies be created?.
Python, fill in code are marked with #FillInStart and #FillInEndim.pdf
Python, fill in code are marked with #FillInStart and #FillInEnd
import socket
import sys
import os
# Since the server might send the HTML across more than one
# send, we should try multiple recv calls to receive all data
def recvall(sock):
BUFFER_SIZE = 4096 # 4 KiB
data = b""
while True:
part = sock.recv(BUFFER_SIZE)
data += part
# Keep receiving only until the received data "ended" in last recv
if len(part) < BUFFER_SIZE:
break
return data
# Create a server socket, bind it to a port and start listening
listener = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
# FillInStart
# FillInEnd
print('Ready to serve...')
while True:
# accept a connection from the client side and decode the message/request
clientSide, addr = listener.accept()
message = #FillInStart #FillInEnd
# for now, lets ignore all the requests that are not GET
# the remaining requests will just be discarded and the client
# will receive no response for those requests
if not message.startswith("GET"):
continue
# extract the URL, domain, method, path from the request
request_method = message.split()[0]
requested_url = message.split()[1]
domain = requested_url.split("/", 3)[2]
path = requested_url.split("/", 3)[3]
# if the path ends in / then we can name it as index.html since
# is usually the case across the web
if path == "":
path = "index.html"
print("request method: {}, requested URL: {} -> domain: {}, path:
{}".format(request_method, requested_url, domain, path))
# create the directory structure similar to how the paths
# are defined within the URL. So, the parent folder will be the
# domain you are visiting and the path will be converted into
# subdirectories within the parent folder for intuitive navigation
file_path = "./{}/{}".format(domain, path)
file_exists = os.path.exists(file_path)
if file_exists:
# if the file exists, we can just read it and send it
print("file was found in the local cache at the proxy")
f = open(file_path, "rb")
outputdata = f.read()
else:
# otherwise, we need to make the request to the remote server
# to retrieve the file and send it to client while also saving
# it locally for future visits
print("file was NOT found in the local cache at the proxy")
print("requesting from server...")
# the GET request is made on HTTP/1.0 so that we don't need to
# deal with gzip compression and the response handling is fairly
# straightforward
GET_request = ""
GET_request += "GET {} HTTP/1.0\r\n".format(requested_url)
GET_request += "Host: {}\r\n\r\n".format(domain)
print(GET_request)
# we open the socket to the server and make the request at port 80
# FillInStart
# FillInEnd
# using the port you have created above to send the GET request
serverSide.send(GET_request.encode())
# receive the response using recvall in case the response takes more
# than one send by the server to send
GET_response = recvall(serverSide)
print("R: {}".format(GET_response))
# we create the directory and subdirectories in case they don't
# don't exist already and save the response as a.
Put this in APA format Add information if needed.CONSTRUCTION.pdf
Put this in APA format? Add information if needed.
CONSTRUCTION OF A NEW HOSPITAL IN A DEVELOPING COUNTRY: APPLYING
PROJECT MANAGEMENT TERMINOLOGY AND CONCEPTS
JAKEISHA MOORE
BUS530 Project Management
UNIT 2 ASSIGNMENT
POST UNIVERSITY
MARCH 19, 2023
CONSTRUCTION OF A NEW HOSPITAL IN A DEVELOPING COUNTRY: APPLYING
PROJECT MANAGEMENT TERMINOLOGY AND CONCEPTS
Traditional healing practices have been suppressed or even destroyed in most emerging nations
due to enduring factors including growing global interaction due to commerce and colonization.
At the turn of the century, health institutions as we know them had been developed specifically
as a result of this process. This project may be challenging and requires a committed team, as we
all know when dealing with the construction of a new hospital in a poor nation. Professionals are
needed to effectively handle it. This assignment will outline the project's elements, goals, team
members' responsibilities, risks, and uncertainties, as well as the anticipated results and the
lesson that was learnt. You will have a better understanding of how project management can be
used to achieve specific objectives if you apply the theories and concept of project management
to a scenario from the real world.
Project Overview: For this assignment, I was interested in the project article on how to structure
the construction of a new hospital in a developing nation. A local government body oversees this
new hospital construction project that has received funding from international aid organizations.
Qualification of the Project: A "project" can be defined as the construction of a brand-new
hospital in a developing nation because it entails a distinct set of activities aimed at achieving a
specific objective. There is a set start and end date for the project, and it needs a dedicated team
to finish it.
Project Objectives: The project's primary goal is to construct a cutting-edge hospital that can
offer the local people top-notch medical treatment. The hospital will be outfitted with cutting-
edge amenities and machinery and staffed by qualified medical personnel.
Project Managers Role: Planning, executing, monitoring, controlling, and concluding the project
are all responsibilities of the project manager. It is the responsibility of the project manager to
guarantee that the project will be finished on time, within budget, and to the required quality
standards.
Project Sponsors Role: The individual or organization that provides the project with funding is
known as the project sponsor. For this situation, the task support is the nearby government body,
which has gotten subsidizing from worldwide guide offices. It is the responsibility of the project
sponsor to ensure that the project is in line with the goals and objectives of the organization.
Project Team Members Role: It is the responsibility of the members of the project team to
complete the tasks that have been assigned to them and to guarantee that the project w.
Proyecto EH! requiere una inversi�n inicial de $50 000 y tiene un va.pdf
Proyecto EH! requiere una inversin inicial de $50 000 y tiene un valor presente neto de $12 000.
El proyecto BE requiere una inversin inicial de $100 000 y tiene un valor presente neto de $13
000. Los proyectos son mutuamente excluyentes. La empresa debe aceptar
A) ambos proyectos. B) proyecto EH!. C) ningn proyecto. D) proyecto SER..
Provide logical case studies where the application of the following .pdf
Provide logical case studies where the application of the following types of OS can be justified
(provide at least three justifications): Distributed OS Real-time OS Your case study should
follow the pattern given below as an example for the installation of Network OS: John is the
Technical Lead at Paradise Travel, a tourism company having 55 employees. The company has
four departments that work together to manage the overall business. John has decided that a
Windows Server 2016, a Network Operating System based Client-Server model will best fit the
need of the company. The primary reasons for his choice are as below: The users will only login
once and should be able to access various systems used internally using that single sign-on
credential. John and his team will be able to easily maintain and set up such access for the users
with effective security policies. As there are four departments, oftentimes some administrative
roles can be delegated to o ne of the responsible person in each of the departments. As the
employees have stated that they do not want to keep calling the IT folks for everything, such a
system can be designed through Organizational Unit feature of Windows Server. Sharing of
equipment such as Printers and Faxes are of critical importance, and Network OS such as
Windows Servers have good support for it..
Provide excel work, spider-plot, and tornado diagram. Opportunit.pdf
Provide excel work, spider-plot, and tornado diagram.
Opportunity 1 A multi-level parking garage in center city Philadelphia. The project consists of
the following details: Qpportunity 2 A non-profit organization seeks to partner on a multi-family
housing facility to benefit the less fortunate. The project consists of the followi Q Qportunity 3 A
mixed-used shell facility, location TBD. The project consists of the following details:.
Prove (i.e. give a derivation for) each of the following. You can us.pdf
Prove (i.e. give a derivation for) each of the following. You can use any of the
11 basic rules NO INDIRECT PROOFS, prove everything only using 11 rules attached(PP).
Project Bird speciesThe OrdwayBirds data frame is a historical re.pdf
Project: Bird species
The OrdwayBirds data frame is a historical record of birds captured and released at the Katharine
Ordway Natural History Study Area, a 278-acre preserve in Inver Grove Heights, Minnesota,
owned and managed by Macalester College. Originally written by hand in a field notebook, the
entries have been transcribed into electronic format under the supervision of Jerald Dosch, Dept.
of Biology, Macalester College.
Due to mistakes in data entry, the SpeciesName variable needs some fixing. SpeciesName is
intended to identify the species of each of the birds, but the spelling often varies among birds of
the same biological species. This leads to mis-classification of birds. There are also problems
with the Month and Day variables; they are supposed to be numerical, but mistakes prevent them
from being correctly identified as such.
Fortunately, all these errors are easy to correct. The data frame OrdwaySpeciesNames collects
together all the variant spellings. Entry by entry, each mis-spelling was translated (by a human)
into a standardized spelling. Thus, join() can be used to correct the mis-spellings in the
OrdwayBirds table.
You are going to look at the month-to-month presence of different species. Think of your
assignment as creating a manual for birders to guide them to the correct time of year to visit
Ordway to see a particular species.
Some simple data cleaning
There are many variables that you wont need for this activity, and you still have to fix the Month
and Day variables. To keep things simple, cut and paste this command into a chunk at the start of
the document.
Task 0 Get the data
The OrdwayBirds data are available in the dcData package.
The mutate() step is part of the data cleaning process, converting Month and Dayas numerical
variables as originally intended by the folks entering the data.
Task 3
How many bird captures are reported for each of the (corrected) species?
Call the variable that contains the total count. Arrange this into descending order from the
species with the most birds, and look through the list. Hint: Remember n(). Also, one of the
arguments to one of the data verbs will be desc(count) to arrange the cases into descending order.
Display the top 10 species in terms of the number of bird captures.
Define for yourself a major species as a species with more than a particular threshold count. Set
your threshold so that there are 5 or 6 species designated as major.
Filter to produce a data frame with only the birds that belong to a major species.Hint: Remember
that summary functions can be used case-by-case when filtering or mutating a data frame that
has been grouped.
Save the output in a table called Majors.
Task 4
When you have correctly produced Majors, write a command that produces the month-by-month
count of each of the major species. Call this table ByMonth.
Display this month-by-month count with a bar chart arranged in a way that you think tells the
story of what time of year the various speci.
Productos de ingenier�a matrimonial Cynthia Gao, gerente de adqu.pdf
Cynthia Gao, gerente de adquisiciones de Wedlock Engineered Products, está revisando una propuesta para cambiar de proveedor de tubos de acero de 3 pulgadas a un proveedor más barato. Sin embargo, Cynthia tiene preocupaciones sobre cambiar de proveedor debido al excelente servicio y rendimiento del proveedor actual durante 15 años, y el posible impacto en su relación con ese proveedor y en el suministro de otros productos. Cynthia debe decidir si aceptar la propuesta de cambiar a un nuevo proveedor para ahorrar $24,000
Process Cost SystemsWhat type of product or business would use a p.pdf
Process Cost Systems
What type of product or business would use a process cost system?
What does it cost production report? Does it track units and costs? What about partially
completed units?
Understand what FIFO and LIFO are and how the use of each affects COGS, profits and taxes.
Method for Allocating Costs:
What is an equivalent unit? Are equivalent units tracked separately for direct materials and
conversion costs? Why?
Be able to compute Equivalent units for Materials and Conversion costs. Know why it matters
whether costs are added at the beginning (materials usually) or along the way in stages
(conversion costs usually). You need to understand how this is done.
Be able to derive the Direct Materials Cost per Equivalent Unit and the Conversion Cost per
Equivalent Unit. Then, be able to allocate costs to the units in a given Stage of Production.
How do you calculate the Yield of a process?
Understand and be able to use the weighted average method to determine the allocation of
factory overhead..
programming assignment 2Preprocessing Before building the language.pdf
programming assignment 2
Preprocessing Before building the language model, the following preprocessing steps should be
performed:
1. Input text should be split into sentences using an existing sentence boundary detector (e.g.
sentence tokenizer from NLTK, spaCy, etc.).
2. Each sentence should be split into words using an existing word tokenizer (word tokenizer
from NLTK, spaCy, etc.).
3. Discard sentences with fewer than n tokens.
4. Add start of sentence token, , and end of sentence token, to each sentence.
Problema 4 Un monopolio se enfrenta a la demanda del mercado QD =.pdf
Un monopolio enfrenta una demanda de QD=400-2P y tiene costos totales de TC=100+20Q+5Q^2. El precio más rentable es de 100 donde la curva de ingreso marginal se iguala a la curva de costo marginal. La cantidad socialmente óptima es de 200 unidades donde la curva de demanda se iguala a la curva de costo marginal, creando un área de pérdida de bienestar deadweight loss de 1,000 unidades entre las curvas de ingreso marginal y demanda.
Preguntas para el ejercicio 34Instrucciones Para cada uno de los .pdf
Preguntas para el ejercicio 34
Instrucciones: Para cada uno de los siguientes extractos de artculos de revistas, indique si la
muestra est sesgada o no y explique su eleccin. En algunos casos, puede responder "no estoy
seguro" porque no hay informacin suficiente para emitir un juicio. Si responde "no estoy seguro"
a un elemento, describa la informacin adicional que le gustara tener antes de tomar una decisin.
1. Los investigadores afirman: "Los fumadores (definidos como individuos que fuman 10 o ms
cigarrillos por da) fueron abordados en varios lugares del campus de la Universidad de
Pittsburgh o cerca de ellos. La muestra (N = 102) incluy a 42 hombres y 60 mujeres, con un
promedio edad de 27,78".
2. Los investigadores afirman que "Los participantes fueron 307 estudiantes en una muestra de
conveniencia de voluntarios en 18 clases de escuelas primarias y secundarias. Despus de tener en
cuenta los datos faltantes, incluidas las ausencias de los estudiantes a la escuela durante 1 o ms
das de la intervencin, el tamao real de la muestra para el anlisis estadstico fue 268".
3. Los investigadores afirman que "Resumidamente, se seleccion una muestra aleatoria
estratificada de 4907 pacientes con enfermedad de las arterias coronarias que se sometieron a un
angiograma en un... hospital del estado de Nueva York... para la parte de extraccin de registros
mdicos del estudio".
4. Los investigadores afirman que "Comisionamos a Survey Sampling Incorporated para que
proporcionara una muestra aleatoria de 1000 residentes de Florida. De los miembros de la
muestra inicial, 198 se haban mudado, tenan direcciones incorrectas, haban fallecido o no
estaban disponibles de alguna otra manera. Estas personas fueron reemplazadas por personas
adicionales al azar residentes seleccionados. Treinta y tres de los reemplazos tampoco pudieron
ser contactados pero no fueron reemplazados. Por lo tanto, el nmero total... se redujo a 967.
5. Los investigadores afirman que "se envi por correo un cuestionario estandarizado
desarrollado para su uso en este estudio a una muestra aleatoria estratificada de 750 hospitales
extrados de la lista de miembros de la Asociacin Estadounidense de Hospitales. Los hospitales se
estratificaron segn el tamao, la ubicacin geogrfica y la etapa de desarrollo de la atencin
administrada ....".
Problem 9.06 (Preferred Stock Valuation)Farley Inc. has perpetual .pdf
Problem 9.06 (Preferred Stock Valuation)
Farley Inc. has perpetual preferred stock outstanding that sells for $42 a share and pays a
dividend of $4.00 at the end of each year. What is the required rate of return? Round your answer
to two decimal places.
______%
Problem 9.08 (Preferred Stock Valuation)
Earley Corporation issued perpetual preferred stock with a 12% annual dividend. The stock
currently yields 7%, and its par value is $100. Round your answers to the nearest cent.
What is the stock's value?
$ ________
Suppose interest rates rise and pull the preferred stock's yield up to 13%. What is its new market
value?
$ ________.
More from agmobiles (20)
Question 1 (25 marks) The most recently audited Statement of Financi.pdf
Question 1 (25 marks) The most recently audited Statement of Financi.pdf
Question Please provide the links or the references where the info.pdf
Question Please provide the links or the references where the info.pdf
QN. 3A sample of 111 mortgages approved during the current year sh.pdf
QN. 3A sample of 111 mortgages approved during the current year sh.pdf
QS 13-7 Contabilizaci�n de peque�os dividendos en acciones LO P2 A c.pdf
QS 13-7 Contabilizaci�n de peque�os dividendos en acciones LO P2 A c.pdf
q60. u anda isiz olan iki kiiyi d��n�n. Tim �almak istiyor ama i a.pdf
q60. u anda isiz olan iki kiiyi d��n�n. Tim �almak istiyor ama i a.pdf
Q4 (Excel spreadsheet is available). From the data given in the fo.pdf
Q4 (Excel spreadsheet is available). From the data given in the fo.pdf
Q1 Feasibility of applying audit data analytics 1) Name a situation.pdf
Q1 Feasibility of applying audit data analytics 1) Name a situation.pdf
Python, fill in code are marked with #FillInStart and #FillInEndim.pdf
Python, fill in code are marked with #FillInStart and #FillInEndim.pdf
Put this in APA format Add information if needed.CONSTRUCTION.pdf
Put this in APA format Add information if needed.CONSTRUCTION.pdf
Proyecto EH! requiere una inversi�n inicial de $50 000 y tiene un va.pdf
Proyecto EH! requiere una inversi�n inicial de $50 000 y tiene un va.pdf
Provide logical case studies where the application of the following .pdf
Provide logical case studies where the application of the following .pdf
Provide excel work, spider-plot, and tornado diagram. Opportunit.pdf
Provide excel work, spider-plot, and tornado diagram. Opportunit.pdf
Prove (i.e. give a derivation for) each of the following. You can us.pdf
Prove (i.e. give a derivation for) each of the following. You can us.pdf
Project Bird speciesThe OrdwayBirds data frame is a historical re.pdf
Project Bird speciesThe OrdwayBirds data frame is a historical re.pdf
Productos de ingenier�a matrimonial Cynthia Gao, gerente de adqu.pdf
Productos de ingenier�a matrimonial Cynthia Gao, gerente de adqu.pdf
Process Cost SystemsWhat type of product or business would use a p.pdf
Process Cost SystemsWhat type of product or business would use a p.pdf
programming assignment 2Preprocessing Before building the language.pdf
programming assignment 2Preprocessing Before building the language.pdf
Problema 4 Un monopolio se enfrenta a la demanda del mercado QD =.pdf
Problema 4 Un monopolio se enfrenta a la demanda del mercado QD =.pdf
Preguntas para el ejercicio 34Instrucciones Para cada uno de los .pdf
Preguntas para el ejercicio 34Instrucciones Para cada uno de los .pdf
Problem 9.06 (Preferred Stock Valuation)Farley Inc. has perpetual .pdf
Problem 9.06 (Preferred Stock Valuation)Farley Inc. has perpetual .pdf
Recently uploaded
Level 3 NCEA - NZ: A Nation In the Making 1872 - 1900 SML.ppt
The History of NZ 1870-1900.
Making of a Nation.
From the NZ Wars to Liberals,
Richard Seddon, George Grey,
Social Laboratory, New Zealand,
Confiscations, Kotahitanga, Kingitanga, Parliament, Suffrage, Repudiation, Economic Change, Agriculture, Gold Mining, Timber, Flax, Sheep, Dairying,
HYPERTENSION - SLIDE SHARE PRESENTATION.
IT WILL BE HELPFULL FOR THE NUSING STUDENTS
IT FOCUSED ON MEDICAL MANAGEMENT AND NURSING MANAGEMENT.
HIGHLIGHTS ON HEALTH EDUCATION.
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 𝟏)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐄𝐏𝐏 𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦 𝐢𝐧 𝐭𝐡𝐞 𝐏𝐡𝐢𝐥𝐢𝐩𝐩𝐢𝐧𝐞𝐬:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐍𝐚𝐭𝐮𝐫𝐞 𝐚𝐧𝐝 𝐒𝐜𝐨𝐩𝐞 𝐨𝐟 𝐚𝐧 𝐄𝐧𝐭𝐫𝐞𝐩𝐫𝐞𝐧𝐞𝐮𝐫:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
Stack Memory Organization of 8086 Microprocessor
The stack memory organization of 8086 microprocessor.
Lifelines of National Economy chapter for Class 10 STUDY MATERIAL PDF
The chapter Lifelines of National Economy in Class 10 Geography focuses on the various modes of transportation and communication that play a vital role in the economic development of a country. These lifelines are crucial for the movement of goods, services, and people, thereby connecting different regions and promoting economic activities.
Benner "Expanding Pathways to Publishing Careers"
This presentation was provided by Rebecca Benner, Ph.D., of the American Society of Anesthesiologists, for the second session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session Two: 'Expanding Pathways to Publishing Careers,' was held June 13, 2024.
How to deliver Powerpoint Presentations.pptx
"How to make and deliver dynamic presentations by making it more interactive to captivate your audience attention"
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh
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
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.
The History of Stoke Newington Street Names
Presented at the Stoke Newington Literary Festival on 9th June 2024
www.StokeNewingtonHistory.com
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptx
Iván Bornacelly, Policy Analyst at the OECD Centre for Skills, OECD, presents at the webinar 'Tackling job market gaps with a skills-first approach' on 12 June 2024
BIOLOGY NATIONAL EXAMINATION COUNCIL (NECO) 2024 PRACTICAL MANUAL.pptx
Practical manual for National Examination Council, Nigeria.
Contains guides on answering questions on the specimens provided
Recently uploaded (20)
Level 3 NCEA - NZ: A Nation In the Making 1872 - 1900 SML.ppt
Level 3 NCEA - NZ: A Nation In the Making 1872 - 1900 SML.ppt
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) Curriculum
spot a liar (Haiqa 146).pptx Technical writhing and presentation skills
spot a liar (Haiqa 146).pptx Technical writhing and presentation skills
Lifelines of National Economy chapter for Class 10 STUDY MATERIAL PDF
Lifelines of National Economy chapter for Class 10 STUDY MATERIAL PDF
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
Traditional Musical Instruments of Arunachal Pradesh and Uttar Pradesh - RAYH...
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...
How to Setup Warehouse & Location in Odoo 17 Inventory
How to Setup Warehouse & Location in Odoo 17 Inventory
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptx
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptx
B. Ed Syllabus for babasaheb ambedkar education university.pdf
B. Ed Syllabus for babasaheb ambedkar education university.pdf
BIOLOGY NATIONAL EXAMINATION COUNCIL (NECO) 2024 PRACTICAL MANUAL.pptx
BIOLOGY NATIONAL EXAMINATION COUNCIL (NECO) 2024 PRACTICAL MANUAL.pptx
public class AVLTreeT extends ComparableT extends BSTT { p.pdf
- 1. public class AVLTree> extends BST { protected int height; public AVLTree() { super(); height = -1; } public AVLTree(BTNode root) { super(root); height = -1; } public void purge(){ super.purge(); } public int getHeight() { return getHeight(root); } private int getHeight(BTNode node) { if(node == null) return -1; else return 1 + Math.max(getHeight(node.left), getHeight(node.right)); } private AVLTree getLeftAVL() { AVLTree leftsubtree = new AVLTree(root.left); return leftsubtree; } private AVLTree getRightAVL() { AVLTree rightsubtree = new AVLTree(root.right); return rightsubtree; } protected int getBalanceFactor() { if(isEmpty()) return 0; else return getRightAVL().getHeight() - getLeftAVL().getHeight();
- 2. } public void insertAVL(T el) { super.insert(el); this.balance(); } public void deleteAVL(T el) { // to be completed by students } protected void balance() { if(!isEmpty()) { getLeftAVL().balance(); getRightAVL().balance(); adjustHeight(); int balanceFactor = getBalanceFactor(); if(balanceFactor == -2) { System.out.println("Balance factor = " + balanceFactor); System.out.println("Balancing node with el: "+root.data); if(getRightAVL().getBalanceFactor() == 0 && getLeftAVL().getBalanceFactor() == -1) /// special case rotateRight(); else if(getLeftAVL().getBalanceFactor() <= 0) rotateRight(); else rotateLeftRight(); } else if(balanceFactor == 2) { System.out.println("Balance factor = " + balanceFactor); System.out.println("Balancing node with el: "+root.data); if(getRightAVL().getBalanceFactor() == 0) /// special case that cannot be done rotateLeft(); /// by double rotations else if(getRightAVL().getBalanceFactor() > 0) rotateLeft(); else
- 3. rotateRightLeft(); } } } protected void adjustHeight() { if(isEmpty()) height = -1; else height = 1 + Math.max(getLeftAVL().getHeight(), getRightAVL().getHeight()); } protected void rotateRight() { System.out.println("RIGHT ROTATION"); // to be completed by students } protected void rotateLeft() { System.out.println("LEFT ROTATION"); BTNode tempNode = root.left; root.left = root.right; root.right = root.left.right; root.left.right = root.left.left; root.left.left = tempNode; T val = (T) root.data; root.data = root.left.data; root.left.data = val; getLeftAVL().adjustHeight(); adjustHeight(); } protected void rotateLeftRight() { System.out.println("Double Rotation..."); getLeftAVL().rotateLeft(); getLeftAVL().adjustHeight(); this.rotateRight(); this.adjustHeight(); }
- 4. protected void rotateRightLeft() { System.out.println("Double Rotation..."); // to be completed by students } public void levelOrderTraversal(){ levelOrderTraversal(root); } } public class AVLTreeDriver { public static void main(String[] args) { System.out.println("nSINGLE LEFT ROTATION EXAMPLE: "); System.out.println("Insert 45 in the following AVL tree:"); AVLTree avlTree2 = new AVLTree(); Integer[] array1 = new Integer []{30, 5, 35, 32, 40}; for(int i = 0; i < array1.length ; i++) avlTree2.insertAVL(array1[i]); avlTree2.printTree(); System.out.println("nInsertion result: "); avlTree2.insertAVL(45); System.out.println(); avlTree2.printTree(); } } 2. Verify the following deletion by the test program: to get the output given below: CASE 3A DELETION EXAMPLE: Delete 1 in the following AVL tree: Root- 7 Deletion result: Balance factor =2 Balancing node with el: 2 LEFT ROTATION Balance factor =2 Balancing node with el: 7 Double Rotation... RIGHT ROTATION LEFT ROTATION Root- -10 Page 3 of 5