Please finish everything marked TODO- BST-java import java-util-Arra.docx

•Download as DOCX, PDF•

0 likes•2 views

Please finish everything marked TODO. BST.java import java.util.ArrayList; import java.util.Collection; import java.util.List; public class BST<E extends Comparable<E>> implements Tree<E> { private int height; private int size; private BinaryNode<E> root; public BST(){ this.root = null; this.height = 0; this.size = 0; } // TODO: BST public BST(BinaryNode<E> root){ } // Access field public BinaryNode<E> root() { return this.root; } // Basic properties public int height() { return this.height; } public int size() { return this.size; } public boolean isBalanced() { return root.isBalanced(); } // TODO: updateHeight - Update the root height to reflect any changes public void updateHeight() { } // Traversals that return lists // TODO: Preorder traversal public List<E> preOrderList() { return new ArrayList<>(); } // TODO: Inorder traversal public List<E> inOrderList() { return new ArrayList<>(); } // TODO: Postorder traversal public List<E> postOrderList() { return new ArrayList<>(); } // Helpers for BST/AVL methods // TODO: extractRightMost // This will be called on the left subtree and will get the maximum value. public BinaryNode<E> extractRightMost(BinaryNode<E> curNode) { return null; } // AVL & BST Search & insert same // TODO: search public BinaryNode<E> search(E elem) { return null; } // TODO: insert public void insert(E elem) { } // TODO: delete public BinaryNode<E> delete(E elem) { return null; } // Stuff to help you debug if you want // Can ignore or use to see if it works. static <E extends Comparable<E>> Tree<E> mkBST (Collection<E> elems) { Tree<E> result = new BST<>(); for (E e : elems) result.insert(e); return result; } public TreePrinter.PrintableNode getLeft() { return this.root.hasLeft() ? this.root.left() : null; } public TreePrinter.PrintableNode getRight() { return this.root.hasRight() ? this.root.right() : null; } public String getText() { return (this.root != null) ? this.root.getText() : ""; } } .

Education

public List<E> preOrderList() {
return new ArrayList<>();
}
// TODO: Inorder traversal
public List<E> inOrderList() {
return new ArrayList<>();
}
// TODO: Postorder traversal
public List<E> postOrderList() {
return new ArrayList<>();
}
// Helpers for BST/AVL methods
// TODO: extractRightMost
// This will be called on the left subtree and will get the maximum value.
public BinaryNode<E> extractRightMost(BinaryNode<E> curNode) {
return null;
}
// AVL & BST Search & insert same
// TODO: search
public BinaryNode<E> search(E elem) {
return null;
}
// TODO: insert
public void insert(E elem) {
}
// TODO: delete
public BinaryNode<E> delete(E elem) {
return null;
}
// Stuff to help you debug if you want
// Can ignore or use to see if it works.
static <E extends Comparable<E>> Tree<E> mkBST (Collection<E> elems) {
Tree<E> result = new BST<>();
for (E e : elems) result.insert(e);
return result;
}
public TreePrinter.PrintableNode getLeft() {
return this.root.hasLeft() ? this.root.left() : null;

}
public TreePrinter.PrintableNode getRight() {
return this.root.hasRight() ? this.root.right() : null;
}
public String getText() {
return (this.root != null) ? this.root.getText() : "";
}
}

Similar to Please finish everything marked TODO- BST-java import java-util-Arra.docx

