2. 3. 5. 6. How many even 4-digit numbers greater than 3000 can be formed from the digits 2, 6, 7, 8, 9 if no digit can be used more than once? Find the inverse s of -1959 modulo 979 such that 0 ≤s<979. You must show all the detailed steps. In a certain assembly plant, three machines, Machine 1, Machine 2 and Machine 3 make 30%, 45% and 25% respectively of the products. It is known from the quality control data collected from the past that 2%, 3% and 2% of the products made by each machine respectively, are defective. If a product is chosen randomly chosen and found to be defective, what is the probability that it is made by Machine 3? 5 people are to be chosen at random from 5 men and 4 women to form a team. Find the probability that the team contains (i) (ii) 3 men and 2 women, at least 3 men.

2. 3. 5. 6. How many even 4-digit numbers greater than 3000 can be formed from the digits 2, 6, 7, 8, 9 if no digit can be used more than once? Find the inverse s of -1959 modulo 979 such that 0 ≤s<979. You must show all the detailed steps. In a certain assembly plant, three machines, Machine 1, Machine 2 and Machine 3 make 30%, 45% and 25% respectively of the products. It is known from the quality control data collected from the past that 2%, 3% and 2% of the products made by each machine respectively, are defective. If a product is chosen randomly chosen and found to be defective, what is the probability that it is made by Machine 3? 5 people are to be chosen at random from 5 men and 4 women to form a team. Find the probability that the team contains (i) (ii) 3 men and 2 women, at least 3 men.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter17: Markov Chains

Section: Chapter Questions

Problem 8RP

See similar textbooks

Similar questions

Q_5 Suppose f:RZ where fx=2x-1.If A={x |1x 4}, find f(A).If B={3,4,5,6,7}, find f(B).If C={-9, -8}, find f^ - 1(C)
Recall Pigou’s example discussed in class, where there are two roads that connect a source, s, and destination, t. The roads have different travel costs. Fraction x1 of the traffic flow on route 1, and the remainder x2 on route 2. Here consider the following scenario. • The first road has “infinite” capacity but is slow and requires 1 hour travel time, T1 = 1. • The second road always requires at least 15 mins, which then increases as a function of traffic density, T2 = 0.25 + 0.75x2. If drivers act in a “selfish” manner – the user optimal scenario – all the traffic will flow on the second path, as one is never worse off. Worst case scenario for path 2, both paths take one hour. So no one is incentivized to change their behavior. 1. Assume user optimal behavior, and calculate τ the expected travel time per car. 2. If instead we could control the flows, we could minimize the expected travel time. Using the expression in part (a), calculate the optimal allocation of flows x¯1 and ¯x2…
I am working on a problem for my homework. I have to convert this C++ Code: int multiply(int x, int y){ int product=0;if(x>y) for(int i=0;i<y;i++) product+=x;if(y>x) for(int i=0;i<x;i++) product+=y;return product;} I have received the MIPS Code of: multiply(int, int): daddiu $sp,$sp,-48 sd $fp,40($sp) move $fp,$sp move $3,$4 move $2,$5 sll $3,$3,0 sw $3,16($fp) sll $2,$2,0 sw $2,20($fp) sw $0,0($fp) lw $3,16($fp) lw $2,20($fp) slt $2,$2,$3 beq $2,$0,.L2 nop sw $0,4($fp) b .L3 nop .L4: lw $3,0($fp) lw $2,16($fp) addu $2,$3,$2 sw $2,0($fp) lw $2,4($fp) addiu $2,$2,1 sw $2,4($fp).L3: lw $3,4($fp) lw $2,20($fp) slt $2,$3,$2 bne $2,$0,.L4…
Show that ∃x (P (x) ∧ Q(x)) is not logically equivalent to (∃x P (x)) ∧ (∃x Q(x)).
1.1 In RSA, let e=5, n=55. Can you find d ≡ 1/e (mod cp(n))? Why? 1.2 Let e=13, n=55. Find d ≡ 1/e (mod cp(n)) provided that d exists. If d does not exist, explain the reason for the nonexistence of d.
5. Let R = {1, 3, π, 4, 1, 9, 10}, S = {{1}, 3, 9, 10}, T = {1, 3, π}, and U = {{1, 3, π}, 1}. Which of thefollowing are true? For those that are not, why not? (d) 1 ⊆ U(e) {1} ⊆ T(f) {1} ⊆ S(g) {1} ∈ S
The factorial function f(n) = n! is defined by n! = 1 2 3... n whenever n is a positive integer, and O! = 1. Provide big-O estimates for the factorial function and the logarithm of the factorial function. As an illustration, 1! = 1, 2! = 1 2=2, 3! = 1 23 = 6, and 4! = 1 234=24.Take note of how quickly the function n! expands. Consider the following: 20! = 2,432,902,008,176,640,000.
4.1.1 Complete solution and answer only no need explanation Given three data points (1,6), (3,28), and (10, 231), What is the value of y at x = 2 if the function y = 2x2 + 3x + 1 passes through the three data points.
3. Simplify the following Boolean functions, using four-variable Kmaps: (a) F (w, x, y, z) = Σ(1, 4, 5, 6, 12, 14, 15) (b) F (A, B, C, D) = Σ(2, 3, 6, 7, 12, 13, 14) (c) F (w, x, y, z) = Σ(1, 3, 4, 5, 6, 7, 9, 11, 13, 15)
Let A = {1, 2, 3, 4, 5} and B = {2, 3, 4, 5, 6, 7} and C = {a, b, c, d, e} 15. Give an example of f: A -> B that is not 1-1.
<Qs 45 > Consider the following pseudo-code: I = 0; J = 0; K = 8; while (I < K – 1) //while-1 { J = J + 1; while (J < K) //while-2 { if (x[I] < x[J]) { temp = x[I]; x[I] = x[J]; x[J] = temp; } } // end of while-2 I = I +1; } // end of while-1 The cyclomatic complexity of the above is ?
Ex: Let A1 ={x, y}, A2 ={1, 2}, and A3 ={a, b}, Find A1 × A2, (A1 × A2) × A3, A1 × A2 × A3.