Evalueserve is the pioneer in knowledge process outsourcing, with operation cent res in India, China, Chile and Romania

and sales offices across the globe. The s uccess of our company and our clients is built on a strong collaboration by our employees. With global presence and diverse employee strength, we strive to prov ide a challenging work environment where personal and professional development i s encouraged and rewarded . ................................................................................ ........................................... How would you fill out exact 4 liters in a Can of 5 liters and another Can of 3 liters, with unlimited supply of water? Fill the 5 liter can and use it to fill the 3 liter can. This leaves 2 liters in the 5 liter can. Empty the 3 liter can and pour the last 2 liters from the 5 li ter can into the 3 liter can. Fill the 5 liter can and use it to fill the 3 lite r can. Since only 1 liter was needed to fill the 3 liter can, 4 liters are remai ning in the 5 liter can. It would be easier to take the 3 liter can, pour that into the 5 liter can. Then do it again, and when its full you will have 1 liter in the 3 liter can. Empty 5 liter can, use this liter + another 3 and finished .................................................................. no of dosas sold in the cafeterai?? How would you go about sizing a market for shirts in Delhi? .................................................................. Alpha:first letter of the greek alphabet The first one or highest ranked; the beginning

Beta The second letter of the Greek alphabet. The second item in a series or system of classification. ................................................................................ ............................................. Pentium D (dual core) has two logical processing cores. But Core 2 Duo has two separate physical processing cores, hence it is faster. ................................................................................ ............................................. Freequency Reuse The key characteristic of a cellular network is the ability to re-use frequencie s to increase both coverage and capacity. As described above, adjacent cells mus t utilize different frequencies, however there is no problem with two cells suff iciently far apart operating on the same frequency. The elements that determine frequency reuse are the reuse distance and the reuse factor. The reuse distance, D is calculated as d=r under root 3 n where R is the cell radius and N is the number of cells per cluster. ................................................................................

............................................. Hands Off In a cellular system, as the distributed mobile transceivers move from cell to c ell during an ongoing continuous communication, switching from one cell frequenc y to a different cell frequency is done electronically without interruption and without a base station operator or manual switching. This is called the handover or handoff. ................................................................................ ............................................. Cellular A cellular network is a radio network distributed over land areas called cells, each served by at least one fixed-location transceiver known as a cell site or b ase station. ................................................................................ .............................................

Population of bhopal=30,0000 Male=20,0000 Female=10,0000 Male >24=15,000 Length 60km ................................................................................ ............................................. What is meant by Maskable interrupts? An interrupt that can be turned off by the programmer is known as Maskable inter rupt. What is Non-Maskable interrupts? An interrupt which can be never be turned off (ie. disabled) is known as Non-Mas kable interrupt(trap) ................................................................................ ............................................. Interrupt Occurence of an event is signaled. Software:System Calls Hardware:System Bus ................................................................................ ............................................. 8086 and 8088 8088 is 8-bit data bus & 16- bit in 8086 ................................................................................ ............................................. There are 9 coins. Out of which one is odd one i.e weight is less or more. How m any iterations of weighing are required to find odd coin? Answer # 1 It is always possible to find odd coin in 3 weighings and to tell whether the odd coin is heavier or lighter. 1. Take 8 coins and weigh 4 against 4.

o o

If both are not equal, goto step 2 If both are equal, goto step 3

2. One of these 8 coins is the odd one. Name the coins on heavier side of the scale as H1, H2, H3 and H4. Similarly, name the coins on the lighter side of the scale as L1, L2, L3 and L4. Either one of H's is heavier or one of L's is lighter. Weigh (H1, H2, L1) against (H3, H4, X) where X is one coin remaining in intial weighing. o If both are equal, one of L2, L3, L4 is lighter. Weigh L2 against L3. ? ? ? If both are equal, L4 is the odd coin and is lighter. If L2 is light, L2 is the odd coin and is lighter. If L3 is light, L3 is the odd coin and is lighter.

o If (H1, H2, L1) is heavier side on the scale, either H1 or H2 is heavier. Weight H1 against H2 ? ? ? If both are equal, there is some error. If H1 is heavy, H1 is the odd coin and is heavier. If H2 is heavy, H2 is the odd coin and is heavier.

o If (H3, H4, X) is heavier side on the scale, either H3 or H4 is heavier or L1 is lighter. Weight H3 against H4 ? ? ? If both are equal, L1 is the odd coin and is lighter. If H3 is heavy, H3 is the odd coin and is heavier. If H4 is heavy, H4 is the odd coin and is heavier.

3. The remaining coin X is the odd one. Weigh X against the anyone coin used in initial weighing. o o o If both are equal, there is some error. If X is heavy, X is the odd coin and is heavier. If X is light, X is the odd coin and is lighter.

8 Balls,Odd ball being heavier This is the simplest question nings.The question is to find ot the odd heavier ball among .Answer is 2 and the solution among the lot and is often used during phone scree out the minimum number of weighings required to sp 8 identically looking balls using a common balance is given in the next paragraph.

For simplicity let us name the balls as A1,A2,A3,B1,B2,B3,C1 and C2.We weigh wit h A's on one side and B's on the other side of the balance.If both sides are equ

