The One With All The "Decrypt"ing

Pavan in search of the ultimate mantra for success goes to a saint, living in the Himalayas. The Saint wants to test the determination Pavan has, to achieve his goal, and shows him a passage. On unlocking its door he can find the hidden code of life. But the door only opens with a magical keyword, which is hidden in the Saint’s words.

“Sky there, humbly blesses, Ajanta caves:

‘ asamba kimba amar… asamba kimba amar!!’ ”

To help him, the saint has also given him a clue:

 “Wait for a second, think carefully , repeat, you will get it.”

He also tells him,” Everything you see beyond this door, will have a relation to what you see next.”

Question 1:

Say the magical word to open the door for Pavan.

Question 2:

The door opens, and Pavan finds that a series of challenges await him. First up, is a sign board that looks like this:

Question 3:

Then he encounters  an ancient scroll, that has the following inscriptions:

Question 4:

In a dark corner, is a pillar with inscriptions all over it, here’s what it looks like:

Question 5:

An unsuccessful  hunter, has written on the walls

S L A E T N I  T H E A D D  A T T R R R A G E T N N S

(Hint: Divide and rule)

Question 6:

You are just a step away from success, echoes a voice

     ees_h_bdlk_ _ ihzadbwt_ yhi_ _twaei_caetervr

("_" represent spaces)

Question 7:

Finally, unravel the mystery of success.

   rwvzgv  mfigfiv  prmwov

(Hint : Techniche speaks)

---

The One "(Work) In Progress"

While supervising the construction of Metro in Technolasia, Pavan came up with quite a weird pattern of placing the barricades near the “Work in progress” board. There are 2 pillars, Left and Right, separated by 8m long stretch. He chose seven equidistant positions in this stretch to place the barricades. But the length of the rope required to connect these depends on their order of placement. Once a barricade is placed, it is connected to its immediate left and right barricades, if there is none, then to the pillar, with a stretched rope.

Assuming Pavan bought a 57m of rope.

Question 1:

What’s the minimum amount of wire he could have used?

1)28     2) 20   3) 26   4) 24

Question 2:

If he has no bar on using the fund. What’s the length of wire he could have used (not wasted)?

(not wasted)?

1) 27    2) 28   3) 35    4) 36

Question 3:

If he applies to another such stretch, 9m long, and with 9 barricades. Then what

would be his minimum wastage? (in case of 57 m long rope)

1) 3      2) 2      3) 0     4) 1

---

The One With The "Code War"

Secret codes are often used, by spies and military, to carry out operations. In one such case, the CBI Coders, Ashima, Roshan and Himanshu, intercepted a mail in which they picked out two patterns, which they suspected could be the key. The rest of the code has been deciphered and conveys information about the camps of a terrorist group. Only the cities where these camps are located now are to be found.  You have been asked to decipher and answer before it’s too late!

All you have is the piece of information provided below:

(Hint: You can have multiple codes for an alphabet, but only one way to decipher it back.)

Question 1:

The first line of the code when deciphered comes out to be “GIFT DEATH TO”.

Given below are the possible deciphered texts of the encircled code.

Kanpur = 1            Nagpur = 2                Mumbai = 3              Delhi = 4

Patna =5                Ahmedabad = 6        Bengaluru = 7           Hyderabad = 8

Add up the numbers corresponding to the correct deciphered possibilities.

1) 12                2) 13            3) 14            4) 16

Question 2:

Which of the following given possibilities can under no condition, be ciphered using the code logic of the previous question?

Kanpur = 1              Chennai = 2       Ahmedabad = 3        Kolkata = 4

Hyderabad= 5        Srinagar= 6        Varanasi= 7              Jaipur = 8

Add up the numbers corresponding to these possibilities.

1) 26                2) 27            3) 28            4) 29

Question 3:

In how many ways the word “EUROPE” can be ciphered according to the code logic

used in the first question?

1) 4                2) 12            3) 0            4) 8

---

The One Where Technothlon Answers

"The Drowning City"

Let’s start with filling up the grid. Let for our purpose, the cell in Row-x and Column-y be denoted as: (x, y).

·     Try to fill column E. To satisfy 12 at the top we must not fill (1,E) with 9,8,7,6 (Rule-5), and also not with 2,3,4,5,6,7 (Rule-3). So it has to be 1. So should be (4,E), (3,B), and (6,B). Now to satisfy 12 at the top of col-E, (3,E), (6,F), (1,B), and (4,B) must be 8.

·    Since we start at the top of column F, people from (2,E) will be rescued before we reach the right of Row-2. Hence, (2,F), (2,C), (5,F), (5,C) are 5.

·     Let’s see (3,F), it can’t be filled with 1(check (2,C)),3,4,5,6,7,8, or, 9 (Rule-3) therefore it has to be 2; so should be (6,F), (1,C), (4,C).