can you add a delete button and a add button to the below program. java fx package nusoft; public class Car { private String make; private String model; private int year; private String color; public Car(String make, int year, String model, String color) { this.make = make; this.model = model; this.year = year; this.color = color; } public String getMake() { return make; } public void setMake(String make) { this.make = make; } public String getModel() { return model; } public void setModel(String model) { this.model = model; } public int getYear() { return year; } public void setYear(int year) { this.year = year; } public String getColor() { return color; } public void setColor(String color) { this.color = color; } @Override public String toString() { return year + " " + make + " " + model + " (" + color + ")"; } } package nusoft; import java.io.BufferedReader; import java.io.FileReader; import java.io.IOException; import java.util.ArrayList; import javafx.application.Application; import javafx.geometry.Pos; import javafx.scene.Scene; import javafx.scene.control.Button; import javafx.scene.control.Label; import javafx.scene.layout.BorderPane; import javafx.scene.layout.VBox; import javafx.stage.Stage; public class CarNavigator extends Application { private ArrayList cars = new ArrayList<>(); private int currentIndex = 0; @Override public void start(Stage primaryStage) throws Exception { readCarsFile(); Label carLabel = new Label(); carLabel.setAlignment(Pos.CENTER); updateCarLabel(carLabel); Button prevButton = new Button("Previous"); prevButton.setOnAction(e -> { currentIndex--; if (currentIndex < 0) { currentIndex = cars.size() - 1; } updateCarLabel(carLabel); }); Button nextButton = new Button("Next"); nextButton.setOnAction(e -> { currentIndex++; if (currentIndex >= cars.size()) { currentIndex = 0; } updateCarLabel(carLabel); }); VBox buttonBox = new VBox(10, prevButton, nextButton); buttonBox.setAlignment(Pos.CENTER); BorderPane root = new BorderPane(carLabel, null, null, buttonBox, null); Scene scene = new Scene(root, 400, 200); primaryStage.setScene(scene); primaryStage.show(); } private void readCarsFile() throws IOException { BufferedReader reader = new BufferedReader(new FileReader("cars.txt")); String line; while ((line = reader.readLine()) != null) { cars.add(line); } reader.close(); } private void updateCarLabel(Label label) { label.setText(cars.get(currentIndex)); } public static void main(String[] args) { launch(args); } } package nusoft.utils; import java.util.NoSuchElementException; import nusoft.Car; public class NuLinkedList { private Node head; private Node tail; private int size; private static class Node { E element; Node prev; Node next; Node(E element, Node prev, Node next) { this.element = element; this.prev = prev; this.next = next; } } public boolean contains(E e) { return indexOf(e) != -1; } public E get(int index) { if (index < 0 || index >= size) { throw new IndexOutOfBoundsException(); } return getNode(index).el.

can you add a delete button and a add button to the below program. j.pdf

sales88

we using java code /** * DynamicArray.java * * Replace all //TODO tags with your code * * Note that below the "//TODO" tag there may be * something like "return null;", "return 0;", etc. * That line is just "stubbed in" so the class * will compile. When you add your code (one or many * statements), you will want to delete the "stubbed" line. * By "stubbed in" we mean "mocked" or "faked in" temporarily. * * When testing, construct using the static factory methods: DynamicList.newEmpty() DynamicList.fromGrowthFactor(growthFactor) DynamicList.from(arrayElements) */ package model.list; import java.lang.reflect.Array; import java.util.concurrent.atomic.AtomicInteger; import java.util.function.BiFunction; import java.util.function.Consumer; import java.util.function.Function; import model.linearpub.DynamicList; import model.linearpub.StructureIterator; public class DynamicArray<E> implements DynamicList<E> { //--------------------------------- // Instance Variables //TODO - declare instance variable(s) //--------------------------------- // Private Constructors /** Constructs and returns new DynamicArray (no args constructor) */ private DynamicArray() { this(defaultGrowthFactor()); } /** Constructs and returns new DynamicArray with "aGrowthFactor" */ private DynamicArray(double aGrowthFactor) { //TODO -- this is the constructor that should //initialize the dynamic array as needed } //------------------------------------------------ public static double defaultGrowthFactor() { //TODO - replace 0 with a good growth factor return 0; } protected static int defaultInitialCapacity() { //TODO - replace 0 with a good initial capacity return 0; } //-------------------- List Statistics --------------------- /** * Return number of elements in this list. */ @Override public int size() { //TODO return 0; } /** * Return true is this list contains no elements. */ @Override public boolean isEmpty() { //TODO return false; } //------------------ Accessing Elements -------------------- /** * Return element at given index. * Throws IndexOutOfBoundsException if passed index is invalid. */ @Override public E get(int index) { //TODO return null; } /** * Return first element * Throws RuntimeException if list is empty */ @Override public E first() { //TODO return null; } /** * Return last element * Throws RuntimeException if list is empty */ @Override public E last() { //TODO return null; } /** * Return a new list containing the elements of this list * between the given index "start" (inclusive) and * the given index "stop" (exclusive). * Throws IndexOutOfBoundsException if either passed index is invalid. */ @Override public DynamicList<E> subList(int start, int stop) { //TODO return null; } /** * Return index of first matching element (where searchFct outputs true) * Return -1 if no match * Example usage (first list of integers, then employees): * index = list.find(eaInteger -> eaInteger == 10); * index = employeeList.find(employee -> employee .getFirstName().equals("Kofi.

we using java code DynamicArrayjava Replace all .pdf

gudduraza28

So I have this code( StackInAllSocks ) and I implemented the method but I can't seem to figure out why there isn't anything showing up on the console. It should pop,peek and push b using the methods from the class called ArrayListTen . The ArrayListTen works fine and compiles the tested code of Rigth# but for StackInAllSocks it doesn't complete at all. note that file VodeDodeis not to be changed is just a Node storage area of the array list. Did I implement the method on StackInAllSocks correctly? if so, should I not use the method from the ArrayListTen .? __________________________________________________________________________ : the code is : VodeDodeis class VodeDode<T> { private T data; private VodeDode<T> next; private VodeDode<T> prev; public VodeDode(T data) { this.data = data; this.next = null; this.prev = null;} public T getData() { return data;} public void setData(T data) { this.data = data;} public VodeDode<T> getNext() { return this.next;} public void setNext(VodeDode<T> next) { this.next = next;} public VodeDode<T> getPrev() { return this.prev;} public void setPrev(VodeDode<T> prev) { this.prev = prev;} @Override public String toString() { return data.toString();}} _________________________________________________________________________ CODE that works fine called ArrayListTen: import java.util.Iterator; public class ArrayListTen<T> implements Iterable<T> { private VodeDode<T> head; //beginning of list private VodeDode<T> tail; //end of list private int size; private VodeDode<T> new_item; public ArrayListTen( ){ this.head = null; this.tail = null; this.size = 0;} public int lenght() { return size ;} public T getBegin() { if (this.head != null) { return head.getData();} else { return null;}} public void addBegin(T value) { VodeDode<T> newVodeDode =new VodeDode<T>(value); if (this.head== null) { head = newVodeDode; tail =newVodeDode;} else {VodeDode<T> temp = head; head = newVodeDode; head.setNext(temp);} size++;} public T removeBegin() { if(this.head == null) { return null;} else {T current = head.getData(); if (tail == head) { tail = null; head = null; } else { head = head.getNext(); head.setPrev(null);}size--; return current;}} public T getEnd() { if (tail != null) { return tail.getData(); } else { return null;}} public void addEnd(T value) { VodeDode<T> newVodeDode = new VodeDode<T>(value); if (this.tail == null) { head = newVodeDode; tail = newVodeDode; } else { newVodeDode.setPrev(tail); tail.setNext(newVodeDode); tail = newVodeDode;} size++;} public T removeEnd() { if(this.tail == null) { return null;} else { T current = tail.getData();//was head. if (head == tail) { head = null; tail = null; } else { tail = tail.getPrev(); tail.setNext(null);} size--; return current;}} public T removeBN(T value) { VodeDode<T> currVodeDode = head; VodeDode<T> prevVodeDode = null; while(currVodeDode != null){ if(currVodeDode.getData().equals(value)){ if(prevVodeDode != null){ prevVodeDode.setNext(currVodeDode.getNext());} else{ head = curr.

So I have this code(StackInAllSocks) and I implemented the method but.pdf

aksahnan

For this micro assignment, you must implement two Linked List functions. We will use the following example Linked List: 2 0 -1 5 7 getElementAt(index) This function should return the element (i.e. value) of the Nth item inside the linked list. For example, on the Linked List above, getElementAt(0) should return 2; getElementAt(3) should return 5. addElementAt(value, location) This function should insert a new value at the given location. Note that the location supplied must be within bounds of the LinkedList. For example, we cannot call addElementAt(4, 11) on the above Linked List because 11 is beyond the size of the Linked List. Here are some examples. If we call addElementAt(0, 1), the above Linked List would now look like: 1 2 0 -1 5 7 If we again call addElementAt(2, 123), we would get: 1 2 123 0 -1 5 7 Grading Your submission will be graded based on the following: 1. [7] Your solution does not cause any runtime issues and your file passes all test cases 2. [3] Your code contains good style. For example,  You provide meaningful variable names  You provide sufficient and meaningful comments  Your code is well structured @@@@@@@@@@@@@@@@@@@@@@@@ #ifndef LINKED_LIST_H #define LINKED_LIST_H #include #include #include "LinkedListNode.h" #include using namespace std; template class LinkedList { private: //points to the front of the linked list LinkedListNode *_front = nullptr; //keeping track of size in a variable eliminates need to continually //count LL boxes. int _size = 0; protected: //creates a new LinkedListNode for us virtual LinkedListNode *createNode(T value) { return new LinkedListNode < T > { value }; } public: //default constructor LinkedList() { _front = nullptr; } //copy constructor LinkedList(const LinkedList &other) { for (int i = 0; i < other.getSize(); i++) { addElement(other.getElementAt(i)); } } //move constructor LinkedList(LinkedList &&other) { //take other's data _front = other._front; _size = other._size; //reset other's pointers other._front = nullptr; } //initializer list constructor LinkedList(initializer_list values) { for (auto item : values) { addElement(item); } } //Always remember to clean up pointers in destructor! virtual ~LinkedList() { LinkedListNode *current = _front; while (current != nullptr) { LinkedListNode *temp = current->getNext(); delete current; current = temp; } } //will return true if the LL is empty. virtual bool isEmpty() const { return _size == 0; } //returns the size of the LL. virtual int getSize() const { return _size; } .

For this micro assignment, you must implement two Linked List functi.docx

mckellarhastings

Favor composition over inheritance

Kochih Wu

java question: \"Fill the add statement area\" Project is to work with stacks. package p2; public class Coordinate { public int x; public int y; public Coordinate( int x, int y ) { this.x = x; this.y = y; } public String toString() { return \"(\" + this.x + \",\" + this.y + \")\"; } @Override public boolean equals( Object object ) { if( object == null ) { return false; } if( ! Coordinate.class.isAssignableFrom( object.getClass() )) { return false; } final Coordinate other = (Coordinate) object; return this.x == other.x && this.y == other.y; } } package p2; public class Coordinate { public int x; public int y; public Coordinate( int x, int y ) { this.x = x; this.y = y; } public String toString() { return \"(\" + this.x + \",\" + this.y + \")\"; } @Override public boolean equals( Object object ) { if( object == null ) { return false; } if( ! Coordinate.class.isAssignableFrom( object.getClass() )) { return false; } final Coordinate other = (Coordinate) object; return this.x == other.x && this.y == other.y; } } package p2; import java.util.Vector; public class Maze { private char[][] maze; private int height; private int width; /** * Create a new Maze of the specified height and width, initializing every * location as empty, with a \' \'. **/ public Maze( int width, int height ) { // ADD STATEMENTS HERE } /** * Mutator to allow us to set the specified Coordinate as blocked, * marking it with a \'X\' **/ public void setBlocked( Coordinate coord ) { // ADD STATEMENTS HERE } /** * Mutator to allow us to set the specified Coordinate as having been visited, * marking it with a \'*\' **/ public void setVisited( Coordinate coord ) { // ADD STATEMENTS HERE } /** * Mutator to allow us to set the specified Coordinate as part of the path solution, * marking it with a \'.\' **/ public void setPath( Coordinate coord ) { // ADD STATEMENTS HERE } /** * Returns the character at the locatio specified by the Coordinate **/ public char at( Coordinate coord ) { // ADD STATEMENTS HERE } /** * Returns a Coordinate array containing all Coordinates that are clear around * the specified coordinate. **/ public Coordinate[] clearAround( Coordinate coord ) { Vector vector = new Vector(); // ADD STATEMENTS HERE // Look at each of the locations around the specified Coordinate, and add it // to the vector if it is clear (i.e. a space) return vector.toArray( new Coordinate[0] ); } /** * Returns a Coordinate that provides the entrance location in this maze. **/ public Coordinate start() { return new Coordinate( 0, 1 ); } /** * Returns a Coordinate that provides the exit location from this maze. **/ public Coordinate end() { // ADD STATEMENTS HERE } /** * The toString() method is responsible for creating a String representation * of the Maze. See the project specification for sample output. Note that * the String representation adds numbers across the top and side of the Maze * to show the Coordinates of each cell in the maze. **/ public String toString() { StringBuilder buffer =.

java question Fill the add statement areaProject is to wo.pdf

dbrienmhompsonkath75

Please fix my errors class Iterator { public: /// Constructor taking a head and tail pointer; YOU'RE WELCOME Iterator(Node<T> *head, Node<T> *tail) : head_(head), tail_(tail) { cursor_ = end(); } /// Constructor taking a head, tail, and cursor pointer; YOU'RE WELCOME Iterator(Node<T> *head, Node<T> *tail, Node<T> *cursor) : head_(head), tail_(tail), cursor_(cursor) {} /// Get a pointer to the head node, or end() if this list is empty Node<T> *begin() { return head_; } /// Get a node pointer representing "end" (aka "depleted"). Probably want to just use nullptr. Node<T> *end() { return nullptr; } /// Get the node to which this iterator is currently pointing Node<T> *getCursor() { return cursor_; } /** * Assignment operator * Return a copy of this Iterator, after modification */ Iterator &operator=(const Iterator &other) { head_ = other.head_; tail_ = other.tail_; cursor_ = other.cursor_; return *this; } /** * Comparison operator * Returns true if this iterator is equal to the other iterator, false otherwise */ bool operator==(const Iterator &other) { return cursor_ == other.cursor_; } /** * Inequality comparison operator * Returns true if this iterator is not equal to the other iterator, false otherwise */ bool operator!=(const Iterator &other) { return !(*this == other); } /** * Prefix increment operator * Return a copy of this Iterator, after modification */ Iterator &operator++() { cursor_ = cursor_->getNext(); return *this; } /*** Postfix increment * Return a copy of this Iterator, BEFORE it was modified */ Iterator operator++(int) { Iterator copy(*this); ++(*this); return copy; } /*** Prefix decrement operator * Return a copy of this Iterator, after modification */ Iterator &operator--() { cursor_ = cursor_->getPrev(); return *this; } /** * Postfix decrement operator * Return a copy of this Iterator BEFORE it was modified */ Iterator operator--(int) { Iterator copy = *this; --(*this); return copy; } /** * AdditionAssignment operator * Return a copy of the current iterator, after modification */ Iterator operator+=(size_t add) { for (size_t i = 0; i < add && cursor_ != nullptr; ++i) { cursor_ = cursor_->getNext(); } return *this; } /** * SubtractionAssignment operator * Return a copy of the current iterator, after modification */ Iterator operator-=(size_t sub) { for (size_t i = 0; i < sub && cursor_ != nullptr; ++i) { cursor_ = cursor_->getPrev(); } return *this; } /** * AdditionAssignment operator, supporting positive or negative ints */ Iterator operator+=(int add) { if (add > 0) { for (int i = 0; i < add && cursor_ != nullptr; ++i) { cursor_ = cursor_->getNext(); } } else { for (int i = 0; i > add && cursor_->getPrev() != nullptr; --i) { cursor_ = cursor_->getPrev(); } } return *this; } /** * SubtractionAssignment operator, supporting positive or negative ints */ Iterator operator-=(int subtract) { // This function adds an integer to the current iterators position in the list, if (subtract > 0) { for (int i = 0; i < subtract && cursor_.

Please fix my errors class Iterator public Construc.pdf

kitty811

To-Do App With Flutter: Step By Step Guide

Biztech Consulting & Solutions

Data Structures and Agorithm: DS 14 Binary Expression Tree.pptx

RashidFaridChishti

2014-11-01 01 Денис Нелюбин. О сортах кофе

Омские ИТ-субботники

The following is to be written in Java: The following is the BSTree.java I have written. Use this code and extend it to achieve the problems listed above: import java.io.*; import java.util.*; class BSTNode { BSTNode left, right; Comparable data; public BSTNode(){ left = null; right = null; data = 0; } /* Constructor */ public BSTNode(Comparable n){ left = null; right = null; data = n; } public void setLeft(BSTNode n){ left = n; } public void setRight(BSTNode n){ right = n; } public BSTNode getLeft(){ return left; } public BSTNode getRight(){ return right; } public void setData(int d){ data = d; } public Comparable getData(){ return data; } } class BST { private BSTNode root; /* Constructor */ public BST(){ root = null; } /* Functions to insert data */ public void insert(Comparable data){ if (root == null){ root = new BSTNode(data); } else insert(root, data); } /* Function to insert data recursively */ private void insert(BSTNode node, Comparable data){ //if (node.getData().equals(data)) thr(); if (data.compareTo(node.getData()) < 0){ //when data < node\'s data //add data as left child of node if it doesnt have one //else insert into node\'s left subtree if (node.getLeft() == null) node.setLeft(new BSTNode(data)); else insert(node.getLeft(), data); } else { //when data > node\'s data //insert data as right child of node if it doesnt have one //else insert into node\'s right subtree if (node.getRight() == null) node.setRight(new BSTNode(data)); else insert(node.getRight(), data); } } public boolean search(Comparable data) { return search(root, data); } private static boolean search(BSTNode node, Comparable data) { if (node == null) return false; if (node.getData().equals(data)) return true; if (data.compareTo(node.getData()) < 0) { // data < this node\'s key; look in left subtree return search(node.getLeft(), data); } else { // data > this node\'s key; look in right subtree return search(node.getRight(), data); } } /* Function for inorder traversal */ public void inorder(){ inorder(root); } private void inorder(BSTNode r){ if (r != null){ inorder(r.getLeft()); System.out.print(r.getData() +\" \"); inorder(r.getRight()); } } } public class BSTree { public static void main(String[] args) { BST bst = new BST(); int[] x = {4,2,6,1,3,5,7,8,12,15,10,13,14,9}; for(int i=0;i Solution REDBLACK.java /* -------------------------------------------------------------------------------------------------------------------- ----------------------------------------------- RBBST.java.

The following is to be written in JavaThe following is the BSTree.pdf

eyewatchsystems

Lab3

karan saini

6. Generics. Collections. Streams

DEVTYPE

Infinum Android Talks #20 - DiffUtil

Infinum

Zend Framework and the Doctrine2 MongoDB ODM (ZF1)

Ryan Mauger

TDC2016POA | Trilha .NET - CQRS e ES na prática com RavenDB

tdc-globalcode

Reactive clean architecture

Viktor Nyblom

C++ prgms 5th unit (inheritance ii)

Ananda Kumar HN

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.

5. Design and implement a method contains 2 for BinarySearchTree, fu.pdf

rambagra74

Awt

Swarup Saha

Similar to Please finish everything marked TODO- BST-java import java-util-Arra.docx (20)

can you add a delete button and a add button to the below program. j.pdf

we using java code DynamicArrayjava Replace all .pdf

So I have this code(StackInAllSocks) and I implemented the method but.pdf

For this micro assignment, you must implement two Linked List functi.docx

Favor composition over inheritance

java question Fill the add statement areaProject is to wo.pdf

Please fix my errors class Iterator public Construc.pdf

To-Do App With Flutter: Step By Step Guide

Data Structures and Agorithm: DS 14 Binary Expression Tree.pptx

2014-11-01 01 Денис Нелюбин. О сортах кофе

The following is to be written in JavaThe following is the BSTree.pdf

Lab3

6. Generics. Collections. Streams

Infinum Android Talks #20 - DiffUtil

Zend Framework and the Doctrine2 MongoDB ODM (ZF1)

TDC2016POA | Trilha .NET - CQRS e ES na prática com RavenDB

Reactive clean architecture

C++ prgms 5th unit (inheritance ii)

5. Design and implement a method contains 2 for BinarySearchTree, fu.pdf

Awt

More from JakeT2gGrayp

Please discuss the bone growth abnormality achondroplasia (achondropla.docx

JakeT2gGrayp

Please answer all questions. Will upvote! Profitability ratios help in the analysis of the combined impact of liquidity ratios, asset management ratios, and debt management ratios on the operating performance of a firm. Your boss has asked you to calculate the profitability ratios of Randall and Arts Inc. and make comments on its second-year performance as compared with its first-year performance. The following shows Randall and Arts Inc.'s income statement for the last two years. The company had assets of $10 , 575 million in the first year and $16 , 916 million in the second year. Common equity was equal to $5 , 625 million in the first year, and the company distributed 100% of its earnings out as dividends during the first and the second years. In addition, the firm did not issue new stock during either year. Randall and Arts Inc. Income Statement For the Year Ending on December 31 (Millions of dollars) Calculate the profitability ratios of Randall and Arts Inc. in the following table. Convert all calculations to a percentage rounded to two decimal places. Decision makers and analysts look deeply into profitability ratios to identify trends in a company's profitability. Profitability ratios give insights into both the survivability of a company and the benefits that shareholders receive. Identify which of the following statements are true about profitability ratios. Check all that apply. A higher operating margin than the industry average indicates either lower operating costs, higher product pricing, or both. If a company's operating margin increases but its profit margin decreases, it could mean that the company paid more in interest or taxes. An increase in the return on assets ratio implies an increase in the assets a firm owns. If a company issues new common shares but its net income does not increase, return on common equity will increase. .

Please answer all questions- Will upvote! Profitability ratios help in.docx

JakeT2gGrayp

picture of artery and vein to label i need a plain diagram of arteries.docx

JakeT2gGrayp

Please answer all questions. 1) Adaptive immunity has five distinct attributes: a) ___ : Adaptive immune responses are precisely tailored reactions against specific attackers. b) : Cells of adaptive immunity activate only in response to specific pathogens. c) : Once induced, cells of adaptive immunity proliferate to form many generations of nearly identical cells called clones. d) : As a rule, adaptive immunity does not act against normal body cells. e) : An adaptive immune response has immunological memory and is able to generate faster and more effective responses in subsequent encounters with a particular pathogen or toxin. 2) These characteristics of adaptive immunity involve the activities of which are a type of leukocyte (white blood cell) that acts against specific pathogens. 3) Human lymphocytes of humans form in the where blood stem cells produce all types of blood cells. 4) There are two main types of lymphocytes, and a) arise and mature in the red bone marrow of adults. b) begin in the bone marrow but mature in the thymus. 5) Adaptive immunity consists of two basic types of responses, a) immune responses and often act against intracellular pathogens. b) immune responses and often act against extracellular pathogens and toxins 6) The long-term ability of descendants of B and T cells to mount adaptive immunological responses against specific pathogens is called immunological 7) An is a protein secreted by the descendant of a B cell that recognizes and strongly binds to the specific biochemical shape. ELEMENTS OF ADAPTIVE IMMUNITY 1) The is composed of lymphatic vessels, which conduct the flow of lymph, and lymphoid and that are directly involved in specific immunity. 2) The lymphoid organs include nodes, the , the the and (MALT). .

