Wednesday, November 17, 2010

Solved clearly answers 1st Mock Test Paper

sk1. Alice and Bob play the following coins-on-a-stack game. 20 coins are stacked one above the other. One of them is a special (gold) coin and the rest are ordinary coins. The goal is to bring the gold coin to the top by repeatedly moving the topmost coin to another position in the stack.
Alice starts and the players take turns. A turn consists of moving the coin on the top to a position i below the top coin (0 ≤ i ≤ 20). We will call this an i-move (thus a 0-move implies doing nothing). The proviso is that an i-move cannot be repeated; for example once a player makes a 2-move, on subsequent turns neither player can make a 2-move.
If the gold coin happens to be on top when it's a player's turn then the player wins the game.
Initially, the gold coinis the third coin from the top. Then

• In order to win, Alice's first move can be a 0-move or a 1-move.

In order to win, Alice's first move should be a 1-move.

• Alice has no winning strategy.

• In order to win, Alice's first move should be a 0-move.
Since It is Way to Win 0-move by Alice 1-move by Bob 2-move by Alice Make Third Coin top
The Answer is Alice First move should be 0-move


2.Alok is attending a workshop "How to do more with less" and today's theme is Working with fewer digits . The speakers discuss how a lot of miraculous mathematics can be achieved if mankind (as well as womankind) had only worked with fewer digits.
The problem posed at the end of the workshop is
How many 5 digit numbers can be formed using the digits 1, 2, 3, 4, 5 (but with repetition) that are divisible by 4?
Can you help Alok find the answer?

• 3125

• 375

• 500

• 625

Last two digits should be divisble by 4

means only 12 24 32 44 52 =5 ways to fill last two places

Remaining places can be filled in 5*5*5 ways so

5*5*5*5=625 is The Correct Answer

3.For the FIFA world cup, Paul the octopus has been predicting the winner of each match with amazing success. It is rumored that in a match between 2 teams A and B, Paul picks A with the same probability as A's chances of winning.
Let's assume such rumors to be true and that in a match between Ghana and Bolivia, Ghana the stronger team has a probability of 2/3 of winning the game. What is the probability that Paul will correctly pick the winner of the Ghana-Bolivia game?
2/3
1/9
4/9
5/9
2/3 …. It Predicts The Winning chances same as Probability of Stronger Team winning the game

4.
The IT giant Tirnop has recently crossed a head count of 150000 and earnings of $7 billion. As one of the forerunners in the technology front, Tirnop continues to lead the way in products and services in India. At Tirnop, all programmers are equal in every respect. They receive identical salaries ans also write code at the same rate.Suppose 12 such programmers take 12 minutes to write 12 lines of code in total. How long will it take 72 programmers to write 72 lines of code in total?
6
72
12
18

12 programmers need 12 minutes to code 12 lines of code.It is asked that how much time does 72 programmers need to code 72 lines of code.
Ans.12min
time is proportional to 1/programmers
time is proportional to coding
therefore c/tp is constant
c1/t1p1=c2/t2p2 gives answer


5. After the typist writes 12 letters and addresses 12 envelopes, she inserts the letters randomly into the envelopes (1 letter per envelope). What is the probability that exactly 1 letter is inserted in an improper envelope?
11/12
0
1/12
12/2power12

Ans. Answer is 11/12 because 1-1/12=11/12

6. Given 3 lines in the plane such that the points of intersection form a triangle with sides of length 20, 20 and 30, the number of points equidistant from all the 3 lines is
0
3
4
1
Answer is 1 only circumcenter will be in equal disctance from all the three

7.
On planet zorba, a solar blast has melted the ice caps on its equator. 8 years after the ice melts, tiny plantoids called echina start growing on the rocks. echina grows in the form of a circle and the relationship between the diameter of this circle and the age of echina is given by the formula
d = 4 * √ (t - 8) for t ≥ 8
where d represents the diameter in mm and t the number of years since the solar blast.
Jagan recorded the radius of some echina at a particular spot as 8mm. How many years back did the solar blast occur?

12
24
16
8

given r=8
therefore diameter d=16
16=4*sqr(t-8)
By solving gives t=24


8.
10 suspects are rounded by the police and questioned about a bank robbery. Only one of them is guilty. The suspects are made to stand in a line and each person declares that the person next to him on his right is guilty. The rightmost person is not questioned. Which of the following possibilities are true?
A. All suspects are lying or the leftmost suspect is innocent.
B. All suspects are lying and the leftmost suspect is innocent .
A only
Both A and B
B only
Neither A nor B

Reason is Each one Says The Right Side Person is Guilty.. And Right Most Person is left without Asking
So Either All should be telling lie
Another choice is Left Most Suspect may be innocent so he may say his right side one is guilty
Either of This Only Can Happen
SO A only is The Answer

7 comments:

  1. this is very great i had gone through all the answers

    ReplyDelete
  2. hey alie and bob ques ans was alice must do 1-move to win this is the ans plz check it bcoz if alice move 0-move bob move 2-move and alice is 1-move then bob wins so 0-move by alice ans is wrng

    ReplyDelete
  3. This comment has been removed by the author.

    ReplyDelete
  4. 5th answer is 0,probability that exactly 1 letter is inserted in an improper envelope.
    there is no chance for placing only one letter in wrong envelope as the remaining 11 letters are placed correctly.
    it would be 11/12 when the question is "no letter is placed correctly"

    ReplyDelete
  5. 6th answer is 4.
    as the question is "the number of points equidistant from all the 3 lines " .there will be 3 excentre's and 1 incentre for a triangle equidistant from all three lines.

    it would be 1 when the question is "equidistant from all three vertices or line segments"

    ReplyDelete
  6. The answer for the 1st question is

    Alice has no winning strategy

    as remaining options are significantly proved to be wrong

    ReplyDelete
  7. if Alice win the game if his 1st move is 1-move once check it....A-1,B-0,A-any move,B-any move they cant do 1 or 0 move.A-1,B-2,A-0,B-any move...he cant do 1 or 2 or 0 move.....
    so ans is Alice win ,if his first move is 1-move

    ReplyDelete