Make two cuts to divide the cake into 4 (cutting on the diameter of a circular cake, the cuts perpendicular to each other). Now, place the 4 sectors of the cake one over the other. Make a cut such that the cut goes throw the centre cutting each of the cake sectors into half. So now we have done 3 cuts. Each sector is cut into two so 4*2=8.
In the reading room of a library, they are 23 reading spots. Each reading spot consists of a round table with 9 chairs placed around it. There some readers such that in each occupied reading spot there are different number of readers. If in all there are 36 readers, how many reading spots do not have even a single reader?
(loga)^2-(logb)^2 =?
With just six weights and a balance scale, you can weigh any unit number of kgs from 1 to 364. What could be the six weights?
Entry ticket to an exhibition ranges from 1p to 7p. You need to provide exact change at the counter. You have 7p coin. In how many parts will you divide 7p so that you will provide the exact change required and carry as less coins as possible?a) 8b) 7c) 5d) 3
Form 8 digit numbers by using 1,2,3,4,5 with repetition allowed and must be divisible by 4?
If (A + 3)^2 = 9 and (B + 4)^2 = 25 then what is the min value for a and b?
A motor cycle stunts man belonging to a fair, rides over the with vertical walls of a circular well at an average speed of 54 kph for 5 minutes. If the radius of the well is 5 meters then the distance travelled is a) 2.5 kmsb) 3.5 kmsc) 4.5 kmsd) 5.5 kmse) None of the above
(1- 1/6) (1-1/7).... (1- (1/ (n+4))) (1-(1/ (n+5))) = ?
Present population of town is 35,000 having males and females. If The population of males is increased by 6% and if the population of females is increased by 4%, then after 1 year the population becomes 36,700. Find the number males and females?
1,6,15,?,15,6,1Find the missing number in the series?
rendc.org
Whether it is technological solutions or user-oriented innovations, We have put together for you the best sources of HR Interview Questions and Answers, Tech Ideas, and Programming Tutorials."
Get all the latest information on rendc.org
© 2022 | All rights reserved.
RENDC
welcome to www.rendc.org
