Adobe paper at MNNIT Allahabad on 03-01-2006 Written Analytical : 15 mins , 15 questions Questions: 1-3 are based on following info.

9) All A,B,C are X 10) All D are either A or B or C 11) All E are either A or B or C 12) All F are either A or B or C 13) Some D are C 14) All G are either D or E or F The questions were like which of these is not possible such as All E are B Some F are Aetc All the 3 ques were like this SOLN: This question can be done using Venn diagram and notice that A,B,C are not mutually exclusive that is they can overlap 15) Arrange these letters ARGFEFI to form name of an animal and find second letter Soln: Giraffe Ques 5-9) were based pn some motorcycle puzzlesuch as A wins , C reaches after D etc.E is driving bike named as L, Bike named as M comes last. etc Based on this information we had to answer the questions. 16) a series was givenwe had to find the odd one 26,50,69,101,145 ANS In this every number is the square of sum number +1 except 69. so 69 is the odd number. Quantitative had 30 questions.really very simple.to be done in 30 mins

First Tech paper 1 hour 11 questions 1 mark each 2 questions 2 marks each total 15 marks 17) A code snippet was given based on recursionwe had to answer how many times x will be printed. 18) Create a reflection of a treethe mirror image ANS) use recursion and make the left child as right and the right child as the left for every node. 19) One question on automata. A grid was given and we had to answer how many strings are possible: end start 20) xyxyxyzyxyxyx Traverse this string just once and find if it is palindrome or not.You have to begin from the start and you cannot move back and have to move sequentially forward. 21) A recursive loop for fibonnaci was given as follows Int fib(int n) { if (n< = 2) return 1; else return (fib(n-1) + fib(n-2)); } Improve this code so that the number of calculations are minimized? 22) Delete the node next to the node pointed to by a given ptr in a linked list in a one line code. ANS ptr->next= ptr->next->next; 23) In an unsorted array find the 2nd largest number in minimum number of calculations .----2 marks. 24) You are given a sum. Find the path in a binary tree from root to a leaf in which sum of all the nodes on this path is equal to the given sum.---2 marks.

2nd technical paper 45 minutes 10 questions 1 mark each 5 questions 3 marks each. 25) How will you avoid inclusion of a header file twice in a C program? ANS) Use # ifdef in the header file..REFER Kernighan Ritchie! 26) A matrix is given and we have to transpose it against the reverse diagonal.---3 marks. 3 6 1 4 7 2 5 9 8

Transpose is: 8 9 5 2 7 4 1 6 3 27) Print the hexadecimal equivalent of an integer w/out using sprintf or any of printf family commands. 28) Find whether the machine is Big-endian or Little-endian? 29) Print the ip address given in integer form , in dot notation . 30) Find the height of the binary tree . 31) Two sorted arrays are given which can contain duplicate elements in each of them.You have to merge both of them into a sorted array removing duplicates.3 marks. Eg: 1,1,3,4,6,8,9,10 2,4,5,6,7,8,8,8,10 Ans-1,2,3,4,5,7,8,9,10 32) In an integer,toggle the first bit from right whose value is 1 ? LIKE: 10110101 01000100 After toggling; 10110101 01000000 33) Find the output of the code given;the code was from bitwise operator and is the given in Test ur C skills (last question in bitwise chapter) .ANSWER- it prints the binary equivalent of the number. BAki aur sab isi type ke the.Bitwise karma achhce se.KnR puri padh lena aur www.cracktheinterview.com se both saare questions the. Interview mein bhi isi site

se questions the.

amit bhatnagar <mnnit_amit@yahoo.co.in> wrote: From amit bhatnagar Thu Apr 20 10:11:50 2006 Date: Wed, 19 Apr 2006 21:41:50 -0700 (PDT) From: amit bhatnagar <mnnit_amit@yahoo.co.in> Subject: Fwd: interview questions To: ankit A <ankitagarwal1@yahoo.co.in> CC: anunay <anunaygupta@gmail.com>, rahul kesarwani <rahul_mzp@yahoo.co.in> Here are the Qs that were asked to Sushil.. Will try to recall as many Qs I can from my interview and get back to you. -Amit Sushil Kumar <sushil.suthar@gmail.com> wrote: Date: Tue, 18 Apr 2006 19:27:31 +0530 From: "Sushil Kumar" <sushil.suthar@gmail.com> To: mnnit_amit@yahoo.co.in, puneet2k5@yahoo.com Subject: interview questions maine lagbhag sabhi questions likh diye hai.. mushkil se ek aadha hi choota hoga. viney se bhi pooch lena.. us se to aur bhi gande-2 questions puche the OS ke.. keshu bahi ko bhi forward kar dena.. All the best. Delhi mein hum logo ko Sharaab aur Shabaaab dono hi milegey. zero interview (HR) 1. intro puchi, 2. area of interest puhne lag gya. yahi tumhara area of interest kuy hai, koi aur kyu nahi. 3. yeh banda mere ko kafi ghumane ki try kar raha tha. 4. computer science kyu opt ki. 5. allahabad mein he kyu admission le. first interview 1. ask about my project and asked for drwaing the architecture diagram. 2. given a string , write a function to return all the words in the string 3. virtual memory kya hoti, kyu hoti hai. 4. paginging kya hoti, kyu hoti hai. 5. puzzle , there are infinite gates in a row , initially are are closed. There is a monkey in front of each gate. Monkey in front of gate 1 , toggle gate number 1,2,3,4,5,... Monkey in front of gate 2 , toggle gate number 2,4,8,10,12,... Monkey in front of gate 3 , toggle gate number 3,6,9,12,15,...

