If you are to conduct an experiment that will illustrate the third law of motion, how will your experiment setup be?

What's the objective of precursor preparation experiment?

And why the color of precursors changes during the experiment?

Select a child who falls within one of the stages of development outlined by Piaget. Once you have decided on the age range you will use, choose the appropriate Piagetian experiment to determine the child's level of cognitive development. Conduct the experiment: Findings: Tell us the age and gender of the child Which experiment you used Where the experiment took place The procedures you followed What the child said and did Tell us your conclusions.

JAVA code

Create a new class called BetterDiGraph that implements the EditableDiGraph interface See the interface below for details.

EditableDigraph below:

import java.util.NoSuchElementException;

/**
* Implements an editable graph with sparse vertex support.
*
*
*/
public interface EditableDiGraph {
  
/**
* Adds an edge between two vertices, v and w. If vertices do not exist,
* adds them first.
*
* @param v source vertex
* @param w destination vertex
*/
void addEdge(int v, int w);

/**
* Adds a vertex to the graph. Does not allow duplicate vertices.
*
* @param v vertex number
*/
void addVertex(int v);

/**
* Returns the direct successors of a vertex v.
*
* @param v vertex
* @return successors of v
*/
Iterable getAdj(int v);
  
/**
* Number of edges.
*
* @return edge count
*/
int getEdgeCount();
  
/**
* Returns the in-degree of a vertex.
* @param v vertex
* @return in-degree.
* @throws NoSuchElementException exception thrown if vertex does not exist.
*/
int getIndegree(int v) throws NoSuchElementException;
  
/**
* Returns number of vertices.
* @return vertex count
*/
int getVertexCount();
  
/**
* Removes edge from graph. If vertices do not exist, does not remove edge.
*
* @param v source vertex
* @param w destination vertex
*/
void removeEdge(int v, int w);

/**
* Removes vertex from graph. If vertex does not exist, does not try to
* remove it.
*
* @param v vertex
*/
void removeVertex(int v);

/**
* Returns iterable object containing all vertices in graph.
*
* @return iterable object of vertices
*/
Iterable vertices();

/**
* Returns true if the graph contains at least one vertex.
*
* @return boolean
*/
boolean isEmpty();
  
/**
* Returns true if the graph contains a specific vertex.
*
* @param v vertex
* @return boolean
*/
boolean containsVertex(int v);
}

(a) Starting from entropy as a function of pressure and volume, S(P, V), show that

d S = C V T ( ∂ T ∂ P ) V d P + C P T ( ∂ T ∂ V ) P d V

For a certain gas that follows the following equation of state:

P(V-b) = RT

Where b is a constant

(b) Starting from the above relationship show that P(V-b)^γ=constant for the reversible adiabatic process. Assume constant heat capacity and γ=C_P/C_V as that for the ideal gas.

GRAPH THEORY

Prove/Show that a connected Graph G is not separable if and only if it is nonseparable.

Definitions for Reference: A connected Graph G is called nonseparable if it has no cut vertices (A vertex v in a connected graph G is caled a cut vertex if G-v is disconnected)

A connected graph G is called separable if there exist subgraphs H1, H2 ⊂ G. with E(H1) ∪ E(H2) = E(G) and E(H1) ∩ E(H2) = ∅. V (H1) ∪ V (H2) =V (G) and V (H1) ∩ V (H2) containing a single vertex.

Section I
You toss a coin and roll a die simultaneously. If the coin shows heads, the experiment outcome is equal to the value shown on the die. If the coin shows tails, the experiment outcome is equal to twice the value shown on the die. Assume that the coin and the die are fair. Let ? be 1 if the coin shows heads and 2 if the coin shows tails, ?be the outcome of rolling the die, and ? the outcome of the experiment. Notice that ?, ?, and ? are random variables.

1. What is the minimal sample space in this experiment? (4 points)

2. Identify the event that the outcome of the experiment is, at least, 10. (4 points)

3. What is the value of ??(? ≤ 9)? (4 points)

4. Whatisthevalueof??(4≤?≤10|?=2)?(4points)

5. Whatisthevalueof??(?=2|4≤?≤10)?(4points)

1. Add 0.5 mL of 0.10 M NiCl2 solution to each of 7 test tubes using dropper provided. Label these tubes 1 through 7. 2. Add the following to the respective tubes containing the NiCl2 solution,

Tube 1: 5 drops of water (used here as a control experiment for dilution)

Tube 2: 1 mL of conc. HCl

Tube 3: 5 drops of conc. ammonia

Tube 4: 5 drops of dilute (5% v/v) ethylenediamine solution

Tube 5: 5 drops of 0.25 M C2O4 2- (oxalate) solution

Tube 6: 5 drops of 0.1 M SCN- (thiocyanate) solution

Tube 7: 5 drops of 0.1 M EDTA solution Mix each solution thoroughly and be sure to note the colour of each tube.

3. Check the stability of each complex by adding 3-5 drops of 1 M NaOH solution. Note any changes (e.g., formation of precipitate, colour change, etc.)

4. Add 0.5 mL of 0.10 M CuSO4 solution to each of 7 new test tubes labeled 8 through 14 using dropper provided. Repeat steps 2 and 3.

The “field strength” of a ligand describes how strong the coordination bond is, for a given metal and the ligand that is considered.  The field strength is evaluated by considering how much it causes the d orbitals to split (DE), which of the ligands is strongest?  Which is the weakest?  Explain your choices in each case.

a) What are the possible errors /uncertainties that can occur in an Incline Friction Experiment? (as detailed as possible for this part)

b) What is the Incline Friction experiment background information (Like the method and the equipment used)?

c)What is the Theory about the Incline Friction experiment? (as detailed as possible for this part)

Trace the sample run provided for Search2D class

..................................................................

public class Search2D

{

    /**

     * Searches for the desiredItem in a rectangular matrix[][] where

     * elements are sorted within each row and within each column

     * If the element is found, prints its position,

     * otherwise prints "not found"

     *

     * @author YOUR NAME

     * @version 10/20/2020

     *

     */

    private void search(int[][] matrix, int desiredItem)

    {

        // TODO Project 4

        // TODO must implement with one loop only

        System.out.println("Searching for " + desiredItem);

    }

    // driver to test search method

    public static void main(String[] args)

    {

        int matrix[][] = {

                {9, 10, 20, 21, 40},

                {11, 15, 25, 26, 45},

                {13, 27, 29, 30, 48},

                {17, 32, 33, 34, 50}};

        Search2D search2D = new Search2D();

        System.out.println("\u001B[35m\u001B[1m*** These should be successful searches: ***\u001B[0m");

        for (int r = 0; r < matrix.length; r++)

        {

            for (int c = 0; c < matrix[r].length; c++)

            {

                search2D.search(matrix, matrix[r][c]);

            }

        }

        System.out.println("\n\u001B[35m\u001B[1m*** These should be unsuccessful searches: ***\u001B[0m");

        search2D.search(matrix,28);

        search2D.search(matrix,5);

        search2D.search(matrix,12);

    }

}