Consider a nonblocking N*N switch. Assume that each of the N inputs has received a call request and each of the N outputs may be the destination of a call request with probability 1/N . Then,
i) Determine the probability distribution of the number of requests destined to one of the output switches.
ii) Determine probability that there will not be any requests to k of the outputs, where k=0,1,…,N.
Consider a nonblocking N*N switch. Assume that each of the N inputs has received a call...
In the Benes network B4 16 inputs are matched with 16 outputs. The network can send each input to either of two copies of B3 , which will be called the upper and lower copy. To have a congestion of 1 it is essential that any two inputs that differ by exactly 8 go to different copies of B3, and that any two packets with outputs that differ by exactly 8 also go to different copies of B3. Consider the...
The problem Write a program that inputs two integers n and k, where n>=k. Your program should calculate the number of different ways that k bishops could be placed on an nXn chessboard. Structure your program using the backtracking scheme that we have used for the eight queens problem. What needs to be modified is the “OK” function. Input Your main program should loop asking the user for values of n and k. Output Each time through the loop, output...
Student ID: 123 Write a C+ program with the following specifications: a. Define a C++ function (name it function_StudentlD where StudentID is your actual student ID number) that has one integer input (N) and one double input (x) and returns a double output S, where N S = n 0 and X2 is given by 0 xeVn n 0,1 Хл —{2. nx 2 n 2 2 m2 x2 3 (Note: in the actual quiz, do not expect a always, practice...
all parts A-E please. Problem 8.43. For sake of a contradiction, assume the interval (0,1) is countable. Then there exists a bijection f : N-> (0,1). For each n є N, its image under f is some number in (0, 1). Let f(n) :-0.aina2na3n , where ain 1s the first digit in the decimal form for the image of n, a2 is the second digit, and so on. If f (n) terminates after k digits, then our convention will be...
Consider the problem of sending a binary message, 0 or 1, via a signal channel consisting of several stages where transmission through each stage is subject to a fixed probability of error, α ∈ (0,1). Assume X0 = 0 is the original signal that is sent and let Xn, be the signal received at the nth stage. Assume {Xn} is a Markov chain with transition probabilities P00 = P11 = 1−α, P01 = P10 = α Determine the probability that...
Consider a noisy communication channel, where each bit is flipped with probability p (the probability that a bit is sent in error is p). Assume that n−1 bits, b1,b2,⋯,b(n−1), are going to be sent on this channel. A parity check bit is added to these bits so that the sum b1+b2+⋯+bn is an even number. This way, the receiver can distinguish occurrence of odd number of errors, that is, if one, three, or any odd number of errors occur, the...
Consider a two-period binomial model, where each period is 6 months. Assume the stock price is $46.00, o=0.28, r=0.06 and the dividend yield is 2.0%. What is the maximum approximate strike price where early exercise would occur with an American call option at point Su? Assume that the strike price K is a whole number
Consider a binary communication channel transmitting coded words of n bits each. Assume that the probability of successful transmission of a single bit is p (and the probability of an error is q=1-p), and that the code is capable of correcting up to e (where e>= 0) errors. If we assume that the transmission of successive bits is independent, then what is the probability of successful word transmission? Hint: the word is successfully transmitted if there are e or fewer...
4.7. Consider a two-layer feedforward ANN with two inputs a and b, one hidden unit c, and one output unit d. This network has five weights (wca, Wcb, Wco, Wse, Wao). where wro represents the threshold weight for unit x. Initialize these weights to the values (.1,.1,.1,.1,.1), then give their values after each of the first two training iterations of the BACKPROPAGATION algorithm. Assume learning rte '-.3, momentum α-: 0.9, incremental weight updates, and the following training examples: 0 1...