Please answer all questions- 1) Adaptive immunity has five distinct a.docx

JakeT2gGrayp

Photoreceptors respond to the removal of light by Group of answer choi.docx

JakeT2gGrayp

Please answer all questions. IMMUNIZATION Immunization or vaccination - what's the difference? The terms 'vaccination' and 'immunization' don't mean the same thing. Immunity is a state of protection from a particular infectious disease. Immunization is the process of producing a state of immunity in a subject. Vaccine is a preparation of immunogenic material used to induce immunity against pathogenic organisms. Vaccination is the term for the process of inducing adaptive immunity. Brief History of Immunization 1. The Chinese adopted a policy of deliberately infecting young children with particles of ground smallpox scabs from children who had survived mild cases by a procedure, called 2. developed the modern practice of vaccination when he inoculated people with cowpox virus to protect them against smallpox Active Immunization 1. The basic principle behind vaccination is to stimulate a response and a memory response that primes the immune system for future exposure to a virulent pathogen. 2. Active immunization involves different vaccine types: a. also called modified live vaccines contain weakened microorganisms; and generally provide lifelong immunity b. vaccines consist of killed bacteria or viruses which include i. , which are produced with inactivated but whole microbes. ii. which are produced with antigenic fragments of microbes. iii. For these vaccines, which cannot replicate or retain residual virulence, multiple doses must be administered to achieve immunity iv. May contain , which are chemicals added to increase their ability to stimulate active immunity. c. vaccines are chemically or thermally modified toxins that stimulate immunity against toxins rather than cellular antigens d. vaccines combine antigens from several pathogens that are administered simultaneously. e. vaccines use recombinant gene technology to remove virulence genes from microbes to create attenuated vaccines, to produce large quantities of antigens for use in immunizations, or to alter cells, viruses, or plasmids by introducing genes for antigens into them. .