al this means the heavier odd ball is among C1 and C2.We can figure out the heav ier ball with one more weighing.If A's are heavier than B's then the heavier odd ball is among A's.Now we balance A1 and A2.If both are same then A3 is the odd ball or else the heavier one of A1 and A2 .Thus, we can find out the heavier bal l using only 2 weighings. ................................................................................ ............................................. You are given two candles of equal size, which can burn 1 hour each. You have to measure 90 minutes with these candles. (There is no scale or clock). Also u r given a lighter. Ans: 1. First light up the two ends of the 1st candle. When it will burn out lig ht up one end of the second candle. (30+60=90) 2. Try the similar problem to measure 45 minutes. Ans: First light-up the two ends of the 1st candle and one end of the 2nd candle . When the 1st candle will burn out ,then light up the both ends of the 2nd candle (15+30=45) ................................................................................ ............................................. How will you measure height of building when you are at the top of the building? And if you have stone with you. Ans: Drop the stone and find the time taken for the stone to reach the ground. f ind height using the formula s = a + gt ( s = height, a= initial velocity=0, g=9.8m/s, t = time taken) ................................................................................ ............................................. There are three people A, B, C. Liars are of same type and Truth speaking people are of same type. Find out who is speaking truth and who is speaking false from the following statements: a) b) A says: B is a liar. B says: A and C are of same type.

Ans: lets assume A is speaking truth. It means B is a liar then it means A and C are not of same type. ................................................................................ ............................................. Door Toggling Puzzle Or 100 Doors Puzzle This is a very common interview puzzle. The problem is very simple if you unders tand it. So the point to note is, do not arrive at the solution so "fast , if you are asked this puzzle in an interview and if you are not planning to show any ac quaintance with this puzzle. Problem goes like this : There are N doors in a row numbered from 1 to N. Initially all are closed. Then you make N passes by the N doors. In pass 1 you toggle the all the doors (1 ,2,3,4....)starting from the first door. In the second pass you toggle every sec

ond door(2,4,6,8,...). In the third pass you toggle all third doors(3,6,9...).Si milarly you make N passes. Question is what is the state of door k after N passes. There are 3 possibilities in any number set - prime numbers, non-prime numbers ( that are not squares) & squares. In this puzzle the original state of a door will be reversed if it is acted upon an odd number of times - otherwise the original state & the final state will be the same. Now let us take each of the number types I mentioned above. 1. Prime numbers are divisible by themselves & 1 - so they will be acted upon an even number of times. So these doors (corresponding to prime numbers) will be c losed 2. Non-prime non-square numbers are divisible by themselves, 1, & any other two numbers such as a*b where a is not equal to b. Thus they are divisible at least by 4 numbers - which means these doors will be closed as well. 3. Square numbers are divisible by themselves, 1 & its factors a*a. Since the fa ctors are the same, these numbers are divisible by at least 3 numbers - hence th ese doors will be open ................................................................................ ............................................. There is a shopkeeper who wants to weigh things who has a common balance. He mus t be in a position to weigh things of all possible integral weighing units from 1 to a given maximum sum. The question will be either about how many weights you will need or how will you weigh. Problem 1: One Side Only (Simple Interview Question for Phone Screening usually) In this version of the problem shopkeeper can only place the weights in one side of the common balance. For example if shopkeeper has weights 1 and 3 then he ca n measure 1,3 and 4 only. Now the question is how many minimum weights and name the weights you will need to measure all weights from 1 to 1000. This is a fairl y simple problem and very easy to prove also. Solution:if shopkeeper has weights 1 and 3 then he can measure 1,3 and 4 only. 1, 2, 4, 8, 16, 32, 64, 128, 256, 512 are the required weights. So we have 1 and we can measure 4 from 1 and 3. Ans is 8.

Problem 2: Both Sides 2 6 18 54 162 486 1458 ................................................................................ ............................................. CDMA cannot offer international roaming, a large GSM advantage.

Each user in a CDMA system uses a different code to modulate their signal. ................................................................................ ............................................. A blind man is handed a deck of 52 cards and told that exactly 10 of these cards are facing up. How can he divide the cards into two piles, not necessarily of e qual size, with each pile having the same number of cards facing up? Source: Heard from a Googler in 2006. Solution: If the original pile has c cards with f cards facing up, then the blin d man divides them into piles of size f and c-f. Then he flips all cards in the pile with f cards. Let s see why it works for c = 52 and f = 10. The blind man wou ld divide the cards into two piles with 10 and 42 cards each. If there are k fac e-up cards in the 10-card pile, then there must be 10-k face-up cards in the 42card pile (because the total number of face-up cards is 10). So by flipping all cards in the 10-card pile, the number of face-up cards in both piles would becom e equal to 10-k. ................................................................................ ............................................. Four honest and hard-working computer engineers are sipping coffee at Starbucks. They wish to compute their average salary. However, nobody is willing to reveal an iota of information about his/her own salary to anybody else. How do they do it? Source: Heard from a fellow student at UC Berkeley in 1996. Solution: The first engineer picks a random k-digit integer for some large k, ad ds his salary to it and writes the sum on a chit. The chit is passed around. Whe n it returns to the first engineer, he subtracts the k-digit integer. ................................................................................ .............................................