Come up with a distributed system which is using ROI, messagingand SOAP web services. No code needed, just show a diagram of thesystem and a short description.
Come up with a divide and conquer algorithm for the followingscenario:
You are studying different types of rocks on an island. Thereare MANY different types of rocks, but we are guaranteed that ofthe “N” rocks on the island, there exists a majority type. Morespecifically, we are guaranteed that there exists a quantitystrictly greater than N/2 rocks of a single type.
We have access to a method called isTheSame(rock1, rock2)returning true if the rocks are of the same type, false otherwise.We must use this method in the following problem as our sole meansfor comparison between two rocks. As an example of desiredfunctionality: If rock type A is in fact the majority and in somearray we have rocks 1,4,5,6, qualifying as typeA we can return anyone of those rocks’ numbers at the end of the algorithm to indicatethat this rock’s type is indeed the majority.
The task is as follows:
a) Design a deterministic divide and conquer algorithm that usesO(nlog(n) calls to isTheSame that returns a rock the belongs to themajority type. Explain in english and provide pseudocode for thisalgorithm.
b) Explain why we make O(nlog(n)) calls to isTheSame.
c) Prove using induction why this algorithm is correct includinga hypothesis, base case, inductive step and conclusion.
”’
How come I don’t get?
3
1
and gives me an error on
print(len(lD[1]))
”’
lA = [[2],[3,5,6],[7],[8],[4,4],[4,5],[6,8],[9],[9],[9]]
lD = [[1],[2],[3],[4],[5],[6],[7],[8],[9]]
lB = [1,2,3,4,5,6,7,8,9]
lC = []
lD = []
print(len(lA[1]))
print(len(lD[1]))
Come up with a formula for the maximum number of nodes(vertices) in a full binary tree that is built up by applying therecursive step n times. Prove your formula using mathematicalinduction
Come up with a formula for the maximum number of nodes (vertices) in a full binary tree that is built up by applying the recursive step n times. Prove your formula using mathematical induction. Show transcribed image text
how come a=0.0; for i=1:10 a=a+0.1; end a==1 then format longe a=9.999999999999e-1
Have you come across any useful PaaS-level cloud-basedservices (from any of the main Cloud Providers, orelsewhere) that support data mining of static or streamingdatasets?
How come we are assuming n = 2^k and k =logn here, also how comewe are ignoring cn/4+cn/2 and justifying it as cn
T(n) 2T(n/2)cn = 2(2T(n/4) + cn/2) + cn – 2(2(2T(n/8) cn/4) + cn/2)cn k timeS = n T(1) + cn lgn -O(nlogn) Show transcribed image text
How do you combine duplicates into single row in VisualBasic?
In other words take an excel sheet like this and make a visualbasic program to
sort all the 19850 on one row and then move to the next row andhave all the 13808
on the same row and so on and on… Thanks
how to combine the files to create bigger files so they canperform load testing? files up to 7GBs
using c++ and .net