Monkey in front of gate 4 , toggle gate number 4,8,12,16,20,... Monkey in front of gate 5 , toggle gate number 5,10,15,20,25,... Once all the monkies are done. what will be the state of nth door? 2nd interview 1. why do want to leave current company 2. current project ke baaer me pucha.. 3. mera kya kaam a , kya role hai woh sab pucha. 4. tower of hanoi problem , iska code likhwaaya 5. then he asked if you have 5 dics in tower of hanoi problem , tell what will be the moves. I write the moves directly. Then he asked me not only moves , show all the fuction calls. 6. circular queue ki imlementation. 3rd interview yeh banda jaldi mein tha,is bande ne jaldi-2 interview liya tha 1. what is thread , what is process. Difference between thread an process. 2. Why we use thread. 3. Bankers algorithm ke bare mein pucha. 4. he asked me in which language ,I am working. I told C#. Then he asked me difference between C# and C++. 4th interview 1. reverse teh order of words in a string(not the string). I told him ,I have already solved finding words in the string in last interview. He told me then leave this problem. 2. find second heighest element in an array. Then he asked to lessen the number of comparisions in the the program. 3. inorder and preorder traversal of a tree is given. And he asked me how to 4. there a 3 container A,B,C of capacity 15,10,6 liters ABC intial cofig is 15 0 0 he wants finally 0 8 5 mere se ho nahi rahi thi , he was helping me like at some steps like I am going right or wrong. 5. there is one string it contains zero's and one's only. write a fuction to move all the one's at the end of string.

"Good friends are hard to find, harder to leave and impossible to forget.."

Blab-away for as little as 1?/min. Make PC-to-Phone Calls using Yahoo! Messenger with Voice.zero interview (HR) 1. intro puchi, 2. area of interest puhne lag gya. yahi tumhara area of interest kuy hai, koi aur kyu nahi. 3. yeh banda mere ko kafi ghumane ki try kar raha tha. 4. computer science kyu opt ki. 5. allahabad mein he kyu admission le. first interview 1. ask about my project and asked for drwaing the architecture diagram. 2. given a string , write a function to return all the words in the string 3. virtual memory kya hoti, kyu hoti hai. 4. paginging kya hoti, kyu hoti hai. 5. puzzle , there are infinite gates in a row , initially are are closed. There is a monkey in front of each gate. Monkey in front of gate 1 , toggle gate number 1,2,3,4,5,... Monkey in front of gate 2 , toggle gate number 2,4,8,10,12,... Monkey in front of gate 3 , toggle gate number 3,6,9,12,15,... Monkey in front of gate 4 , toggle gate number 4,8,12,16,20,... Monkey in front of gate 5 , toggle gate number 5,10,15,20,25,... Once all the monkies are done. what will be the state of nth door? 2nd interview 1. why do want to leave current company 2. current project ke baaer me pucha.. 3. mera kya kaam a , kya role hai woh sab pucha. 4. tower of hanoi problem , iska code likhwaaya 5. then he asked if you have 5 dics in tower of hanoi problem , tell what will be the moves. I write the moves directly. Then he asked me not only moves , show all the fuction calls. 6. circular queue ki imlementation. 3rd interview yeh banda jaldi mein tha,is bande ne jaldi-2 interview liya tha

1. what is thread , what is process. Difference between thread an process. 2. Why we use thread. 3. Bankers algorithm ke bare mein pucha. 4. he asked me in which language ,I am working. I told C#. Then he asked me difference between C# and C++. 4th interview 1. reverse teh order of words in a string(not the string). I told him ,I have already solved finding words in the string in last interview. He told me then leave this problem. 2. find second heighest element in an array. Then he asked to lessen the number of comparisions in the the program. 3. inorder and preorder traversal of a tree is given. And he asked me how to 4. there a 3 container A,B,C of capacity 15,10,6 liters ABC intial cofig is 15 0 0 he wants finally 0 8 5 mere se ho nahi rahi thi , he was helping me like at some steps like I am going right or wrong. 5. there is one string it contains zero's and one's only. write a fuction to move all the one's at the end of string.

ALL THE BEST.