Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more.
Course Hero has millions of course specific materials providing students with the best way to expand
their education.
Below is a small sample set of documents:
MIT - BUSINESS - 201
STOCK PRICE DATE, DAILY, 26OCT98-25OCT99DateSP500AbbottFordKelloggMicrosoft ATT26-Oct-98 1072.32 44.895348.646 32.985292.3754427-Oct-98 1065.34 44.2795 49.1301 32.4983 92.4375 44.687528-Oct-98 1068.09 45.3264 49.8237 31.8897 92.68754329-Oct-
MIT - BUSINESS - 201
UN-13BA123456789101112131415161718192021222324252627282930313233BCDEFGHIJKBlack-Scholes Option-Pricing FormulaSXrTSigma25 Current stock price25 Exercise price6.00% Risk-free rate of interest0.5 Time to
MIT - BUSINESS - 201
A123456789101112131415161718192021222324252627282930313233343536373839404142BCDEFGHIJTHE OPTION TO EXPANDYearCF of single machine0-1000Discount rate for machine cash flowsRiskless discount rateNPV
MIT - BUSINESS - 201
ABCDEFGHIJBlack-Scholes option pricing formulaSXrTSigmad1d250 Current stock price50 Exercise price10.00% Risk-free rate of interest1 Time to maturity of option (in years)25% Stock volatility0.5250 <- (LN(S/X)+(r+0.5*sigma^2)*T)/(sig
MIT - BUSINESS - 201
UN-11IA12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485
MIT - BUSINESS - 201
UN-15BA1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556BCDEFGHBASIC DURATION CALCULATIONYTMYear123456789107%Ct,A707070
MIT - BUSINESS - 201
UN-16CA1234567891011121314151617181920212223242526272829303132333435363738394041424344454647BCDEFGHIBASIC IMMUNIZATION EXAMPLE WITH 3 BONDSYield to maturity6%Coupon rateMaturityFace valueBond
MIT - BUSINESS - 201
McCULLOGH'S TERM STRUCTURE DATA SETDate1.19802.19803.19804.19805.19806.19807.19808.19809.198010.198011.198012.19801.19812.19813.19814.19815.19816.19817.19818.19819.198110.198111.198112.19811.19822.19823.19824.19825.19826.198
MIT - BUSINESS - 201
UN-new chapter 17, AA1234567891011BCDEFEXPECTED RETURN ON A ONE-YEAR BONDWITH AN ADJUSTMENT FOR DEFAULT PROBABILITYFace value, FPrice, PAnnual coupon rate, QNondefault probability, Recovery percentage, Expected cash flowExpected
MIT - BUSINESS - 201
UN-17BABCDEFGHIJKTcMrPayments per yeargDuration-continuous timeL27%256.0%41.256897 <- =(c_/r_*(1-EXP(-r_*(M-T_)+EXP(-r_*(M-T_)/(c_/0.08*(1-EXP(-0.08*(M-T_)+EXP(-0.08*(M-T_)13.32712 <- =(EXP(r_)*(-c_+c_*EXP(M*r_)-c_*M*r_+M*r_^2)/(
MIT - BUSINESS - 201
Page 432A1234567891011121314150.56430.92190.47250.72770.80050.01280.97480.41280.9670B0.85070.52730.88680.10370.18460.02580.05440.59690.1379CDE0.50780.01300.83450.35170.48280.32060.62440.19990.02120.8786 <- R
MIT - BUSINESS - 201
UN-19J1234567891011121314151617181920212223242526ACF1Growth rateDiscount rateYearCash flowNPVIRRBC23410%15%0-1150.00DE=C6*(1+$B$2)1234.002257.40FGH5342.606376.86IJ=D6*(1+$B$2)3283.144311.4574
MIT - BUSINESS - 201
UN-20EABC12345 Matrix A (a row vector)234678910 Matrix D (a 4 x 3 matrix)13-8-311-810-112-3-11113013314DEFGHIMATRICES IN EXCELMatrix B (a square 3 x 3 matrix)13-8-3-810-1-3-111Matrix C(a columnvector)13
MIT - BUSINESS - 201
UN-21AA123456789101112131415BCDEFGHGAUSS-SEIDEL METHOD-SOLUTION BY ITERATIVE SUBSTITUTIONy=(E4-2)/4x050.753.8750.46875 4.2968750.5742188 4.13867190.534668 4.1979980.5494995 4.17575070.5439377 4.18409350.5460234 4.18096
MIT - BUSINESS - 201
UN-22BA1234567891011121314BCDEFGEXCEL'S NPV FUNCTIONDiscount rateYearCash flowNPV10%0-100135233334425516334425516$11.65 <- =NPV(B3,C5:G5)+B5EXCEL'S IRR FUNCTIONYearCash flowIRR0-10013523315.00% <- =
MIT - BUSINESS - 201
ABCDEFG1 AUTO FILL/COPY212325 <- B3+3435465768798101112 Double-clicking on the "fill handle" of a cell will fill in the rest of the column13 provided there's a filled cell next to it.A123PUTTING LINE BREAKS IN CELLSThis
MIT - BUSINESS - 201
A123456BCDEFGHIJKFunctions in ActionParameterFunction11.25#MACRO? <- =Function1(B3)Placing the cursor on a cell with a small red triangle in the corner willshow you the source code of the function used in the cell.To edit the code
MIT - BUSINESS - 201
A1234567891011121314151617181920212223242526272829303132BCDEFGHIJKFunctions In ActionParameter Function1.1667 #MACRO? <- =Function1(A4)1.1667 #MACRO? <- =Function2(A5)1.16666 #MACRO? <- =Function1(A6)1.1666
MIT - BUSINESS - 201
AB123ActivecellDemo()4ActivecellDemo1()CDEFGHIJActivecell Macros in this Workbook5Placing the cursor on a cell with a small red triangle in the cornerwill show you the source code of the Macro or FunctionTo edit the code you may press
MIT - BUSINESS - 201
UN-15I2.6T erm Structures, 19482.42.2Pur e discount r a t e %21.81.61.41.210.80mo 1mo 2mo 3mo 4mo 5mo 6mo 9mo1yrMat urit y2 yr3yr4yr5yr10yr 15yr 20yrUN-15J18T erm Structures, 19811716Pur e discount r a t e, %1514131211109
Colorado Tech - ADMON - mpm
Universidad VirtualAdministracin de la Cadena de Valor2.4 Realizar reflexin tema SustentabilidadEQUIPO 37Olga Nora Garca Esquivel A00372979Tatiana Vanessa Mndez Martnez A01304717Amilcar Estrada Rodrguez A01304897Octavio Navarro Daz A01307499Alejan
Colorado Tech - ADMON - mpm
Reflexin sobre el artculo de la Biblioteca Digital Sustainable Operations Management",de Paul R Kleindorfer, Kalyan Singhal, Luk N Van Wassenhove. Production andOperations Management. Muncie: Winter 2005. Vol. 14, Iss. 4; pg. 482, 11 pgsEn la actualida
Colorado Tech - ADMON - mpm
cha06369_tn07.qxd2/12/037:01 PMPage 299TECHNICAL NOTE SEVENtechnical notetechnical note sevenP R O C E S S C A PA B I L I T Y A N DS TAT I S T I C A L Q U A L I T YCONTROLAssignable variation definedCommon variation definedVariation around Us
Colorado Tech - ADMON - mpm
Universidad VirtualAdministracin de la Cadena de Valor2.4 Realizar reflexin tema SustentabilidadEQUIPO 37Olga Nora Garca Esquivel A00372979Tatiana Vanessa Mndez Martnez A01304717Amilcar Estrada Rodrguez A01304897Octavio Navarro Daz A01307499Alejan
Colorado Tech - ADMON - mpm
LOOKING FOR.SOLUTIONSMANUAL ORTEST BANK ?OVER 10,000 TITLESAVALABLE!Student.Plus@Hotmail.Comwww.student-plus.netThe List Below Updated On 24, JULY, 2010How To Order? Email UsEmail us at STUDENT.PLUS@HOTMAIL.COM asking for the teaching or studyi
Colorado Tech - ADMON - mpm
Universidad VirtualAdministracin de la Cadena de Valor2.5 Resolver problemas del captulo 6EQUIPO 37Olga Nora Garca Esquivel A00372979Tatiana Vanessa Mndez Martnez A01304717Amilcar Estrada Rodrguez A01304897Octavio Navarro Daz A01307499Alejandro Be
Colorado Tech - ADMON - mpm
Universidad VirtualAdministracin de la Cadena de Valor2.4 Realizar reflexin tema SustentabilidadEQUIPO 37Olga Nora Garca Esquivel A00372979Tatiana Vanessa Mndez Martnez A01304717Amilcar Estrada Rodrguez A01304897Octavio Navarro Daz A01307499Alejan
Colorado Tech - ADMON - mpm
Universidad VirtualAdministracin de la Cadena de Valor2.4 Realizar reflexin tema SustentabilidadEQUIPO 37Olga Nora Garca Esquivel A00372979Tatiana Vanessa Mndez Martnez A01304717Amilcar Estrada Rodrguez A01304897Octavio Navarro Daz A01307499Alejan
Colorado Tech - ADMON - mpm
Colorado Tech - ADMON - mpm
TATIANA V. MENDEZA01304717ADMINISTRACION DE LA CADENA DE VALORPROBLEMA 2Rockness Recycling reacondiciona a estudiantes de administracin agotados. El procesoutiliza una banda transportadora que lleva a cada estudiante por los cinco pasos del procesoe
Colorado Tech - ADMON - mpm
Universidad VirtualAdministracin de la Cadena de Valor2.5 Resolver problemas del captulo 6Profesor TitularDr. Alberto Rodrguez RodrguezCampusSedeEnero 19, 2011.Sante FeCoatzacoalcosProblema 2.- Rockness Recycling reacondiciona a estudiantes de a
Colorado Tech - ADMON - mpm
Universidad VirtualAdministracin de la Cadena de Valor2.5 Resolver problemas del captulo 6Profesor TitularDr. Alberto Rodrguez RodrguezCampusSedeEnero 19, 2011.Sante FeCoatzacoalcosProblema 2.- Rockness Recycling reacondiciona a estudiantes de a
Colorado Tech - ADMON - mpm
Universidad VirtualAdministracin de la Cadena de Valor2.4 Realizar reflexin tema SustentabilidadEQUIPO 37Olga Nora Garca Esquivel A00372979Tatiana Vanessa Mndez Martnez A01304717Amilcar Estrada Rodrguez A01304897Octavio Navarro Daz A01307499Alejan
Colorado Tech - ADMON - mpm
Universidad VirtualAdministracin de la Cadena de Valor2.5 Resolver problemas del captulo 6EQUIPO 37Olga Nora Garca Esquivel A00372979Tatiana Vanessa Mndez Martnez A01304717Amilcar Estrada Rodrguez A01304897Octavio Navarro Daz A01307499Alejandro Be
UCSD - CSE - 21
CSE 21: Homework 3October 12, 2009Problem 1In how many ways can 6 people be assigned to 4 nonempty teams?Problem 2An urn contains 5 red marbles and 6 white marbles.(a) How many ways can 4 marbles be drawn?(b) What if we must have 2 red marbles and
UCSD - CSE - 21
Name:Student ID:CSE 21Midterm #2 SolutionsNovember 17, 2009Each problem is worth 20 points. Show your work, especially on decision trees. Also, makesure you write legibly so that I have a chance of being able to read your solutions! Additionalscrat
UCSD - CSE - 21
Name:Student ID:CSE 21Practice Final ExamDecember 2, 20091. Dene the recurrence a(n + 2) = 4a(n + 1) a(n), , n 0, with a(0) = 1, a(1) = 2.(a) What is the value of a(5)?(b) Find an explicit closed form solution for a(n);(c) Prove by induction that
UCSD - CSE - 21
Solutions to the Practice Final ExamDecember 2, 20091. Solution:(a) a(0) = 1, a(1) = 2, a(2) = 7, a(3) = 26, a(4) = 97, and a(5) = 362.(b) Notice that the characteristic polynomial of the recurrence relation is x2 4x + 1, which has roots 2 3,nnyiel
UCSD - CSE - 21
CSE 21: Homework Solutions 2October 5, 2009Problem 1Teams A and B play in baseballs world series. Here, the team that rst wins four games wins the series.(a) What is the number of ways the series can occur?(b) What is the number of ways the series ca
UCSD - CSE - 21
CSE 21: Homework Solutions 3October 12, 2009Let S (n, k ) be the Stirling number of the second kind which counts thenumber of ways to partition n labeled elements into k disjoint, nonempty,unlabeled blocks.Problem 1In how many ways can 6 people be a
UCSD - CSE - 21
CSE21 FA11Homework #1 (9/26/11)1.1. An n-digit number is a list of n digits where the rst digit in the listis not zero (where we assume n 1).(a)How many n-digit numbers are there (as a function of n)?(b)How many n-digit numbers contain no 1s?(c)H
UCSD - CSE - 21
CSE21 FA11Homework #1 (9/26/11)1.1. An n-digit number is a list of n digits where the rst digit in the listis not zero (where we assume n 1).(a)How many n-digit numbers are there (as a function of n)?(b)How many n-digit numbers contain no 1s?(c)H
UCSD - CSE - 21
CSE21 FA11Homework #2 (10/3/11)In this homework, we will consider ordinary decks of playing cards whichhave 52 cards, with 13 of each of the four suits (Hearts, Spades, Diamondsand Clubs) with each suit have the 13 ranks (Ace, 2, 3, . . . , Jack, Quee
UCSD - CSE - 21
CSE21 FA11Homework #2 (10/3/11)In this homework, we will consider ordinary decks of playing cards whichhave 52 cards, with 13 of each of the four suits (Hearts, Spades, Diamondsand Clubs) with each suit have the 13 ranks (Ace, 2, 3, . . . , Jack, Quee
UCSD - CSE - 21
CSE21 FA11Homework #3 (10/10/11)3.1.Prove by induction thatnk=1k2 =n(n+1)(2n+1).63.2. It is desired to form three committees from a group of 3 men and 3women.(a) In how many ways can this be done?(b) Suppose that each of the committees must c
UCSD - CSE - 21
CSE21 FA11Homework #3 Solutions (10/15/11)3.1. Prove by induction thatnk2 =k=1n(n + 1)(2n + 1)6Sketch of proof. Step 1. We need to verify the base case for n = 1, i.e.1k=1=k=11 (1 + 1) (2 + 1).6Step 2. Proof by induction. We assume that n=1
UCSD - CSE - 21
CSE21 FA11Homework #4 (10/17/11)4.1.Prove by induction thatnk=1k3 = (nk=1k )2 .(Hint: First get an explicit form form the second sum. Then use induction.)4.2. (Note: This problem is fairly tough! Ill be impressed by anyone whocan get this one!
UCSD - CSE - 21
CSE21 FA11Homework #4 (10/17/11)4.1.Sketch of proof. Recall that we showed in class that n=1 k = n(n2+1) for allk22n 1. We will prove that by induction n=1 k 3 = n (n4+1) . We assume thatknn2 (n+1)23for some xed n 1. Note thatk=1 k =4n+1n
UCSD - CSE - 21
CSE21 FA11Homework #5 (10/24/11)5.1. (a) 10 cards are drawn at random one at a time with replacement froman ordinary deck of cards.What is the sample space? What is the probabilitythat no Ace appears on any of the draws? What is the probability that a
UCSD - CSE - 21
CSE21 FA11Homework #5 (10/17/11)5.1Solution. (a) The probability that no Ace appears on any of the drawsis ( 48 )10 . The probability that at least one King appears in 10 draws is521 ( 48 )10 . The probability that at least 2 Queens appear in the 10
UCSD - CSE - 21
CSE21 FA11Homework #6 (10/31/11)6.1. Five boys and three girls are throwing Frisbees. Each boy has oneFrisbee and throws it to a random girl. What is the probability that each ofthe girls gets at least one of thrown Frisbees?6.2. A box contains 20 li
UCSD - CSE - 21
CSE21 FA11Homework #6 (10/31/11)6.1. Five boys and three girls are throwing Frisbees. Each boy has oneFrisbee and throws it to a random girl. What is the probability that each ofthe girls gets at least one of thrown Frisbees?Answer: S (5, 3) 3!35=
UCSD - CSE - 21
CSE21 FA11Homework #7 (11/7/11)7.1. A bin contains 4 red balls, 5 white balls and 6 blue balls. A randomsubset S of 4 balls is removed (without replacement). Consider the following3 events:(1) E1 : S has exactly 2 red balls.;(2) E2 : S has balls of
UCSD - CSE - 21
CSE21 FA11Homework #7 Solutions7.1. A bin contains 4 red balls, 5 white balls and 6 blue balls. A randomsubset S of 4 balls is removed (without replacement). Consider the following3 events:(1) E1 : S has exactly 2 red balls.;(2) E2 : S has balls of
UCSD - CSE - 21
CSE21 FA11Homework #8 (11/14/11)8.1. An urn contains r red marbles and b blue marbles. A random marbleM1 is drawn out. If M1 is red, then it is put back into the urn along withc more blue marbles. On the other hand, if M1 is blue, then it is put back
UCSD - CSE - 21
CSE21 FA11Homework #8 (11/17/11)8.1Solution. Draw the decision tree. Then compute:(a)P r(M2 = red) =r+drbr+.r+b+cr+b r+b+dr+b(b)P r(M2 = red|M1 = red) =P r(M1 = blue|M2 = blue) =r.r+b+cbbr+b r+d+brb+cbb+ r+b r+d+br+d r+b+c8.2S
UCSD - CSE - 21
CSE21 FA11Homework #9 (11/22/11)9.1Does every connected graph has a spanning tree? Give either a proof or acounterexample.9.2(a) Select a spanning tree of minimum total weight from the following weightedgraph.(b) Find all spanning trees (list thei
UCSD - CSE - 21
CSE 21Midterm #1October 20, 20111. (a) How many rearrangements using all the letters of the wordSCHWARZENEGGER are there?Answer:14!3!2!2!= 36324288001.(b) How many rearrangements using only 13 of the letters of the wordSCHWARZENEGGER are there?
UCSD - CSE - 21
CSE 21 FA 11Practice Final Exam1. Dene the recurrence a(n + 2) = 4a(n + 1) a(n), , n 0, with a(0) = 1, a(1) = 2.(a) What is the value of a(5)?(b) Find an explicit closed form solution for a(n);(c) Prove by induction that the expression in (b) is vali
FAU - PHI - 2010
NelsonRobert NelsonProfessor Embree04/29/11PHI2010605ArtThere is a philosophy to art. There is a broad spectrum of what would be considered art anddifferent forms of art, even some that disprove another as art. Some questions that would beasked i