Answers - Freshers Quiz 2K19

1)Yeti / Himmanv
2) JCB ki Khudaai ………………………………………..
3)Ed Sheeren
4)GSLV Mark 3, Moon south polar region, Vikram Lander and Pragyan
Rover
5)Terracotta Army
6) Sania Mirza
7)FedEx
8)Quintessence
9)Khan Abdul Gaffar
10)Neurology
11)MAD magazine
12)Area 51, Conspiracy theory related to Aliens and UFO
13)Man’s - N. Djokovic
Woman’s - Simona Halep
14)They started the Olympic Torch Relay. Hence, the route started in
Greece, and passed through Austria and Hungary, before entering
Germany
15)Power Play
16)Royal Calcutta Golf Club
17)Tug of War
18) Eoin Morgan(Irish), Jofra Archer(WI) ,Ben Stokes(NZ), Jason Roy(SA),
Adil Rashid and Mooen Ali
19)Usain Bolt
20)Sachin Tendulkar, 2003 world cup
21)Daffodils, William Wordsworth
22)Mahatma Gandhi
23)Tree Climbing Championships
24)Peter Parker
25)A Dying Star
26)Mind Stone
27)Arjun Reddy
28)INS Vikrant
29) International Space Station(ISS)
30)Wall - E
31)Doremon
32)He was voice of Donald Duck
33)Glove
34)Father and Son
35)Pangaea

Puzzle
1) The minimum number of cuts for a 100-unit stick is seven.
Since cutting several pieces of a given stick at the same time is
allowed, we need
to concern ourselves only with finding a cutting algorithm that reduces
the size of
the longest piece present to size 1. This implies that on each iteration
an optimal
algorithm must cut the longest piece—and simultaneously all the
other pieces whose size is greater than 1—by half (or as close to this
a possible). That is, if the length l of a piece is even, it is cut into two
pieces of length l/2; if l is odd and greater than 1, it is cut into pieces
of lengths l/2 = (l + 1)/2 and l/2 = (l − 1)/2, respectively. The iterations
stop after the longest—and, hence, all the other piece of the
stick—has length 1.

2) The sum of the three numbers below the diameter equals '⅓’ of the
top number. So, the answer is one.
3)A = 3, B = 1, C = 4, D = 2

4)A1: The answer is two weighings.

Select from the given coins two groups of three coins each and put them on
the opposite cups of the scale. If they weigh the same, the fake is among
the other two coins, and weighing these two coins will identify the lighter
fake. If the first weighing does not yield a balance, the lighter fake is among
the three lighter coins. Take any two of them and put them on the opposite
cups of the scale. If they weigh the same, it is the third coin in the lighter
group that is fake; if they do not weigh the same, the lighter one is the fake.
Since the problem cannot be solved in one weighing, the above algorithm
requiring just two weighings is optimal.

5)In 60 days. If one clock gains a minute a day (or loses, the math
will be the same), it will gain 24 minutes the first day, 48 minutes by
the end of the second, and 120 minutes after 5 days. This means in
ten days it will gain 4 hours and in 20 days, 8 hours. This times 3, to

make it 24 hours, will require 60 days. The other clock running back-
ward will tell the same time as the normal clock every 24 hours, so it

really doesn't present a problem for the solution of the puzzle.

6) The final answer is the probability that the last person ends up in his
proper seat is exactly ½ The reasoning goes as follows: First, observe that
the fate of the last person is determined the moment either the first or the
last seat is selected! This is because the last person will either get the first
seat or the last seat. Any other seat will necessarily be taken by the time
the last guy gets to ‘choose’. Since at each choice step, the first or last is
equally probable to be taken, the last person will get either the first or last
with equal probability: 1/2.
7)Write 100 in binary, which is 1100100 and take the complement which is
11011 and it is 27.
Subtract the complement from the original number. So 100 – 27 = 73.

Try it out for 50 people. 50 = 110010 in binary.

Complement is 1101 = 13. Therefore, 50 – 13 = 37.
For the number in form 2^n, it will be the first person. Let’s take an
example:
64 = 1000000
Complement = 111111 = 63.
64-63 = 1.
You can apply this for any ’n’​.

8)36

9) Darkness

10) The minimum number of moves needed to solve the puzzle is 16.
Graph theory.