Sources and use statement for 2017 and 2016 information

Let S be a subset of a vector space V . Show that span(S) = span(span(S)). Show that span(S) is the unique smallest linear subspace of V containing S as a subset, and that it is the intersection of all subspaces of V that contain S as a subset.

Design a limiter circuit such that a ±20 V input sinusoidal wave is limited between +5 V and –3 V at the output. Use a single current limiting resistor and specify its value such that no diode experiences a current greater than 10 mA.

Suppose you have the 8.25 μF capacitor of a heart defibrillator at a potential difference of 13.5 × 104 V. C = 8.25 μF V = 13.5 × 104 V a) What is the energy stored in it in J? b) Find the amount of stored charge in mC.

Describe an experiment, either at the molecular/cellular level or at the physiological level to gain knowledge on the impact the biotic pathogen Phytaphthora infestans has on potato plants. Please explain methodology and what can be learned from the experiment.

What organic compounds were produced in the Miller-Urey experiment? How did the design of the experiment support the hypothesis that organic compounds are likely to have arisen from abiotic materials present in the atmosphere of early Earth?

In Caribbean seagrass meadows manatee grass Syringodium filiforme appears before turtle grass Thalassia testudinum. (a) Describe the design of an experiment to determine the mechanism of this successional sequence. (b) Give the statistical null hypothesis for this experiment.

explain how scientists were able to suggest a molecule associated with heredity using strains of pneumonia-causing bacteria. In your explanation include, one control experiment and at least one experiment as proof of such a hereditary molecule.

Java Data Structures (Stack and Recursion)

Using the CODE provided BELOW (WITHOUT IMPORTING any classes from Java Library) modify the classes and add the following methods to the code provided below.

1. Add a recursive method hmTimes() to the CODE BELOW that states how many times a particular value appears on the stack.

2. Add a recursive method insertE() to the CODE BELOW that allows insert a value at the end of the stack.

3. Add a recursive method popLast() to the CODE BELOW that allows removal of the last node from the stack.

4. Add a recursive method hmNodes() to CODE BELOW that states how many nodes does the stack have.

Prove that every method works, MULTIPLE TIMES, in the MAIN StackWithLinkedList2.

CODE:

class Node {

  int value;

  Node nextNode;

  Node(int v, Node n)

  {

    value = v;

nextNode = n;

  }

  Node (int v)

  {

     this(v,null);

  }

}

class Stack {

  protected Node top;

  Stack()

  {

    top = null;

  }

  boolean isEmpty()

  {

    return( top == null);

  }

  void push(int v)

  {

    Node tempPointer;

    tempPointer = new Node(v);

tempPointer.nextNode = top;

top = tempPointer;

  }

  int pop()

  {

    int tempValue;

tempValue = top.value;

top = top.nextNode;

return tempValue;

  }   

  void printStack()

  {

    Node aPointer = top;

String tempString = "";

while (aPointer != null)

{

tempString = tempString + aPointer.value + "\n";

aPointer = aPointer.nextNode;

}

System.out.println(tempString);

  }

  boolean hasValue(int v)

  {

    if (top.value == v)

{

return true;

}

else

{

return hasValueSubList(top,v);

}

  }

  boolean hasValueSubList(Node ptr, int v)

  {

    if (ptr.nextNode == null)

{

return false;

}

else if (ptr.nextNode.value == v)

{

return true;

}

else

{

return hasValueSubList(ptr.nextNode,v);

}

  }

}

public class StackWithLinkedList2{

  public static void main(String[] args){

    int popValue;

    Stack myStack = new Stack();

myStack.push(5);

myStack.push(7);

myStack.push(9);

    System.out.println(myStack.hasValue(11));

  }

}