#88 #BITCOMPANY Company : DIRECT-I Year : 2009 Selection Process : Initially above 7 and then yaad nehi shaayad CGPA wise shortlisting .Ask Placement office . NOw the Main Stuff :: Written Round :: • General Aptitude + technical questions (C, OOP, DBMS) • Aptitude questions (with a few exceptions)were easy, technical questions were of moderate difficulty • C questions like recursive functions, finding output of some code etc., • 15 x 1 mark, 10 x 3 marks and 3 x 10 marks questions and 1mark=1min o 1 mark questions were very simple… o For 3 marks questions little bit thinking is necessary but easy ones… like matching kind of questions o 10 marks questions contains puzzles for e.g.: bulbs on/off, probability based questions Eg :: 1) Given a binary tree, such that each node contains a number. Find the maximum possible sum in going from one leaf node to another. 2) Suppose you have some guests arriving at a party. For each guest, you are given the arrival and departure time. When a guest arrives he is given a wine glass and when he leaves he returns that wine glass (it becomes available to be given to another guest). Find the minimum number of wine glasses needed to serve all the guests. The arrival and departure team can only be between 1800 to 2359 hours. Interview ROunds :: 12 students were shortlisted for the first interview process. I was told that I came 3rd in the apti test :) All the three interviews were telephonic. Round 1 :: • The first round was algos round • Panel consisted of one interviewer • He asked me to tell him about myself • Then, he asked if I had passion for something. I talked about web development and we had a very long discussion on many web technologies, protocols, interoperability, vendor locking, cloud storage, cloud computing, web OSes, domains, DNS, server technologies, web databases. This is where I scored huge points in my interview. • Then he asked very simple questions on merging two sorted arrays, finding the kth element in two sorted arrays, permutations of merging two series such that their relative order is maintained Eg :: 1) Suppose you have strings like A, B…, Z, AA, AB, ….AZ and so on. This is similar to the way the columns of excel are named. Given a number you have to find the corresponding string. (e.g. 27 would map to AA). I had to give the algorithm and write the pseudo code for this. 2) Given n biased coins, with each coin giving heads with probability Pi, find the probability that on tossing the n coins I will obtain exactly k heads. I had to write the formula for this (i.e. the expression that would give us P (n, k)). 3) Given n positive real numbers, find whether there exists a triplet among this set such that, the sum of the triplet is in the range (1, 2). Do it in linear time and O (1) space. Round 2 :: • A panel of two interviewed me for 60 minutes • This was the technology round • First thing they asked me was about my extra-curricular activities. Then they again asked me to tell about myself • I was asked how much knowledge I had in computer networks, OS. He asked some basic questions in networks (OSI layers, their functions and examples) and OS(multithreading, process management) • As I had a little experience with website management, questions on Javascript(closures) and mySQL were also asked • They asked me to explain the OOP concepts. • As I told them that I was good at problem solving, they asked me three questions which dealt with operations on a two dimensional arrays wherein every row and every column was sorted. These were quite tough but I solved them in the end. Eg :: 1) Suppose we have three positive integers A, B, C. We randomly choose an integer a in the range [0,A] and an integer b in the range [0,B]. Find the probability that a + b
Posted on: Sun, 21 Jul 2013 15:27:23 +0000