Please answer all questions- IMMUNIZATION Immunization or vaccination.docx

JakeT2gGrayp

Place these phases of an audit in chronological order- A- Assess the r.docx

JakeT2gGrayp

Petty Cash Fund Petty Cash Fund Libby Company established a petty cas.docx

JakeT2gGrayp

Please answer question 4b only 4. The image below (on Endomembrane System) has been labeled. Refer to the key as you answer the two questions ( 4 a and 4 b ) that follow. Key for Image > A. Vesicle B. Hydrolytic enzymes C. Lysosome D. Transport vesicle E. Lipids F. Smooth ER G. Ribosome H. Nucleus I. Rough ER J. Transport vesicle K. Proteins L. Golgi body M. Cytoplasm N. Secretory vesicle O. Cell membrane Follow-up questions corresponding to image above. 4a. Briefly describe how the following structures work together: (Letters: G, I, J, L, N, and O). 4b. Briefly describe how the following structures work together: (Letters: A, C, L, and O). .

Please answer question 4b only 4- The image below (on Endomembrane Sys.docx

JakeT2gGrayp

Please answer all questions. b. The in which CD95L binds to CD95 on the target cell, triggering target cell apoptosis. T cells, which function in memory responses. 4. Cytotoxic T cells may also form Antibody Immune Responses Inducement of T-Dependent Antibody Immunity with Clonal Selection Activation of T-dependent antibody immunity requires the assistance of type 2 helper T (Th2) cells. 1. In antibody immunity, an APC's MHC II protein-epitope complex activates a helper T cell (Th cell) bearing a complementary 2. APCs present epitopes on MHC molecules and form an immunological synapse with Th using the complementary TCR. 3. CD 4 MHC interaction stabilizes the synapse, and the delivers a second signal. 4. ( IL 4 ) then induces the Th cell to become a type T cell (Th2). 5. The Th_cell interacts with cells displaying epitope on MHC II and releases . Since only B cells displaying the epitope the Th2 cell recognizes are activated, this process is called selection. 6. The activated B cell proliferates rapidly and the clones differentiate into either B cells or cells. 7. cells live for only a short time but secrete large amounts of antibodies, beginning with and class switching as they get older. 8. B cells migrate to lymphoid tissues to await a subsequent encounter with the same antigen. Types of Acquired Immunity Specific immunity is characterized either naturally or artificially acquired and as either active or passive. 1. When the body mounts a specific immune response against an infectious agent, the result is called _ immunity. 2. The passing of maternal IgG to the fetus and the transmission of secretory IgA in breastmilk to a baby are examples of immunity. 3. immunity is achieved by deliberately injecting someone with antigens in vaccines to provoke an active response, as in the process of immunization. 4. immunotherapy involves the administration of preformed antibodies in antitoxins or antisera to a patient. Immune Responses 1. The first adaptive response to a particular antigen is called the As a result of this initial encounter, the adaptive immune system "remembers" the mechanism that was effective against that specific antigen. 2. If the same antigen is encountered later in life, a stronger antigen-specific adaptive immune response occurs, called the response. .

Please answer all questions- b- The in which CD95L binds to CD95 on t.docx

JakeT2gGrayp

Please answer all questions. T Lymphocytes (T Cells) 1) T lymphocytes act against antigens, producing -mediated immune responses. 2) T cells have (TCRs), which have an antigen- binding site for a specific epitope. 3) T cells mature under the influence of signals from the , and they attack cells that harbor endogenous pathogens during -mediated immune responses. 4) In cell-mediated immunity, - also called CD8 positive (CD8+ cells) because they have membrane protein CD8-act against infected or abnormal body cells, including virus-infected cells, bacteria-infected cells, some fungus- or protozoan-infected cells, some cancer cells, and foreign cells that enter the body as a result of organ transplantation. 5) Two types of - Th1 and Th2 - are characterized by a membrane protein, CD4, so they are CD4+ and direct cell-mediated and antibody immune responses, respectively. B Lymphocytes (B Cells) and Antibodies 1. , which in the red bone marrow, make immunoglobulins (Ig) of two types(BCRs) and 2. Immunoglobulins are complementary to epitopes and consist of two identical shorter chains and two identical longer chains joined via bonds to form Y shaped molecules. 3. are inserted into the cytoplasmic membranes of B cells via transmembrane polypeptides. 4. The arms of each heavy and light chain vary in amino acid sequence, and thus each is called a region. 5. The two variable regions form -binding sites. 6. Exact binding between an antigen-binding site and an epitope accounts for the of an antibody immune response. 7. Because an antigen typically has numerous , many different BCRs will recognize any particular antigen's epitopes, but each BCR recognizes only epitope. 8. When an antigenic epitope stimulates a specific B cell, the B cell begins reproducing. a. The daughter B lymphocytes are now called cells, secrete and no longer display 9. Antibodies: a. similar to BCRs in shape but are portion of BCRs. b. Antibodies carry the same cell. for an epitope as the BCR of the activated B c. The arms, or antigen-binding sites. (fragment, antigen-binding), of the antibody contain the d. The antibody stem is called the (fragment, crystallizable). e. There are five basic types of stems, and these form the five classes of antibodies: , and .

