The microscope that gives the greatest resolution, and therefore the highest useful magnification is the:  

A. compound light microscope;  

B. transmission electron microscope;  

C. darkfield microscope;  

D. scanning electron microscope;  

E. fluorescence microscope.

A) The full employment level of RGDP is the absolute highest level of output that the economoy can produce with its existing labor force, technology and amount of capital equipment structures. Agree or Disagree and why.

B) Why do economists estimate that the economy has attained full employment when the measured rate of unemploymnet is as high as 4% or possible 4.5%?

The article presents an analysis of the current outlook of the highest court in the United States. We often think of courts (and especially the Supreme Court) as dispassionate and thoroughly objective institutions. Yet as the text materials in Chapter One discuss, there are various schools of jurisprudence, some of whom try to examine the ways in which courts really operate. Robin Conrad and Ralph Nader have opposed views on the current court that appear prominently in the article.

Link to article: http://www.nytimes.com/2008/03/16/magazine/16supreme-t.html?_r=3&scp=2&sq=rosen+supreme+court+inc&st=nyt&oref=slogin&oref=slogin&oref=slogin

Describe their respective viewpoints. Does this article change your impression of the Supreme Court? Why or why not?

How to find the day of the highest and lowest temperatures? And how to find an average of high and low temperatures? C language

Diversification in an investment portfolio is a significant concept for creating the highest return for the least amount of risk. To create this diversification portfolio managers consider the correlation of investments. Based on your reading, thoroughly explain how correlation is interpreted and how it can help with the creation of a diversified portfolio.

Modify the method so that the item with the highest key is not only returned by the method but is also removed from the array.

Call the method removeMax().

// highArray.java
// demonstrates array class with high-level interface
// to run this program: C>java HighArrayApp
////////////////////////////////////////////////////////////////
class HighArray {
    private long[] a; // ref to array a
    private int nElems; // number of data items

    //-----------------------------------------------------------
    public HighArray(int max) // constructor
    {
        a = new long[max]; // create the array
        nElems = 0; // no items yet
    }

    //-----------------------------------------------------------
    public boolean find(long searchKey) { // find specified value
        int j;
        for (j = 0; j < nElems; j++) // for each element,
            if (a[j] == searchKey) // found item?
                break; // exit loop before end
        if (j == nElems) // gone to end?
            return false; // yes, can't find it
        else
            return true; // no, found it
    } // end find()

    //-----------------------------------------------------------
    public void insert(long value) // put element into array
    {
        a[nElems] = value; // insert it
        nElems++; // increment size
    }

    //-----------------------------------------------------------
    public boolean delete(long value) {
        int j;
        for (j = 0; j < nElems; j++) // look for it
            if (value == a[j])
                break;
        if (j == nElems) // can't find it
            return false;
        else // found it
        {
            for (int k = j; k < nElems; k++) // move higher ones down
                a[k] = a[k + 1];
            nElems--; // decrement size
            return true;
        }
    } // end delete()

    //-----------------------------------------------------------
    public void display() // displays array contents
    {
        for (int j = 0; j < nElems; j++) // for each element,
            System.out.print(a[j] + " "); // display it
        System.out.println("");
    }

    public long getMax() {
        if (nElems == 0) {
            return -1;
        } else {
            long max = a[0];
            for (int i = 0; i < nElems; i++) {
                if (a[i] > max) {
                    max = a[i];
                }
            }
            return max;
        }
    }
//-----------------------------------------------------------
} // end class HighArray

////////////////////////////////////////////////////////////////
class HighArrayApp {
    public static void main(String[] args) {
        int maxSize = 100; // array size
        HighArray arr; // reference to array
        arr = new HighArray(maxSize); // create the array
        arr.insert(77); // insert 10 items
        arr.insert(99);
        arr.insert(44);
        arr.insert(55);
        arr.insert(22);
        arr.insert(88);
        arr.insert(11);
        arr.insert(00);
        arr.insert(66);
        arr.insert(33);
        arr.display(); // display items
        int searchKey = 35; // search for item
        if (arr.find(searchKey))
            System.out.println("Found " + searchKey);
        else
            System.out.println("Can't find " + searchKey);
        arr.delete(00); // delete 3 items
        arr.delete(55);
        arr.delete(99);
        arr.display(); // display items again

        System.out.println("Max in array is " + arr.getMax());
    } // end main()
} // end class HighArrayApp

Consider a large clothing shop in Sydney. Suppose it is known that the number of business suits sold per day is normally distributed with a mean, μ = 22 and standard deviation, σ = 10.  Mr Wood is employed to sell business suits. The number of business suits he sells each day for 35 days is recorded and the mean number per day calculated.

What is the probability that Mr Wood's average daily sales will be more than 26 business suits?  (4 dp)   Answer

A bored student starts rolling a die.

(a) Let N7 be the number of tries he needs to get 7 fours. Find a formula for the exact probability P(N7 = 42). You do not have to evaluate it to get a number. To get started note that in order for N7 = 42, the 42nd toss must be a four.

(b) Let N30 be the number of tries he needs to get 30 fours. Use the central limit theorem with the histogram correction to calculate P (N30 ≤ 180).