1. Algorithm. Given an array Weights denoting the weights of items in another array Items. Say Weights = {2, 3, 5,1, 4}. Items = {E, B, A, D, C}. Write a function to pick item among Items array. The probabilities of pick A and B and C and D and E should be P(A) : P(B) : P(C): P(D) :P(E) = 5: 3: 4: 1: 2.

2. Time complexity of merge-sort, quick-sort.

3. Describe Multiple inheritance in C++.

Question

1. Algorithm. Given an array Weights denoting the weights of items in another array Items. Say Weights = {2, 3, 5,1, 4}. Items = {E, B, A, D, C}. Write a function to pick item among Items array. The probabilities of pick A and B and C and D and E should be P(A) : P(B) : P(C): P(D) :P(E) = 5: 3: 4: 1: 2. 

2. Time complexity of merge-sort, quick-sort.

3. Describe Multiple inheritance in C++.

Anónimo · Accepted Answer

1. Sum weights into a 'sum'. Do binary search on this array.

SevOne

Pregunta de entrevista de SevOne

Respuesta de la entrevista

Empresas seguidas

Búsquedas de empleo