Provide a P-Value, a determination of whether to reject the null, and an explanation.Test the hypothesis that μ1 = μ2. Two samples are randomly selected from normal populations. The sample statistics are given below. n1 = 25 n2 = 30 1 = 23 2 = 21 s1 = 1.5 s2 = 1.9

What does the -n option in sed do?

Which command would capitalize all the letters in the file info.txt

Which Bash operator is used for appending the output of a command to a file?

READ ME: Each question is worth 1.00 point. You will receive extra credit based on the number of correct answers. The extra credit points will be added to your Lecture Exam 1. You are not allowed any notes or other studying material. If you are caught cheating, you will be reported to the college and given a zero on your lecture exam 1. Read each question carefully! 

GA Power has an unsorted list A of length , with the account numbers of all its clients. They also have another unsorted list B of length , with the account number of those clients that paid their bill, where . Design a divide & conquer algorithm that returns a list of the account numbers of the clients that did not pay their bill. You can assume and are powers of 2.  Describe your algorithm in words (no pseudocode!); Justify its correctness; Analyze and state its runtime.  Faster (and correct) in asymptotic Big O notation is worth more credit.  

You are given a network  and a valid flow f. You are told that the flow along an edge satisfies f(e)=c(e). Which of the following is True? Select the most accurate answer.

Standard disclaimer: your solution should use the algorithms from class (DFS, Explore, BFS, Dijkstra’s, Bellman-Ford, Floyd-Warshall, SCC, Kruskal’s, Prim’s, Ford-Fulkerson, Edmonds-Karp, and 2-SAT) as a black box subroutine for your algorithm. If you attempt to modify one of these algorithms you will not receive full credit, even if it is correct. Make sure to explain your algorithm in words (no pseudocode!), explain the correctness of your design, and state and analyze its running time. Faster—and correct—solutions are worth more credit. You are given a directed, weighted graph G=(V,E) with exactly one edge, e=(uv), satisfying  w(e)

A pinwheel of size k, is a graph with a center vertex connected to k vertices, which are otherwise not connected to any other vertex in the pinwheel. Consider the pinwheel problem where the input is a graph G and an integer , and the output is a set of  vertices where the induced subgraph is a pinwheel, and returns NO if such a set of vertices does not exist. The picture shows pinwheels of size  and , respectively. Show that the Pinwheel Problem is NP-complete.

You are given a network  and a valid flow f. Which of the following conditions guarantee that f is a max flow? Check ALL that apply.