Site List

Saturday, January 29, 2011

First Round: You will get three design problem in this round and either you do first two problems or do do third problem.

Design Problem 1: FTP Client Design

You have to design a FTP client which have the following features: 1. User should be able to login into FTP Server using user name and password along with other details. 2. User should be able to download the files. 3. User should be able to upload the files. 4. User should be able to see default directory when open first time and also list all files for a directory.

Design this system in term of system architecture, Class diagrams and functionality.

Design Problem 2: Task Scheduler Design You need to design a task schedule as like windows task scheduler, which have the following properties. 1. User should be able to schedule multiple task at same time. 2. User should be able to schedule task like: run task at 5.00 pm or run task at 5.00 pm with interval of 4 hours etc. 3. There should be proper error handling log mountainous in fail our of any task and should not effect the other task running.

Design this system in term of Class diagram, Database design and functionality.

Design Problem 3: Quality Test Engine Design a internal quality test engine tool to manage internal testing process 1. You can create multiple processes, new process, update those process 2. There should be multiple level of users and should be able to manage different type of data. 3. Admin or super user should be able to assign the roles to each user group. etc.....

One of my friend gone through two rounds of Polaris interview first round was simple objective test and 15 questions from C#, .NET and ASP.NET and 5 questions from SQL.

Second round was personal technical interview. Here is some questions:

Ques: What is Abstract Classes? Ques:What is interfaces? Ques:What is difference between abstract classes and interfaces? Ques:Give an example where do you use interfaces and abstract classes? Ques:What is Silverlight? Ques:How will you define an object in silverlight? Ques:What is ria services? Ques:What is data contract? Ques:What is WCF? Ques:What is latest version of silverlight? Ques:What is left outer join? Ques:Write a query to return non intersect area from two tables ?

Saturday, January 22, 2011

There is a camel which can carry max 1000 bananas at a time and eat 1 banana for every one kilometer. There 1000 km desert and you need to move this 3000 bananas across the desert. How many maximum bananas you can transfer the other end of desert.

if you think in strait way the max bananas will be 0.

but there is a solution:

lets talk about every km. you would like to transfer 1000 bananas 1 km. Now camel will take 1000 bananas and come back and again take 1000 bananas and come back and take 1000 bananas again. so there is total five trips to transfer 3000 banana 1 km. for this transfer camel will eat 5 bananas.

camel will take 5 trips until there is 2000 bananas so lets find out how main km camel will move until 2000 bananas left.

1000/5 =200 km

now for 2000 bananas camel will make 3 trips, so lets find out how many km camel will move until 1000 bananas left.

1000/3 = 333 km

so now there is only 1000 banana left and camel have moved to 200+333 = 533 km

left distance = 1000-533 = 467 km

so at end left bananas = 1000 - 467 = 533 bananas

there can be another solution when camel will not eat any banana while coming back and not carrying the bananas. in that can solution will be 833bananas

Friday, January 21, 2011

you have 25 horses and 5 horse can race in a group. how many minimum races you have to do to find the top 3 horses in group.

ans:

step 1: divide 5 horses in 5 groups and race then (5 races).

Group A, Group B, Group C, Group D, Group E

step 2: take top from each race and race them ex. A1, B1, C1, D1, E1 (1 race)

step 3: Now suppose A1 top the race, so take second person from A's group and rest of person from step 2 ex. A2, B1, C1, D1, E1 (1 race ). Who ever will top the race will be top second

Step 4: Now Suppose B1 top the race, so take second person from B's group and rest of person from step 3 ex. A2, B2, C1, D1, E1 (1 race ). Who ever will top the race will be top third

Congrats you got top 3 in just 5+1+1+1 = 8 races.

Answer 2:

It can be more optimize and solution is 7 race.

After 6th race (step 2)

Discard the group C and D because we want only top 3. Discard C2 onward (C2, C3 ..) because they will never come in top 3 Now Discard B3 onwards because B1 can be second and B2 can be third max. So A1 is top 1 and you have qualified horses for second and third position is: A2, A3, B1, B2, C1 race then and find the top 2 and top 3.

if all three rats die it means b7 is common in all three mixture so b7 have poison if non will die it means b8 have poison if rat A only die it means b1 have poison if rat A, B die it means b3 have poison etc