Akamai Aptitude Placement Question Paper 2012.
Akamai Solution Job 2012 Placement Aptitude Question paper with answers Akamai 2012 Aptitude Question with solution you can download it in FREE, if Akamai 2012 test paper in text or pdf for Akamai 2012 Answer Keys you can download Akamai for MBA/ B.Tech / M.Tech 2012 page also just Go to menu bar, Click on File->then Save.
Akamai Solution Campus 2012 exam recruitment Aptitude Question paper Free Download PDF is available in www.oldquestionpapers.net which has been provided by many students Akamai Placement paper for 2012 paper is available for all the students in FREE and also Akamai Placement Aptitude Question paper for B.Tech MCA 2012 fully solved Akamai 2012 with answer keys and solution.
Akamai Aptitude Placement Question Paper 2012
You can get daily updates on Akamai Solution Campus 2012 from www.oldquestionpapers.net here you can also check similar links for other related study materials on Akamai Here Akamai Placement Aptitude Question bank 2012.
1. Alok and Bhanu play the following min-max game. Given the expression N = 19 + X * (Y – Z), where X,Y and Z are variables representing single digits (0 to 9), Alok would like to maximize N while Bhanu would like to minimize it. Towards this end, Alok chooses a single digit number and Bhanu substitutes this for a variable of her choice (X,Y or Z). Alok then chooses the next value and Bhanu, the variable to substitute the value. Finally Alok proposes the value for the remaining variable. Assuming both play to their
optimal strategies, the value of N at the end of the game would be
0 100
0 019
0 -62
0 37
The number of bacteria in a colony was growing exponentially. At 4 pm yesterday the number of bacteria was 400 and at 6 pm yesterday it was 3600. How many bacteria were there in the colony at 7 pm yesterday?
0 3600
0 10800
0 32400
0 14400
The number of bacteria in a colony was growing exponentially. At 4 pm yesterday the number of bacteria was 400 and at 6 pm yesterday it was 3600. How many bacteria were there in the colony at 7 pm yesterday?
0 3600
0 10800
0 32400
0 14400
3. A multiple choice question has 4 options. Choosing the correct option ea,’ns the student 3 marks. However choosing the wrong option incurs negative marks so that if a student chooses an option randomly, his expected score is O.Suppose a student has successfully elimirlated 2 incorrect options. His expected score if he chooses randomly among the remaining options is.
0 1.00
0 1.50 .
0 00 .,
0 3
4. On the planet Oz, th~re are 8 days in a week – Sunday to Saturday and another day called Oz day. There are 36 hours in a day and each hour has 90 minutes while each minu!e has 60 seconds. As on earth, the hour hand covers the dial twice every day. Find the approximate angle between the hands of a clock on Oz when the tiime is 12:40 am.
0 111 degrees 0 251 degrees
0 71 degrees 0 89 degrees
5. You’re going to get grounded for a week if you don’t get at least 80% in your science class. So far you have 237 of the total 300 points. The final test is worth 100 points. What is the minimum score you need to get on the final test? Assume the teacher rounds properly.
0 93
0 80
0 83
0 100
6. Middle-earth is a fictiona; land inhabited by Hobbits, Elves,dwarves and mer:. The Hobbits and the Elvesare peaceful creatures who prefer slow, silent lives and appreciate nature and art. The dwarves and the men engage in physical games. The game is as follows. Atournai is one, where out ofthe two teams that playa match, th9 one that loses get eliminated. The matches are played in different rounds where in every round; half of the teams get eliminated from the tournament. Ifthere are 8 rounds played in a knock-out tournvi how many matches were played?
0 257
072
0 255
0 256
7. Alice and Bob play the following coins-on-a-stack game. 100 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 r;layers take turns. A turn consists of moving the coin on the top to a position i below the top coin (for some i between a and 100). We will call this an i-move (thus a a-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 coin is the third co:n from the top. Then
0 In order to win, Alice’s firs-:’move can be a a-move or a 1-move.
0 In order to win, Alice’s first move should be a 1-move.
0 In order to win, Alice’s first move should be a a-move.
0 Alicehas no winning strategy.
8. The ITgiant Tirnop has mcently 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 and also write code at the same ,ate. Suppose 13 such programmers take 13 minutes to write 13 lines of code in total. How many lines of code can be written by 91 programmers in 91 minutes?
a 637
a 91
a 7
013
9. Achilleswas the son of the nymph Thetis and Peleus, the king of the Myrmidons. Zeus and Poseidon had beenrivalsfor the hand of Thetisuntil Prometheus, the fire-bringer,warned Zeusof a prophecythat Thetis would bear a son greater than his father. For this reason, the two gods withdrew their pursuit, and had her wed Peleus. The following statement is another interesting prcphecy about the ages of two childen of Zeus that would hold true at some time during the lifetime of the children. 4 years ago, Athena’s age was twice Helen’s age. 4 years hence, Athena’s age will be 4/3 times the age of Helen. Find Athena’s present age in binary numbers during the time that the statement holds true.
a 100
a 1001
a 101
a 1100
10.36 people (ai, a2, , a36) meet and shake hands in a circular fashion. ill other words, there are totally 36 handshakes involvingthe pairs, (ai, a2), (a2, a3), , (a35, a36), (a36, al). Then the size of the smallest set of people such that the rest have shaken hcmdswith at lea:,! one person in the set is
011
a 18
a 12
013
Similar Pages…
See Also……