What is return value of BSR Routine ?

Question

Consider the following function.

Assume that the array contains list of all the numbers from 1 to k –1. What is the return value of function BSR?

• Sum of all numbers
• Repeated number in the list
• Average of all the numbers
• None of these

-----------------------------------------------------------------------------------------------------------------------------------------------------------------

Here I think answer should Be D, None of these, as as per me this program will add up all no from 1 to k-1. i.e. (k-1 * k ) /2 in value & substracting last from it which is also (k-1*k) /2 . So it will always return 0.

Q 37

Made Easy FLT 6-Practice Test 14

Comments

not at all.  :)

Assume that the array contains list of all the numbers from 1 to k –1.

means if k is 7 

then all no. 1-6 are present in it.

like 1223456 ,1123456, 1233456, etc

---

I mean Answer the question :D You are commenting !

---

dear just want to clear the doubt.

Answer 1

Assume that the array contains list of all the numbers from 1 to k –1. //main line 

i.e. we have two take all no. form 1- k-1 when no. of values are k.

take random input

k= 7

1,2,3,4,5,6,6

now For  loop find sum of all array element= 27

now last = 7(6)/2= 21

return = 27-21= 6

so 6 is repeated.

Comments

Just one more doubt,

Assume that the array contains list of all the numbers from 1 to k –1.

For Sure, it is said that array contains all the numbers from 1 to k-1, but it is never said, it can not contain any other no ! Then after using up all the numbers from 1 to k-1 I can any other no like say 1000.

Then in that case, it'll return the no which is not in 1 to k-1. Which is not repeated !

it should have said

Assume that the array contains list of all the numbers from 1 to k –1 & it does not contain any other numbers.

---

yup it may be one point. used 

Assume that the array contains list of all the numbers from 1 to k –1 only.

---

Your answer is almost correct :) The "Only" flaw in logic is "Only" word is not there ! Whether we can assume it or not not sure , Mostly not I think !(Specially in GATE exam, assuming stuff can have deadly , -ve marks consequences ! )

@Arjun, @Pragy , @Amar Vashishth can someone comment here on this question ?

---

its Code, just run it.

---

yes. "only" should be there.

---

So D is correct !

Answer 2

Here answer is D) None of the above.

Size of array is k & Array should contain all no from 1 to k-1. So there are k-1 no that must be there. Once we fill up k-1 places with 1 to k-1 no, we get one extra space.

 We can put any No X  there ! (Not necessary to be in 1 to k-1, it is not said that array contains ONLY no from 1 to k-1)

Last = (k * k - 1 ) /2;

value = sum of 1 to k-1 + X = (K * k-1 ) / 2 + X

Value - Last = X

So answer is D.

It seem like B is correct, but it is not so. As we do not need to repeat any no, we can take no outside of given range 1 to k-1  !

Value - Last = Extra no