Please answer all questions- T Lymphocytes (T Cells) 1) T lymphocytes.docx

JakeT2gGrayp

Please answer all questions. 5. When the inflammatory mediators exceed the body's coping mechanisms, acute shock may occur, which requires immediate treatment with epinephrine. 6. Type I hypersensitivity can be diagnosed by and can be partially prevented by avoidance of and by 7. Some type I hypersensitivities are treated with IMMUNODEFICIENCY DISEASES 1. develop when the body cannot launch or sustain an immune response and may be classified as: a. immunodeficiency diseases, which result from mutations or developmental anomalies and occur in young children, are present from birth, resulting from a genetic defect or developmental abnormality. They are generally rare and may affect B cells, T cells, natural killer (NK) cells, phagocytes, or complement components. b. immunodeficiency diseases, occur after birth, perhaps due . The most significant example of an acquired immunodeficiency is (AIDS). c. People with either type of immunodeficiency tend to have repeated infections; the types of infections often depend on which part of the immune system is affected. .

Please answer all questions- 5- When the inflammatory mediators excee (1).docx

JakeT2gGrayp

Please answer all questions. 10. Antibody Function: The binding of antibody to epitope is the central functional feature of antibody adaptive immune responses. Once bound, they function in several ways. These include: a. : Stems of antibody molecules can bind and activate complement protein 1 (C1), triggering the complement cascade. IgE antibody stems attach to mast cells and eosinophils, causing them to release inflammatory chemicals. b. which antibodies achieve by binding to critical portions, or neutralization of bacteria or viruses, when bound antibodies block attachment molecules on their surfaces. c. : whereby antibodies act as opsonins to stimulate Phagocytes have receptors for antibody stems and can phagocytize them quickly. d. which is the clumping of antigen-bound antibody molecules, and which hinders the activity of pathogens and increases the chance that they will be e. (ADCC). Similar to opsonization, the stems of antibodies interact with , which then releases perforin and granzymes, which trigger in the targeted cell. Immune Response Cytokines 1. are soluble regulatory proteins that act as intercellular signals when released by certain body cells, including those of the kidney, skin, and immune system. 2. Cytokines of the immune system include: a. : which signal among leukocytes (primarily). b. : which are antiviral proteins that also act as cytokines. The most potent is gamma interferon (IFN-p). c. which stimulate leukocyte stem cells to divide. d. which is secreted by macrophages and T cells to kill tumor cells and to regulate immune responses and inflammation. e. which signal leukocytes to move to a site of inflammation or infection, or to move within tissues. Cell-Mediated Immune Responses The body uses cell-mediated immune responses to endogenous antigens to fight intracellular pathogens such as viruses that have invaded body cells, as well as abnormal body cells such as cancer cells. 1. Once activated by cells, T cells (Tc cells) recognize abnormal molecules presented by MHC class foreign cells. 2. Activated Tc cells reproduce to form protein on the surface of infected, cancerous, or expansion. 3. T cells destroy their target cells via two pathways: a. The pathway, which kills the affected cells by secreting perforins and granzymes .