·    Similarly, (2,D) can’t be filled with 1,2,3,4,5,6,7,8 (Rule-3), and it’s 9 along with (2,A), (5,A), and (5,D).

·     Only possible choice for (3,C) and hence (3,D), (3,A), (6,A) and (6,D) is 4.

The numbers outside the grid can be filled now.

(Remember: You can’t save one’s who have already been saved. Be cautious while answering the questions. Avoid over-counting.)

·   Brown and Green box represents the ones who couldn’t be saved in the original situation.

·    Green box represents the ones who could have been saved if the diagonal light was allowed.

Question-1: option-1) 4

Question-2: option-3) 25

Question-3: option-1) 9

---

---

"Jumbled"

(A few clarifications:

• In Q2, ‘None of these’ means ‘None of these’ and nothing else, unlike what is being interpreted in the discussion.
• In Q4 we asked for option which is where the attentiveness is being tested as Q-2 doesn’t contain 3 and 4 and Q-4 doesn’t contain 0 in any of the options.)

Let’s start by rejecting the inappropriate options.

• In Q1, reject opt-3 (Rule-2).
• In Q2, reject opt-4 (Rule-1).
• In Q3, reject opt-4 (Rule-2).
• In Q4, reject opt-1 (read Q4).

Interestingly, you can solve the Q2 before any other Ques, but when all Ques are taken in account, you must chose opt-2 for Q3 else it will create a contradiction. And this is where the actual thinking was involved, and the approach, “Start your thinking process from Q3, and hence it’s ans is opt-2” is not strong enough to support the answer to Q3.

Based on the above step, reject opt-4 in Q1.In Q2, reject opt-2 i.e. 0 as then ans to Q4 would be opt-3, a contradiction. Also reject opt-1 as that would mean ans to Q4 is opt-4 and the 2 ques to have opt-3 as their ans must be Q1 & Q3-a contradiction to above answers.

=>Ans to Q2 is opt-3. => Ans to Q-4 is opt-2.

Now Q1 is left to be answered at the end. => Ans to Q1 is opt-1.

Question-1: option-1) 1

Question-2: option-3) 1

Question-3: option-2) 3

Question-4: option-2) 3

---

---

"Follow The Arrow"

(will be updated with the next set of Solutions. The discussion is still on.)

---

---

The One With The Jolly Guy

A down to earth person . Even though he likes to speak less but it is hard to match him when it comes to hard work. South regional head of Technothon, Vijay is also the co-in-charge of publicity of techno’13. The most humble, optimistic, "Jolly" guy who adds a fun element to everything once he pairs up with a yet to be introduced organizer (guess who that crazy guy is?). A great team mate.
	Vijay Sai

---

The One With The Geek

Cool dude among the seven.He is the East Regional Head of Technothlon'13. Skilled in coding he manages the online life and databases of Technothlon'13. Even though he does all the online work but on a personal level he doesn't like to be online himself .The only place in the entire campus where you can actually spot him is the IITG library. Being optimistic hardworking and chilled out are some of his most awesome qualities.

Krtin Kumar

---

The One Where We "Follow The Arrow"

                A Kindergarten teacher has introduced a new game for her students, during their school picnic. She divided students into 6 teams: 1st two teams (G and H) had 1 student each, next 2 teams(I and J) had 3 students each, and the last two teams(P and  N) had 5 students each. The equisized teams were to face each other in the interesting game. For the same, she arranged the opponent teams in rows, facing each other as shown:

   

Team G v/s Team H

Team I  v/s Team J

Team P v/s Team N

                                               
                                      
Opponent teams are to exchange heir positions, but with certain twists:
a student can move only in the direction of his arrow to an empty block only if:
●    The empty block is exactly in front of him, or
●    There is exactly one student of opposition and none of his own team between him and the empty
      block.

            Finally all the kids completed the game, and were rewarded by the teacher. Shockingly there was a striking similarity between all the game plays : One team in each gameplay had to take 1 step more than its opponent team. With this fact in mind, we can  derive some more similarities the game had  in each case.

(They played…you solve :P) 
(Hint: Try to visualize for small sized teams, and then build your logic.)


Question 1:
 The total number of steps taken by students A, E and V can be?
 1) 7, 9        2) 8, 9        3) 9, 11          4)10, 11
  

Question 2:
How many total steps were taken by all the little kids(in 3rd match) of teams P and N to complete the game? 
1) 30        2) 33        3)35        4)38


Question 3:
 If E being the bold started first, then the total number of steps taken by A, B, C and D is-
 1) 12        2) 15        3) 13        4) 14


Guidelines: Give complete strategies used to get the answer that would help our team and your fellow contestants to know the way you thought.

--

Regards

Team Techno'13

---