Numerade

Questions asked

BEST MATCH

On July 1, 2007, a U.S. company enters into a forward contract to buy £10,000,000 on January 1, 2008. On September 1, 2007, it enters into a forward contract to sell £10 million on January 1, 2008. Describe the profit or loss the company will make in dollars as a function of the forward exchange rates on July 1, 2007, and September 1, 2007.

View Answer

BEST MATCH

The inactivation of the cross-bridges in smooth muscle requires the aid of the molecule ______ to help remove a key group from the myosin. Please spell out the name of the molecule completely.

View Answer

BEST MATCH

A NOR gate outputs a 1 when both of the inputs are 1 outputs a 0 if any of the inputs are 1 is not a universal gate outputs a 1 if any of the inputs are 0

View Answer

BEST MATCH

The assumption of completeness with respect to preferences for any pair bundles LaTeX: x' and LaTeX: x'' means that

View Answer

BEST MATCH

You wish to test the following claim ($H_a$) at a significance level of $\alpha = 0.02$. $H_o: p = 0.71$ $H_a: p > 0.71$ You obtain a sample of size $n = 501$ in which there are 361 successful observations. For this should use the (cumulative) binomial distribution to obtain an exact p-value. (Do not use the distribution as an approximation for the binomial distribution.) The p-value for this test is (assuming $H_o$ is true) the probability of observing... $\circ$ at most 361 successful observations $\circ$ at least 361 successful observations What is the p-value for this sample? (Report answer accurate to four decimal places.) p-value =

View Answer

BEST MATCH

f, in practice, 5.0 mL of 16.0 M nitric acid were added to effect the dissolution of the copper (step 1), what would be the minimum volume of 4.00 M NaOH required to neutralize the remaining acid and convert all of the Cu2+(aq) to Cu(OH)2(s) (step 2)?

View Answer

BEST MATCH

U-subsititution In this guestion,vou will solve a definite integral problem using the method of substitution T/3 cos(5x)sin2(5x)dx (a) Make the substitution u = sin 5, and write the integrand as a function of u f cos(5x) sin2(5x)dx=f np (b) Hence solve the integral as a function of u. You do not need a constant of integration for definite integrals 40 When = T/4,what is the value of (c) u Number (d) ...and the value of part (b) then ? When = 7/3,what is (e) the value of u Number (f)... and the value of part (b)? (g) Hence give the value of the definite integral Number

View Answer

BEST MATCH

a simple counterexample for each of them to show that the proposed greedy algorithm does not always return the optimal solution.You should give an example input, state the solution returned by the greedy algorithm on that input, and another solution that is better than the greedy solution for that input. a) Input: An undirected complete graph G (i.e. there is an edge (with weight) between any two vertices in the graph); a starting vertex s and a destination vertex t in G. Problem: Find a path that begins at s, ends at t, and visits every other vertex in G exactly once, and such that the total weight of this path is as small as possible. Algorithm: Let u be the current vertex (which initially is s). Find the minimum- weight edge among all edges (u, v) where v is neither t nor any vertex already visited. Add this edge to the path, and update the current vertex to v. Repeat this until t is the only vertex not yet visited. At this point add the edge from the current vertex to t as the final edge of the path. b Input:A set Y of YouTube channels,a set P of people and a and a set of pairs y,P) indicating person py subscribed channel y Problem: Choose a subset Y' of YouTube channels from Y so that everyone in P subscribes to at least one channel in Y'and that the number of channels in Y' is as small as possible Algorithm: Repeatedly add to Y'the channel that would give the largest number of 'new' subscribers (i.e. those who did not subscribe to any channel already in Y'), until everyone in P has subscribed something in Y'. c) Input: A set of objects, each with a weight between 0 and 1. Problem: Put all objects into a number of containers,where each container can hold objects of total weight at most 1, and such that the number of containers used is minimised Algorithm: Sort all objects in decreasing order of weights. For each object in this sorted order, among all existing containers that would fit this object, put it into the one with the largest total weight of objects already in there. If no existing container can fit this object in, put it into a new container.

View Answer

BEST MATCH

2. Normal forms for four different games are presented below. Eliminate strictly dominated strategies to try to simplify, and (possibly) solve the games. Identify all Pure Strategy Nash Equilibria from each game. (2 points) Player 2 a b c A (2,12) (1,10) (1,11) Player 1 B (0,12) (0,10) (0,11) C (0,12) (0,10) (0,13) Player 2 a b c A (1,1) (-2,0) (4,-1) Player 1 B (0,3) (3,1) (5,4) C (1,5) (4,2) (6,2) Player 2 a b c A (73,25) (57,42) (66,32) Player 1 B (80,26) (35,12) (32,54) C (28,27) (63,31) (54,29) Player 2 a b c d e f g h A (-1,1) (-1,1) (-1,1) (-1,1) (1,-1) (1,-1) (1,-1) (1,-1) Player 1 B (1,-1) (0,0) (1,-1) (0,0) (1,-1) (0,0) (1,-1) C (-1,1) (0,0) (-1,1) (0,0) (0,0) (-1,1) (-1,1) (0,0) (0,0)

View Answer

BEST MATCH

Problem 6 3. Given a square waveform with a period of 4 seconds, a duty cycle of 75%, voltage peak-to-peak equal to 1 with a 0.5 volt DC offset. – Please put a title and x and y labels on each plot. ? Use the Fourier Series with $n = 4, 10, 100$, and 500 to plot two periods of the waveform. If using Excel, get as close to 500 as you can - take advantage of the zero terms. If using Matlab, take a look at 5000 too.

View Answer

jonathan r.