Please answer all questions- 10- Antibody Function- The binding of an.docx

JakeT2gGrayp

Phosphatidate is an intermediate in the formation of- a) phospholipids.docx

JakeT2gGrayp

phage type of 42D. Which statement(s) are true? Check All That Apply The man who is suing picked up a pathogenic S . aureus from another source, perhaps even from his own normal biota. The potato salad was the source of the outbreak for all of these people. Person number 4 who ate the original potato salad did not get ill from S . aureus in that potato salad. There is no way to determine who got infected with which S. aureus. Ceck Ar That Apour phinge typed, and this is abs eone with fecil samples trom 4 of the il peogle. The 4 it people hed no potaio saisd ien. A week ister anather person, cloiming to have boughr ine potano salsd and thrown it out aftes .

phage type of 42D- Which statement(s) are true- Check All That Apply T.docx

JakeT2gGrayp

Pequired informetion Learning Objective 03-P6- Prepare closing entries.docx

JakeT2gGrayp

Please update the registers at the end of the program execution- Also.docx

JakeT2gGrayp

Please see below H 10 table released by the Fed. Rates in currency units per U.S. dollar except as noted by an asterisk ("). Asterisk indicates U.S. dollars per currency unit. Foreign Exchange Rates - H.10 Weekly (Rates in currenev unitt per U.S. dollar exceot as noted] Using the data from the above table H 10 , calculate and state the value of the exchange rate yens per South Africa rand, EY/R on February 12. .

Please see below H10 table released by the Fed- Rates in currency unit.docx

JakeT2gGrayp

People are perceived as being more trustworthy when they- Select one-.docx

JakeT2gGrayp

Please make revision to the following program so it incorporates three different functions (other than main) without changing much of the code itself. #include <iostream> #include <fstream> #include <string> using namespace std; int main(int argc, char *argv[]) { (void) argc; string filename = argv[1]; ifstream infile; infile.open(filename); if (!infile.is_open()) { cerr << "ERROR: Error opening file - "; cerr << "please check that you specified the correct file name "; exit(EXIT_FAILURE); } if (infile.eof()) { cerr << "ERROR: Letter file is not properly formatted. "; exit(EXIT_FAILURE); } // Read the contents of the file into a string string contents; char ch; while (infile >> ch) { contents += ch; } // Calculate the frequency distribution of letters in the text int letter_count[26]; int size_of_file = contents.size(); for (int i = 0; i < 26; i++) letter_count[i] = 0; int total_letters = 0; for (int i = 0; i < size_of_file; i++) { char letter = contents[i]; if (letter >= 'a' && letter <= 'z') { letter_count[letter - 'a']++; total_letters++; } else if (letter >= 'A' && letter <= 'Z') { letter_count[letter - 'A']++; total_letters++; } } // The expected frequency distribution of English letters double expected_count[26] = {0.0812, 0.0149, 0.0271, 0.0432, 0.1202, 0.0230, 0.0203, 0.0592, 0.0731, 0.0010, 0.0069, 0.0398, 0.0261, 0.0695, 0.0768, 0.0182, 0.0011, 0.0602, 0.0628, 0.0910, 0.0288, 0.0111, 0.0209, 0.0017, 0.0211, 0.0007}; // Calculate the sum of squared errors between observed and expected // frequencies double min_error = 1e9; int shift = 0; for (int s = 0; s < 26; s++) { double error = 0.0; for (int i = 0; i < 26; i++) { int observed_count = letter_count[(i + s) % 26]; double expected = total_letters * expected_count[i]; double diff = observed_count - expected; error += diff * diff / expected; } if (error < min_error) { min_error = error; shift = s; } } // Output the shift amount cout << "The shift amount is: " << shift << endl; // Close the input file infile.close(); return 0; } .

Please make revision to the following program so it incorporates three.docx

JakeT2gGrayp

More from JakeT2gGrayp (20)