Download Here and leave comments
Download Here
Sunday, July 27, 2008
Saturday, July 26, 2008
Friday, July 18, 2008
Microsoft recruitment procedure & Questions
There were 4 rounds for selection procedure. First round was a written test, second round was group interview and 3rd and 4th rounds were technical interview. Each round had eliminations. Total 143 students were eligible for written test and 16 students were selected for the next round, ie. group interview. Only 8 students were able to go for 3rd round of technical interview. In 3rd round 4 more students were eliminated and remaining 4 students went for final round of technical interview. Only 1 student got an offer finally from Microsoft.
Following is the detail about each round.
Note: All examples which I will give here are just for your understanding. Interviewer was not giving any examples. Hardly 2 – 3 time interviewer gave examples.
Round 1: Written test
Paper style: 3 subjective questions
Time limit: 1½ hour
Question 1: Finding output....
It was string cruncher program. First remove all repeated consecutive substring with length 1, then delete substring of length 2 and so on...
Example : string is “abcabeccced”
After removing repeated substring of length 1: “abcababceccced” --> “abcababceced” (2 ,c, are removed)
After removing repeated substring of length 2: “abcababceced” --> “abcabceced” (substring “ab” is removed)
and so on...
Question 2: Writing a program.
Definition: You are given 3 integer arrays A, B and C of length n1, n2 and n3 respectively. All arrays are sorted. We define triplet of these 3 arrays as (x,y,z) where x is any integer from A, y from B and z from C. We define distance of triplet as maximum difference among triplet elements, i.e. Maximum of x – y, y – z or z – x. Write a program to find minimum triplet distance. (means there are n1*n2*n3 number of possible triplets are possible...among all triplets which triplet has minimum distance...Give only distance, but not triplet elements). Your program must be as much efficient as possible.
Question 3: Writing program.
Definition: You are given 2 integer numbers in linked list form. Add those 2 numbers.
Example: First number is 234 and second number is 35. So, you are provided with 2 linked lists 2->3->4 and 3->5. Your answer must be 2->6->9. (Make sure to take care of carry number). This example was given in paper.
Round 2: Group Interview
All candidates who had cleared the written test were called for group interview. Here we were given 3 problems one by one. Time limit was between 15 to 20 minutes. Once they gave problem definition we were supposed to think on it and discuss our ideas and logic about solving that problem with one of the representatives from Microsoft. Once that representative was convinced with our logic then we had to write code for that problem on paper.
Problem 1: You are given a string. Develop a function to remove duplicate characters from that string. String could be of any length. Your algorithm must be in space. If you wish you can use constant size extra space which is not dependent any how on string size. Your algorithm must be of complexity of O(n). Example: Given string is BANANAS. Output must be BANS. All repeated characters are removed.
Problem 2: You have a tree and address of its root. Write an efficient program to test whether a given tree is Binary search Tree or not. (Hint: In-order traversal of binary search tree is sorted in increasing order. Use this property to develop program)
Problem 3: You have 2 sorted lists and a function that merge that 2 lists such that output is again sorted and duplicates are removed. That means output is union of those 2 lists in sorted form.
Example: First list is 2->3->5->6->8 and second list is 4->5->6->7 and output of function is 2->3->4->5->6->7->8.
Develop test cases to test given function such that your test cases ensures that given function works for every situation. That is if inputs are valid then it gives proper output in any case or otherwise it shows error message.
Round 3: First Technical Interview
All those who had cleared group interview were called for first technical interview. They were taking minimum 2 hours for first interview. Some of us also faced interview for 3 or more hours.
Round 4: Second Technical Interview
All those who had cleared first technical interview were called for second interview. This was last round of interview. They took 1½ to 2 hours for this second interview.
I don,t remember all the questions which were asked to me in both interviews. But still some of the questions which I can remember (almost 80 to 90% questions) are listed below.
In both interview they ask questions from C/C++, java, OS, Data structure and algorithms, Microprocessors and compiler constructions. With this, they also asked me to develop more than 6 to 8 programs. You can develop all programs in 5 to 7 minutes. But after writing program they asked to find its complexity and try to reduce the complexity and write the program again. In this way it took almost 15 to 20 min for each program. Some took less than 15 minutes also.
Some of the interview questions are as follows:
1. You are given a linked list and block size k. Reverse block of size k from list.
For example you are given linked list of 1000 nodes and block size is 5 then instead of reversing whole list, reverse first 5 elements, then 6 to 10 elements, then 11 to 15 elements, and so on...You have singly linked list and your algorithm which you will implement must be in space, that is no extra space is allowed.
2. You are given a tree and any 2 nodes of that tree. Find common parent of both nodes. Develop as much efficient program as you can.
3. In unix there is a command called “tail”. Implement that command in C.
4. Some questions about race condition (OS)
5. Questions related to semaphores.
6. Questions related to mutex. Applications of mutex. How to implement mutex in OS?
7. Questions about Critical region (OS).
8. How to ensure that race condition doesn,t occur. Give your view as you are OS designer.
9. How to ensure that each process lock the critical region before they enter in it. As OS designer How will you force the process to do this?
10. Questions on IPC
11. Questions on Shared memory and Message passing mechanism.
12. Difference between system call and API call
13. How system call works? What happens when system call is invoked?
14. Different types of system calls?
15. Some questions from microprocessor. About Interrupts
16. Types of Interrupts. What happened when interrupt is called?
17. You are given a hard copy of a program which contains some errors. Your job is to find all types of errors from it. And discuss why is it an error. Write correct program for the same.
18. You are given a linked list and a number n. You also have a function to delete all nodes from that list which are at position which multiple of n in the list.
Example: if number is 3 then delete 3rd, 6th, 9th ,...nodes form the list. Develop a program that tests whether given function works properly or not. (In short they are asking me to develop general program for all test cases. By running that program all tests can be performed.)
19. Questions on java. Exception handling
20. Need of catch and finally block in java exception handling..
21. How will you create your own exception.. Explain with example.
22. Some questions on compiler construction. What is parser? What is input to the parser and what is output of parser? Difference between top down and bottom up parser.
23. F(1) = 1.
F(2n) = F (n) and F(2n+1) = F(n) + F(n+1).
Develop recursive program.
24. You are given a string which contains some special characters. You also have set of special characters. You are given other string (call it as pattern string). Your job is to write a program to replace each special characters in given string by pattern string. You are not allowed to create new resulting string. You need to allocate some new memory to given existing string but constraint is you can only allocate memory one time. Allocate memory exactly what you need not more not less.
25. Assume that your friend is writing a book . He gives you a file that contains that book. Your job is to develop an algorithm for indexing of that book. In every book there is one index at end which contains some words which are not there in normal vocabulary dictionary. It also contains page number for reference. You can use any data structure you want. You need to justify why you have used that data structure and also need to justify your logic.
26. Question from my B.E. final semester project. Asked me to explain whole project.
27. Question from everything written on my resume.
28. Question from my every project I did. They asked me to explain each project and then how to do some modification? That modification will be suggested by interviewer himself.
29. My experience in Teaching assistantship.
30. They had my written test answer sheet. They opened it and asked me to explain why I gave that output or why I implement that logic. How did I arrive to that solution which I had written in answer sheet.
31. In written test, for second question I had implement a program which was not much efficient. During interview they ask me to optimize my program. They also gave hint to optimize it.
32. During group interview, in second problem I was only able to discuss logic I was unable to develop program in given time limit. Interviewer knew this. She asked me to develop that program during interview.
33. Which is your favorite software tool? If you are allowed to add any feature in it which feature you will add?
34. Which is your favorite subject? Some questions from that subject.
35. Something about yourself , your hobbies, interests, strengths and weakness.
MICROSOFT PAPER ON 26th JULY
Selection procedure and interview questions of Microsoft at Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT)
There were 4 rounds for selection procedure. First round was a written test, second round was group interview and 3rd and 4th rounds were technical interview. Each round had eliminations. Total 143 students were eligible for written test and 16 students were selected for the next round, ie. group interview. Only 8 students were able to go for 3rd round of technical interview. In 3rd round 4 more students were eliminated and remaining 4 students went for final round of technical interview. Only 1 student got an offer finally from Microsoft.
Following is the detail about each round.
Note: All examples which I will give here are just for your understanding. Interviewer was not giving any examples. Hardly 2 – 3 time interviewer gave examples.
Round 1: Written test
Paper style: 3 subjective questions
Time limit: 1½ hour
Question 1: Finding output....
It was string cruncher program. First remove all repeated consecutive substring with length 1, then delete substring of length 2 and so on...
Example : string is “abcabeccced”
After removing repeated substring of length 1: “abcababceccced” --> “abcababceced” (2 ,c, are removed)
After removing repeated substring of length 2: “abcababceced” --> “abcabceced” (substring “ab” is removed)
and so on...
Question 2: Writing a program.
Definition: You are given 3 integer arrays A, B and C of length n1, n2 and n3 respectively. All arrays are sorted. We define triplet of these 3 arrays as (x,y,z) where x is any integer from A, y from B and z from C. We define distance of triplet as maximum difference among triplet elements, i.e. Maximum of x – y, y – z or z – x. Write a program to find minimum triplet distance. (means there are n1*n2*n3 number of possible triplets are possible...among all triplets which triplet has minimum distance...Give only distance, but not triplet elements). Your program must be as much efficient as possible.
Question 3: Writing program.
Definition: You are given 2 integer numbers in linked list form. Add those 2 numbers.
Example: First number is 234 and second number is 35. So, you are provided with 2 linked lists 2->3->4 and 3->5. Your answer must be 2->6->9. (Make sure to take care of carry number). This example was given in paper.
Round 2: Group Interview
All candidates who had cleared the written test were called for group interview. Here we were given 3 problems one by one. Time limit was between 15 to 20 minutes. Once they gave problem definition we were supposed to think on it and discuss our ideas and logic about solving that problem with one of the representatives from Microsoft. Once that representative was convinced with our logic then we had to write code for that problem on paper.
Problem 1: You are given a string. Develop a function to remove duplicate characters from that string. String could be of any length. Your algorithm must be in space. If you wish you can use constant size extra space which is not dependent any how on string size. Your algorithm must be of complexity of O(n). Example: Given string is BANANAS. Output must be BANS. All repeated characters are removed.
Problem 2: You have a tree and address of its root. Write an efficient program to test whether a given tree is Binary search Tree or not. (Hint: In-order traversal of binary search tree is sorted in increasing order. Use this property to develop program)
Problem 3: You have 2 sorted lists and a function that merge that 2 lists such that output is again sorted and duplicates are removed. That means output is union of those 2 lists in sorted form.
Example: First list is 2->3->5->6->8 and second list is 4->5->6->7 and output of function is 2->3->4->5->6->7->8.
Develop test cases to test given function such that your test cases ensures that given function works for every situation. That is if inputs are valid then it gives proper output in any case or otherwise it shows error message.
Round 3: First Technical Interview
All those who had cleared group interview were called for first technical interview. They were taking minimum 2 hours for first interview. Some of us also faced interview for 3 or more hours.
Round 4: Second Technical Interview
All those who had cleared first technical interview were called for second interview. This was last round of interview. They took 1½ to 2 hours for this second interview.
I don,t remember all the questions which were asked to me in both interviews. But still some of the questions which I can remember (almost 80 to 90% questions) are listed below.
In both interview they ask questions from C/C++, java, OS, Data structure and algorithms, Microprocessors and compiler constructions. With this, they also asked me to develop more than 6 to 8 programs. You can develop all programs in 5 to 7 minutes. But after writing program they asked to find its complexity and try to reduce the complexity and write the program again. In this way it took almost 15 to 20 min for each program. Some took less than 15 minutes also.
Some of the interview questions are as follows:
1. You are given a linked list and block size k. Reverse block of size k from list.
For example you are given linked list of 1000 nodes and block size is 5 then instead of reversing whole list, reverse first 5 elements, then 6 to 10 elements, then 11 to 15 elements, and so on...You have singly linked list and your algorithm which you will implement must be in space, that is no extra space is allowed.
2. You are given a tree and any 2 nodes of that tree. Find common parent of both nodes. Develop as much efficient program as you can.
3. In unix there is a command called “tail”. Implement that command in C.
4. Some questions about race condition (OS)
5. Questions related to semaphores.
6. Questions related to mutex. Applications of mutex. How to implement mutex in OS?
7. Questions about Critical region (OS).
8. How to ensure that race condition doesn,t occur. Give your view as you are OS designer.
9. How to ensure that each process lock the critical region before they enter in it. As OS designer How will you force the process to do this?
10. Questions on IPC
11. Questions on Shared memory and Message passing mechanism.
12. Difference between system call and API call
13. How system call works? What happens when system call is invoked?
14. Different types of system calls?
15. Some questions from microprocessor. About Interrupts
16. Types of Interrupts. What happened when interrupt is called?
17. You are given a hard copy of a program which contains some errors. Your job is to find all types of errors from it. And discuss why is it an error. Write correct program for the same.
18. You are given a linked list and a number n. You also have a function to delete all nodes from that list which are at position which multiple of n in the list.
Example: if number is 3 then delete 3rd, 6th, 9th ,...nodes form the list. Develop a program that tests whether given function works properly or not. (In short they are asking me to develop general program for all test cases. By running that program all tests can be performed.)
19. Questions on java. Exception handling
20. Need of catch and finally block in java exception handling..
21. How will you create your own exception.. Explain with example.
22. Some questions on compiler construction. What is parser? What is input to the parser and what is output of parser? Difference between top down and bottom up parser.
23. F(1) = 1.
F(2n) = F (n) and F(2n+1) = F(n) + F(n+1).
Develop recursive program.
24. You are given a string which contains some special characters. You also have set of special characters. You are given other string (call it as pattern string). Your job is to write a program to replace each special characters in given string by pattern string. You are not allowed to create new resulting string. You need to allocate some new memory to given existing string but constraint is you can only allocate memory one time. Allocate memory exactly what you need not more not less.
25. Assume that your friend is writing a book . He gives you a file that contains that book. Your job is to develop an algorithm for indexing of that book. In every book there is one index at end which contains some words which are not there in normal vocabulary dictionary. It also contains page number for reference. You can use any data structure you want. You need to justify why you have used that data structure and also need to justify your logic.
26. Question from my B.E. final semester project. Asked me to explain whole project.
27. Question from everything written on my resume.
28. Question from my every project I did. They asked me to explain each project and then how to do some modification? That modification will be suggested by interviewer himself.
29. My experience in Teaching assistantship.
30. They had my written test answer sheet. They opened it and asked me to explain why I gave that output or why I implement that logic. How did I arrive to that solution which I had written in answer sheet.
31. In written test, for second question I had implement a program which was not much efficient. During interview they ask me to optimize my program. They also gave hint to optimize it.
32. During group interview, in second problem I was only able to discuss logic I was unable to develop program in given time limit. Interviewer knew this. She asked me to develop that program during interview.
33. Which is your favorite software tool? If you are allowed to add any feature in it which feature you will add?
34. Which is your favorite subject? Some questions from that subject.
35. Something about yourself , your hobbies, interests, strengths and weakness.
Networks and Security
1. How do you use RSA for both authentication and secrecy?
2. What is ARP and how does it work?
3. What,s the difference between a switch and a router?
4. Name some routing protocols? (RIP,OSPF etc..)
5. How do you do authentication with message digest(MD5)? (Usually MD is used for finding tampering of data)
6. How do you implement a packet filter that distinguishes following cases and selects first case and rejects second case.
i) A host inside the corporate n/w makes a ftp request to outside host and the outside host sends reply.
ii) A host outside the network sends a ftp request to host inside. for the packet filter in both cases the source and destination fields will look the same.
7. How does traceroute work? Now how does traceroute make sure that the packet follows the same path that a previous (with ttl - 1) probe packet went in?
8. Explain Kerberos Protocol ?
9. What are digital signatures and smart cards?
10. Difference between discretionary access control and mandatory access control?
Java
1. How do you find the size of a java object (not the primitive type) ?
ANS. type cast it to string and find its s.length()
2. Why is multiple inheritance not provided in Java?
3. Thread t = new Thread(); t.start(); t = null; now what will happen to the created thread?
4. How is garbage collection done in java?
5. How do you write a "ping" routine in java?
6. What are the security restrictions on applets?
Graphics
1. Write a function to check if two rectangles defined as below overlap or not. struct rect { int top, bot, left, right; } r1, r2;
2. Write a SetPixel(x, y) function, given a pointer to the bitmap. Each pixel is represented by 1 bit. There are 640 pixels per row. In each byte, while the bits are numbered right to left, pixels are numbered left to right. Avoid multiplications and divisions to improve performance.
Databases
* 1. You, a designer want to measure disk traffic i.e. get a histogram showing the relative frequency of I/O/second for each disk block. The buffer pool has b buffers and uses LRU replacement policy. The disk block size and buffer pool block sizes are the same. You are given a routine int lru_block_in_position (int i) which returns the block_id of the block in the i-th position in the list of blocks managed by LRU. Assume position 0 is the hottest. You can repeatedly call this routine. How would you get the histogram you desire?
Hints and Answers
1. Simply do histogram [lru_block_in_position (b-1)] ++ at frequent intervals... The sampling frequency should be close to the disk I/O rate. It can be adjusted by remembering the last block seen in position b. If same, decrease frequency; if different, increase, with exponential decay etc. And of course, take care of overflows in the histogram.
Semaphores
1. Implement a multiple-reader-single-writer lock given a compare-and-swap instruction. Readers cannot overtake waiting writers.
Computer Architecture
1. Explain what is DMA?
2. What is pipelining?
3. What are superscalar machines and vliw machines?
4. What is cache?
5. What is cache coherency and how is it eliminated?
6. What is write back and write through caches?
7. What are different pipelining hazards and how are they eliminated.
8. What are different stages of a pipe?
9. Explain more about branch prediction in controlling the control hazards
10. Give examples of data hazards with pseudo codes.
11. How do you calculate the number of sets given its way and size in a cache?
12. How is a block found in a cache?
13. Scoreboard analysis.
14. What is miss penalty and give your own ideas to eliminate it.
15. How do you improve the cache performance.
16. Different addressing modes.
17. Computer arithmetic with two,s complements.
18. About hardware and software interrupts.
19. What is bus contention and how do you eliminate it.
20. What is aliasing?
21) What is the difference between a latch and a flip flop?
22) What is the race around condition? How can it be overcome?
23) What is the purpose of cache? How is it used?
24) What are the types of memory management?
Algorithms and Programming
1. Given a rectangular (cuboidal for the puritans) cake with a rectangular piece removed (any size or orientation), how would you cut the remainder of the cake into two equal halves with one straight cut of a knife ?
2. You,re given an array containing both positive and negative integers and required to find the sub-array with the largest sum (O(N) a la KBL). Write a routine in C for the above.
3. Given an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
4. Write a routine to draw a circle (x ** 2 + y ** 2 = r ** 2) without making use of any floating point computations at all. [ This one had me stuck for quite some time and I first gave a solution that did have floating point computations ].
5. Given only putchar (no sprintf, itoa, etc.) write a routine putlong that prints out an unsigned long in decimal. [ I gave the obvious solution of taking % 10 and / 10, which gives us the decimal value in reverse order. This requires an array since we need to print it out in the correct order. The interviewer wasn,t too pleased and asked me to give a solution which didn,t need the array ].
6. Give a one-line C expression to test whether a number is a power of 2. [No loops allowed - it,s a simple test.]
7. Given an array of characters which form a sentence of words, give an efficient algorithm to reverse the order of the words (not characters) in it.
8. How many points are there on the globe where by walking one mile south, one mile east and one mile north you reach the place where you started.
9. Give a very good method to count the number of ones in a "n" (e.g. 32) bit number.
ANS. Given below are simple solutions, find a solution that does it in log (n) steps.
Iterative
function iterativecount (unsigned int n)
begin
int count=0;
while (n)
begin
count += n & 0x1 ;
n >>= 1;
end
return count;
end
Sparse Count
function sparsecount (unsigned int n)
begin
int count=0;
while (n)
begin
count++;
n &= (n-1);
end
return count ;
end
10. What are the different ways to implement a condition where the value of x can be either a 0 or a 1. Apparently the if then else solution has a jump when written out in assembly. if (x == 0) y=a else y=b There is a logical, arithmetic and a data structure solution to the above problem.
11. Reverse a linked list.
12. Insert in a sorted list
13. In a X,s and 0,s game (i.e. TIC TAC TOE) if you write a program for this give a fast way to generate the moves by the computer. I mean this should be the fastest way possible.
The answer is that you need to store all possible configurations of the board and the move that is associated with that. Then it boils down to just accessing the right element and getting the corresponding move for it. Do some analysis and do some more optimization in storage since otherwise it becomes infeasible to get the required storage in a DOS machine.
14. I was given two lines of assembly code which found the absolute value of a number stored in two,s complement form. I had to recognize what the code was doing. Pretty simple if you know some assembly and some fundaes on number representation.
15. Give a fast way to multiply a number by 7.
16. How would go about finding out where to find a book in a library. (You don,t know how exactly the books are organized beforehand).
17. Linked list manipulation.
18. Tradeoff between time spent in testing a product and getting into the market first.
19. What to test for given that there isn,t enough time to test everything you want to.
20. First some definitions for this problem: a) An ASCII character is one byte long and the most significant bit in the byte is always ,0,. b) A Kanji character is two bytes long. The only characteristic of a Kanji character is that in its first byte the most significant bit is ,1,.
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
21. Delete an element from a doubly linked list.
22. Write a function to find the depth of a binary tree.
23. Given two strings S1 and S2. Delete from S2 all those characters which occur in S1 also and finally create a clean S2 with the relevant characters deleted.
24. Assuming that locks are the only reason due to which deadlocks can occur in a system. What would be a foolproof method of avoiding deadlocks in the system.
25. Reverse a linked list.
Ans: Possible answers -
iterative loop
curr->next = prev;
prev = curr;
curr = next;
next = curr->next
endloop
recursive reverse(ptr)
if (ptr->next == NULL)
return ptr;
temp = reverse(ptr->next);
temp->next = ptr;
return ptr;
end
26. Write a small lexical analyzer - interviewer gave tokens. expressions like "a*b" etc.
27. Besides communication cost, what is the other source of inefficiency in RPC? (answer : context switches, excessive buffer copying). How can you optimize the communication? (ans : communicate through shared memory on same machine, bypassing the kernel _ A Univ. of Wash. thesis)
28. Write a routine that prints out a 2-D array in spiral order!
29. How is the readers-writers problem solved? - using semaphores/ada .. etc.
30. Ways of optimizing symbol table storage in compilers.
31. A walk-through through the symbol table functions, lookup() implementation etc. - The interviewer was on the Microsoft C team.
32. A version of the "There are three persons X Y Z, one of which always lies".. etc..
33. There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner.. what is the probability that they don,t collide.
34. Write an efficient algorithm and C code to shuffle a pack of cards.. this one was a feedback process until we came up with one with no extra storage.
35. The if (x == 0) y = 0 etc..
36. Some more bitwise optimization at assembly level
37. Some general questions on Lex, Yacc etc.
38. Given an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
39. Given an array of characters. How would you reverse it. ? How would you reverse it without using indexing in the array.
40. Given a sequence of characters. How will you convert the lower case characters to upper case characters. ( Try using bit vector - solutions given in the C lib -typec.h)
41. Fundamentals of RPC.
42. Given a linked list which is sorted. How will u insert in sorted way.
43. Given a linked list How will you reverse it.
44. Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
45. Do a breadth first traversal of a tree.
46. Write code for reversing a linked list.
47. Write, efficient code for extracting unique elements from a sorted list of array. e.g. (1, 1, 3, 3, 3, 5, 5, 5, 9, 9, 9, 9) -> (1, 3, 5, 9).
48. Given an array of integers, find the contiguous sub-array with the largest sum.
ANS. Can be done in O(n) time and O(1) extra space. Scan array from 1 to n. Remember the best sub-array seen so far and the best sub-array ending in i.
49. Given an array of length N containing integers between 1 and N, determine if it contains any duplicates.
ANS. [Is there an O(n) time solution that uses only O(1) extra space and does not destroy the original array?]
50. Sort an array of size n containing integers between 1 and K, given a temporary scratch integer array of size K.
ANS. Compute cumulative counts of integers in the auxiliary array. Now scan the original array, rotating cycles! [Can someone word this more nicely?]
* 51. An array of size k contains integers between 1 and n. You are given an additional scratch array of size n. Compress the original array by removing duplicates in it. What if k << n?
ANS. Can be done in O(k) time i.e. without initializing the auxiliary array!
52. An array of integers. The sum of the array is known not to overflow an integer. Compute the sum. What if we know that integers are in 2,s complement form?
ANS. If numbers are in 2,s complement, an ordinary looking loop like for(i=total=0;i< n;total+=array[i++]); will do. No need to check for overflows!
53. An array of characters. Reverse the order of words in it.
ANS. Write a routine to reverse a character array. Now call it for the given array and for each word in it.
* 54. An array of integers of size n. Generate a random permutation of the array, given a function rand_n() that returns an integer between 1 and n, both inclusive, with equal probability. What is the expected time of your algorithm?
ANS. "Expected time" should ring a bell. To compute a random permutation, use the standard algorithm of scanning array from n downto 1, swapping i-th element with a uniformly random element <= i-th. To compute a uniformly random integer between 1 and k (k < n), call rand_n() repeatedly until it returns a value in the desired range.
55. An array of pointers to (very long) strings. Find pointers to the (lexicographically) smallest and largest strings.
ANS. Scan array in pairs. Remember largest-so-far and smallest-so-far. Compare the larger of the two strings in the current pair with largest-so-far to update it. And the smaller of the current pair with the smallest-so-far to update it. For a total of <= 3n/2 strcmp() calls. That,s also the lower bound.
56. Write a program to remove duplicates from a sorted array.
ANS. int remove_duplicates(int * p, int size)
{
int current, insert = 1;
for (current=1; current < size; current++)
if (p[current] != p[insert-1])
{
p[insert] = p[current];
current++;
insert++;
} else
current++;
return insert;
}
57. C++ ( what is virtual function ? what happens if an error occurs in constructor or destructor. Discussion on error handling, templates, unique features of C++. What is different in C++, ( compare with unix).
58. Given a list of numbers ( fixed list) Now given any other list, how can you efficiently find out if there is any element in the second list that is an element of the first list (fixed list).
59. Given 3 lines of assembly code : find it is doing. IT was to find absolute value.
60. If you are on a boat and you throw out a suitcase, Will the level of water increase.
61. Print an integer using only putchar. Try doing it without using extra storage.
62. Write C code for (a) deleting an element from a linked list (b) traversing a linked list
63. What are various problems unique to distributed databases
64. Declare a void pointer ANS. void *ptr;
65. Make the pointer aligned to a 4 byte boundary in a efficient manner ANS. Assign the pointer to a long number and the number with 11...1100 add 4 to the number
66. What is a far pointer (in DOS)
67. What is a balanced tree
68. Given a linked list with the following property node2 is left child of node1, if node2 < node1 else, it is the right child.
O P
|
|
O A
|
|
O B
|
|
O C
How do you convert the above linked list to the form without disturbing the property. Write C code for that.
O P
|
|
O B
/ \
/ \
/ \
O ? O ?
determine where do A and C go
69. Describe the file system layout in the UNIX OS
ANS. describe boot block, super block, inodes and data layout
70. In UNIX, are the files allocated contiguous blocks of data
ANS. no, they might be fragmented
How is the fragmented data kept track of
ANS. Describe the direct blocks and indirect blocks in UNIX file system
71. Write an efficient C code for ,tr, program. ,tr, has two command line arguments. They both are strings of same length. tr reads an input file, replaces each character in the first string with the corresponding character in the second string. eg. ,tr abc xyz, replaces all ,a,s by ,x,s, ,b,s by ,y,s and so on. ANS.
a) have an array of length 26.
put ,x, in array element corr to ,a,
put ,y, in array element corr to ,b,
put ,z, in array element corr to ,c,
put ,d, in array element corr to ,d,
put ,e, in array element corr to ,e,
and so on.
the code
while (!eof)
{
c = getc();
putc(array[c - ,a,]);
}
72. what is disk interleaving
73. why is disk interleaving adopted
74. given a new disk, how do you determine which interleaving is the best a) give 1000 read operations with each kind of interleaving determine the best interleaving from the statistics
75. draw the graph with performance on one axis and ,n, on another, where ,n, in the ,n, in n-way disk interleaving. (a tricky question, should be answered carefully)
76. I was a c++ code and was asked to find out the bug in that. The bug was that he declared an object locally in a function and tried to return the pointer to that object. Since the object is local to the function, it no more exists after returning from the function. The pointer, therefore, is invalid outside.
77. A real life problem - A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square.
78.
int *a;
char *c;
*(a) = 20;
*c = *a;
printf("%c",*c);
what is the output?
79. Write a program to find whether a given m/c is big-endian or little-endian!
80. What is a volatile variable?
81. What is the scope of a static function in C ?
82. What is the difference between "malloc" and "calloc"?
83. struct n { int data; struct n* next}node;
node *c,*t;
c->data = 10;
t->next = null;
*c = *t;
what is the effect of the last statement?
84. If you,re familiar with the ? operator x ? y : z
you want to implement that in a function: int cond(int x, int y, int z); using only ~, !, ^, &, +, |, <<, >> no if statements, or loops or anything else, just those operators, and the function should correctly return y or z based on the value of x. You may use constants, but only 8 bit constants. You can cast all you want. You,re not supposed to use extra variables, but in the end, it won,t really matter, using vars just makes things cleaner. You should be able to reduce your solution to a single line in the end though that requires no extra vars.
85. You have an abstract computer, so just forget everything you know about computers, this one only does what I,m about to tell you it does. You can use as many variables as you need, there are no negative numbers, all numbers are integers. You do not know the size of the integers, they could be infinitely large, so you can,t count on truncating at any point. There are NO comparisons allowed, no if statements or anything like that. There are only four operations you can do on a variable.
1) You can set a variable to 0.
2) You can set a variable = another variable.
3) You can increment a variable (only by 1), and it,s a post increment.
4) You can loop. So, if you were to say loop(v1) and v1 = 10, your loop would execute 10 times, but the value in v1 wouldn,t change so the first line in the loop can change value of v1 without changing the number of times you loop.
You need to do 3 things.
1) Write a function that decrements by 1.
2) Write a function that subtracts one variable from another.
3) Write a function that divides one variable by another.
4) See if you can implement all 3 using at most 4 variables. Meaning, you,re not making function calls now, you,re making macros. And at most you can have 4 variables. The restriction really only applies to divide, the other 2 are easy to do with 4 vars or less. Division on the other hand is dependent on the other 2 functions, so, if subtract requires 3 variables, then divide only has 1 variable left unchanged after a call to subtract. Basically, just make your function calls to decrement and subtract so you pass your vars in by reference, and you can,t declare any new variables in a function, what you pass in is all it gets.
Linked lists
* 86. Under what circumstances can one delete an element from a singly linked list in constant time?
ANS. If the list is circular and there are no references to the nodes in the list from anywhere else! Just copy the contents of the next node and delete the next node. If the list is not circular, we can delete any but the last node using this idea. In that case, mark the last node as dummy!
* 87. Given a singly linked list, determine whether it contains a loop or not.
ANS. (a) Start reversing the list. If you reach the head, gotcha! there is a loop!
But this changes the list. So, reverse the list again.
(b) Maintain two pointers, initially pointing to the head. Advance one of them one node at a time. And the other one, two nodes at a time. If the latter overtakes the former at any time, there is a loop!
p1 = p2 = head;
do {
p1 = p1->next;
p2 = p2->next->next;
} while (p1 != p2);
88. Given a singly linked list, print out its contents in reverse order. Can you do it without using any extra space?
ANS. Start reversing the list. Do this again, printing the contents.
89. Given a binary tree with nodes, print out the values in pre-order/in-order/post-order without using any extra space.
90. Reverse a singly linked list recursively. The function prototype is node * reverse (node *) ;
ANS.
node * reverse (node * n)
{
node * m ;
if (! (n && n -> next))
return n ;
m = reverse (n -> next) ;
n -> next -> next = n ;
n -> next = NULL ;
return m ;
}
91. Given a singly linked list, find the middle of the list.
HINT. Use the single and double pointer jumping. Maintain two pointers, initially pointing to the head. Advance one of them one node at a time. And the other one, two nodes at a time. When the double reaches the end, the single is in the middle. This is not asymptotically faster but seems to take less steps than going through the list twice.
Bit-manipulation
92. Reverse the bits of an unsigned integer.
ANS.
#define reverse(x) \
(x=x>>16|(0x0000ffff&x)<<16, \
x=(0xff00ff00&x)>>8|(0x00ff00ff&x)<<8, \
x=(0xf0f0f0f0&x)>>4|(0x0f0f0f0f&x)<<4, \
x=(0xcccccccc&x)>>2|(0x33333333&x)<<2, \
x=(0xaaaaaaaa&x)>>1|(0x55555555&x)<<1)
* 93. Compute the number of ones in an unsigned integer.
ANS.
#define count_ones(x) \
(x=(0xaaaaaaaa&x)>>1+(0x55555555&x), \
x=(0xcccccccc&x)>>2+(0x33333333&x), \
x=(0xf0f0f0f0&x)>>4+(0x0f0f0f0f&x), \
x=(0xff00ff00&x)>>8+(0x00ff00ff&x), \
x=x>>16+(0x0000ffff&x))
94. Compute the discrete log of an unsigned integer.
ANS.
#define discrete_log(h) \
(h=(h>>1)|(h>>2), \
h|=(h>>2), \
h|=(h>>4), \
h|=(h>>8), \
h|=(h>>16), \
h=(0xaaaaaaaa&h)>>1+(0x55555555&h), \
h=(0xcccccccc&h)>>2+(0x33333333&h), \
h=(0xf0f0f0f0&h)>>4+(0x0f0f0f0f&h), \
h=(0xff00ff00&h)>>8+(0x00ff00ff&h), \
h=(h>>16)+(0x0000ffff&h))
If I understand it right, log2(2) =1, log2(3)=1, log2(4)=2..... But this macro does not work out log2(0) which does not exist! How do you think it should be handled?
* 95. How do we test most simply if an unsigned integer is a power of two?
ANS. #define power_of_two(x) \ ((x)&&(~(x&(x-1))))
96. Set the highest significant bit of an unsigned integer to zero.
ANS. (from Denis Zabavchik) Set the highest significant bit of an unsigned integer to zero
#define zero_most_significant(h) \
(h&=(h>>1)|(h>>2), \
h|=(h>>2), \
h|=(h>>4), \
h|=(h>>8), \
h|=(h>>16))
97. Let f(k) = y where k is the y-th number in the increasing sequence of non-negative integers with the same number of ones in its binary representation as y, e.g. f(0) = 1, f(1) = 1, f(2) = 2, f(3) = 1, f(4) = 3, f(5) = 2, f(6) = 3 and so on. Given k >= 0, compute f(k).
Others
98. A character set has 1 and 2 byte characters. One byte characters have 0 as the first bit. You just keep accumulating the characters in a buffer. Suppose at some point the user types a backspace, how can you remove the character efficiently. (Note: You cant store the last character typed because the user can type in arbitrarily many backspaces)
99. What is the simples way to check if the sum of two unsigned integers has resulted in an overflow.
100. How do you represent an n-ary tree? Write a program to print the nodes of such a tree in breadth first order.
101. Write the ,tr, program of UNIX. Invoked as
tr -str1 -str2. It reads stdin and prints it out to stdout, replacing every occurance of str1[i] with str2[i].
e.g. tr -abc -xyz
to be and not to be <- input
to ye xnd not to ye <- output
MICROSOFT PAPER AND PATTERN
The following are actual questions from actual interviews conducted by
Microsoft employees on the main campus. Microsoft Consultants are
sometimes allowed to have a life, so questions asked of them during
interviews don,t really count and aren,t listed.
The questions tend to follow some basic themes:
Riddles
Algorithms
Applications
Thinkers
Riddles
Why is a manhole cover round?
How many cars are there in the USA? (A popular variant is "How many gas
stations are there in the USA?")
How many manhole covers are there in the USA?
You,ve got someone working for you for seven days and a gold bar to pay
them. The gold bar is segmented into seven connected pieces. You must
give them a piece of gold at the end of every day. If you are only
allowed to make two breaks in the gold bar, how do you pay your worker?
One train leaves Los Angeles at 15mph heading for New York. Another
train leaves from New York at 20mph heading for Los Angeles on the same
track. If a bird, flying at 25mph, leaves from Los Angeles at the same
time as the train and flies back and forth between the two trains until
they collide, how far will the bird have traveled?
Imagine a disk spinning like a record player turn table. Half of the
disk is black and the other is white. Assume you have an unlimited
number
of color sensors. How many sensors would you have to place around the
disk to determine the direction the disk is spinning? Where would they
be placed?
Imagine an analog clock set to 12 o,clock. Note that the hour and
minute hands overlap. How many times each day do both the hour and
minute
hands overlap? How would you determine the exact times of the day that
this occurs?
You have two jars, 50 red marbles and 50 blue marbles. A jar will be
picked at random, and then a marble will be picked from the jar.
Placing
all of the marbles in the jars, how can you maximize the chances of a
red marble being picked? What are the exact odds of getting a red
marble
using your scheme?
Pairs of primes separated by a single number are called prime pairs.
Examples are 17 and 19. Prove that the number between a prime pair is
always divisible by 6 (assuming both numbers in the pair are greater
than
6). Now prove that there are no ,prime triples.,
There is a room with a door (closed) and three light bulbs. Outside the
room there are three switches, connected to the bulbs. You may
manipulate the switches as you wish, but once you open the door you
can,t
change them. Identify each switch with its bulb.
Suppose you had 8 billiard balls, and one of them was slightly heavier,
but the only way to tell was by putting it on a scale against another.
What,s the fewest number of times you,d have to use the scale to find
the heavier ball?
Imagine you are standing in front of a mirror, facing it. Raise your
left hand. Raise your right hand. Look at your reflection. When you
raise
your left hand your reflection raises what appears to be his right
hand. But when you tilt your head up, your reflection does too, and
does
not appear to tilt his/her head down. Why is it that the mirror appears
to reverse left and right, but not up and down?
You have 4 jars of pills. Each pill is a certain weight, except for
contaminated pills contained in one jar, where each pill is weight + 1.
How could you tell which jar had the contaminated pills in just one
measurement?
The SF Chronicle has a word game where all the letters are scrambled up
and you have to figure out what the word is. Imagine that a scrambled
word is 5 characters long:
How many possible solutions are there?
What if we know which 5 letters are being used?
Develop an algorithm to solve the word.
There are 4 women who want to cross a bridge. They all begin on the
same side. You have 17 minutes to get all of them across to the other
side. It is night. There is one flashlight. A maximum of two people can
cross at one time. Any party who crosses, either 1 or 2 people, must
have
the flashlight with them. The flashlight must be walked back and forth,
it cannot be thrown, etc. Each woman walks at a different speed. A pair
must walk together at the rate of the slower woman,s pace.
Woman 1: 1 minute to cross
Woman 2: 2 minutes to cross
Woman 3: 5 minutes to cross
Woman 4: 10 minutes to cross
For example if Woman 1 and Woman 4 walk across first, 10 minutes have
elapsed when they get to the other side of the bridge. If Woman 4 then
returns with the flashlight, a total of 20 minutes have passed and you
have failed the mission. What is the order required to get all women
across in 17 minutes? Now, what,s the other way?
If you had an infinite supply of water and a 5 quart and 3 quart pail,
how would you measure exactly 4 quarts?
You have a bucket of jelly beans. Some are red, some are blue, and some
green. With your eyes closed, pick out 2 of a like color. How many do
you have to grab to be sure you have 2 of the same?
If you have two buckets, one with red paint and the other with blue
paint, and you take one cup from the blue bucket and poor it into the
red
bucket. Then you take one cup from the red bucket and poor it into the
blue bucket. Which bucket has the highest ratio between red and blue?
Prove it mathematically.
Algorithms
What,s the difference between a linked list and an array?
Implement a linked list. Why did you pick the method you did?
Implement an algorithm to sort a linked list. Why did you pick the
method you did? Now do it in O(n) time.
Describe advantages and disadvantages of the various stock sorting
algorithms.
Implement an algorithm to reverse a linked list. Now do it without
recursion.
Implement an algorithm to insert a node into a circular linked list
without traversing it.
Implement an algorithm to sort an array. Why did you pick the method
you did?
Implement an algorithm to do wild card string matching.
Implement strstr() (or some other string library function).
Reverse a string. Optimize for speed. Optimize for space.
Reverse the words in a sentence, i.e. "My name is Chris" becomes "Chris
is name My." Optimize for speed. Optimize for space.
Find a substring. Optimize for speed. Optimize for space.
Compare two strings using O(n) time with constant space.
Suppose you have an array of 1001 integers. The integers are in random
order, but you know each of the integers is between 1 and 1000
(inclusive). In addition, each number appears only once in the array,
except
for one number, which occurs twice. Assume that you can access each
element of the array only once. Describe an algorithm to find the
repeated
number. If you used auxiliary storage in your algorithm, can you find
an
algorithm that does not require it?
Count the number of set bits in a number. Now optimize for speed. Now
optimize for size.
Multiple by 8 without using multiplication or addition. Now do the same
with 7.
Add numbers in base n (not any of the popular ones like 10, 16, 8 or 2
-- I hear that Charles Simonyi, the inventor of Hungarian Notation,
favors -2 when asking this question).
Write routines to read and write a bounded buffer.
Write routines to manage a heap using an existing array.
Implement an algorithm to take an array and return one with only unique
elements in it.
Implement an algorithm that takes two strings as input, and returns the
intersection of the two, with each letter represented at most once. Now
speed it up. Now test it.
Implement an algorithm to print out all files below a given root node.
Given that you are receiving samples from an instrument at a constant
rate, and you have constant storage space, how would you design a
storage algorithm that would allow me to get a representative readout
of
data, no matter when I looked at it? In other words, representative of
the
behavior of the system to date.
How would you find a cycle in a linked list?
Give me an algorithm to shuffle a deck of cards, given that the cards
are stored in an array of ints.
The following asm block performs a common math function, what is it?
cwd xor ax, dx
sub ax, dx
Imagine this scenario:
I/O completion ports are communictaions ports which take handles to
files, sockets, or any other I/O. When a Read or Write is submitted to
them, they cache the data (if necessary), and attempt to take the
request
to completion. Upon error or completion, they call a user-supplied
function to let the users application know that that particular request
has
completed. They work asynchronously, and can process an unlimited
number of simultaneous requests.
Design the implementation and thread models for I/O completion ports.
Remember to take into account multi-processor machines.
Write a function that takes in a string parameter and checks to see
whether or not it is an integer, and if it is then return the integer
value.
Write a function to print all of the permutations of a string.
Implement malloc.
Write a function to print the Fibonacci numbers.
Write a function to copy two strings, A and B. The last few bytes of
string A overlap the first few bytes of string B.
How would you write qsort?
How would you print out the data in a binary tree, level by level,
starting at the top?
Applications
How can computer technology be integrated in an elevator system for a
hundred story office building? How do you optimize for availability?
How
would variation of traffic over a typical work week or floor or time of
day affect this?
How would you implement copy-protection on a control which can be
embedded in a document and duplicated readily via the Internet?
Define a user interface for indenting selected text in a Word document.
Consider selections ranging from a single sentence up through
selections of several pages. Consider selections not currently visible
or only
partially visible. What are the states of the new UI controls? How will
the user know what the controls are for and when to use them?
How would you redesign an ATM?
Suppose we wanted to run a microwave oven from the computer. What kind
of software would you write to do this?
What is the difference between an Ethernet Address and an IP address?
How would you design a coffee-machine for an automobile.
If you could add any feature to Microsoft Word, what would it be?
How would you go about building a keyboard for 1-handed users?
How would you build an alarm clock for deaf people?
Thinkers
How are M&Ms made?
If you had a clock with lots of moving mechanical parts, you took it
apart piece by piece without keeping track of the method of how it was
disassembled, then you put it back together and discovered that 3
important parts were not included; how would you go about reassembling
the
clock?
If you had to learn a new computer language, how would you go about
doing it?
You have been assigned to design Bill Gates bathroom. Naturally, cost
is not a consideration. You may not speak to Bill.
What was the hardest question asked of you so far today?
If MS told you we were willing to invest $5 million in a start up of
your choice, what business would you start? Why?
If you could gather all of the computer manufacturers in the world
together into one room and then tell them one thing that they would be
compelled to do, what would it be?
Explain a scenario for testing a salt shaker.
If you are going to receive an award in 5 years, what is it for and who
is the audience?
How would you explain how to use Microsoft Excel to your grandma?
Why is it that when you turn on the hot water in any hotel, for
example, the hot water comes pouring out almost instantaneously?
Why do you want to work at Microsoft?
Suppose you go home, enter your house/apartment, hit the light switch,
and nothing happens - no light floods the room. What exactly, in order,
are the steps you would take in determining what the problem was?
Interviewer hands you a black pen and says nothing but "This pen is
red."
Following is the detail about each round.
Note: All examples which I will give here are just for your understanding. Interviewer was not giving any examples. Hardly 2 – 3 time interviewer gave examples.
Round 1: Written test
Paper style: 3 subjective questions
Time limit: 1½ hour
Question 1: Finding output....
It was string cruncher program. First remove all repeated consecutive substring with length 1, then delete substring of length 2 and so on...
Example : string is “abcabeccced”
After removing repeated substring of length 1: “abcababceccced” --> “abcababceced” (2 ,c, are removed)
After removing repeated substring of length 2: “abcababceced” --> “abcabceced” (substring “ab” is removed)
and so on...
Question 2: Writing a program.
Definition: You are given 3 integer arrays A, B and C of length n1, n2 and n3 respectively. All arrays are sorted. We define triplet of these 3 arrays as (x,y,z) where x is any integer from A, y from B and z from C. We define distance of triplet as maximum difference among triplet elements, i.e. Maximum of x – y, y – z or z – x. Write a program to find minimum triplet distance. (means there are n1*n2*n3 number of possible triplets are possible...among all triplets which triplet has minimum distance...Give only distance, but not triplet elements). Your program must be as much efficient as possible.
Question 3: Writing program.
Definition: You are given 2 integer numbers in linked list form. Add those 2 numbers.
Example: First number is 234 and second number is 35. So, you are provided with 2 linked lists 2->3->4 and 3->5. Your answer must be 2->6->9. (Make sure to take care of carry number). This example was given in paper.
Round 2: Group Interview
All candidates who had cleared the written test were called for group interview. Here we were given 3 problems one by one. Time limit was between 15 to 20 minutes. Once they gave problem definition we were supposed to think on it and discuss our ideas and logic about solving that problem with one of the representatives from Microsoft. Once that representative was convinced with our logic then we had to write code for that problem on paper.
Problem 1: You are given a string. Develop a function to remove duplicate characters from that string. String could be of any length. Your algorithm must be in space. If you wish you can use constant size extra space which is not dependent any how on string size. Your algorithm must be of complexity of O(n). Example: Given string is BANANAS. Output must be BANS. All repeated characters are removed.
Problem 2: You have a tree and address of its root. Write an efficient program to test whether a given tree is Binary search Tree or not. (Hint: In-order traversal of binary search tree is sorted in increasing order. Use this property to develop program)
Problem 3: You have 2 sorted lists and a function that merge that 2 lists such that output is again sorted and duplicates are removed. That means output is union of those 2 lists in sorted form.
Example: First list is 2->3->5->6->8 and second list is 4->5->6->7 and output of function is 2->3->4->5->6->7->8.
Develop test cases to test given function such that your test cases ensures that given function works for every situation. That is if inputs are valid then it gives proper output in any case or otherwise it shows error message.
Round 3: First Technical Interview
All those who had cleared group interview were called for first technical interview. They were taking minimum 2 hours for first interview. Some of us also faced interview for 3 or more hours.
Round 4: Second Technical Interview
All those who had cleared first technical interview were called for second interview. This was last round of interview. They took 1½ to 2 hours for this second interview.
I don,t remember all the questions which were asked to me in both interviews. But still some of the questions which I can remember (almost 80 to 90% questions) are listed below.
In both interview they ask questions from C/C++, java, OS, Data structure and algorithms, Microprocessors and compiler constructions. With this, they also asked me to develop more than 6 to 8 programs. You can develop all programs in 5 to 7 minutes. But after writing program they asked to find its complexity and try to reduce the complexity and write the program again. In this way it took almost 15 to 20 min for each program. Some took less than 15 minutes also.
Some of the interview questions are as follows:
1. You are given a linked list and block size k. Reverse block of size k from list.
For example you are given linked list of 1000 nodes and block size is 5 then instead of reversing whole list, reverse first 5 elements, then 6 to 10 elements, then 11 to 15 elements, and so on...You have singly linked list and your algorithm which you will implement must be in space, that is no extra space is allowed.
2. You are given a tree and any 2 nodes of that tree. Find common parent of both nodes. Develop as much efficient program as you can.
3. In unix there is a command called “tail”. Implement that command in C.
4. Some questions about race condition (OS)
5. Questions related to semaphores.
6. Questions related to mutex. Applications of mutex. How to implement mutex in OS?
7. Questions about Critical region (OS).
8. How to ensure that race condition doesn,t occur. Give your view as you are OS designer.
9. How to ensure that each process lock the critical region before they enter in it. As OS designer How will you force the process to do this?
10. Questions on IPC
11. Questions on Shared memory and Message passing mechanism.
12. Difference between system call and API call
13. How system call works? What happens when system call is invoked?
14. Different types of system calls?
15. Some questions from microprocessor. About Interrupts
16. Types of Interrupts. What happened when interrupt is called?
17. You are given a hard copy of a program which contains some errors. Your job is to find all types of errors from it. And discuss why is it an error. Write correct program for the same.
18. You are given a linked list and a number n. You also have a function to delete all nodes from that list which are at position which multiple of n in the list.
Example: if number is 3 then delete 3rd, 6th, 9th ,...nodes form the list. Develop a program that tests whether given function works properly or not. (In short they are asking me to develop general program for all test cases. By running that program all tests can be performed.)
19. Questions on java. Exception handling
20. Need of catch and finally block in java exception handling..
21. How will you create your own exception.. Explain with example.
22. Some questions on compiler construction. What is parser? What is input to the parser and what is output of parser? Difference between top down and bottom up parser.
23. F(1) = 1.
F(2n) = F (n) and F(2n+1) = F(n) + F(n+1).
Develop recursive program.
24. You are given a string which contains some special characters. You also have set of special characters. You are given other string (call it as pattern string). Your job is to write a program to replace each special characters in given string by pattern string. You are not allowed to create new resulting string. You need to allocate some new memory to given existing string but constraint is you can only allocate memory one time. Allocate memory exactly what you need not more not less.
25. Assume that your friend is writing a book . He gives you a file that contains that book. Your job is to develop an algorithm for indexing of that book. In every book there is one index at end which contains some words which are not there in normal vocabulary dictionary. It also contains page number for reference. You can use any data structure you want. You need to justify why you have used that data structure and also need to justify your logic.
26. Question from my B.E. final semester project. Asked me to explain whole project.
27. Question from everything written on my resume.
28. Question from my every project I did. They asked me to explain each project and then how to do some modification? That modification will be suggested by interviewer himself.
29. My experience in Teaching assistantship.
30. They had my written test answer sheet. They opened it and asked me to explain why I gave that output or why I implement that logic. How did I arrive to that solution which I had written in answer sheet.
31. In written test, for second question I had implement a program which was not much efficient. During interview they ask me to optimize my program. They also gave hint to optimize it.
32. During group interview, in second problem I was only able to discuss logic I was unable to develop program in given time limit. Interviewer knew this. She asked me to develop that program during interview.
33. Which is your favorite software tool? If you are allowed to add any feature in it which feature you will add?
34. Which is your favorite subject? Some questions from that subject.
35. Something about yourself , your hobbies, interests, strengths and weakness.
MICROSOFT PAPER ON 26th JULY
Selection procedure and interview questions of Microsoft at Dhirubhai Ambani Institute of Information and Communication Technology (DA-IICT)
There were 4 rounds for selection procedure. First round was a written test, second round was group interview and 3rd and 4th rounds were technical interview. Each round had eliminations. Total 143 students were eligible for written test and 16 students were selected for the next round, ie. group interview. Only 8 students were able to go for 3rd round of technical interview. In 3rd round 4 more students were eliminated and remaining 4 students went for final round of technical interview. Only 1 student got an offer finally from Microsoft.
Following is the detail about each round.
Note: All examples which I will give here are just for your understanding. Interviewer was not giving any examples. Hardly 2 – 3 time interviewer gave examples.
Round 1: Written test
Paper style: 3 subjective questions
Time limit: 1½ hour
Question 1: Finding output....
It was string cruncher program. First remove all repeated consecutive substring with length 1, then delete substring of length 2 and so on...
Example : string is “abcabeccced”
After removing repeated substring of length 1: “abcababceccced” --> “abcababceced” (2 ,c, are removed)
After removing repeated substring of length 2: “abcababceced” --> “abcabceced” (substring “ab” is removed)
and so on...
Question 2: Writing a program.
Definition: You are given 3 integer arrays A, B and C of length n1, n2 and n3 respectively. All arrays are sorted. We define triplet of these 3 arrays as (x,y,z) where x is any integer from A, y from B and z from C. We define distance of triplet as maximum difference among triplet elements, i.e. Maximum of x – y, y – z or z – x. Write a program to find minimum triplet distance. (means there are n1*n2*n3 number of possible triplets are possible...among all triplets which triplet has minimum distance...Give only distance, but not triplet elements). Your program must be as much efficient as possible.
Question 3: Writing program.
Definition: You are given 2 integer numbers in linked list form. Add those 2 numbers.
Example: First number is 234 and second number is 35. So, you are provided with 2 linked lists 2->3->4 and 3->5. Your answer must be 2->6->9. (Make sure to take care of carry number). This example was given in paper.
Round 2: Group Interview
All candidates who had cleared the written test were called for group interview. Here we were given 3 problems one by one. Time limit was between 15 to 20 minutes. Once they gave problem definition we were supposed to think on it and discuss our ideas and logic about solving that problem with one of the representatives from Microsoft. Once that representative was convinced with our logic then we had to write code for that problem on paper.
Problem 1: You are given a string. Develop a function to remove duplicate characters from that string. String could be of any length. Your algorithm must be in space. If you wish you can use constant size extra space which is not dependent any how on string size. Your algorithm must be of complexity of O(n). Example: Given string is BANANAS. Output must be BANS. All repeated characters are removed.
Problem 2: You have a tree and address of its root. Write an efficient program to test whether a given tree is Binary search Tree or not. (Hint: In-order traversal of binary search tree is sorted in increasing order. Use this property to develop program)
Problem 3: You have 2 sorted lists and a function that merge that 2 lists such that output is again sorted and duplicates are removed. That means output is union of those 2 lists in sorted form.
Example: First list is 2->3->5->6->8 and second list is 4->5->6->7 and output of function is 2->3->4->5->6->7->8.
Develop test cases to test given function such that your test cases ensures that given function works for every situation. That is if inputs are valid then it gives proper output in any case or otherwise it shows error message.
Round 3: First Technical Interview
All those who had cleared group interview were called for first technical interview. They were taking minimum 2 hours for first interview. Some of us also faced interview for 3 or more hours.
Round 4: Second Technical Interview
All those who had cleared first technical interview were called for second interview. This was last round of interview. They took 1½ to 2 hours for this second interview.
I don,t remember all the questions which were asked to me in both interviews. But still some of the questions which I can remember (almost 80 to 90% questions) are listed below.
In both interview they ask questions from C/C++, java, OS, Data structure and algorithms, Microprocessors and compiler constructions. With this, they also asked me to develop more than 6 to 8 programs. You can develop all programs in 5 to 7 minutes. But after writing program they asked to find its complexity and try to reduce the complexity and write the program again. In this way it took almost 15 to 20 min for each program. Some took less than 15 minutes also.
Some of the interview questions are as follows:
1. You are given a linked list and block size k. Reverse block of size k from list.
For example you are given linked list of 1000 nodes and block size is 5 then instead of reversing whole list, reverse first 5 elements, then 6 to 10 elements, then 11 to 15 elements, and so on...You have singly linked list and your algorithm which you will implement must be in space, that is no extra space is allowed.
2. You are given a tree and any 2 nodes of that tree. Find common parent of both nodes. Develop as much efficient program as you can.
3. In unix there is a command called “tail”. Implement that command in C.
4. Some questions about race condition (OS)
5. Questions related to semaphores.
6. Questions related to mutex. Applications of mutex. How to implement mutex in OS?
7. Questions about Critical region (OS).
8. How to ensure that race condition doesn,t occur. Give your view as you are OS designer.
9. How to ensure that each process lock the critical region before they enter in it. As OS designer How will you force the process to do this?
10. Questions on IPC
11. Questions on Shared memory and Message passing mechanism.
12. Difference between system call and API call
13. How system call works? What happens when system call is invoked?
14. Different types of system calls?
15. Some questions from microprocessor. About Interrupts
16. Types of Interrupts. What happened when interrupt is called?
17. You are given a hard copy of a program which contains some errors. Your job is to find all types of errors from it. And discuss why is it an error. Write correct program for the same.
18. You are given a linked list and a number n. You also have a function to delete all nodes from that list which are at position which multiple of n in the list.
Example: if number is 3 then delete 3rd, 6th, 9th ,...nodes form the list. Develop a program that tests whether given function works properly or not. (In short they are asking me to develop general program for all test cases. By running that program all tests can be performed.)
19. Questions on java. Exception handling
20. Need of catch and finally block in java exception handling..
21. How will you create your own exception.. Explain with example.
22. Some questions on compiler construction. What is parser? What is input to the parser and what is output of parser? Difference between top down and bottom up parser.
23. F(1) = 1.
F(2n) = F (n) and F(2n+1) = F(n) + F(n+1).
Develop recursive program.
24. You are given a string which contains some special characters. You also have set of special characters. You are given other string (call it as pattern string). Your job is to write a program to replace each special characters in given string by pattern string. You are not allowed to create new resulting string. You need to allocate some new memory to given existing string but constraint is you can only allocate memory one time. Allocate memory exactly what you need not more not less.
25. Assume that your friend is writing a book . He gives you a file that contains that book. Your job is to develop an algorithm for indexing of that book. In every book there is one index at end which contains some words which are not there in normal vocabulary dictionary. It also contains page number for reference. You can use any data structure you want. You need to justify why you have used that data structure and also need to justify your logic.
26. Question from my B.E. final semester project. Asked me to explain whole project.
27. Question from everything written on my resume.
28. Question from my every project I did. They asked me to explain each project and then how to do some modification? That modification will be suggested by interviewer himself.
29. My experience in Teaching assistantship.
30. They had my written test answer sheet. They opened it and asked me to explain why I gave that output or why I implement that logic. How did I arrive to that solution which I had written in answer sheet.
31. In written test, for second question I had implement a program which was not much efficient. During interview they ask me to optimize my program. They also gave hint to optimize it.
32. During group interview, in second problem I was only able to discuss logic I was unable to develop program in given time limit. Interviewer knew this. She asked me to develop that program during interview.
33. Which is your favorite software tool? If you are allowed to add any feature in it which feature you will add?
34. Which is your favorite subject? Some questions from that subject.
35. Something about yourself , your hobbies, interests, strengths and weakness.
Networks and Security
1. How do you use RSA for both authentication and secrecy?
2. What is ARP and how does it work?
3. What,s the difference between a switch and a router?
4. Name some routing protocols? (RIP,OSPF etc..)
5. How do you do authentication with message digest(MD5)? (Usually MD is used for finding tampering of data)
6. How do you implement a packet filter that distinguishes following cases and selects first case and rejects second case.
i) A host inside the corporate n/w makes a ftp request to outside host and the outside host sends reply.
ii) A host outside the network sends a ftp request to host inside. for the packet filter in both cases the source and destination fields will look the same.
7. How does traceroute work? Now how does traceroute make sure that the packet follows the same path that a previous (with ttl - 1) probe packet went in?
8. Explain Kerberos Protocol ?
9. What are digital signatures and smart cards?
10. Difference between discretionary access control and mandatory access control?
Java
1. How do you find the size of a java object (not the primitive type) ?
ANS. type cast it to string and find its s.length()
2. Why is multiple inheritance not provided in Java?
3. Thread t = new Thread(); t.start(); t = null; now what will happen to the created thread?
4. How is garbage collection done in java?
5. How do you write a "ping" routine in java?
6. What are the security restrictions on applets?
Graphics
1. Write a function to check if two rectangles defined as below overlap or not. struct rect { int top, bot, left, right; } r1, r2;
2. Write a SetPixel(x, y) function, given a pointer to the bitmap. Each pixel is represented by 1 bit. There are 640 pixels per row. In each byte, while the bits are numbered right to left, pixels are numbered left to right. Avoid multiplications and divisions to improve performance.
Databases
* 1. You, a designer want to measure disk traffic i.e. get a histogram showing the relative frequency of I/O/second for each disk block. The buffer pool has b buffers and uses LRU replacement policy. The disk block size and buffer pool block sizes are the same. You are given a routine int lru_block_in_position (int i) which returns the block_id of the block in the i-th position in the list of blocks managed by LRU. Assume position 0 is the hottest. You can repeatedly call this routine. How would you get the histogram you desire?
Hints and Answers
1. Simply do histogram [lru_block_in_position (b-1)] ++ at frequent intervals... The sampling frequency should be close to the disk I/O rate. It can be adjusted by remembering the last block seen in position b. If same, decrease frequency; if different, increase, with exponential decay etc. And of course, take care of overflows in the histogram.
Semaphores
1. Implement a multiple-reader-single-writer lock given a compare-and-swap instruction. Readers cannot overtake waiting writers.
Computer Architecture
1. Explain what is DMA?
2. What is pipelining?
3. What are superscalar machines and vliw machines?
4. What is cache?
5. What is cache coherency and how is it eliminated?
6. What is write back and write through caches?
7. What are different pipelining hazards and how are they eliminated.
8. What are different stages of a pipe?
9. Explain more about branch prediction in controlling the control hazards
10. Give examples of data hazards with pseudo codes.
11. How do you calculate the number of sets given its way and size in a cache?
12. How is a block found in a cache?
13. Scoreboard analysis.
14. What is miss penalty and give your own ideas to eliminate it.
15. How do you improve the cache performance.
16. Different addressing modes.
17. Computer arithmetic with two,s complements.
18. About hardware and software interrupts.
19. What is bus contention and how do you eliminate it.
20. What is aliasing?
21) What is the difference between a latch and a flip flop?
22) What is the race around condition? How can it be overcome?
23) What is the purpose of cache? How is it used?
24) What are the types of memory management?
Algorithms and Programming
1. Given a rectangular (cuboidal for the puritans) cake with a rectangular piece removed (any size or orientation), how would you cut the remainder of the cake into two equal halves with one straight cut of a knife ?
2. You,re given an array containing both positive and negative integers and required to find the sub-array with the largest sum (O(N) a la KBL). Write a routine in C for the above.
3. Given an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
4. Write a routine to draw a circle (x ** 2 + y ** 2 = r ** 2) without making use of any floating point computations at all. [ This one had me stuck for quite some time and I first gave a solution that did have floating point computations ].
5. Given only putchar (no sprintf, itoa, etc.) write a routine putlong that prints out an unsigned long in decimal. [ I gave the obvious solution of taking % 10 and / 10, which gives us the decimal value in reverse order. This requires an array since we need to print it out in the correct order. The interviewer wasn,t too pleased and asked me to give a solution which didn,t need the array ].
6. Give a one-line C expression to test whether a number is a power of 2. [No loops allowed - it,s a simple test.]
7. Given an array of characters which form a sentence of words, give an efficient algorithm to reverse the order of the words (not characters) in it.
8. How many points are there on the globe where by walking one mile south, one mile east and one mile north you reach the place where you started.
9. Give a very good method to count the number of ones in a "n" (e.g. 32) bit number.
ANS. Given below are simple solutions, find a solution that does it in log (n) steps.
Iterative
function iterativecount (unsigned int n)
begin
int count=0;
while (n)
begin
count += n & 0x1 ;
n >>= 1;
end
return count;
end
Sparse Count
function sparsecount (unsigned int n)
begin
int count=0;
while (n)
begin
count++;
n &= (n-1);
end
return count ;
end
10. What are the different ways to implement a condition where the value of x can be either a 0 or a 1. Apparently the if then else solution has a jump when written out in assembly. if (x == 0) y=a else y=b There is a logical, arithmetic and a data structure solution to the above problem.
11. Reverse a linked list.
12. Insert in a sorted list
13. In a X,s and 0,s game (i.e. TIC TAC TOE) if you write a program for this give a fast way to generate the moves by the computer. I mean this should be the fastest way possible.
The answer is that you need to store all possible configurations of the board and the move that is associated with that. Then it boils down to just accessing the right element and getting the corresponding move for it. Do some analysis and do some more optimization in storage since otherwise it becomes infeasible to get the required storage in a DOS machine.
14. I was given two lines of assembly code which found the absolute value of a number stored in two,s complement form. I had to recognize what the code was doing. Pretty simple if you know some assembly and some fundaes on number representation.
15. Give a fast way to multiply a number by 7.
16. How would go about finding out where to find a book in a library. (You don,t know how exactly the books are organized beforehand).
17. Linked list manipulation.
18. Tradeoff between time spent in testing a product and getting into the market first.
19. What to test for given that there isn,t enough time to test everything you want to.
20. First some definitions for this problem: a) An ASCII character is one byte long and the most significant bit in the byte is always ,0,. b) A Kanji character is two bytes long. The only characteristic of a Kanji character is that in its first byte the most significant bit is ,1,.
Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).
21. Delete an element from a doubly linked list.
22. Write a function to find the depth of a binary tree.
23. Given two strings S1 and S2. Delete from S2 all those characters which occur in S1 also and finally create a clean S2 with the relevant characters deleted.
24. Assuming that locks are the only reason due to which deadlocks can occur in a system. What would be a foolproof method of avoiding deadlocks in the system.
25. Reverse a linked list.
Ans: Possible answers -
iterative loop
curr->next = prev;
prev = curr;
curr = next;
next = curr->next
endloop
recursive reverse(ptr)
if (ptr->next == NULL)
return ptr;
temp = reverse(ptr->next);
temp->next = ptr;
return ptr;
end
26. Write a small lexical analyzer - interviewer gave tokens. expressions like "a*b" etc.
27. Besides communication cost, what is the other source of inefficiency in RPC? (answer : context switches, excessive buffer copying). How can you optimize the communication? (ans : communicate through shared memory on same machine, bypassing the kernel _ A Univ. of Wash. thesis)
28. Write a routine that prints out a 2-D array in spiral order!
29. How is the readers-writers problem solved? - using semaphores/ada .. etc.
30. Ways of optimizing symbol table storage in compilers.
31. A walk-through through the symbol table functions, lookup() implementation etc. - The interviewer was on the Microsoft C team.
32. A version of the "There are three persons X Y Z, one of which always lies".. etc..
33. There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner.. what is the probability that they don,t collide.
34. Write an efficient algorithm and C code to shuffle a pack of cards.. this one was a feedback process until we came up with one with no extra storage.
35. The if (x == 0) y = 0 etc..
36. Some more bitwise optimization at assembly level
37. Some general questions on Lex, Yacc etc.
38. Given an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
39. Given an array of characters. How would you reverse it. ? How would you reverse it without using indexing in the array.
40. Given a sequence of characters. How will you convert the lower case characters to upper case characters. ( Try using bit vector - solutions given in the C lib -typec.h)
41. Fundamentals of RPC.
42. Given a linked list which is sorted. How will u insert in sorted way.
43. Given a linked list How will you reverse it.
44. Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
45. Do a breadth first traversal of a tree.
46. Write code for reversing a linked list.
47. Write, efficient code for extracting unique elements from a sorted list of array. e.g. (1, 1, 3, 3, 3, 5, 5, 5, 9, 9, 9, 9) -> (1, 3, 5, 9).
48. Given an array of integers, find the contiguous sub-array with the largest sum.
ANS. Can be done in O(n) time and O(1) extra space. Scan array from 1 to n. Remember the best sub-array seen so far and the best sub-array ending in i.
49. Given an array of length N containing integers between 1 and N, determine if it contains any duplicates.
ANS. [Is there an O(n) time solution that uses only O(1) extra space and does not destroy the original array?]
50. Sort an array of size n containing integers between 1 and K, given a temporary scratch integer array of size K.
ANS. Compute cumulative counts of integers in the auxiliary array. Now scan the original array, rotating cycles! [Can someone word this more nicely?]
* 51. An array of size k contains integers between 1 and n. You are given an additional scratch array of size n. Compress the original array by removing duplicates in it. What if k << n?
ANS. Can be done in O(k) time i.e. without initializing the auxiliary array!
52. An array of integers. The sum of the array is known not to overflow an integer. Compute the sum. What if we know that integers are in 2,s complement form?
ANS. If numbers are in 2,s complement, an ordinary looking loop like for(i=total=0;i< n;total+=array[i++]); will do. No need to check for overflows!
53. An array of characters. Reverse the order of words in it.
ANS. Write a routine to reverse a character array. Now call it for the given array and for each word in it.
* 54. An array of integers of size n. Generate a random permutation of the array, given a function rand_n() that returns an integer between 1 and n, both inclusive, with equal probability. What is the expected time of your algorithm?
ANS. "Expected time" should ring a bell. To compute a random permutation, use the standard algorithm of scanning array from n downto 1, swapping i-th element with a uniformly random element <= i-th. To compute a uniformly random integer between 1 and k (k < n), call rand_n() repeatedly until it returns a value in the desired range.
55. An array of pointers to (very long) strings. Find pointers to the (lexicographically) smallest and largest strings.
ANS. Scan array in pairs. Remember largest-so-far and smallest-so-far. Compare the larger of the two strings in the current pair with largest-so-far to update it. And the smaller of the current pair with the smallest-so-far to update it. For a total of <= 3n/2 strcmp() calls. That,s also the lower bound.
56. Write a program to remove duplicates from a sorted array.
ANS. int remove_duplicates(int * p, int size)
{
int current, insert = 1;
for (current=1; current < size; current++)
if (p[current] != p[insert-1])
{
p[insert] = p[current];
current++;
insert++;
} else
current++;
return insert;
}
57. C++ ( what is virtual function ? what happens if an error occurs in constructor or destructor. Discussion on error handling, templates, unique features of C++. What is different in C++, ( compare with unix).
58. Given a list of numbers ( fixed list) Now given any other list, how can you efficiently find out if there is any element in the second list that is an element of the first list (fixed list).
59. Given 3 lines of assembly code : find it is doing. IT was to find absolute value.
60. If you are on a boat and you throw out a suitcase, Will the level of water increase.
61. Print an integer using only putchar. Try doing it without using extra storage.
62. Write C code for (a) deleting an element from a linked list (b) traversing a linked list
63. What are various problems unique to distributed databases
64. Declare a void pointer ANS. void *ptr;
65. Make the pointer aligned to a 4 byte boundary in a efficient manner ANS. Assign the pointer to a long number and the number with 11...1100 add 4 to the number
66. What is a far pointer (in DOS)
67. What is a balanced tree
68. Given a linked list with the following property node2 is left child of node1, if node2 < node1 else, it is the right child.
O P
|
|
O A
|
|
O B
|
|
O C
How do you convert the above linked list to the form without disturbing the property. Write C code for that.
O P
|
|
O B
/ \
/ \
/ \
O ? O ?
determine where do A and C go
69. Describe the file system layout in the UNIX OS
ANS. describe boot block, super block, inodes and data layout
70. In UNIX, are the files allocated contiguous blocks of data
ANS. no, they might be fragmented
How is the fragmented data kept track of
ANS. Describe the direct blocks and indirect blocks in UNIX file system
71. Write an efficient C code for ,tr, program. ,tr, has two command line arguments. They both are strings of same length. tr reads an input file, replaces each character in the first string with the corresponding character in the second string. eg. ,tr abc xyz, replaces all ,a,s by ,x,s, ,b,s by ,y,s and so on. ANS.
a) have an array of length 26.
put ,x, in array element corr to ,a,
put ,y, in array element corr to ,b,
put ,z, in array element corr to ,c,
put ,d, in array element corr to ,d,
put ,e, in array element corr to ,e,
and so on.
the code
while (!eof)
{
c = getc();
putc(array[c - ,a,]);
}
72. what is disk interleaving
73. why is disk interleaving adopted
74. given a new disk, how do you determine which interleaving is the best a) give 1000 read operations with each kind of interleaving determine the best interleaving from the statistics
75. draw the graph with performance on one axis and ,n, on another, where ,n, in the ,n, in n-way disk interleaving. (a tricky question, should be answered carefully)
76. I was a c++ code and was asked to find out the bug in that. The bug was that he declared an object locally in a function and tried to return the pointer to that object. Since the object is local to the function, it no more exists after returning from the function. The pointer, therefore, is invalid outside.
77. A real life problem - A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square.
78.
int *a;
char *c;
*(a) = 20;
*c = *a;
printf("%c",*c);
what is the output?
79. Write a program to find whether a given m/c is big-endian or little-endian!
80. What is a volatile variable?
81. What is the scope of a static function in C ?
82. What is the difference between "malloc" and "calloc"?
83. struct n { int data; struct n* next}node;
node *c,*t;
c->data = 10;
t->next = null;
*c = *t;
what is the effect of the last statement?
84. If you,re familiar with the ? operator x ? y : z
you want to implement that in a function: int cond(int x, int y, int z); using only ~, !, ^, &, +, |, <<, >> no if statements, or loops or anything else, just those operators, and the function should correctly return y or z based on the value of x. You may use constants, but only 8 bit constants. You can cast all you want. You,re not supposed to use extra variables, but in the end, it won,t really matter, using vars just makes things cleaner. You should be able to reduce your solution to a single line in the end though that requires no extra vars.
85. You have an abstract computer, so just forget everything you know about computers, this one only does what I,m about to tell you it does. You can use as many variables as you need, there are no negative numbers, all numbers are integers. You do not know the size of the integers, they could be infinitely large, so you can,t count on truncating at any point. There are NO comparisons allowed, no if statements or anything like that. There are only four operations you can do on a variable.
1) You can set a variable to 0.
2) You can set a variable = another variable.
3) You can increment a variable (only by 1), and it,s a post increment.
4) You can loop. So, if you were to say loop(v1) and v1 = 10, your loop would execute 10 times, but the value in v1 wouldn,t change so the first line in the loop can change value of v1 without changing the number of times you loop.
You need to do 3 things.
1) Write a function that decrements by 1.
2) Write a function that subtracts one variable from another.
3) Write a function that divides one variable by another.
4) See if you can implement all 3 using at most 4 variables. Meaning, you,re not making function calls now, you,re making macros. And at most you can have 4 variables. The restriction really only applies to divide, the other 2 are easy to do with 4 vars or less. Division on the other hand is dependent on the other 2 functions, so, if subtract requires 3 variables, then divide only has 1 variable left unchanged after a call to subtract. Basically, just make your function calls to decrement and subtract so you pass your vars in by reference, and you can,t declare any new variables in a function, what you pass in is all it gets.
Linked lists
* 86. Under what circumstances can one delete an element from a singly linked list in constant time?
ANS. If the list is circular and there are no references to the nodes in the list from anywhere else! Just copy the contents of the next node and delete the next node. If the list is not circular, we can delete any but the last node using this idea. In that case, mark the last node as dummy!
* 87. Given a singly linked list, determine whether it contains a loop or not.
ANS. (a) Start reversing the list. If you reach the head, gotcha! there is a loop!
But this changes the list. So, reverse the list again.
(b) Maintain two pointers, initially pointing to the head. Advance one of them one node at a time. And the other one, two nodes at a time. If the latter overtakes the former at any time, there is a loop!
p1 = p2 = head;
do {
p1 = p1->next;
p2 = p2->next->next;
} while (p1 != p2);
88. Given a singly linked list, print out its contents in reverse order. Can you do it without using any extra space?
ANS. Start reversing the list. Do this again, printing the contents.
89. Given a binary tree with nodes, print out the values in pre-order/in-order/post-order without using any extra space.
90. Reverse a singly linked list recursively. The function prototype is node * reverse (node *) ;
ANS.
node * reverse (node * n)
{
node * m ;
if (! (n && n -> next))
return n ;
m = reverse (n -> next) ;
n -> next -> next = n ;
n -> next = NULL ;
return m ;
}
91. Given a singly linked list, find the middle of the list.
HINT. Use the single and double pointer jumping. Maintain two pointers, initially pointing to the head. Advance one of them one node at a time. And the other one, two nodes at a time. When the double reaches the end, the single is in the middle. This is not asymptotically faster but seems to take less steps than going through the list twice.
Bit-manipulation
92. Reverse the bits of an unsigned integer.
ANS.
#define reverse(x) \
(x=x>>16|(0x0000ffff&x)<<16, \
x=(0xff00ff00&x)>>8|(0x00ff00ff&x)<<8, \
x=(0xf0f0f0f0&x)>>4|(0x0f0f0f0f&x)<<4, \
x=(0xcccccccc&x)>>2|(0x33333333&x)<<2, \
x=(0xaaaaaaaa&x)>>1|(0x55555555&x)<<1)
* 93. Compute the number of ones in an unsigned integer.
ANS.
#define count_ones(x) \
(x=(0xaaaaaaaa&x)>>1+(0x55555555&x), \
x=(0xcccccccc&x)>>2+(0x33333333&x), \
x=(0xf0f0f0f0&x)>>4+(0x0f0f0f0f&x), \
x=(0xff00ff00&x)>>8+(0x00ff00ff&x), \
x=x>>16+(0x0000ffff&x))
94. Compute the discrete log of an unsigned integer.
ANS.
#define discrete_log(h) \
(h=(h>>1)|(h>>2), \
h|=(h>>2), \
h|=(h>>4), \
h|=(h>>8), \
h|=(h>>16), \
h=(0xaaaaaaaa&h)>>1+(0x55555555&h), \
h=(0xcccccccc&h)>>2+(0x33333333&h), \
h=(0xf0f0f0f0&h)>>4+(0x0f0f0f0f&h), \
h=(0xff00ff00&h)>>8+(0x00ff00ff&h), \
h=(h>>16)+(0x0000ffff&h))
If I understand it right, log2(2) =1, log2(3)=1, log2(4)=2..... But this macro does not work out log2(0) which does not exist! How do you think it should be handled?
* 95. How do we test most simply if an unsigned integer is a power of two?
ANS. #define power_of_two(x) \ ((x)&&(~(x&(x-1))))
96. Set the highest significant bit of an unsigned integer to zero.
ANS. (from Denis Zabavchik) Set the highest significant bit of an unsigned integer to zero
#define zero_most_significant(h) \
(h&=(h>>1)|(h>>2), \
h|=(h>>2), \
h|=(h>>4), \
h|=(h>>8), \
h|=(h>>16))
97. Let f(k) = y where k is the y-th number in the increasing sequence of non-negative integers with the same number of ones in its binary representation as y, e.g. f(0) = 1, f(1) = 1, f(2) = 2, f(3) = 1, f(4) = 3, f(5) = 2, f(6) = 3 and so on. Given k >= 0, compute f(k).
Others
98. A character set has 1 and 2 byte characters. One byte characters have 0 as the first bit. You just keep accumulating the characters in a buffer. Suppose at some point the user types a backspace, how can you remove the character efficiently. (Note: You cant store the last character typed because the user can type in arbitrarily many backspaces)
99. What is the simples way to check if the sum of two unsigned integers has resulted in an overflow.
100. How do you represent an n-ary tree? Write a program to print the nodes of such a tree in breadth first order.
101. Write the ,tr, program of UNIX. Invoked as
tr -str1 -str2. It reads stdin and prints it out to stdout, replacing every occurance of str1[i] with str2[i].
e.g. tr -abc -xyz
to be and not to be <- input
to ye xnd not to ye <- output
MICROSOFT PAPER AND PATTERN
The following are actual questions from actual interviews conducted by
Microsoft employees on the main campus. Microsoft Consultants are
sometimes allowed to have a life, so questions asked of them during
interviews don,t really count and aren,t listed.
The questions tend to follow some basic themes:
Riddles
Algorithms
Applications
Thinkers
Riddles
Why is a manhole cover round?
How many cars are there in the USA? (A popular variant is "How many gas
stations are there in the USA?")
How many manhole covers are there in the USA?
You,ve got someone working for you for seven days and a gold bar to pay
them. The gold bar is segmented into seven connected pieces. You must
give them a piece of gold at the end of every day. If you are only
allowed to make two breaks in the gold bar, how do you pay your worker?
One train leaves Los Angeles at 15mph heading for New York. Another
train leaves from New York at 20mph heading for Los Angeles on the same
track. If a bird, flying at 25mph, leaves from Los Angeles at the same
time as the train and flies back and forth between the two trains until
they collide, how far will the bird have traveled?
Imagine a disk spinning like a record player turn table. Half of the
disk is black and the other is white. Assume you have an unlimited
number
of color sensors. How many sensors would you have to place around the
disk to determine the direction the disk is spinning? Where would they
be placed?
Imagine an analog clock set to 12 o,clock. Note that the hour and
minute hands overlap. How many times each day do both the hour and
minute
hands overlap? How would you determine the exact times of the day that
this occurs?
You have two jars, 50 red marbles and 50 blue marbles. A jar will be
picked at random, and then a marble will be picked from the jar.
Placing
all of the marbles in the jars, how can you maximize the chances of a
red marble being picked? What are the exact odds of getting a red
marble
using your scheme?
Pairs of primes separated by a single number are called prime pairs.
Examples are 17 and 19. Prove that the number between a prime pair is
always divisible by 6 (assuming both numbers in the pair are greater
than
6). Now prove that there are no ,prime triples.,
There is a room with a door (closed) and three light bulbs. Outside the
room there are three switches, connected to the bulbs. You may
manipulate the switches as you wish, but once you open the door you
can,t
change them. Identify each switch with its bulb.
Suppose you had 8 billiard balls, and one of them was slightly heavier,
but the only way to tell was by putting it on a scale against another.
What,s the fewest number of times you,d have to use the scale to find
the heavier ball?
Imagine you are standing in front of a mirror, facing it. Raise your
left hand. Raise your right hand. Look at your reflection. When you
raise
your left hand your reflection raises what appears to be his right
hand. But when you tilt your head up, your reflection does too, and
does
not appear to tilt his/her head down. Why is it that the mirror appears
to reverse left and right, but not up and down?
You have 4 jars of pills. Each pill is a certain weight, except for
contaminated pills contained in one jar, where each pill is weight + 1.
How could you tell which jar had the contaminated pills in just one
measurement?
The SF Chronicle has a word game where all the letters are scrambled up
and you have to figure out what the word is. Imagine that a scrambled
word is 5 characters long:
How many possible solutions are there?
What if we know which 5 letters are being used?
Develop an algorithm to solve the word.
There are 4 women who want to cross a bridge. They all begin on the
same side. You have 17 minutes to get all of them across to the other
side. It is night. There is one flashlight. A maximum of two people can
cross at one time. Any party who crosses, either 1 or 2 people, must
have
the flashlight with them. The flashlight must be walked back and forth,
it cannot be thrown, etc. Each woman walks at a different speed. A pair
must walk together at the rate of the slower woman,s pace.
Woman 1: 1 minute to cross
Woman 2: 2 minutes to cross
Woman 3: 5 minutes to cross
Woman 4: 10 minutes to cross
For example if Woman 1 and Woman 4 walk across first, 10 minutes have
elapsed when they get to the other side of the bridge. If Woman 4 then
returns with the flashlight, a total of 20 minutes have passed and you
have failed the mission. What is the order required to get all women
across in 17 minutes? Now, what,s the other way?
If you had an infinite supply of water and a 5 quart and 3 quart pail,
how would you measure exactly 4 quarts?
You have a bucket of jelly beans. Some are red, some are blue, and some
green. With your eyes closed, pick out 2 of a like color. How many do
you have to grab to be sure you have 2 of the same?
If you have two buckets, one with red paint and the other with blue
paint, and you take one cup from the blue bucket and poor it into the
red
bucket. Then you take one cup from the red bucket and poor it into the
blue bucket. Which bucket has the highest ratio between red and blue?
Prove it mathematically.
Algorithms
What,s the difference between a linked list and an array?
Implement a linked list. Why did you pick the method you did?
Implement an algorithm to sort a linked list. Why did you pick the
method you did? Now do it in O(n) time.
Describe advantages and disadvantages of the various stock sorting
algorithms.
Implement an algorithm to reverse a linked list. Now do it without
recursion.
Implement an algorithm to insert a node into a circular linked list
without traversing it.
Implement an algorithm to sort an array. Why did you pick the method
you did?
Implement an algorithm to do wild card string matching.
Implement strstr() (or some other string library function).
Reverse a string. Optimize for speed. Optimize for space.
Reverse the words in a sentence, i.e. "My name is Chris" becomes "Chris
is name My." Optimize for speed. Optimize for space.
Find a substring. Optimize for speed. Optimize for space.
Compare two strings using O(n) time with constant space.
Suppose you have an array of 1001 integers. The integers are in random
order, but you know each of the integers is between 1 and 1000
(inclusive). In addition, each number appears only once in the array,
except
for one number, which occurs twice. Assume that you can access each
element of the array only once. Describe an algorithm to find the
repeated
number. If you used auxiliary storage in your algorithm, can you find
an
algorithm that does not require it?
Count the number of set bits in a number. Now optimize for speed. Now
optimize for size.
Multiple by 8 without using multiplication or addition. Now do the same
with 7.
Add numbers in base n (not any of the popular ones like 10, 16, 8 or 2
-- I hear that Charles Simonyi, the inventor of Hungarian Notation,
favors -2 when asking this question).
Write routines to read and write a bounded buffer.
Write routines to manage a heap using an existing array.
Implement an algorithm to take an array and return one with only unique
elements in it.
Implement an algorithm that takes two strings as input, and returns the
intersection of the two, with each letter represented at most once. Now
speed it up. Now test it.
Implement an algorithm to print out all files below a given root node.
Given that you are receiving samples from an instrument at a constant
rate, and you have constant storage space, how would you design a
storage algorithm that would allow me to get a representative readout
of
data, no matter when I looked at it? In other words, representative of
the
behavior of the system to date.
How would you find a cycle in a linked list?
Give me an algorithm to shuffle a deck of cards, given that the cards
are stored in an array of ints.
The following asm block performs a common math function, what is it?
cwd xor ax, dx
sub ax, dx
Imagine this scenario:
I/O completion ports are communictaions ports which take handles to
files, sockets, or any other I/O. When a Read or Write is submitted to
them, they cache the data (if necessary), and attempt to take the
request
to completion. Upon error or completion, they call a user-supplied
function to let the users application know that that particular request
has
completed. They work asynchronously, and can process an unlimited
number of simultaneous requests.
Design the implementation and thread models for I/O completion ports.
Remember to take into account multi-processor machines.
Write a function that takes in a string parameter and checks to see
whether or not it is an integer, and if it is then return the integer
value.
Write a function to print all of the permutations of a string.
Implement malloc.
Write a function to print the Fibonacci numbers.
Write a function to copy two strings, A and B. The last few bytes of
string A overlap the first few bytes of string B.
How would you write qsort?
How would you print out the data in a binary tree, level by level,
starting at the top?
Applications
How can computer technology be integrated in an elevator system for a
hundred story office building? How do you optimize for availability?
How
would variation of traffic over a typical work week or floor or time of
day affect this?
How would you implement copy-protection on a control which can be
embedded in a document and duplicated readily via the Internet?
Define a user interface for indenting selected text in a Word document.
Consider selections ranging from a single sentence up through
selections of several pages. Consider selections not currently visible
or only
partially visible. What are the states of the new UI controls? How will
the user know what the controls are for and when to use them?
How would you redesign an ATM?
Suppose we wanted to run a microwave oven from the computer. What kind
of software would you write to do this?
What is the difference between an Ethernet Address and an IP address?
How would you design a coffee-machine for an automobile.
If you could add any feature to Microsoft Word, what would it be?
How would you go about building a keyboard for 1-handed users?
How would you build an alarm clock for deaf people?
Thinkers
How are M&Ms made?
If you had a clock with lots of moving mechanical parts, you took it
apart piece by piece without keeping track of the method of how it was
disassembled, then you put it back together and discovered that 3
important parts were not included; how would you go about reassembling
the
clock?
If you had to learn a new computer language, how would you go about
doing it?
You have been assigned to design Bill Gates bathroom. Naturally, cost
is not a consideration. You may not speak to Bill.
What was the hardest question asked of you so far today?
If MS told you we were willing to invest $5 million in a start up of
your choice, what business would you start? Why?
If you could gather all of the computer manufacturers in the world
together into one room and then tell them one thing that they would be
compelled to do, what would it be?
Explain a scenario for testing a salt shaker.
If you are going to receive an award in 5 years, what is it for and who
is the audience?
How would you explain how to use Microsoft Excel to your grandma?
Why is it that when you turn on the hot water in any hotel, for
example, the hot water comes pouring out almost instantaneously?
Why do you want to work at Microsoft?
Suppose you go home, enter your house/apartment, hit the light switch,
and nothing happens - no light floods the room. What exactly, in order,
are the steps you would take in determining what the problem was?
Interviewer hands you a black pen and says nothing but "This pen is
red."
INFOSYS recruitment procedure & Questions
The criteria was any two 60% and one 65%. ( generally it is 10th and B-tech 65% and 12th 60%)
Important Tips:-
1. Start from easy questions and then proceed towards the difficult ones.
2. Make a mindset that the questions which are difficult for you, will be difficult for others too.. But the question which is easy for you may not b easy for others.
The written exam was divided into two sections:
1) Aptitude (30 ques 40 min)
2) English (40 ques 30 min)
we were firstly asked to fill up a simple form.. ( do not forget to carry a passport sized photo with you).. the aptitude paper was given first…then the English Paper…
APTITUDE
The paper was not tough but needs practice and proper time management…for aptitude section follow R.S. Aggarwal “Verbal and non Verbal reasoning”...
Chapters to be followed:-
Section 1
1. Series completion
2. Blood Relations
3. Puzzle Test
4. Number, Ranking & Time Sequence Test
5. Data Sufficiency
Section 2
1. Logic ( This is also known as Syllogism)- Very Important
Section 3
1. Series
2. Cubes and Dice.
Some of the ques I remember are-
Ques (1-5) – Ranking
The questions were very easy.
1. Ram is 10th from front and Shyam is 10th from back. if both interchange their positions then Ram is 27th from front, then Shyam’s position from back is
(1) 25 (2) 26 (3) 27 (4) 28
2. Hari stands 10th in the class and mohan stands 17th from back and there are 4 students in between them then the total strength of the class is…..
Ques (6-10)- Next figure i.e. the 6th figure in the series..
Here five figures were given and we had to find out the next figure in the series from the five figures given as options. These were easy too..
Ques (11-15)- Data sufficiency problems
Ques (16-20)- Graph
Here one graph on Solubility Vs temperature for 6 different compounds like calcium sulphate, calcium chloride, etc.. was given.. 5 ques followed it… this was little tough as there were 6 different lines in a small graph ..
Questions were like- which has the highest solubility… (1) calcium chloride at 29deg (2)calcium sulphate at 15deg (3)sodium chloride at 22deg (4)potassium chloride at 20deg.
Ques (21-25)- Puzzle Test
I don’t remember the whole ques ..it was something like-
There are six persons A,B,C,D,E,F…each person wore a cap and a tie. No person wore same coloured cap and tie..caps colour were red,black,brown,yellow,green,white. Tie colours were red,blue,yellow,brown,orange,green… E wore cap as the colour of the F’s tie. C wore cap as the colour of the D’s tie……….
Five questions followed it…
Ques (26-30)- Syllogism
These were really tough…follow the nine rules given in R.S. Aggarwal or follow the rules tought by ur PPT teacher…For Bhubaneswar students follow Nanda Sir’s notes…
ENGLISH
The English section was a tough one…for this prepare from Baron’s guide or revise your basics from Wren and Martin…look for the section in the paper which is easy for you and attempt
1. 2 long passages followed by 5 ques each…these passages were very tough…one advice- read the passage once then from the questions try to find out the answers from the passage…this might help you in completing ques (1-10) much faster.. don’t give too much time reading the passage..
2. ques (11-17)- choose the correct sentence out of the four …
3. ques on fill in the blanks with the correct word or phrase
4. choose the best suited words or phrases for the underlined words
By 1 p.m the written exam was over …the results were out by 3p.m. the cut off was around 13 each in Aptitude as well as English section……within 10 min the HR Interview started…
HR INTERVIEW
The most important thing to crack the interview is that you have to be well prepared about what is there in your CV…Confidence counts a lot…keep smiling but don’t show your teeth…if you don’t know the answer say politely that you don’t know the answer do not bluff.. the HR will catch you… a person with the above qualities and a good communication skill (in English) can crack the HR interview easily..
The interview was for around 18-20 min…the HR person was very friendly…his questions followed from what I spoke…my questions were-
1. tell me about yourself…
2. where do your parents live?
3. how come you have done schooling from Jamshedpur rather than your native place?
4. you must be leaving in the hostel?
5. you from which branch?
6. do you have exposure to computers?(while answering this ques I spoke about my summer course i.e. Network Management in “Linux” environment….so the next questions were from this)
7. what was the course all about?
8. what is a switch?
9. what is routing?
10. name a company which produces switches..(I didn’t knew the answer so I said “I don’t know the answer)
11. then he asked don’t you watch KBC…I replied – “Sir, for the last 3yrs I don’t have access to the television as I stay in the mess..
12. what is Oracle?
13. do you have any interest in sports?(my answer was cricket)
14. are you there in the college team?
15. have you played cricket for your college?
16. then he gave me a Maths ques.- there are X no of students in the class..you have Rs6500..you distributed 6500 among all the students..if 15 more students are included and the same amount is distributed among all then the new share for each gets reduced by Rs30 than the previous one..can u find out the actual no of students(X)? Here he wanted to see that whether I was ready to accept new problems and how I proceed…never say no to these questions.. always give it a try.try until he/she stops you.. then explain him/her what you have done..i gave him the answer and explained what I had done..
17. again he asked me question on cricket- What is China man? – I didn’t knew the answer so replied- “Sorry sir I don’t know the answer
Some other ques which were asked to my friends were like-
1. what is the meaning of your name?
2. who invented zero?- Aryabhata
3. what is the loss in a line? – I^2R loss
4. why should I hire you?
5. why Infosys?
6. tell me about your strengths?
7. give an example where you have worked as a team.
After the Interview I had to wait for around 6 hrs for the result…at 9:15pm the results were announced…
INFOSYS PAPER ON 1st MARCH AT BHUBANESWAR .
Hello friends,
I am Sudhir Kumar Gupta, from GITA, Bhubaneswar (Electronics and Communication Engg). First of all I would like to thank all those who have posted their reviews on this site…these reviews helped me a lot in cracking INFOSYS at the first go…
To start up with INFOSYS was the first company to start the campus season in Orissa . To boast off GITA (Gandhi group) was the first Institution to have INFOSYS at its campus....
About 292 students appeared from GITA, Bhubaneswar and GIET, Gunupur.87 students (73 GIET and 14 GITA) cleared the written exam. Finally 48 (11 GITA and 37 GIET) could make it to INFOSYS....and I was one of the 11 successful candidates from GITA…
At our campus the INFOSYS people were very time bounded...they had informed that ppt talk would start at 9.00a.m….so did the ppt talk started at 9a.m sharp…the ppt talk was for two hours…do attend this talk with a pen and paper and note down some key points because the HR might ask question related to these…
The criteria was any two 60% and one 65%. ( generally it is 10th and B-tech 65% and 12th 60%)
Important Tips:-
1. Start from easy questions and then proceed towards the difficult ones.
2. Make a mindset that the questions which are difficult for you, will be difficult for others too.. But the question which is easy for you may not b easy for others.
The written exam was divided into two sections:
1) Aptitude (30 ques 40 min)
2) English (40 ques 30 min)
we were firstly asked to fill up a simple form.. ( do not forget to carry a passport sized photo with you).. the aptitude paper was given first…then the English Paper…
APTITUDE
The paper was not tough but needs practice and proper time management…for aptitude section follow R.S. Aggarwal “Verbal and non Verbal reasoning”...
Chapters to be followed:-
Section 1
1. Series completion
2. Blood Relations
3. Puzzle Test
4. Number, Ranking & Time Sequence Test
5. Data Sufficiency
Section 2
1. Logic ( This is also known as Syllogism)- Very Important
Section 3
1. Series
2. Cubes and Dice.
Some of the ques I remember are-
Ques (1-5) – Ranking
The questions were very easy.
1. Ram is 10th from front and Shyam is 10th from back. if both interchange their positions then Ram is 27th from front, then Shyam’s position from back is
(1) 25 (2) 26 (3) 27 (4) 28
2. Hari stands 10th in the class and mohan stands 17th from back and there are 4 students in between them then the total strength of the class is…..
Ques (6-10)- Next figure i.e. the 6th figure in the series..
Here five figures were given and we had to find out the next figure in the series from the five figures given as options. These were easy too..
Ques (11-15)- Data sufficiency problems
Ques (16-20)- Graph
Here one graph on Solubility Vs temperature for 6 different compounds like calcium sulphate, calcium chloride, etc.. was given.. 5 ques followed it… this was little tough as there were 6 different lines in a small graph ..
Questions were like- which has the highest solubility… (1) calcium chloride at 29deg (2)calcium sulphate at 15deg (3)sodium chloride at 22deg (4)potassium chloride at 20deg.
Ques (21-25)- Puzzle Test
I don’t remember the whole ques ..it was something like-
There are six persons A,B,C,D,E,F…each person wore a cap and a tie. No person wore same coloured cap and tie..caps colour were red,black,brown,yellow,green,white. Tie colours were red,blue,yellow,brown,orange,green… E wore cap as the colour of the F’s tie. C wore cap as the colour of the D’s tie……….
Five questions followed it…
Ques (26-30)- Syllogism
These were really tough…follow the nine rules given in R.S. Aggarwal or follow the rules tought by ur PPT teacher…For Bhubaneswar students follow Nanda Sir’s notes…
ENGLISH
The English section was a tough one…for this prepare from Baron’s guide or revise your basics from Wren and Martin…look for the section in the paper which is easy for you and attempt
1. 2 long passages followed by 5 ques each…these passages were very tough…one advice- read the passage once then from the questions try to find out the answers from the passage…this might help you in completing ques (1-10) much faster.. don’t give too much time reading the passage..
2. ques (11-17)- choose the correct sentence out of the four …
3. ques on fill in the blanks with the correct word or phrase
4. choose the best suited words or phrases for the underlined words
By 1 p.m the written exam was over …the results were out by 3p.m. the cut off was around 13 each in Aptitude as well as English section……within 10 min the HR Interview started…
HR INTERVIEW
The most important thing to crack the interview is that you have to be well prepared about what is there in your CV…Confidence counts a lot…keep smiling but don’t show your teeth…if you don’t know the answer say politely that you don’t know the answer do not bluff.. the HR will catch you… a person with the above qualities and a good communication skill (in English) can crack the HR interview easily..
The interview was for around 18-20 min…the HR person was very friendly…his questions followed from what I spoke…my questions were-
1. tell me about yourself…
2. where do your parents live?
3. how come you have done schooling from Jamshedpur rather than your native place?
4. you must be leaving in the hostel?
5. you from which branch?
6. do you have exposure to computers?(while answering this ques I spoke about my summer course i.e. Network Management in “Linux” environment….so the next questions were from this)
7. what was the course all about?
8. what is a switch?
9. what is routing?
10. name a company which produces switches..(I didn’t knew the answer so I said “I don’t know the answer)
11. then he asked don’t you watch KBC…I replied – “Sir, for the last 3yrs I don’t have access to the television as I stay in the mess..
12. what is Oracle?
13. do you have any interest in sports?(my answer was cricket)
14. are you there in the college team?
15. have you played cricket for your college?
16. then he gave me a Maths ques.- there are X no of students in the class..you have Rs6500..you distributed 6500 among all the students..if 15 more students are included and the same amount is distributed among all then the new share for each gets reduced by Rs30 than the previous one..can u find out the actual no of students(X)? Here he wanted to see that whether I was ready to accept new problems and how I proceed…never say no to these questions.. always give it a try.try until he/she stops you.. then explain him/her what you have done..i gave him the answer and explained what I had done..
17. again he asked me question on cricket- What is China man? – I didn’t knew the answer so replied- “Sorry sir I don’t know the answer
Some other ques which were asked to my friends were like-
1. what is the meaning of your name?
2. who invented zero?- Aryabhata
3. what is the loss in a line? – I^2R loss
4. why should I hire you?
5. why Infosys?
6. tell me about your strengths?
7. give an example where you have worked as a team.
After the Interview I had to wait for around 6 hrs for the result…at 9:15pm the results were announced…
INFOSYS PAPER ON 27th FEBRUARY AT BANGALORE
hello friends............we had pool campus in btl college in bangalore...around 6 colleges came..with 600+ students....they asked us to register,,they verified our resume..
THINGS NEEDED@
@we need 3 copies of photograph
@3 copies of resume
@xerox of mark sheets 10th,12th,college
@ID CARD
@BLUE OR BLACK BALL PEN
ROUNDS@
APTITUDE=REASONING 30 QUESTION IN 40 MIN+ENGLISH 40 QUESTION IN 30 MIN
HR
I DONT REMEMBER QUESTIONS BUT ILL TELL U HOW TO APPROACH
FIRST 5 QUESTIONS(LIKE PUZZLE) TOUGHEST AND VERY IMPORTANT TO CLEAR THE 1ST ROUND
EG>>
THERE ARE A,B,C,D,E MEN...TOTAL AMOUNT THEY HAVE IS 100 RS... D AND E HAVE MONEY IN THE RATIO 4AND3 A HAS AMOUNT OF SOME VALUE WHICH IS SQUARE OF A NO B HAS AMOUNT OF SOME VALUE WHICH IS SQUARE OR CUBE OF A NO
A=B+D
NO TWO HAVE SAME AMOUNT........
LIKE THIS BUT DONT TRY THIS I MAY HAVE MISSED SOMETHING ....BUT THIS IS THE PATTERN.
NEXT 5 QUESTIONS ARE PICTURE SERIES SOLVE NON VERBAL &VERBAL BOOK RS AGARWAL
NEXT 5 QUESTINS ARE SIMPLE LIKE A STATEMENT WILL BE GIVEN AND TWO CONCLUSIONS...IS THAT TWO CONCLUSIONS NEEDED OR ONE IS ENOUGH TO SOLVE THE QUESTION,.....IF U HAVE LITTLE MASALA IN HEAD U CAN SOLVE...
SYLLOGISM 5 QUESTION... PRACTICE WELL IN NON VERBAL &VERBAL BOOK RS AGARWAL LITTLE CONFUSING
NEXT 5 QUESTION FROM DATA INTERPRETATION.... VERY BAD NO TIME TO SOLVE THOSE FRACTIONS.....ALWAYS PREFER TO SOLVE AT LAST IF U GET BIG FRACTION..
NEXT 5 QUESTION
ONE CONTEXT WILL BE GIVEN AND QUESTIONS WILL BE ASKED FROM THAT
EG+
A,B,C,D ARE 4 PEOPLE ONE OF THEM IS MURDERED....TWO ARE FEMALE....AND SPOUSE TO THE OTHER A,S SISTER SPOKE TO THE SPOUSE OF THE MURDERED ONE ONCE B,S SISTER SPOKE ONLY TWICE TO.....
LIKE THIS.....
1.WHO WAS MURDERED?
2.WHO IS THE SPOUSE OF C?
3.........
4./....
5.........
AFTER WE WROTE THE APPTI TEST WE WENT FOR LUNCH AND AFTER 2 HRS THEY ANNOUNCED THE RESULTS....
OUT OF 600+ STUDENS THEY SELECTED 17 STUDENTS FOR HR ROUND.......I WAS ONE AMONG THEM...I WAS ONE AMOUNG THE 2 STUDENTS SELCTED FROM MY COLLEGE FOR HR ROUND....IMMEDIATELY THEY ASKED US TO GO TO A ROOM...,,
HR ROUND
I KNOCKED THE DOOR AND ASKED HIM EXCUSE ME SIR MAY I COME IN TO MY SURPRISE THERE WERE THREE HR S THEY STOOD UP AND SHOOK MY HAND...
HR: PLEASE TAKE UR SEAT
ME: THANK U SIR
HR: IS THIS UR FIRST INTERVIEW?
ME: YES SIR
HR: PLZ GIVE ME UR COPY OF RESUME
ME YES SIR...AND I GAVE HIM
HR: HOW CAN I CALL U OR HOW DO UR FRIENDS CALL U?
ME: SIR MY GIRL FRIENDS CALL ME BHARATHI AND MY BOY FRIENDS CALL ME ARASU ALL HR SMILED ANDTHIS MADE ME TO STAY COOL FURTHER...
HR: OK THEN I SHOULD CALL U ARASU RIGHT?(AS HE IS MALE HR)
ME: I JUST SMILED AT HIM AND SAID YES
HR: TELL ME ABT UR FURURE PLAN?
ME: TOLD ILL DO MBA IN CORRESPONDANCE.....(PREPARE FOR A BETTER ANS)
HR: ASKED ME WHAT SPECIALIZATION?
ME: TOLD HIM FINANCE
HR: WHAT DO U KNOW ABT FINANCE?
ME: SIR IT S SOMETHING MONEY RELATED..MANAGING COMPANYS FINANCE SECTION..
HR: THEN..
ME: SIR ACTUALLY I DONT HAVE A DEEP KNOWLEDGE ABT FINANCE...
HR "WHATEVER U KNOW U TELL ME?THEN WHY DO U WANT SOFTWARE ENGINEERING POST?
ME: I TOLD HIM SIR UNLESS WE KNOW ABT THE EMPLOYEES(SOFTWARE ENGG) BY WORKING WITH THEM WE CANT BE EFFECTIVE IN MANAGING THE REVENUE PRODUCED BY THEM...AND .........(SOME HOW I CONVINCED HIM)
HR: TELL ME ABT UR EXTRA CURRICULAR ACTIVITIES??
ME :TOLD IAM A CLASSICAL VIOLINIST......(15 MIN HE JUST SPOKE TO ME ABT THIS ONLY)
HR: ARE U A TEAM PLAYER?(I SPECIFIED IT IN RESUME)
ME: YES MAM...I TOLD ONE EXAMPLE FOOTBALL PLAYER..
HR: UR R ECE STUDENT RIGHT?WHAT U HAVE DONE TO IMPROVE UR KNOWLEDGE?
ME: ILL SURF INTERNET..AND I HAVE EVEN PLANNED WHAT TO FOR MY PROJECT...
HR: OH IS IT?OK TELL ME ABT UR IDEA ABT THE PROJECT
ME: I EXP HIMTHE PROJECT..(CONVINCED)
HR: WOULD U LIKE TO ASK ANY QUESTIONS...
ME: ASKED HIM WHY NO PRODUCT BASED THINGS ARE NOT COMING FROM INFOSYS SUCH AS INFOSYS OS..
HR: ANSWERED
HR: ANY MORE QUESTIONS
ME: SMILED AND SAID THATS ALL
HR STOOD UP AND SHOOK HAND WITH ME.....
THEY TOLD RESULTS WILL BE ANNOUNCED AFTER 10 DAYS
I CANT SLEEP PROPERLY..I TYPED THIS AT 2.55AM IN NIGHT..24 HRS THINKING ABT THE RESULTS..
I HOPE THAT GOD WILL HELP ME AND MY EXPERIENCE WILL HELP U...........
TAKE CARE AND PLZ PRAY FOR ME FRIENDS.....
HOPE TO MEET U IN INFOSYS..
Infosys Sample Test #5
1) A man collects cigarette stubs and makes one full cigarette with every 8 stubs.
If he gets 64 stubs how many full cigarettes can he smoke.
Ans: 8+1=9
2) A soldier looses his way in a thick jungle. At random he walks from his camp but mathematically in an interesting fashion. First he walks one mile East then half mile to North. Then 1/4 mile to West, then 1/8 mile to South and so on making a loop.
Finally how far he is from his camp and in which direction.
Ans: Distance travelled in north and south directions
1/2 - 1/8 + 1/32 - 1/128 + 1/512 - and so on
= 1/2/((1-(-1/4))
Similarly in east and west directions
1- 1/4 + 1/16 - 1/64 + 1/256 - and so on
= 1/(( 1- ( - 1/4))
Add both the answers
3) How can 1000000000 be written as a product of two factors neither of them containing zeros
Ans: 2 power 9 x 5 power 9
4) Conversation between two mathematciAns:
First : I have three childern. The product of their ages is 36.
If you sum their ages, it is exactly same as my neighbour,s door number on my left.
The second mathematician verfies the door number and says that it is not sufficient.
Then the first says " Ok one more clue is that my youngest is really the youngest". Immmediately the second mathematician answers .
Can you answer the question asked by the first mathematician?
What are the childeren ages?
Ans 1,6 and 6
5) Light glows for every 13 seconds . How many times did it glow between 1:57:58 and 3:20:47 am.
Ans: 383 + 1 = 384
6) 500 men are arranged in an array of 10 rows and 50 columns according to their heights.
Tallest among each row of all are asked to fall out.
And the shortest among them is A.
Similarly after resuming that to their original podsitions that the shortest among each column are asked to fall out.
And the tallest among them is B .
Now who is taller among A and B ?
Ans A
7) A person with some money spends1/3 for cloths, 1/5 of the remaining for food and 1/4 of the remaining for travel.
He is left with Rs 100/- .
How much did he have with him in the begining ?
Ans: Rs 250/-
8) There are six boxes containing 5 , 7 , 14 , 16 , 18 , 29 balls of either red or blue in colour.
Some boxes contain only red balls and others contain only blue.
One sales man sold one box out of them and then he says
" I have the same number of red balls left out as that of blue ".
Which box is the one he solds out ?
Ans: Total no of balls = 89 and (89-29 /2) = 60/2 = 30
and also 14 + 16 = 5 + 7 + 18 = 30
9) A chain is broken into three pieces of equal lenths containing 3 links each.
It is taken to a backsmith to join into a single continuous one .
How many links are to to be opened to make it ?
Ans: 2.
10) Grass in lawn grows equally thick and in a uniform rate.
It takes 24 days for 70 cows and 60 days for 30 cows to eat the whole of the grass.
How many cows are needed to eat the grass in 96 days.?
Ans: 20
g - grass at the beginning
r - rate at which grass grows, per day
y - rate at which one cow eats grass, per day
n - no of cows to eat the grass in 96 days
g + 24*r = 70 * 24 * y
g + 60*r = 30 * 60 * y
g + 96*r = n * 96 * y
Solving, n = 20.
Infosys Sample Test #6
1. From a vessel, 1/3rd of the liquid evaporates on the first day.
On the second day 3/4th of the remaining liquid evaporates.
What fraction of the volume is present at the end of the second day.
Ans: 50%
2. An orange glass has orange juice and white glass has apple juice both of equal volumes.
50ml of the orange juice is taken and poured into the apple juice.
50ml from the white glass is poured into the orange glass.
Of the two quantities, the amount of apple juice in the orange glass and the amount of orange juice in the white glass, which one is greater and by how much?
Ans: The two quantities are equal
3. There is a 4 inch cube painted on all sides.
This is cut down into of 1 inch cubes.
What is the no of cubes which have no pointed sides.
Ans: 8
4. Sam and Mala have a conversation.
Sam says I am certainly not over 40
Mala says I am 38 and you are atleast 5 years older than me
Now Sam says you are atleast 39
All the statements by the two are false.
How old are they really?
Ans: Mala = 38 yrs
Sam = 41 yrs.
5. Ram Singh goes to his office in the city, every day from his suburban house.
His driver Gangaram drops him at the railway station in the morning and picks him up in the evening.
Every evening Ram Singh reaches the station at 5 O, Clock.
Gangaram also reaches at the same time.
One day Ram Singh started early from his office and came to the station at 4 O, Clock.
Not wanting to wait for the car he starts walking home. Mangaram starts at normal time, picks him up on the way
and takes him back house, half an hour early.
How much time did Ram Singh walk?
6. In a railway station, there are two trains going.
One in the harbour line and one in the main line, each having a frequency of 10 minutes.
The main line service starts at 5 o,clock and the harbour line starts at 5.02A.M.
A man goes to the station every day to catch the first train that comes.
What is the probability of the man catching the first train?
Ans: 0.8
7. A family X went for a vacation.
Unfortunately it rained for 13 days when they were there.
But whenever it rained in the mornings, they had clear afternoons and vice versa.
In all they enjoyed 11 mornings and 12 afternoons.
How many days did they stay there totally?
Ans: 18
8. A survey was taken among 100 people to find their preference of watching T.V. programmes.
There are 3 channels. Given the no of people who watch
• at least channel 1
• at least channel 2
• at least channel 3
• no channels at all
• atleast channels 1and 3
• atleast channels 1 and 2
• atleast channels 2 and 3
Find the no of people who watched all three.
9. Albert and Fernandes have two leg swimming race.
Both start from opposite ends of the pool.
On the first leg, the boys pass each other at 18 m from the deep end of the pool.
During the second leg they pass at 10 m from the shallow end of the pool.
Both go at constant speed but one of them is faster.
Each boy rests for 4 seconds at the end of the first leg.
What is the length of the pool?
10. Each alphabet stands for one digit in the following multiplication.
T H I S
x I S
---------
X F X X
X X U X
------------
X X N X X
------------
What is the maximum value T can take?
Ans: T max value = 4
Infosys Sample Test #7
1.An escalator is descending at constant speed.
A walks down and takes 50 steps to reach the bottom.
B runs down and takes 90 steps in the same time as A takes 10 steps.
How many steps are visible when the escalator is not operating?
Ans: 150 steps
2. Every day a cyclist meets a train at a particular crossing.
The road is straight before the crossing and both are travelling in the same direction.
The cyclist travels with a speed of 10 Kmph.
One day the cyclist comes late by 25 min. and meets the train 5km before the crossing.
What is the speed of the train?
Ans: 60 kmph
3. There are five persons with surnames Mukherjee, Misra, Iyer, Patil and Sharma.
There are 4 persons having first or middle name of Kumar, 3 persons with Mohan, 2 persons with Dev and 1 Anil.
Either Mukherjee and Patil have a first or middle name of Dev or Misra and Iyer have their first or middle name of Dev.
Of Mukherkjee and Misra, either both of them have a first or middle name of Mohan or neither have a first or
middle name of Mohan.
Either Iyer or Sharma has a first or middle name of Kumar but not both.
Who has the first or middle name of Anil?
Ans: Kumar Misra Dev
Mohan Iyer Dev
Kumar Patil Mohan
Mohan Sharma Kumar
4. Boys are allowed to watch football at C.V.Raman auditorium subjected to conditions.
The boy over age 16 can wear overcoat
No boy over age 15 can wear cap
To watch the football either he has to wear overcoat or cap or both
A boy with an umberella or above 16 or both cannot wear sweater.
Boys must either not watch football or wear sweater.
What is the appearence of the boy who is watching football.
5. A bird keeper has got P pigeons, M mynas and S sparrows.
The keeper goes for lunch leaving his assistant to watch the birds.
Suppose p=10, m=5, s=8 when the bird keeper comes back, the assistant informs the x birds have escaped. The bird keeper exclaims: "Oh no! All my sparrows are gone."
How many birds flew away?
When the bird keeper comes back, the assistant told him that x birds have escaped. The keeper realised that atleast 2 sparrows have escaped.
What is minimum no of birds that can escape?
6. Answer the following questions based on the conditions from the choices A, B, C, D, E as described below:
(A) if a definete conclusion can be drawn from condition 1
(B) if a definete conclusion can be drawn from condition 2
(C) if a definete conclusion can be drawn from condition 1 and 2
(D) if a definete conclusion can be drawn from condition 1 or 2
(E) no conclusion can be drawn using both conditions
person 1 says N<5
person says N>5
person 3 says 3N>20
person 4 says 3N>10
person 5 says N<8
What is the value of N?
a) 1. No of persons who speak false being less than no of persons who tells the truth.
2. Person 2 is telling the truth.
b) 1. no of persong telling the truth is greater than no of persons telling lies
2. person 5 is telling the truth.
7. There are N coins on a table and there are two players A & B.
You can take 1 or 2 coins at a time.
The person who takes the last coin is the loser.
A always starts first.
If N=7
(a) A can always win by taking two coins in his first chanse
(b) B can win only if A takes two coins in his first chance.
(c) B can always win by proper play
(d) none of the above
2. A can win by proper play if N is equal to
(a) 13 (b) 37 (c) 22 (d) 34 (e) 48
Ans: (e.)
3. B can win by proper play if N is equal to
(a) 25 (b)26 (c) 32 (d) 41 (e) none
4. if N<4, can A win by proper play always?
(a) Yes (b) No
8. Two twins have vertain peculiar charcteristics.
One of them always lies on Monday, Wednesday, Friday.
The other always lies on Tuesdays, Thursdays and Saturdays.
On the other days they tell the truth. You are given a conversation.
Person A-- today is Sunday my name is Anil
Person B -- today is Tuesday, my name is Bill
What day is today?
Ans: Today is Tuesday.
9. There is a safe with a 5 digit number as the key.
The 4th digit is 4 greater than second digit, while 3rd digit is 3 less than 2nd digit.
The 1st digit is thrice the last digit.
There are 3 pairs whose sum is 11.
Find the number.
Ans: 65292
10. A hotel has two wings,the east wing and the west wing.
Some east wing rooms but not all have an ocean view.
All west wing rooms have a harbour view.
The charge for all rooms is identical, except as follows :
• Extra charge for all harbour view rooms on or above the 3rd floor
• Extra charge for all ocean view rooms except those without balcony
• Extra charge for some harbour rooms on the first two floor & some east wing rooms without ocean view but having kitchen facilities.
Which of the following cannot be determined on the basis of the nformation given:
I. Whether there are any rooms without a balcony for which an extra charge is imposed.
II. Whether any room without a kitchen or a view involves an extra charge.
III. Whether two extra charges are impsed for any room.
(A) I only
(B) II only
(C) III only
(D) II and III only
(E) I, II and III
(This question is from 1999 Barrons GRE Guide model Test 3 - section 6, question 22)
Ans: (A)
INFOSYS PAPER ON 14th FEBRUARY AT CHANDIGARH
I sat for the Infosys placement procedure on the 14th FEB and got through!
Logical Reasoning Test (30 questions(6*5) - 40 minutes)
The questions tested general aptitude:
1)A question on Arithmetic (price of rice dal cultivation, man days required, money available, land available, selling price ratio etc)
2)Data sufficiency. This question was very simple
3)Data Interpretation based on a Pie Chart. Didnt attempt because of pausity of time. Leave this one for the last!
4)A Puzzle (Something like A,B,C,D,E eat different fruits on five days in a week. You had to work out various possibilties.) Refer RS Aggarwal (Verbal and non verbal) chapter - Puzzles test anddo all the six types of puzzles given. Do the chap on Blood Relations as well!
5)syllogism Five simple questions on Syllogism. Attempt them first as they are very easy and dont take much time. These questions get you going,
Do the chapter LOGIC from RS Aggarwal (Verbal - non verbal)
Do the rules as well as Logical Venn Diagrams.
6)Find the next image in a series.
Doing puzzles from Shakuntala Devi is of no use now as the pattern has changed and Infy doesnt test you on puzzles anymore. Despite the fact that there is no negative marking, do not attempt the questions you have not solved. The rough work is most probably chechked and thus guesses are not advised. All they doi is lessen your chances of selection. If at all, you can guess the "next image in series questions"
I attempted 20 questions out of 30
English Test (40 questions - 30 minutes)
1) Reading comprehension - One lengthy passage and one short passage! Leave them for the last Rest of test just checks basic English Usage and you dont really need to prepare if you know the basic usage!
You can attempt all the questions in this section easily! the test and getting through it isnt tough!!
Interview :
It was an HR interview lasting about 10-15 minutes!
Excerpts:
First the interviewer told me that I hadnt done well in the written! I sensed that was just to check my confidence and I said that I had done well enough!
Next he asked what kind of a person I was.
He asked questions made out of my answers only. So beware! Then he asked general things like life at my college and whom do I value the most out of family , friends and teachers Then he asked how much had my family spent on me. I answered spontaneously : It is very difficult to keep track of that! he said you have given up so easily! Then he gave me a pen and a paper ans asked to calculate!
Remain confident no matter what they ask or say and never give up on anything! Even if they give you a puzzle just keep working on it until they ask you to stop! maintain eye contact and shake hands firmly if he/she offers! getting through ain,t as tough as you might think
Aptitude Questions
1. One guy has Rs. 100/- in hand. He has to buy 100 balls. One football costs Rs. 15/, One Cricket ball costs Re. 1/- and one table tennis ball costs Rs. 0.25 He spend the whole Rs. 100/- to buy the balls. How many of each balls he bought?
2. The distance between Station Atena and Station Barcena is 90 miles. A train starts from Atena towards Barcena. A bird starts at the same time from Barcena straight towards the moving train. On reaching the train, it instantaneously turns back and returns to Barcena. The bird makes these journeys from Barcena to the train and back to Barcena continuously till the train reaches Barcena. The bird finally returns to Barcena and rests. Calculate the total distance in miles the bird travels in the following two cases:
(a) The bird flies at 90 miles per hour and the speed of the train is 60 miles per hour.
(b) the bird flies at 60 miles per hour and the speed of the train is 90 miles per hour
3. A tennis championship is played on a knock-out basis, i.e., a player is out of the tournament when he loses a match.
(a) How many players participate in the tournament if 15 matches are totally played?
(b) How many matches are played in the tournament if 50 players totally participate?
4. When I add 4 times my age 4 years from now to 5 times my age 5 years from now, I get 10 times my current age. How old will I be 3 years from now?
5. A rich merchant had collected many gold coins. He did not want anybody to know about them. One day, his wife asked, "How many gold coins do we have?" After pausing a moment, he replied, "Well! If I divide the coins into two unequal numbers, then 37 times the difference between the two numbers equals the difference between the squares of the two numbers." The wife looked puzzled. Can you help the merchant,s wife by finding out how many gold R
6. A set of football matches is to be organized in a "round-robin" fashion, i.e., every participating team plays a match against every other team once and only once. If 21 matches are totally played, how many teams participated?
7. Glenn and Jason each have a collection of cricket balls. Glenn said that if Jason would give him 2 of his balls they would have an equal number; but, if Glenn would give Jason 2 of his balls, Jason would have 2 times as many balls as Glenn. How many balls does Jason have?
8. Suppose 8 monkeys take 8 minutes to eat 8 bananas.
(a) How many minutes would it take 3 monkeys to eat 3 bananas?
(b) How many monkeys would it take to eat 48 bananas in 48 minutes
9. It was vacation time, and so I decided to visit my cousin,s home. What a grand time we had! In the mornings, we both would go for a jog. The evenings were spent on the tennis court. Tiring as these activities were, we could manage only one per day, i.e., either we went for a jog or played tennis each day. There were days when we felt lazy and stayed home all day long. Now, there were 12 mornings when we did nothing, 18 evenings when we stayed at home, and a total of 14 days when we jogged or played tennis. For how many days did I stay at my cousin,s place?
10. A 31" x 31" square metal plate needs to be fixed by a carpenter on to a wooden board. The carpenter uses nails all along the edges of the square such that there are 32 nails on each side of the square. Each nail is at the same distance from the neighboring nails. How many nails does the carpenter use?
Answer and Explanation.
1. F + C + T = 100-------------eq1
15F + C + 0.25T = 100-------------eq2
eq1=eq2 .solve to get F=3T/56 ;F=3,T=56,C=41
2. a) There is no need to consider their meeting pt at all.the train has been running for 90miles/(60miles/hr)=1.5hrs.bird flies till train reaches destination frm strting pt.so bird flies for1.5hrs at the vel given(90).so dist=1.5*90=135miles
b) time of train=1hr.so dist of bird=60*1=60miles
3. (a) u don,t need to sum it up.since it,s a knock out only 1 person emerges winner finally.so15+1=16is answer.becos after15 matches finally we shud,ve 15losers and 1winner.
(b) 49:its always one less than no of players as per the idea given above.so no need to check okay cos its always true.ans is 49.
4. Let x= current age
4(x+4)+5(x+5)=10x ;so x=R 41 years
5. 37(x-y)=x^2-y^2. u no tht x^2-y^2=(x-y)(x+y).so (x-y) cancels on both sides to give x+y=37.so sum of unequal halves=37 which is the req answer.
6. R ans:7 teams okay.for a match u need 2 teams.suppose there r totally ,n ,teams.
Now uve to choose 2 teams out of ,n, teams.so answer =no of such choices=no. of possible combinations. So we,ve ans = nC2(ncombination2)=21;solve to get n=7.
Sol: n(n-1)/2=21. so n=7.if u don,t understand c the graph below
each team plays no. of matches=no of teams ahead of it. One bar ,|, represents one team.
| | | | | | | ------------7
6 5 4 3 2 1 0 -----------21
last team is written as 0 matches becos this team has already played with all other teams-hence sum of matches =6+5+4+3+2+1=21 which is correct only if no of teams =7
7. R 14
1. G+2=j-2
2. 2(G-2)=J+2.
solve these 2 to get
J=14
8. a). Sol:each mky takes 8 min to eat a banana
b).ans:8m=48 m=6
9. Use sets and venn diagram to solve such questions.a,b ,aub,anb etc.
12=tennis+leave
18=jog +leave
so jog-tennis=6
again jog+tennis=14.so solve and get jog=10,leave=8,tennis=4.so tot=22
10. Ans= 32*2 + 30*2=124
INFOSYS PAPER ON 6th FEBRUARY 2008
hi friends...this is Sriram Mohan Nedunuri I attended pool campus of Infosys on 5th Feb. 2008 at COER, Roorkee and got selected finally. There were students from 6 colleges n were about 1200. First there was presentation on Infosys and about 1o’clock we gave written exam. Around 380 students were selected for HR and finally around 250 got selected.
Here is the pattern dear frnds
1.logical reasoning (30 ques) 40 min
2.English section (40 ques) 35 min
For logical reasoning go through rs aggarwal, the imp chapters well, that’s enough but do them thoroughly.
The logical section consisted of the following ques....
1.2 puzzle tests of 10 marks..... .(just go thru RS AGARWAL its more than enough.....).
2.5 series figure ques of 5 marks .its like odd figure out – very easy( go thru RS AGARWAL...NON VERBAL SECTION more than enough).
3.5 ques on data sufficiency .questions in this section were so easy try to do data sufficiency first u can complete in 3-4 mins . some are given below.
1.PQR is an isosceles triangle. What’s the length of PQ?
a. The length of QR is 7.
b. The angle of PQR is 90 degree.
Ans: both are sufficient for conclusion.
2. What’s the ratio of length of the line segment PQ to the length of arc PQ, when PQ forms the arc of a circle?
a. Area of circle is168.
b. The segment PQ forms the diameter of circle.
Ans: both are sufficient for conclusion.
3. Are two triangles congruent?
a. Both triangles are right angled.
b. Both are of same perimeter.
Ans: both are not sufficient for conclusion
4. In what time the cylinder completes one rotation?
a. Radius of cylinder is given.
b. Speed (angular) is given.
Ans: both are sufficient for conclusion
4.5 ques on logical reasoning or syllogism... (Go thru rs agarwal also go thru the LR part of the cat material)
5. Data interpretation of 5 ques (Just go thru the rs agarwal aptitude book......it is best as i preffered the same)
From 1997-2002,data was given on students studied in different streams like arts ,commerce ,engineering, medical, agriculture and science. Questions were like....
1.Number of students studying medicine is what %ge of no of students studying engineering?
2.% of Students studying commerce in yr 1999 is what % of students studying in all the yrs?(ans E(no one was correct)) ............... Like that.... questions in this section were easy but time consuming better try to approximate and save time..
English section....... it is as follows
1. 2 paragraphs based question very easy ( try to do it in last minutes as it is very easy u have to just go thru it once it is of total 10 marks ). There were two paragraphs one was big one and second was relatively shorter. I did the shorter one and it was on green house effect- easy one u can even answer the questions even without reading paragraph.
2. 5 ques were given – in that each ques carries four options n u have to find the correct sentence – 5 marks
3. Theme detection 5 ques
4. Fit the correct word in the blanks. This is of 5 marks,,,,
5. 5 ques were given – in that each ques carries four options n u have to find the correct sentence – 5 marks
for verbal I will say that go for wren n martin (or Raymond Murphy) n cover articles , tenses, prepositions, subject n verb relations...trust me friends these books will help u a lot in clearing this round.
For over all logical n English prepare sincerely and friends C2D (cooperate to dominate) policy will be really helpful, even though u have done sincere efforts better do along with ur frnds. Written results were announced in the evening around 7 and I was one of the short listed candidates among 34 form our college. We were asked to leave n appear the next day for interview. Next day interview started around 12 o’clock
INFOSYS PAPER ON 6th FEBRUARY 2008
hi friends...this is Sriram Mohan Nedunuri I attended pool campus of Infosys on 5th Feb. 2008 at COER, Roorkee and got selected finally. There were students from 6 colleges n were about 1200. First there was presentation on Infosys and about 1o’clock we gave written exam. Around 380 students were selected for HR and finally around 250 got selected.
Here is the pattern dear frnds
1.logical reasoning (30 ques) 40 min
2.English section (40 ques) 35 min
For logical reasoning go through rs aggarwal, the imp chapters well, that’s enough but do them thoroughly.
The logical section consisted of the following ques....
1.2 puzzle tests of 10 marks..... .(just go thru RS AGARWAL its more than enough.....).
2.5 series figure ques of 5 marks .its like odd figure out – very easy( go thru RS AGARWAL...NON VERBAL SECTION more than enough).
3.5 ques on data sufficiency .questions in this section were so easy try to do data sufficiency first u can complete in 3-4 mins . some are given below.
1.PQR is an isosceles triangle. What’s the length of PQ?
a. The length of QR is 7.
b. The angle of PQR is 90 degree.
Ans: both are sufficient for conclusion.
2. What’s the ratio of length of the line segment PQ to the length of arc PQ, when PQ forms the arc of a circle?
a. Area of circle is168.
b. The segment PQ forms the diameter of circle.
Ans: both are sufficient for conclusion.
3. Are two triangles congruent?
a. Both triangles are right angled.
b. Both are of same perimeter.
Ans: both are not sufficient for conclusion
4. In what time the cylinder completes one rotation?
a. Radius of cylinder is given.
b. Speed (angular) is given.
Ans: both are sufficient for conclusion
4.5 ques on logical reasoning or syllogism... (Go thru rs agarwal also go thru the LR part of the cat material)
5. Data interpretation of 5 ques (Just go thru the rs agarwal aptitude book......it is best as i preffered the same)
From 1997-2002,data was given on students studied in different streams like arts ,commerce ,engineering, medical, agriculture and science. Questions were like....
1.Number of students studying medicine is what %ge of no of students studying engineering?
2.% of Students studying commerce in yr 1999 is what % of students studying in all the yrs?(ans E(no one was correct)) ............... Like that.... questions in this section were easy but time consuming better try to approximate and save time..
English section....... it is as follows
1. 2 paragraphs based question very easy ( try to do it in last minutes as it is very easy u have to just go thru it once it is of total 10 marks ). There were two paragraphs one was big one and second was relatively shorter. I did the shorter one and it was on green house effect- easy one u can even answer the questions even without reading paragraph.
2. 5 ques were given – in that each ques carries four options n u have to find the correct sentence – 5 marks
3. Theme detection 5 ques
4. Fit the correct word in the blanks. This is of 5 marks,,,,
5. 5 ques were given – in that each ques carries four options n u have to find the correct sentence – 5 marks
for verbal I will say that go for wren n martin (or Raymond Murphy) n cover articles , tenses, prepositions, subject n verb relations...trust me friends these books will help u a lot in clearing this round.
For over all logical n English prepare sincerely and friends C2D (cooperate to dominate) policy will be really helpful, even though u have done sincere efforts better do along with ur frnds. Written results were announced in the evening around 7 and I was one of the short listed candidates among 34 form our college. We were asked to leave n appear the next day for interview. Next day interview started around 12 o’clock
INFOSYS PAPER ON 16TH JANUARY AT UIT – RGPV (GEC) BHOPAL
HELLO FRIENDS THIS IS DHEERAJ ASSUDANI from E.C. INFOSYS VISITED UIT – RGPV FIRST ACROSS INDIA FOR ITS 2009 CAMPUS RECRUITMENT
There are generally 2 phases
(1) Written round
(2) H.R.
The Written test consists of 2 sections.
1) Logical Reasoning (30 qs in 40 min)
2) Verbal Ability(40 quest in 35 min)
Logical section consists of 6 subsections of 5 questions each.
Q1-5) (Puzzel test) the avg of 11 prime no’s less than 45 is also a prime no….
Then
i. Find the avg?
ii. Which is the min prime no?
iii.Which is the second min no?
iv.Which is the max no?
v. How many no r der greater than 20
Q6-10 there were problems on figure where 2 figs implies each other & the 3rd fig is given & u need to find the fig which implies it (Do mirror img and water img chapters from R.S. Aggarwal verbal & non verbal)
Q11-15) 5 prob based on data sufficiency. This consists of a question followed by two statements containing facts providing clues to solve that quest. We r suppose to find out which statement is/are sufficient to solve ans the quest.
E.g. what is the avg score of class?
I. There are 26 students in the class.
II. Every student scores in AP with 2 as lowest score
Q16-20) Data interpretation problems. (Little time consuming but easy one. Ref R.S.Aggarwal Quant)
Q21-25) A critical Reasoning Problem like Ann, Boobie, Cathy and Dave are at their monthly business meeting. Their occupations are author, biologist, chemist and doctor, but not necessarily in that order. Dave just told the biologist that Cathy was on her way with doughnuts. Ann is sitting across from the doctor and next to the chemist. The doctor was thinking that Boobie was a goofy name for parent,s to choose,but didn,t say anything. What is each person,s occupation?
Ans: Since Dave spoke to the biologist and Ann sat next to the chemist and across the doctor, Cathy must be the author and Ann the biologist. The doctor didn,t speak, but David did, so Bobbie is the doctor and Dave the chemist.
(Now u must have identified all facts) just ans qs asked
Q26-30) Prob based on syllogism. (Ref R.S. Aggarwal verbal & non-verabal Logic chapter)
e.g. A. all refils are nibs
B. all nibs r pens
C. no pens r pencils
D. no pencils r nobs
E. all reffils r pens
1.ABC 2.BCD 3.BCE 4.ABE 5.ACD
Answer: 4
Section-2 Verbal Ability
This section consists of:
1) Two RC’s, a very big one and time consuming so attempt them at the end.(refer BARONS GRE )
2) Replace an underlined sentence with another one which is of the same meaning from the given 4 alternatives.
3) Fill in the blank with correct alternative. (REFER ANY GRAMMAR BOOK HAVING TENSES )
4) Deriving conclusion from small passages.
5) Select the correct statement from the set of 4 statements. One is correct and some r with little grammatical mistake. . (REFER ANY GRAMMAR BOOK HAVING TENSES )
(2) H.R. ROUND
Once u clear written Round interview is just a formalty . they ask some basic puzzles like
1. 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 light 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)
3. You r given a thermometer. What can u do by this without measuring the temperature?
Ans: if u put thermometer into a tree it won’t grow anymore, will just die off
4. How it is possible to place four points that are equidistance from each other? OR U r a landscape designer and your boss asked u to design a landscape such that you should place 4 trees equidistance from each other. (Distance from each tree to the other must be same)
Ans: Only 3 points can be equidistant from each other. But if u place points in the shape of a pyramid then its possible
5. You are given a cake; one of its corner is broken. How will u cut the rest into Two equal parts?
Ans: Slice the cake
6. How will you recognize the magnet & magnetic material & non-magnetic material?
Ans: Drag one piece of material over another. There is no attractive force in the middle portion of the magnet. OR
Get a piece of thread and tie up with the one bar and check for poles. If it iron bar then it moves freely and if it is magnetic bar then it fix in one direction according to poles.
7. If one tyre of a car suddenly gets stolen.... and after sometime u find the tyre without the screws how will u make ur journey complete
Ans: Open 3 screws, 1 from each tyre and fix the tyre.
8. How can u measure a room height using a thermometer?
Ans: temp varies with height. but its dependent on various other factors like humidity, wind etc.
9 What is the height of room if after entering the room with a watch ur head strikes a hanging bulb?
Ans: Oscillate the hanging bulb. Calculate the time period for one complete oscillation by Simple Harmonic Motion (SHM) of the handing bulb. Put it in the formula T=2 * 3.14 * (L/G)^1/2 L will be the length of the hanging thread. Add the L with ur height to get the height of the room.
10. Color of bear.... if it falls from 1m height in 1s.
Ans: We get ,g, perfect 10 which is only in poles...hence polar bear...color White
11. 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. find height using the formula
s = gt*t/2 ( s = height, a= initial velocity=0, g=9.8m/s, t = time taken)
12. How wud u catch and receive a ball in same direction? (Dropping is from north and receiving from bottom not accepted, as it is 2 directions)
13. 25 statements given. Some tell truth, some false and some alternators. Find out
the true statements.
14. Can u make 120 with 5 zeros?
Ans: Factorial (factorial (0)+factorial (0)+factorial (0)+factorial (0)+factorial (0)) = 120
15.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) A says: B is a liar.
b) 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.
16.5 swimmers A, B, C, E, F and many conditions of their positions like there are Two b/w A & F, B doesn,t win etc the question was to find who was b/w like E & D?
17. in a race u drove 1st lap with 40kmph and in the second lap at what speed u must drive so that ur average speed must be 80kmph.
18. You have to draw 3 concentric circles with a line passing thru their center without lifting hand.
Ans: Start the line complete one circle move inside circles along the line and then draw second circle. Like wise rest.
19. A rectangular paper is there. At a corner a rectangular size paper is taken from it. Now you have to cut the remaining paper into two equal halves.
Ans: try it on the paper. You must fold the part that has complete paper and select Half of it and then fold the part that cut and selects half of it and then cut along the folding.
20. Value of (x-a)(x-b)………..(x-z)
21. There are 9 coins. 8 are of 1 gm and 1 is of 2 grams. How will you find out the heavier coin in minimum number of weighing and how many weighing it will need?
Ans: 2 weighing ( Divide the number of coins into 3 parts at each weighing)
Sir : tell me about ur biggest achievement?
Dheeraj: I told
Sir : are u any Olympiad winner ?
Dheeraj: yes sir mathematics Olympiad
Sir : Tell me about ur presntations & prove any commercial apps of wearable computing within this room in a minute ?
Dheeraj: I proved , he was impressed
Sir : any QUESTION for me ?
Dheeraj : I have 1 more year to complete my course what do u expect me to do in this 1 year to fit in to your organization
Speak very polite and be confident in the interview. Don’t try answering the question that you really don’t know. Be very careful with the resumes keep it as simple as you can .
Three suggestions from my side for an interview
1 don’t bluff
2. for God’s sake don’t bluff.
3 for your own sake don’t bluff
INFOSYS PAPER ON 26th JUNE AT HYDERABAD
Hey guys, This is Harleen.Im doin my engineering. A brief intro about the Infosys paper is as below. Before i start off with the aptitude paper,i would really like to tell u guys to be good with time management!!!
The aptitude paper was divided into2 parts..
1)reasoning
2)verbal
Reasoning:
In this section v had 30 quest.. and 40 min to solve them..This paper was given first!!
Q1-Q5: These questions were based on cubes as in if the opposite sides of the cube are painted with the same colour and the 3 colours which are used are red,green and yellow,and the cubes is cut into parts then how many pieces would be red,yellow ,etc..
Q6-Q10: This set of questions was based on finding the missing figure...could be solved with jus a little presence of mind.
Q11-Q15: The questions here were based on Data Sufficiency.Each question coved a different area of quant,like one was on S.I,C.I and the other on profit and loss .etc...
Q16-20: This set was of DI...and all the 5 questions were based on one tabular column...(was quite tough)
Q21-25: Now this was a perfect reasoning question...as in there are 4 subjects and five ppl..if A had taken up biology and anthropology and B had only biology,C had anotomy and science D had only science and E had biology,anthropology and anotomy,then how many mim ppl are required so as all the subjects are covered...and so on..
Q26-30: these questions were based on syllogisms..jus be perfect with the 9 rules of syllogisms..(quite an easy one).
Verbal:
It consisted of 40 questions and they had to be solved in 30 min!!(time management is very imp!!) Here v had 2 reading comprehension passages..
The first one was really long... and the second one was short..BUT i chose NOT TO Start with them..casue they would actually take away a lot of time where in there were only 5 questions under each passage!!
Moving on to the other questions, there were correction of sentences,fill in the right tense,suitable conclusion of the passage..(all the questions were very simple..)
After getting done with these get onto the reading comprehension..start off with the small passage first!,then if u hav time left u can move over to the big passage!!
The cut offs for each section was arnd 15 -17 ..(approx..)
Once you clear the aptitide,and face the HR round with confidence ,good communication skills and a smile on your face,ur into INFOSYS!!!(But dont forget to be HONEST and thorough with ur resume!
Important Tips:-
1. Start from easy questions and then proceed towards the difficult ones.
2. Make a mindset that the questions which are difficult for you, will be difficult for others too.. But the question which is easy for you may not b easy for others.
The written exam was divided into two sections:
1) Aptitude (30 ques 40 min)
2) English (40 ques 30 min)
we were firstly asked to fill up a simple form.. ( do not forget to carry a passport sized photo with you).. the aptitude paper was given first…then the English Paper…
APTITUDE
The paper was not tough but needs practice and proper time management…for aptitude section follow R.S. Aggarwal “Verbal and non Verbal reasoning”...
Chapters to be followed:-
Section 1
1. Series completion
2. Blood Relations
3. Puzzle Test
4. Number, Ranking & Time Sequence Test
5. Data Sufficiency
Section 2
1. Logic ( This is also known as Syllogism)- Very Important
Section 3
1. Series
2. Cubes and Dice.
Some of the ques I remember are-
Ques (1-5) – Ranking
The questions were very easy.
1. Ram is 10th from front and Shyam is 10th from back. if both interchange their positions then Ram is 27th from front, then Shyam’s position from back is
(1) 25 (2) 26 (3) 27 (4) 28
2. Hari stands 10th in the class and mohan stands 17th from back and there are 4 students in between them then the total strength of the class is…..
Ques (6-10)- Next figure i.e. the 6th figure in the series..
Here five figures were given and we had to find out the next figure in the series from the five figures given as options. These were easy too..
Ques (11-15)- Data sufficiency problems
Ques (16-20)- Graph
Here one graph on Solubility Vs temperature for 6 different compounds like calcium sulphate, calcium chloride, etc.. was given.. 5 ques followed it… this was little tough as there were 6 different lines in a small graph ..
Questions were like- which has the highest solubility… (1) calcium chloride at 29deg (2)calcium sulphate at 15deg (3)sodium chloride at 22deg (4)potassium chloride at 20deg.
Ques (21-25)- Puzzle Test
I don’t remember the whole ques ..it was something like-
There are six persons A,B,C,D,E,F…each person wore a cap and a tie. No person wore same coloured cap and tie..caps colour were red,black,brown,yellow,green,white. Tie colours were red,blue,yellow,brown,orange,green… E wore cap as the colour of the F’s tie. C wore cap as the colour of the D’s tie……….
Five questions followed it…
Ques (26-30)- Syllogism
These were really tough…follow the nine rules given in R.S. Aggarwal or follow the rules tought by ur PPT teacher…For Bhubaneswar students follow Nanda Sir’s notes…
ENGLISH
The English section was a tough one…for this prepare from Baron’s guide or revise your basics from Wren and Martin…look for the section in the paper which is easy for you and attempt
1. 2 long passages followed by 5 ques each…these passages were very tough…one advice- read the passage once then from the questions try to find out the answers from the passage…this might help you in completing ques (1-10) much faster.. don’t give too much time reading the passage..
2. ques (11-17)- choose the correct sentence out of the four …
3. ques on fill in the blanks with the correct word or phrase
4. choose the best suited words or phrases for the underlined words
By 1 p.m the written exam was over …the results were out by 3p.m. the cut off was around 13 each in Aptitude as well as English section……within 10 min the HR Interview started…
HR INTERVIEW
The most important thing to crack the interview is that you have to be well prepared about what is there in your CV…Confidence counts a lot…keep smiling but don’t show your teeth…if you don’t know the answer say politely that you don’t know the answer do not bluff.. the HR will catch you… a person with the above qualities and a good communication skill (in English) can crack the HR interview easily..
The interview was for around 18-20 min…the HR person was very friendly…his questions followed from what I spoke…my questions were-
1. tell me about yourself…
2. where do your parents live?
3. how come you have done schooling from Jamshedpur rather than your native place?
4. you must be leaving in the hostel?
5. you from which branch?
6. do you have exposure to computers?(while answering this ques I spoke about my summer course i.e. Network Management in “Linux” environment….so the next questions were from this)
7. what was the course all about?
8. what is a switch?
9. what is routing?
10. name a company which produces switches..(I didn’t knew the answer so I said “I don’t know the answer)
11. then he asked don’t you watch KBC…I replied – “Sir, for the last 3yrs I don’t have access to the television as I stay in the mess..
12. what is Oracle?
13. do you have any interest in sports?(my answer was cricket)
14. are you there in the college team?
15. have you played cricket for your college?
16. then he gave me a Maths ques.- there are X no of students in the class..you have Rs6500..you distributed 6500 among all the students..if 15 more students are included and the same amount is distributed among all then the new share for each gets reduced by Rs30 than the previous one..can u find out the actual no of students(X)? Here he wanted to see that whether I was ready to accept new problems and how I proceed…never say no to these questions.. always give it a try.try until he/she stops you.. then explain him/her what you have done..i gave him the answer and explained what I had done..
17. again he asked me question on cricket- What is China man? – I didn’t knew the answer so replied- “Sorry sir I don’t know the answer
Some other ques which were asked to my friends were like-
1. what is the meaning of your name?
2. who invented zero?- Aryabhata
3. what is the loss in a line? – I^2R loss
4. why should I hire you?
5. why Infosys?
6. tell me about your strengths?
7. give an example where you have worked as a team.
After the Interview I had to wait for around 6 hrs for the result…at 9:15pm the results were announced…
INFOSYS PAPER ON 1st MARCH AT BHUBANESWAR .
Hello friends,
I am Sudhir Kumar Gupta, from GITA, Bhubaneswar (Electronics and Communication Engg). First of all I would like to thank all those who have posted their reviews on this site…these reviews helped me a lot in cracking INFOSYS at the first go…
To start up with INFOSYS was the first company to start the campus season in Orissa . To boast off GITA (Gandhi group) was the first Institution to have INFOSYS at its campus....
About 292 students appeared from GITA, Bhubaneswar and GIET, Gunupur.87 students (73 GIET and 14 GITA) cleared the written exam. Finally 48 (11 GITA and 37 GIET) could make it to INFOSYS....and I was one of the 11 successful candidates from GITA…
At our campus the INFOSYS people were very time bounded...they had informed that ppt talk would start at 9.00a.m….so did the ppt talk started at 9a.m sharp…the ppt talk was for two hours…do attend this talk with a pen and paper and note down some key points because the HR might ask question related to these…
The criteria was any two 60% and one 65%. ( generally it is 10th and B-tech 65% and 12th 60%)
Important Tips:-
1. Start from easy questions and then proceed towards the difficult ones.
2. Make a mindset that the questions which are difficult for you, will be difficult for others too.. But the question which is easy for you may not b easy for others.
The written exam was divided into two sections:
1) Aptitude (30 ques 40 min)
2) English (40 ques 30 min)
we were firstly asked to fill up a simple form.. ( do not forget to carry a passport sized photo with you).. the aptitude paper was given first…then the English Paper…
APTITUDE
The paper was not tough but needs practice and proper time management…for aptitude section follow R.S. Aggarwal “Verbal and non Verbal reasoning”...
Chapters to be followed:-
Section 1
1. Series completion
2. Blood Relations
3. Puzzle Test
4. Number, Ranking & Time Sequence Test
5. Data Sufficiency
Section 2
1. Logic ( This is also known as Syllogism)- Very Important
Section 3
1. Series
2. Cubes and Dice.
Some of the ques I remember are-
Ques (1-5) – Ranking
The questions were very easy.
1. Ram is 10th from front and Shyam is 10th from back. if both interchange their positions then Ram is 27th from front, then Shyam’s position from back is
(1) 25 (2) 26 (3) 27 (4) 28
2. Hari stands 10th in the class and mohan stands 17th from back and there are 4 students in between them then the total strength of the class is…..
Ques (6-10)- Next figure i.e. the 6th figure in the series..
Here five figures were given and we had to find out the next figure in the series from the five figures given as options. These were easy too..
Ques (11-15)- Data sufficiency problems
Ques (16-20)- Graph
Here one graph on Solubility Vs temperature for 6 different compounds like calcium sulphate, calcium chloride, etc.. was given.. 5 ques followed it… this was little tough as there were 6 different lines in a small graph ..
Questions were like- which has the highest solubility… (1) calcium chloride at 29deg (2)calcium sulphate at 15deg (3)sodium chloride at 22deg (4)potassium chloride at 20deg.
Ques (21-25)- Puzzle Test
I don’t remember the whole ques ..it was something like-
There are six persons A,B,C,D,E,F…each person wore a cap and a tie. No person wore same coloured cap and tie..caps colour were red,black,brown,yellow,green,white. Tie colours were red,blue,yellow,brown,orange,green… E wore cap as the colour of the F’s tie. C wore cap as the colour of the D’s tie……….
Five questions followed it…
Ques (26-30)- Syllogism
These were really tough…follow the nine rules given in R.S. Aggarwal or follow the rules tought by ur PPT teacher…For Bhubaneswar students follow Nanda Sir’s notes…
ENGLISH
The English section was a tough one…for this prepare from Baron’s guide or revise your basics from Wren and Martin…look for the section in the paper which is easy for you and attempt
1. 2 long passages followed by 5 ques each…these passages were very tough…one advice- read the passage once then from the questions try to find out the answers from the passage…this might help you in completing ques (1-10) much faster.. don’t give too much time reading the passage..
2. ques (11-17)- choose the correct sentence out of the four …
3. ques on fill in the blanks with the correct word or phrase
4. choose the best suited words or phrases for the underlined words
By 1 p.m the written exam was over …the results were out by 3p.m. the cut off was around 13 each in Aptitude as well as English section……within 10 min the HR Interview started…
HR INTERVIEW
The most important thing to crack the interview is that you have to be well prepared about what is there in your CV…Confidence counts a lot…keep smiling but don’t show your teeth…if you don’t know the answer say politely that you don’t know the answer do not bluff.. the HR will catch you… a person with the above qualities and a good communication skill (in English) can crack the HR interview easily..
The interview was for around 18-20 min…the HR person was very friendly…his questions followed from what I spoke…my questions were-
1. tell me about yourself…
2. where do your parents live?
3. how come you have done schooling from Jamshedpur rather than your native place?
4. you must be leaving in the hostel?
5. you from which branch?
6. do you have exposure to computers?(while answering this ques I spoke about my summer course i.e. Network Management in “Linux” environment….so the next questions were from this)
7. what was the course all about?
8. what is a switch?
9. what is routing?
10. name a company which produces switches..(I didn’t knew the answer so I said “I don’t know the answer)
11. then he asked don’t you watch KBC…I replied – “Sir, for the last 3yrs I don’t have access to the television as I stay in the mess..
12. what is Oracle?
13. do you have any interest in sports?(my answer was cricket)
14. are you there in the college team?
15. have you played cricket for your college?
16. then he gave me a Maths ques.- there are X no of students in the class..you have Rs6500..you distributed 6500 among all the students..if 15 more students are included and the same amount is distributed among all then the new share for each gets reduced by Rs30 than the previous one..can u find out the actual no of students(X)? Here he wanted to see that whether I was ready to accept new problems and how I proceed…never say no to these questions.. always give it a try.try until he/she stops you.. then explain him/her what you have done..i gave him the answer and explained what I had done..
17. again he asked me question on cricket- What is China man? – I didn’t knew the answer so replied- “Sorry sir I don’t know the answer
Some other ques which were asked to my friends were like-
1. what is the meaning of your name?
2. who invented zero?- Aryabhata
3. what is the loss in a line? – I^2R loss
4. why should I hire you?
5. why Infosys?
6. tell me about your strengths?
7. give an example where you have worked as a team.
After the Interview I had to wait for around 6 hrs for the result…at 9:15pm the results were announced…
INFOSYS PAPER ON 27th FEBRUARY AT BANGALORE
hello friends............we had pool campus in btl college in bangalore...around 6 colleges came..with 600+ students....they asked us to register,,they verified our resume..
THINGS NEEDED@
@we need 3 copies of photograph
@3 copies of resume
@xerox of mark sheets 10th,12th,college
@ID CARD
@BLUE OR BLACK BALL PEN
ROUNDS@
APTITUDE=REASONING 30 QUESTION IN 40 MIN+ENGLISH 40 QUESTION IN 30 MIN
HR
I DONT REMEMBER QUESTIONS BUT ILL TELL U HOW TO APPROACH
FIRST 5 QUESTIONS(LIKE PUZZLE) TOUGHEST AND VERY IMPORTANT TO CLEAR THE 1ST ROUND
EG>>
THERE ARE A,B,C,D,E MEN...TOTAL AMOUNT THEY HAVE IS 100 RS... D AND E HAVE MONEY IN THE RATIO 4AND3 A HAS AMOUNT OF SOME VALUE WHICH IS SQUARE OF A NO B HAS AMOUNT OF SOME VALUE WHICH IS SQUARE OR CUBE OF A NO
A=B+D
NO TWO HAVE SAME AMOUNT........
LIKE THIS BUT DONT TRY THIS I MAY HAVE MISSED SOMETHING ....BUT THIS IS THE PATTERN.
NEXT 5 QUESTIONS ARE PICTURE SERIES SOLVE NON VERBAL &VERBAL BOOK RS AGARWAL
NEXT 5 QUESTINS ARE SIMPLE LIKE A STATEMENT WILL BE GIVEN AND TWO CONCLUSIONS...IS THAT TWO CONCLUSIONS NEEDED OR ONE IS ENOUGH TO SOLVE THE QUESTION,.....IF U HAVE LITTLE MASALA IN HEAD U CAN SOLVE...
SYLLOGISM 5 QUESTION... PRACTICE WELL IN NON VERBAL &VERBAL BOOK RS AGARWAL LITTLE CONFUSING
NEXT 5 QUESTION FROM DATA INTERPRETATION.... VERY BAD NO TIME TO SOLVE THOSE FRACTIONS.....ALWAYS PREFER TO SOLVE AT LAST IF U GET BIG FRACTION..
NEXT 5 QUESTION
ONE CONTEXT WILL BE GIVEN AND QUESTIONS WILL BE ASKED FROM THAT
EG+
A,B,C,D ARE 4 PEOPLE ONE OF THEM IS MURDERED....TWO ARE FEMALE....AND SPOUSE TO THE OTHER A,S SISTER SPOKE TO THE SPOUSE OF THE MURDERED ONE ONCE B,S SISTER SPOKE ONLY TWICE TO.....
LIKE THIS.....
1.WHO WAS MURDERED?
2.WHO IS THE SPOUSE OF C?
3.........
4./....
5.........
AFTER WE WROTE THE APPTI TEST WE WENT FOR LUNCH AND AFTER 2 HRS THEY ANNOUNCED THE RESULTS....
OUT OF 600+ STUDENS THEY SELECTED 17 STUDENTS FOR HR ROUND.......I WAS ONE AMONG THEM...I WAS ONE AMOUNG THE 2 STUDENTS SELCTED FROM MY COLLEGE FOR HR ROUND....IMMEDIATELY THEY ASKED US TO GO TO A ROOM...,,
HR ROUND
I KNOCKED THE DOOR AND ASKED HIM EXCUSE ME SIR MAY I COME IN TO MY SURPRISE THERE WERE THREE HR S THEY STOOD UP AND SHOOK MY HAND...
HR: PLEASE TAKE UR SEAT
ME: THANK U SIR
HR: IS THIS UR FIRST INTERVIEW?
ME: YES SIR
HR: PLZ GIVE ME UR COPY OF RESUME
ME YES SIR...AND I GAVE HIM
HR: HOW CAN I CALL U OR HOW DO UR FRIENDS CALL U?
ME: SIR MY GIRL FRIENDS CALL ME BHARATHI AND MY BOY FRIENDS CALL ME ARASU ALL HR SMILED ANDTHIS MADE ME TO STAY COOL FURTHER...
HR: OK THEN I SHOULD CALL U ARASU RIGHT?(AS HE IS MALE HR)
ME: I JUST SMILED AT HIM AND SAID YES
HR: TELL ME ABT UR FURURE PLAN?
ME: TOLD ILL DO MBA IN CORRESPONDANCE.....(PREPARE FOR A BETTER ANS)
HR: ASKED ME WHAT SPECIALIZATION?
ME: TOLD HIM FINANCE
HR: WHAT DO U KNOW ABT FINANCE?
ME: SIR IT S SOMETHING MONEY RELATED..MANAGING COMPANYS FINANCE SECTION..
HR: THEN..
ME: SIR ACTUALLY I DONT HAVE A DEEP KNOWLEDGE ABT FINANCE...
HR "WHATEVER U KNOW U TELL ME?THEN WHY DO U WANT SOFTWARE ENGINEERING POST?
ME: I TOLD HIM SIR UNLESS WE KNOW ABT THE EMPLOYEES(SOFTWARE ENGG) BY WORKING WITH THEM WE CANT BE EFFECTIVE IN MANAGING THE REVENUE PRODUCED BY THEM...AND .........(SOME HOW I CONVINCED HIM)
HR: TELL ME ABT UR EXTRA CURRICULAR ACTIVITIES??
ME :TOLD IAM A CLASSICAL VIOLINIST......(15 MIN HE JUST SPOKE TO ME ABT THIS ONLY)
HR: ARE U A TEAM PLAYER?(I SPECIFIED IT IN RESUME)
ME: YES MAM...I TOLD ONE EXAMPLE FOOTBALL PLAYER..
HR: UR R ECE STUDENT RIGHT?WHAT U HAVE DONE TO IMPROVE UR KNOWLEDGE?
ME: ILL SURF INTERNET..AND I HAVE EVEN PLANNED WHAT TO FOR MY PROJECT...
HR: OH IS IT?OK TELL ME ABT UR IDEA ABT THE PROJECT
ME: I EXP HIMTHE PROJECT..(CONVINCED)
HR: WOULD U LIKE TO ASK ANY QUESTIONS...
ME: ASKED HIM WHY NO PRODUCT BASED THINGS ARE NOT COMING FROM INFOSYS SUCH AS INFOSYS OS..
HR: ANSWERED
HR: ANY MORE QUESTIONS
ME: SMILED AND SAID THATS ALL
HR STOOD UP AND SHOOK HAND WITH ME.....
THEY TOLD RESULTS WILL BE ANNOUNCED AFTER 10 DAYS
I CANT SLEEP PROPERLY..I TYPED THIS AT 2.55AM IN NIGHT..24 HRS THINKING ABT THE RESULTS..
I HOPE THAT GOD WILL HELP ME AND MY EXPERIENCE WILL HELP U...........
TAKE CARE AND PLZ PRAY FOR ME FRIENDS.....
HOPE TO MEET U IN INFOSYS..
Infosys Sample Test #5
1) A man collects cigarette stubs and makes one full cigarette with every 8 stubs.
If he gets 64 stubs how many full cigarettes can he smoke.
Ans: 8+1=9
2) A soldier looses his way in a thick jungle. At random he walks from his camp but mathematically in an interesting fashion. First he walks one mile East then half mile to North. Then 1/4 mile to West, then 1/8 mile to South and so on making a loop.
Finally how far he is from his camp and in which direction.
Ans: Distance travelled in north and south directions
1/2 - 1/8 + 1/32 - 1/128 + 1/512 - and so on
= 1/2/((1-(-1/4))
Similarly in east and west directions
1- 1/4 + 1/16 - 1/64 + 1/256 - and so on
= 1/(( 1- ( - 1/4))
Add both the answers
3) How can 1000000000 be written as a product of two factors neither of them containing zeros
Ans: 2 power 9 x 5 power 9
4) Conversation between two mathematciAns:
First : I have three childern. The product of their ages is 36.
If you sum their ages, it is exactly same as my neighbour,s door number on my left.
The second mathematician verfies the door number and says that it is not sufficient.
Then the first says " Ok one more clue is that my youngest is really the youngest". Immmediately the second mathematician answers .
Can you answer the question asked by the first mathematician?
What are the childeren ages?
Ans 1,6 and 6
5) Light glows for every 13 seconds . How many times did it glow between 1:57:58 and 3:20:47 am.
Ans: 383 + 1 = 384
6) 500 men are arranged in an array of 10 rows and 50 columns according to their heights.
Tallest among each row of all are asked to fall out.
And the shortest among them is A.
Similarly after resuming that to their original podsitions that the shortest among each column are asked to fall out.
And the tallest among them is B .
Now who is taller among A and B ?
Ans A
7) A person with some money spends1/3 for cloths, 1/5 of the remaining for food and 1/4 of the remaining for travel.
He is left with Rs 100/- .
How much did he have with him in the begining ?
Ans: Rs 250/-
8) There are six boxes containing 5 , 7 , 14 , 16 , 18 , 29 balls of either red or blue in colour.
Some boxes contain only red balls and others contain only blue.
One sales man sold one box out of them and then he says
" I have the same number of red balls left out as that of blue ".
Which box is the one he solds out ?
Ans: Total no of balls = 89 and (89-29 /2) = 60/2 = 30
and also 14 + 16 = 5 + 7 + 18 = 30
9) A chain is broken into three pieces of equal lenths containing 3 links each.
It is taken to a backsmith to join into a single continuous one .
How many links are to to be opened to make it ?
Ans: 2.
10) Grass in lawn grows equally thick and in a uniform rate.
It takes 24 days for 70 cows and 60 days for 30 cows to eat the whole of the grass.
How many cows are needed to eat the grass in 96 days.?
Ans: 20
g - grass at the beginning
r - rate at which grass grows, per day
y - rate at which one cow eats grass, per day
n - no of cows to eat the grass in 96 days
g + 24*r = 70 * 24 * y
g + 60*r = 30 * 60 * y
g + 96*r = n * 96 * y
Solving, n = 20.
Infosys Sample Test #6
1. From a vessel, 1/3rd of the liquid evaporates on the first day.
On the second day 3/4th of the remaining liquid evaporates.
What fraction of the volume is present at the end of the second day.
Ans: 50%
2. An orange glass has orange juice and white glass has apple juice both of equal volumes.
50ml of the orange juice is taken and poured into the apple juice.
50ml from the white glass is poured into the orange glass.
Of the two quantities, the amount of apple juice in the orange glass and the amount of orange juice in the white glass, which one is greater and by how much?
Ans: The two quantities are equal
3. There is a 4 inch cube painted on all sides.
This is cut down into of 1 inch cubes.
What is the no of cubes which have no pointed sides.
Ans: 8
4. Sam and Mala have a conversation.
Sam says I am certainly not over 40
Mala says I am 38 and you are atleast 5 years older than me
Now Sam says you are atleast 39
All the statements by the two are false.
How old are they really?
Ans: Mala = 38 yrs
Sam = 41 yrs.
5. Ram Singh goes to his office in the city, every day from his suburban house.
His driver Gangaram drops him at the railway station in the morning and picks him up in the evening.
Every evening Ram Singh reaches the station at 5 O, Clock.
Gangaram also reaches at the same time.
One day Ram Singh started early from his office and came to the station at 4 O, Clock.
Not wanting to wait for the car he starts walking home. Mangaram starts at normal time, picks him up on the way
and takes him back house, half an hour early.
How much time did Ram Singh walk?
6. In a railway station, there are two trains going.
One in the harbour line and one in the main line, each having a frequency of 10 minutes.
The main line service starts at 5 o,clock and the harbour line starts at 5.02A.M.
A man goes to the station every day to catch the first train that comes.
What is the probability of the man catching the first train?
Ans: 0.8
7. A family X went for a vacation.
Unfortunately it rained for 13 days when they were there.
But whenever it rained in the mornings, they had clear afternoons and vice versa.
In all they enjoyed 11 mornings and 12 afternoons.
How many days did they stay there totally?
Ans: 18
8. A survey was taken among 100 people to find their preference of watching T.V. programmes.
There are 3 channels. Given the no of people who watch
• at least channel 1
• at least channel 2
• at least channel 3
• no channels at all
• atleast channels 1and 3
• atleast channels 1 and 2
• atleast channels 2 and 3
Find the no of people who watched all three.
9. Albert and Fernandes have two leg swimming race.
Both start from opposite ends of the pool.
On the first leg, the boys pass each other at 18 m from the deep end of the pool.
During the second leg they pass at 10 m from the shallow end of the pool.
Both go at constant speed but one of them is faster.
Each boy rests for 4 seconds at the end of the first leg.
What is the length of the pool?
10. Each alphabet stands for one digit in the following multiplication.
T H I S
x I S
---------
X F X X
X X U X
------------
X X N X X
------------
What is the maximum value T can take?
Ans: T max value = 4
Infosys Sample Test #7
1.An escalator is descending at constant speed.
A walks down and takes 50 steps to reach the bottom.
B runs down and takes 90 steps in the same time as A takes 10 steps.
How many steps are visible when the escalator is not operating?
Ans: 150 steps
2. Every day a cyclist meets a train at a particular crossing.
The road is straight before the crossing and both are travelling in the same direction.
The cyclist travels with a speed of 10 Kmph.
One day the cyclist comes late by 25 min. and meets the train 5km before the crossing.
What is the speed of the train?
Ans: 60 kmph
3. There are five persons with surnames Mukherjee, Misra, Iyer, Patil and Sharma.
There are 4 persons having first or middle name of Kumar, 3 persons with Mohan, 2 persons with Dev and 1 Anil.
Either Mukherjee and Patil have a first or middle name of Dev or Misra and Iyer have their first or middle name of Dev.
Of Mukherkjee and Misra, either both of them have a first or middle name of Mohan or neither have a first or
middle name of Mohan.
Either Iyer or Sharma has a first or middle name of Kumar but not both.
Who has the first or middle name of Anil?
Ans: Kumar Misra Dev
Mohan Iyer Dev
Kumar Patil Mohan
Mohan Sharma Kumar
4. Boys are allowed to watch football at C.V.Raman auditorium subjected to conditions.
The boy over age 16 can wear overcoat
No boy over age 15 can wear cap
To watch the football either he has to wear overcoat or cap or both
A boy with an umberella or above 16 or both cannot wear sweater.
Boys must either not watch football or wear sweater.
What is the appearence of the boy who is watching football.
5. A bird keeper has got P pigeons, M mynas and S sparrows.
The keeper goes for lunch leaving his assistant to watch the birds.
Suppose p=10, m=5, s=8 when the bird keeper comes back, the assistant informs the x birds have escaped. The bird keeper exclaims: "Oh no! All my sparrows are gone."
How many birds flew away?
When the bird keeper comes back, the assistant told him that x birds have escaped. The keeper realised that atleast 2 sparrows have escaped.
What is minimum no of birds that can escape?
6. Answer the following questions based on the conditions from the choices A, B, C, D, E as described below:
(A) if a definete conclusion can be drawn from condition 1
(B) if a definete conclusion can be drawn from condition 2
(C) if a definete conclusion can be drawn from condition 1 and 2
(D) if a definete conclusion can be drawn from condition 1 or 2
(E) no conclusion can be drawn using both conditions
person 1 says N<5
person says N>5
person 3 says 3N>20
person 4 says 3N>10
person 5 says N<8
What is the value of N?
a) 1. No of persons who speak false being less than no of persons who tells the truth.
2. Person 2 is telling the truth.
b) 1. no of persong telling the truth is greater than no of persons telling lies
2. person 5 is telling the truth.
7. There are N coins on a table and there are two players A & B.
You can take 1 or 2 coins at a time.
The person who takes the last coin is the loser.
A always starts first.
If N=7
(a) A can always win by taking two coins in his first chanse
(b) B can win only if A takes two coins in his first chance.
(c) B can always win by proper play
(d) none of the above
2. A can win by proper play if N is equal to
(a) 13 (b) 37 (c) 22 (d) 34 (e) 48
Ans: (e.)
3. B can win by proper play if N is equal to
(a) 25 (b)26 (c) 32 (d) 41 (e) none
4. if N<4, can A win by proper play always?
(a) Yes (b) No
8. Two twins have vertain peculiar charcteristics.
One of them always lies on Monday, Wednesday, Friday.
The other always lies on Tuesdays, Thursdays and Saturdays.
On the other days they tell the truth. You are given a conversation.
Person A-- today is Sunday my name is Anil
Person B -- today is Tuesday, my name is Bill
What day is today?
Ans: Today is Tuesday.
9. There is a safe with a 5 digit number as the key.
The 4th digit is 4 greater than second digit, while 3rd digit is 3 less than 2nd digit.
The 1st digit is thrice the last digit.
There are 3 pairs whose sum is 11.
Find the number.
Ans: 65292
10. A hotel has two wings,the east wing and the west wing.
Some east wing rooms but not all have an ocean view.
All west wing rooms have a harbour view.
The charge for all rooms is identical, except as follows :
• Extra charge for all harbour view rooms on or above the 3rd floor
• Extra charge for all ocean view rooms except those without balcony
• Extra charge for some harbour rooms on the first two floor & some east wing rooms without ocean view but having kitchen facilities.
Which of the following cannot be determined on the basis of the nformation given:
I. Whether there are any rooms without a balcony for which an extra charge is imposed.
II. Whether any room without a kitchen or a view involves an extra charge.
III. Whether two extra charges are impsed for any room.
(A) I only
(B) II only
(C) III only
(D) II and III only
(E) I, II and III
(This question is from 1999 Barrons GRE Guide model Test 3 - section 6, question 22)
Ans: (A)
INFOSYS PAPER ON 14th FEBRUARY AT CHANDIGARH
I sat for the Infosys placement procedure on the 14th FEB and got through!
Logical Reasoning Test (30 questions(6*5) - 40 minutes)
The questions tested general aptitude:
1)A question on Arithmetic (price of rice dal cultivation, man days required, money available, land available, selling price ratio etc)
2)Data sufficiency. This question was very simple
3)Data Interpretation based on a Pie Chart. Didnt attempt because of pausity of time. Leave this one for the last!
4)A Puzzle (Something like A,B,C,D,E eat different fruits on five days in a week. You had to work out various possibilties.) Refer RS Aggarwal (Verbal and non verbal) chapter - Puzzles test anddo all the six types of puzzles given. Do the chap on Blood Relations as well!
5)syllogism Five simple questions on Syllogism. Attempt them first as they are very easy and dont take much time. These questions get you going,
Do the chapter LOGIC from RS Aggarwal (Verbal - non verbal)
Do the rules as well as Logical Venn Diagrams.
6)Find the next image in a series.
Doing puzzles from Shakuntala Devi is of no use now as the pattern has changed and Infy doesnt test you on puzzles anymore. Despite the fact that there is no negative marking, do not attempt the questions you have not solved. The rough work is most probably chechked and thus guesses are not advised. All they doi is lessen your chances of selection. If at all, you can guess the "next image in series questions"
I attempted 20 questions out of 30
English Test (40 questions - 30 minutes)
1) Reading comprehension - One lengthy passage and one short passage! Leave them for the last Rest of test just checks basic English Usage and you dont really need to prepare if you know the basic usage!
You can attempt all the questions in this section easily! the test and getting through it isnt tough!!
Interview :
It was an HR interview lasting about 10-15 minutes!
Excerpts:
First the interviewer told me that I hadnt done well in the written! I sensed that was just to check my confidence and I said that I had done well enough!
Next he asked what kind of a person I was.
He asked questions made out of my answers only. So beware! Then he asked general things like life at my college and whom do I value the most out of family , friends and teachers Then he asked how much had my family spent on me. I answered spontaneously : It is very difficult to keep track of that! he said you have given up so easily! Then he gave me a pen and a paper ans asked to calculate!
Remain confident no matter what they ask or say and never give up on anything! Even if they give you a puzzle just keep working on it until they ask you to stop! maintain eye contact and shake hands firmly if he/she offers! getting through ain,t as tough as you might think
Aptitude Questions
1. One guy has Rs. 100/- in hand. He has to buy 100 balls. One football costs Rs. 15/, One Cricket ball costs Re. 1/- and one table tennis ball costs Rs. 0.25 He spend the whole Rs. 100/- to buy the balls. How many of each balls he bought?
2. The distance between Station Atena and Station Barcena is 90 miles. A train starts from Atena towards Barcena. A bird starts at the same time from Barcena straight towards the moving train. On reaching the train, it instantaneously turns back and returns to Barcena. The bird makes these journeys from Barcena to the train and back to Barcena continuously till the train reaches Barcena. The bird finally returns to Barcena and rests. Calculate the total distance in miles the bird travels in the following two cases:
(a) The bird flies at 90 miles per hour and the speed of the train is 60 miles per hour.
(b) the bird flies at 60 miles per hour and the speed of the train is 90 miles per hour
3. A tennis championship is played on a knock-out basis, i.e., a player is out of the tournament when he loses a match.
(a) How many players participate in the tournament if 15 matches are totally played?
(b) How many matches are played in the tournament if 50 players totally participate?
4. When I add 4 times my age 4 years from now to 5 times my age 5 years from now, I get 10 times my current age. How old will I be 3 years from now?
5. A rich merchant had collected many gold coins. He did not want anybody to know about them. One day, his wife asked, "How many gold coins do we have?" After pausing a moment, he replied, "Well! If I divide the coins into two unequal numbers, then 37 times the difference between the two numbers equals the difference between the squares of the two numbers." The wife looked puzzled. Can you help the merchant,s wife by finding out how many gold R
6. A set of football matches is to be organized in a "round-robin" fashion, i.e., every participating team plays a match against every other team once and only once. If 21 matches are totally played, how many teams participated?
7. Glenn and Jason each have a collection of cricket balls. Glenn said that if Jason would give him 2 of his balls they would have an equal number; but, if Glenn would give Jason 2 of his balls, Jason would have 2 times as many balls as Glenn. How many balls does Jason have?
8. Suppose 8 monkeys take 8 minutes to eat 8 bananas.
(a) How many minutes would it take 3 monkeys to eat 3 bananas?
(b) How many monkeys would it take to eat 48 bananas in 48 minutes
9. It was vacation time, and so I decided to visit my cousin,s home. What a grand time we had! In the mornings, we both would go for a jog. The evenings were spent on the tennis court. Tiring as these activities were, we could manage only one per day, i.e., either we went for a jog or played tennis each day. There were days when we felt lazy and stayed home all day long. Now, there were 12 mornings when we did nothing, 18 evenings when we stayed at home, and a total of 14 days when we jogged or played tennis. For how many days did I stay at my cousin,s place?
10. A 31" x 31" square metal plate needs to be fixed by a carpenter on to a wooden board. The carpenter uses nails all along the edges of the square such that there are 32 nails on each side of the square. Each nail is at the same distance from the neighboring nails. How many nails does the carpenter use?
Answer and Explanation.
1. F + C + T = 100-------------eq1
15F + C + 0.25T = 100-------------eq2
eq1=eq2 .solve to get F=3T/56 ;F=3,T=56,C=41
2. a) There is no need to consider their meeting pt at all.the train has been running for 90miles/(60miles/hr)=1.5hrs.bird flies till train reaches destination frm strting pt.so bird flies for1.5hrs at the vel given(90).so dist=1.5*90=135miles
b) time of train=1hr.so dist of bird=60*1=60miles
3. (a) u don,t need to sum it up.since it,s a knock out only 1 person emerges winner finally.so15+1=16is answer.becos after15 matches finally we shud,ve 15losers and 1winner.
(b) 49:its always one less than no of players as per the idea given above.so no need to check okay cos its always true.ans is 49.
4. Let x= current age
4(x+4)+5(x+5)=10x ;so x=R 41 years
5. 37(x-y)=x^2-y^2. u no tht x^2-y^2=(x-y)(x+y).so (x-y) cancels on both sides to give x+y=37.so sum of unequal halves=37 which is the req answer.
6. R ans:7 teams okay.for a match u need 2 teams.suppose there r totally ,n ,teams.
Now uve to choose 2 teams out of ,n, teams.so answer =no of such choices=no. of possible combinations. So we,ve ans = nC2(ncombination2)=21;solve to get n=7.
Sol: n(n-1)/2=21. so n=7.if u don,t understand c the graph below
each team plays no. of matches=no of teams ahead of it. One bar ,|, represents one team.
| | | | | | | ------------7
6 5 4 3 2 1 0 -----------21
last team is written as 0 matches becos this team has already played with all other teams-hence sum of matches =6+5+4+3+2+1=21 which is correct only if no of teams =7
7. R 14
1. G+2=j-2
2. 2(G-2)=J+2.
solve these 2 to get
J=14
8. a). Sol:each mky takes 8 min to eat a banana
b).ans:8m=48 m=6
9. Use sets and venn diagram to solve such questions.a,b ,aub,anb etc.
12=tennis+leave
18=jog +leave
so jog-tennis=6
again jog+tennis=14.so solve and get jog=10,leave=8,tennis=4.so tot=22
10. Ans= 32*2 + 30*2=124
INFOSYS PAPER ON 6th FEBRUARY 2008
hi friends...this is Sriram Mohan Nedunuri I attended pool campus of Infosys on 5th Feb. 2008 at COER, Roorkee and got selected finally. There were students from 6 colleges n were about 1200. First there was presentation on Infosys and about 1o’clock we gave written exam. Around 380 students were selected for HR and finally around 250 got selected.
Here is the pattern dear frnds
1.logical reasoning (30 ques) 40 min
2.English section (40 ques) 35 min
For logical reasoning go through rs aggarwal, the imp chapters well, that’s enough but do them thoroughly.
The logical section consisted of the following ques....
1.2 puzzle tests of 10 marks..... .(just go thru RS AGARWAL its more than enough.....).
2.5 series figure ques of 5 marks .its like odd figure out – very easy( go thru RS AGARWAL...NON VERBAL SECTION more than enough).
3.5 ques on data sufficiency .questions in this section were so easy try to do data sufficiency first u can complete in 3-4 mins . some are given below.
1.PQR is an isosceles triangle. What’s the length of PQ?
a. The length of QR is 7.
b. The angle of PQR is 90 degree.
Ans: both are sufficient for conclusion.
2. What’s the ratio of length of the line segment PQ to the length of arc PQ, when PQ forms the arc of a circle?
a. Area of circle is168.
b. The segment PQ forms the diameter of circle.
Ans: both are sufficient for conclusion.
3. Are two triangles congruent?
a. Both triangles are right angled.
b. Both are of same perimeter.
Ans: both are not sufficient for conclusion
4. In what time the cylinder completes one rotation?
a. Radius of cylinder is given.
b. Speed (angular) is given.
Ans: both are sufficient for conclusion
4.5 ques on logical reasoning or syllogism... (Go thru rs agarwal also go thru the LR part of the cat material)
5. Data interpretation of 5 ques (Just go thru the rs agarwal aptitude book......it is best as i preffered the same)
From 1997-2002,data was given on students studied in different streams like arts ,commerce ,engineering, medical, agriculture and science. Questions were like....
1.Number of students studying medicine is what %ge of no of students studying engineering?
2.% of Students studying commerce in yr 1999 is what % of students studying in all the yrs?(ans E(no one was correct)) ............... Like that.... questions in this section were easy but time consuming better try to approximate and save time..
English section....... it is as follows
1. 2 paragraphs based question very easy ( try to do it in last minutes as it is very easy u have to just go thru it once it is of total 10 marks ). There were two paragraphs one was big one and second was relatively shorter. I did the shorter one and it was on green house effect- easy one u can even answer the questions even without reading paragraph.
2. 5 ques were given – in that each ques carries four options n u have to find the correct sentence – 5 marks
3. Theme detection 5 ques
4. Fit the correct word in the blanks. This is of 5 marks,,,,
5. 5 ques were given – in that each ques carries four options n u have to find the correct sentence – 5 marks
for verbal I will say that go for wren n martin (or Raymond Murphy) n cover articles , tenses, prepositions, subject n verb relations...trust me friends these books will help u a lot in clearing this round.
For over all logical n English prepare sincerely and friends C2D (cooperate to dominate) policy will be really helpful, even though u have done sincere efforts better do along with ur frnds. Written results were announced in the evening around 7 and I was one of the short listed candidates among 34 form our college. We were asked to leave n appear the next day for interview. Next day interview started around 12 o’clock
INFOSYS PAPER ON 6th FEBRUARY 2008
hi friends...this is Sriram Mohan Nedunuri I attended pool campus of Infosys on 5th Feb. 2008 at COER, Roorkee and got selected finally. There were students from 6 colleges n were about 1200. First there was presentation on Infosys and about 1o’clock we gave written exam. Around 380 students were selected for HR and finally around 250 got selected.
Here is the pattern dear frnds
1.logical reasoning (30 ques) 40 min
2.English section (40 ques) 35 min
For logical reasoning go through rs aggarwal, the imp chapters well, that’s enough but do them thoroughly.
The logical section consisted of the following ques....
1.2 puzzle tests of 10 marks..... .(just go thru RS AGARWAL its more than enough.....).
2.5 series figure ques of 5 marks .its like odd figure out – very easy( go thru RS AGARWAL...NON VERBAL SECTION more than enough).
3.5 ques on data sufficiency .questions in this section were so easy try to do data sufficiency first u can complete in 3-4 mins . some are given below.
1.PQR is an isosceles triangle. What’s the length of PQ?
a. The length of QR is 7.
b. The angle of PQR is 90 degree.
Ans: both are sufficient for conclusion.
2. What’s the ratio of length of the line segment PQ to the length of arc PQ, when PQ forms the arc of a circle?
a. Area of circle is168.
b. The segment PQ forms the diameter of circle.
Ans: both are sufficient for conclusion.
3. Are two triangles congruent?
a. Both triangles are right angled.
b. Both are of same perimeter.
Ans: both are not sufficient for conclusion
4. In what time the cylinder completes one rotation?
a. Radius of cylinder is given.
b. Speed (angular) is given.
Ans: both are sufficient for conclusion
4.5 ques on logical reasoning or syllogism... (Go thru rs agarwal also go thru the LR part of the cat material)
5. Data interpretation of 5 ques (Just go thru the rs agarwal aptitude book......it is best as i preffered the same)
From 1997-2002,data was given on students studied in different streams like arts ,commerce ,engineering, medical, agriculture and science. Questions were like....
1.Number of students studying medicine is what %ge of no of students studying engineering?
2.% of Students studying commerce in yr 1999 is what % of students studying in all the yrs?(ans E(no one was correct)) ............... Like that.... questions in this section were easy but time consuming better try to approximate and save time..
English section....... it is as follows
1. 2 paragraphs based question very easy ( try to do it in last minutes as it is very easy u have to just go thru it once it is of total 10 marks ). There were two paragraphs one was big one and second was relatively shorter. I did the shorter one and it was on green house effect- easy one u can even answer the questions even without reading paragraph.
2. 5 ques were given – in that each ques carries four options n u have to find the correct sentence – 5 marks
3. Theme detection 5 ques
4. Fit the correct word in the blanks. This is of 5 marks,,,,
5. 5 ques were given – in that each ques carries four options n u have to find the correct sentence – 5 marks
for verbal I will say that go for wren n martin (or Raymond Murphy) n cover articles , tenses, prepositions, subject n verb relations...trust me friends these books will help u a lot in clearing this round.
For over all logical n English prepare sincerely and friends C2D (cooperate to dominate) policy will be really helpful, even though u have done sincere efforts better do along with ur frnds. Written results were announced in the evening around 7 and I was one of the short listed candidates among 34 form our college. We were asked to leave n appear the next day for interview. Next day interview started around 12 o’clock
INFOSYS PAPER ON 16TH JANUARY AT UIT – RGPV (GEC) BHOPAL
HELLO FRIENDS THIS IS DHEERAJ ASSUDANI from E.C. INFOSYS VISITED UIT – RGPV FIRST ACROSS INDIA FOR ITS 2009 CAMPUS RECRUITMENT
There are generally 2 phases
(1) Written round
(2) H.R.
The Written test consists of 2 sections.
1) Logical Reasoning (30 qs in 40 min)
2) Verbal Ability(40 quest in 35 min)
Logical section consists of 6 subsections of 5 questions each.
Q1-5) (Puzzel test) the avg of 11 prime no’s less than 45 is also a prime no….
Then
i. Find the avg?
ii. Which is the min prime no?
iii.Which is the second min no?
iv.Which is the max no?
v. How many no r der greater than 20
Q6-10 there were problems on figure where 2 figs implies each other & the 3rd fig is given & u need to find the fig which implies it (Do mirror img and water img chapters from R.S. Aggarwal verbal & non verbal)
Q11-15) 5 prob based on data sufficiency. This consists of a question followed by two statements containing facts providing clues to solve that quest. We r suppose to find out which statement is/are sufficient to solve ans the quest.
E.g. what is the avg score of class?
I. There are 26 students in the class.
II. Every student scores in AP with 2 as lowest score
Q16-20) Data interpretation problems. (Little time consuming but easy one. Ref R.S.Aggarwal Quant)
Q21-25) A critical Reasoning Problem like Ann, Boobie, Cathy and Dave are at their monthly business meeting. Their occupations are author, biologist, chemist and doctor, but not necessarily in that order. Dave just told the biologist that Cathy was on her way with doughnuts. Ann is sitting across from the doctor and next to the chemist. The doctor was thinking that Boobie was a goofy name for parent,s to choose,but didn,t say anything. What is each person,s occupation?
Ans: Since Dave spoke to the biologist and Ann sat next to the chemist and across the doctor, Cathy must be the author and Ann the biologist. The doctor didn,t speak, but David did, so Bobbie is the doctor and Dave the chemist.
(Now u must have identified all facts) just ans qs asked
Q26-30) Prob based on syllogism. (Ref R.S. Aggarwal verbal & non-verabal Logic chapter)
e.g. A. all refils are nibs
B. all nibs r pens
C. no pens r pencils
D. no pencils r nobs
E. all reffils r pens
1.ABC 2.BCD 3.BCE 4.ABE 5.ACD
Answer: 4
Section-2 Verbal Ability
This section consists of:
1) Two RC’s, a very big one and time consuming so attempt them at the end.(refer BARONS GRE )
2) Replace an underlined sentence with another one which is of the same meaning from the given 4 alternatives.
3) Fill in the blank with correct alternative. (REFER ANY GRAMMAR BOOK HAVING TENSES )
4) Deriving conclusion from small passages.
5) Select the correct statement from the set of 4 statements. One is correct and some r with little grammatical mistake. . (REFER ANY GRAMMAR BOOK HAVING TENSES )
(2) H.R. ROUND
Once u clear written Round interview is just a formalty . they ask some basic puzzles like
1. 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 light 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)
3. You r given a thermometer. What can u do by this without measuring the temperature?
Ans: if u put thermometer into a tree it won’t grow anymore, will just die off
4. How it is possible to place four points that are equidistance from each other? OR U r a landscape designer and your boss asked u to design a landscape such that you should place 4 trees equidistance from each other. (Distance from each tree to the other must be same)
Ans: Only 3 points can be equidistant from each other. But if u place points in the shape of a pyramid then its possible
5. You are given a cake; one of its corner is broken. How will u cut the rest into Two equal parts?
Ans: Slice the cake
6. How will you recognize the magnet & magnetic material & non-magnetic material?
Ans: Drag one piece of material over another. There is no attractive force in the middle portion of the magnet. OR
Get a piece of thread and tie up with the one bar and check for poles. If it iron bar then it moves freely and if it is magnetic bar then it fix in one direction according to poles.
7. If one tyre of a car suddenly gets stolen.... and after sometime u find the tyre without the screws how will u make ur journey complete
Ans: Open 3 screws, 1 from each tyre and fix the tyre.
8. How can u measure a room height using a thermometer?
Ans: temp varies with height. but its dependent on various other factors like humidity, wind etc.
9 What is the height of room if after entering the room with a watch ur head strikes a hanging bulb?
Ans: Oscillate the hanging bulb. Calculate the time period for one complete oscillation by Simple Harmonic Motion (SHM) of the handing bulb. Put it in the formula T=2 * 3.14 * (L/G)^1/2 L will be the length of the hanging thread. Add the L with ur height to get the height of the room.
10. Color of bear.... if it falls from 1m height in 1s.
Ans: We get ,g, perfect 10 which is only in poles...hence polar bear...color White
11. 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. find height using the formula
s = gt*t/2 ( s = height, a= initial velocity=0, g=9.8m/s, t = time taken)
12. How wud u catch and receive a ball in same direction? (Dropping is from north and receiving from bottom not accepted, as it is 2 directions)
13. 25 statements given. Some tell truth, some false and some alternators. Find out
the true statements.
14. Can u make 120 with 5 zeros?
Ans: Factorial (factorial (0)+factorial (0)+factorial (0)+factorial (0)+factorial (0)) = 120
15.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) A says: B is a liar.
b) 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.
16.5 swimmers A, B, C, E, F and many conditions of their positions like there are Two b/w A & F, B doesn,t win etc the question was to find who was b/w like E & D?
17. in a race u drove 1st lap with 40kmph and in the second lap at what speed u must drive so that ur average speed must be 80kmph.
18. You have to draw 3 concentric circles with a line passing thru their center without lifting hand.
Ans: Start the line complete one circle move inside circles along the line and then draw second circle. Like wise rest.
19. A rectangular paper is there. At a corner a rectangular size paper is taken from it. Now you have to cut the remaining paper into two equal halves.
Ans: try it on the paper. You must fold the part that has complete paper and select Half of it and then fold the part that cut and selects half of it and then cut along the folding.
20. Value of (x-a)(x-b)………..(x-z)
21. There are 9 coins. 8 are of 1 gm and 1 is of 2 grams. How will you find out the heavier coin in minimum number of weighing and how many weighing it will need?
Ans: 2 weighing ( Divide the number of coins into 3 parts at each weighing)
Sir : tell me about ur biggest achievement?
Dheeraj: I told
Sir : are u any Olympiad winner ?
Dheeraj: yes sir mathematics Olympiad
Sir : Tell me about ur presntations & prove any commercial apps of wearable computing within this room in a minute ?
Dheeraj: I proved , he was impressed
Sir : any QUESTION for me ?
Dheeraj : I have 1 more year to complete my course what do u expect me to do in this 1 year to fit in to your organization
Speak very polite and be confident in the interview. Don’t try answering the question that you really don’t know. Be very careful with the resumes keep it as simple as you can .
Three suggestions from my side for an interview
1 don’t bluff
2. for God’s sake don’t bluff.
3 for your own sake don’t bluff
INFOSYS PAPER ON 26th JUNE AT HYDERABAD
Hey guys, This is Harleen.Im doin my engineering. A brief intro about the Infosys paper is as below. Before i start off with the aptitude paper,i would really like to tell u guys to be good with time management!!!
The aptitude paper was divided into2 parts..
1)reasoning
2)verbal
Reasoning:
In this section v had 30 quest.. and 40 min to solve them..This paper was given first!!
Q1-Q5: These questions were based on cubes as in if the opposite sides of the cube are painted with the same colour and the 3 colours which are used are red,green and yellow,and the cubes is cut into parts then how many pieces would be red,yellow ,etc..
Q6-Q10: This set of questions was based on finding the missing figure...could be solved with jus a little presence of mind.
Q11-Q15: The questions here were based on Data Sufficiency.Each question coved a different area of quant,like one was on S.I,C.I and the other on profit and loss .etc...
Q16-20: This set was of DI...and all the 5 questions were based on one tabular column...(was quite tough)
Q21-25: Now this was a perfect reasoning question...as in there are 4 subjects and five ppl..if A had taken up biology and anthropology and B had only biology,C had anotomy and science D had only science and E had biology,anthropology and anotomy,then how many mim ppl are required so as all the subjects are covered...and so on..
Q26-30: these questions were based on syllogisms..jus be perfect with the 9 rules of syllogisms..(quite an easy one).
Verbal:
It consisted of 40 questions and they had to be solved in 30 min!!(time management is very imp!!) Here v had 2 reading comprehension passages..
The first one was really long... and the second one was short..BUT i chose NOT TO Start with them..casue they would actually take away a lot of time where in there were only 5 questions under each passage!!
Moving on to the other questions, there were correction of sentences,fill in the right tense,suitable conclusion of the passage..(all the questions were very simple..)
After getting done with these get onto the reading comprehension..start off with the small passage first!,then if u hav time left u can move over to the big passage!!
The cut offs for each section was arnd 15 -17 ..(approx..)
Once you clear the aptitide,and face the HR round with confidence ,good communication skills and a smile on your face,ur into INFOSYS!!!(But dont forget to be HONEST and thorough with ur resume!
Subscribe to:
Posts (Atom)
Posts
