PYRAMID WALLS
Another break comes in your journey when you encounter a long wall in Aleppo. The wall is made of bricks of di fferent sizes and if you put all the bricks in order of their sizes, you will get a staircase and be able to cross it. So, you have to sort the bricks such that the smallest is on the top and largest at the bottom. To re-order them, you can hold any number of bricks from the top of pile, lift them, invert the pile you are holding and place the inverted pile back on the rest of the bricks below. The move has been explained in the below diagram:
The above diagram indicates one move or step. By doing a certain number of appropriate moves, you can bring the entire pile of bricks to suit your need.
The wall stopping your way looks like the figure shown:
You have to make the staircase by sorting the wall according to the rules explained above. As you are in hurry to complete your journey, you must sort the bricks in minimum possible moves.
Question 7:
What is the minimum no. of moves required?
(A) 10
(B) 9
(C) 8
(D) 12
After crossing the wall, your journey hits another wall (see below), but this time sorted and built of hollow numbered blocks. On reaching the top of it, you see a signboard which says: “From the top block, move down one layer a time to either of the two touching blocks just below the one where you are. At the bottom, you will find a glider which fl ies for as much time as the sum of the numbers on the blocks through which you pass”. As you would want the glider to fl y for as much time as possible, you must choose the path which gives you the maximum sum.
Question 8:
Find the path and give the maximum time for which the glider can be own.
(A) 248
(B) 335
(C) 249
(D) 250
Question 9:
Can you fi nd how many paths pass through the block ‘55’ ?
(A) 48
(B) 12
(C) 24
(D) 10
After crossing the wall, your journey hits another wall (see below), but this time sorted and built of hollow numbered blocks. On reaching the top of it, you see a signboard which says: “From the top block, move down one layer a time to either of the two touching blocks just below the one where you are. At the bottom, you will find a glider which fl ies for as much time as the sum of the numbers on the blocks through which you pass”. As you would want the glider to fl y for as much time as possible, you must choose the path which gives you the maximum sum.
Question 8:
Find the path and give the maximum time for which the glider can be own.
(A) 248
(B) 335
(C) 249
(D) 250
Question 9:
Can you fi nd how many paths pass through the block ‘55’ ?
(A) 48
(B) 12
(C) 24
(D) 10
Answer of question 7 should be 10
ReplyDeleteAnswer of question 7 should be (c) ...
ReplyDeletePlease check it.
AGREE WITH YOU... I ALSO THINK SO
DeletePlease post your solutions before claiming that the answer is wrong. We would surely discuss on every solution.
ReplyDeletePLZ TECHNICH TEAM COULD U GIVE SOLUTION OF THIS ANS.
ReplyDeleteAns for Q 7 should be ---- A)10
ReplyDeleteinitial sequence : 4,2,3,1,6,5
ReplyDeletefirst step:1,3,2,4,6,5
second:2,3,1,4,6,5
third : 3,2,1,4,6,5
fourth : 1,2,3,4,6,5
five:5,6,4,3,2,1
sixth:6,5,4,3,2,1
seventh: 1,2,3,4,5,6
so the possible ans must be 8
-by naman shrivastava
Initial sequence:
ReplyDelete42316 587
1) 6132458 7
2) 85423167
3) 7613245 8
4) 54231 678
5) 13 245678
6) 312 45678
7) 21 345678
8) 12345678
Yeah...even I got 8 as the answer!....cmon guys change the key
ReplyDeleteHave u guys verified it yet??
ReplyDeleteGuys...change the key already...result day is coming soon
ReplyDeletewtf
ReplyDeleteWhat's the mistake with the proof for 8 as the answer...if none...then why havnt u guys changed the key???!!
ReplyDeleteexactly, wtf is iit-g doing???
ReplyDelete