. Let us consider the network structure shown in the figure below. Our goal is to calculate maximum likelihood (ML), maximum aposteriori (MAP) and Bayesian estimates of the parameter = P r(b|a). 4 samples are available (. We also know that the prior distribution of P r(b|a) is Beta(3,3)

Question # 1.1 Ascertain the number of clock cycles will take execution of this portion on the normal (non- pipelined) engineering. Show estimations

Question # 1.2 Ascertain the number of clock cycles will take execution of this portion on the straightforward pipeline without sending or bypassing when consequence of the branch guidance (new PC content) is accessible after WB stage. Show timing of one circle cycle

Question # 1.3 Work out the number of clock cycles will take execution of this portion on the straightforward pipeline with typical sending and bypassing when aftereffect of branch guidance (new PC content) is accessible after finishing of the ID stage. Show timing of one circle cyclE

Question # 1.4 Plan the portion directions including branch-defer space to get least handling time expecting that pipeline has typical sending and bypassing equipment. It is conceivable to reorder directions and change position of circle mark (L1) yet not name of registers or operation code alteration. Show planned fragment, position of L1 and pipeline timing

Question # 2.1 Work out the number of clock cycles will take circle execution (from IF to IF of LD F2, ....) of this section on the this FP-pipeline with typical sending and bypassing when aftereffect of branch guidance (new PC content) is accessible after fruition of the ID stage. Show timing of the primary circle turn (beginning from IF of LD F3, 0(R1)

Question # 3.1 What sort of dangers are between adhering to guidelines (Circle one of three): 1. LD F2, 28(R5) and MULTD F0, F2, F4: 2. DIVD F10, F0, F6 and ADDD F6, F8, F2: . 3. MULTD F0, F2, F4 and SD F8, 50(R5): a). Question # 3.2 What sort of Data risks are between the accompanying directions (Circle one of four): 1. MULTD F0, F2, F4 and DIVD F10, F0, F6: 2. DIVD F10, F0, F6 and ADDD F6, F8, F2: 3. MULTD F0, F2, F4 and SD F8, 50(R5) :

Given an arranged word reference of an outsider language having N words and k beginning letter sets of standard word reference. Track down the request for characters in the outsider language. Note: Many orders might be feasible for a specific experiment, in this way you might return any substantial request and result will be 1 assuming that the request for string returned by the capacity is right else 0 signifying inaccurate string returned. Given a string S, find the longest palindromic substring in S. Substring of string S: S[ I . . . . j ] where 0 I j < len(S). Palindrome string: A string which peruses the equivalent in reverse. All the more officially, S is palindrome if reverse(S) = S. Incase of contention, return the substring which happens first ( with the most un-beginning record)