Monday, September 15, 2008

Adobe Interview of Rinky Gupta

Q: Given length and precision(ex: 1/8) draw scale. each unit shd have different height. Draw same as the scale we generally use.

Q: a)Implement stack.(write constructor, destructor,push,pop).
b)Implement Quesue using stack. Optimise the enqueue and dequeue operations.

Q: Difference b/w program and process. How a process executes(Interviewer was expecting program counter etc etc)


Q: There are 3 string S1, S2 and S3. Replace all occurances of S2 in S1 with S3. S3 and S2 can be of any length. Length of S2 can be greater equal or less than that of S3. Result is new string.

Q: There are n guests in a party. A guest can make any numbr of handshakes(0 to n-1) . Prove that there are atleast 2 guest having same number of handshakes.(Can be proved using induction as well as Contradiction)

Q: Difference b/w reference and pointer and where do we use each. What is advantage of 1 over other. When is the memory allocated for each.

Q: Two trains are moving towards each other with different speeds on same track. A bird is moving to and fro. Find the distance travlled by bird till the trains meet.

Q: 100 floors. 2 eggs. find the lowest floor from which the egg breaks in min number of throws.

Q: 50 Red balls and 50 blue balls. 2 empty baskets. A person has to choose 1 basket at random and then pick 1 ball out of it at random. Distribute the balls to maximise the probability of picking up red ball.

Q: Find the subsequence of max sum from array of +ve and -ve numbers.

Q: There is an array of N elements having values in range 0 to N-1. a value can be repeated any number of times. Do some preprocessing so that the count of a particular value can be determined in O(1) after preprocessing. Do not use any extra array to store the counts. Same array can be modified to strore counts for each value.

Q: A float f is given and digits d. return the string having the value with d sigits after decimal.

Q: a)Find the maximum and the min value an integer can store.
b)Implementation of sizeof.
c)Used number of bits to find the max and min value
d)Use complement to find the max value of integer(complement 0 and reset the signed bit to get max value) All these questions were linked from 1 to other.

Q: Rotate integer n bits right.

Q: Two linked lists having a common node. Find the node.

Q: 1,2,4,6 and operators + - * / . Operators can be used any number of times. Write expressions to make 24 and 25

Q: 5,5,5,5,5 and any operators. Make 37.

Q: 2 cans of 10L each full with water. An empty can of 4L and another of 5L. move 2L to each of 4and 5 can.

Q: Reverse linked list.

Q: Few questions on output of C++ codes.

Q: A chess board 8X8 given(area 64 units). 31 slabs of 2X1 each(area 62 units). Arrange slabs on chessboard such that top-left and bottom-right corners are left empty.

Q: There are 100 prisoners. The jailor will make them stand in a row 1 after other, so that each person can see the people in front of him. The he will put caps of red and black color at random on head of each prisoner. There can be any number of red and black caps. The person telling the right color of his hat would survive, others dead. One person can speak one word i.e. the color of his hat.Before the activity the prisoners can think of some protocol to be followed so that max number can survive. No one would cheat. Decide the protocol that shd be followed.


Adobe Interview of Manmohan

Written test for DS and C paper has changed but Quantitative and Analytical are still the same.

DS Paper:
1) Nodes are given in order, make the BST for these nodes
2) Hash function was given had to find which numbers map to the same key
3) Using Boolean operators solve a boolean expression
4) LCA for a BST write code.
5) Base conversion from a 14-base to 7-base
6) Paranthesis matching problem which DS would be best and why
stack was the answer. (tree, stack, queue, linklist were choices)
7) Prefix expression was given had to find the value for given A and B
8) Dont remember
9) Dont remember
10)Some assembly lang program was given need to find whats the behaviour of the program
It was some recursive routine.

C paper:
1) Difference between 2 statments actually they were some pointer to function
2) int *i,*j;
i = (int*) 60;
j = (int*) 20;
printf("%d",i-j);
3) Middle node of link list
4) Missing number find in array in o(n) time number in the range 1-n-1
5) Gcd or 2 numbers
6) Reverse a doubly link list
7) Call statements for a function named crazy(int n, int a, int b)
void Crazy(int n, int a, int b)
{
if(n==0)
return;
Crazy(n-1, b+n, a);
printf("%d %d %d\n", n,a,b);
Crazy(n-1, b, a+n);
}
8) Find 2's compliment of a number which is given in string form
9) MACRO were defined for SUM(a, b) and MULT(a, b)
then printf the result of some expression formed by using these MACROs
10)
file1.c
int myarray[10];

file2.c
extern int* myarray;
void foo()
{
myarray[0] = 0;
}
What problems this program might have and under what conditions?


Technical Interviews

Round1:
1) char* ftoa(float f, int d);
d: number of digits after decimal place that needs to be printed
2) Minesweeper game discussed logic and strategies
3) Tower of Hanoi for N discs, What if the disks are not sorted
4) Max subarray sum problem

Round2:
1) Levelwise traversal
2) Virtual Destructor
3) Nth node from the end of the list
4) Mirror image
5) Power of 2
6) Puzzle a rectangle is given u take out a smaller rectangle from it.
Now divide the rectangle bigger one into 2 equal parts using a single straight line.
7) A mooon shape was given and using 2 lines needed to divide it into 6 parts.
8) Question on polymorphism and other basic question on c++.
9) Container class interfaces and all what all will u have.
10) Permutation and given an API that checks if the word is valid or not.

Round3:
1) 5 5 5 5 5 = 37 puzzle
2) Reverse a link list
3) Power of 2 or not
4) Count number of 1's set bit in an integer
5) Apple, Orange and Mix Puzzle
6) C++ questions tell the output of the program
7) Find repeated number in an array of size n, numbers in the range 1-n-1
8) 8 balls one of them is lighter than others find in 2 weighings
9) What is reference and pointer

Round4:
It was an HR round very long and interesting

Round5:
1) Stack implementation, implement a queue using stack this interface
2) Spiral printing of a matrix m*n
3) Some memory manager kind of thing discussion. Memory allocator and deallocator for efficiently using the memory.

Adobe Interview of Ruchi Sharma

****ROUND 1****

1) Reverse a linklist.

2) Find whether two given linklists of any length merge at a point or not.

3) Print binary representation of a given integer.

4) Code to find all permutations of a given string.

5) puzzle : 5 5 5 5 5 = 37 use any arithmetic operators on LHS to make 37 .

6) puzzle:
given : -20 = -20
to prove : -4=-5.
4-5 steps were given to prove this. I had to find which step was wrong.

7) puzzle : 5 bags each having balls of same weight except one bag. find the bag having the odd ball.

8) Two C++ questions..find output.


****ROUND 2****

1) Given an integer, write code to find max and minimum value it can store.The number of bytes of the integer
is also unknown and no lib func is to be used.

2) An array has numbers in unsorted order n no fix range.any number can be repeated any number of times.
Extract unique elements from the array.

3) 4 tumblers A, B , C , and D of max capacity 10ml,10ml,4ml and 5 ml milk respectively.
make 2ml each in C and D without losing milk.

4) Discussion regarding project.


****ROUND 3****

1) Given a number N.Write a code to Print all primes in the range 2 to N.Optimise it also.

2) Given an array having positive and negative numbers. Find a contiguous sequence having max sum.

3) HAT puzzle : A team of N players, where N is at least three, are randomly assigned hats that
are equally likely to be white or black, under conditions such that:

- Each team player can see the hats of the other team members, but cannot see their own hat.
- Team members cannot communicate in any way.
- The jailor will ask each prisoner the color of his hat.
- If he got wrong ans the prisoner would be killed.

Find the strategy followed by prisoners to minize no of deaths.


4) Discussion regarding project.

Friday, August 29, 2008

Trilogy Interview of Manmohan

Hi these are the question asked to me in Trilogy Interview.
Hope these questions help you too :D All the best :)


1st Round

Only postorder of bst given regenerate the tree
Approach
Code
Complexity
Optimization improve the order of ur solution


2nd Round

1) Spiral printing n*n matrix not m*n actually discussed for that also but coded for n*n only

2) LCA least common Ancestor

3rd Round

LinkList merging Y shaped find the common point or merging point
char array is given find the first repeating character in the array

eg. char a[ ] = "abcdcad"

return "a" here...not "c"

Reverse link list: Code and explanation of calls made
Test case : when llist contains a loop then it will fail then what will u do

1) Then find the loop

2) Remove the loop then reverse the list using this function

3) Camal Banana puzzle 4000 banana and 1000 km and 1000 banana max limit per trip
What is the maximum number of bananas u can take to the other side.
4) Pure virtual function

5) Sinlgeton class Implementation

6) Diameter of a tree: Code and Complexity


4th Round

1) 1-d array given find the sum of the elements between 2 indices say i and j in constant time
eg. a[] = "1 4 2 5 6 3"
and if i = 2 and j = 4 then it should return the sum 4+2+5 from the array in constant time .
U need to do some preprocessing on array for this
2) Now the same for a 2-d array. Now two indices are given say (i1,j1) and (i2,j2)
Find the sum of elements of the rectangle formed by these indices in constant time again do some preprocessing computation for this and return the result in constant time.
3) check IsBst() check if a binary tree is bst or not
do it in o(n) now
do it in o(n) with o(1) space complexity now
4) 2 candles each burns 1 hr Measure 45 minutes

Friday, August 22, 2008

Grapecity Interview of Shobhit Bhatnagar

Hi everybody,

I'm sharing the my experience at Grapecity with u ppl, hope it will help u to prep for it. There were 5 rounds in all.

Round 1 : Written

Four sections were there : C++, RDBMS, OOPS and Aptitude.
Questions were simple, OOPS section hav questions from UML too, lekin hum sabne chore the wo ques...:)

Round 2 : HR

Yes, to our surprise, they had HR before Tech, and it is not a formaility.....

Questions were :

Your educational background(complete includin school, which school, wat subjects etc.)
Your family background
Details about your interests and hobbies
Technologies you are familiar with
Why Grapecity??
Why u choose to do MCA??
What are your career interests??
What kind of projects u hav done???
Hav u done any project in a comp or not?

There were two puzzles as well in b/w,
One is like, u r given two sandtimers of 11 and 7 mins, and u hv to make time of 15 mins.
Another is like

CAT
-IP
----
APA

Assign values to alphabets, values given were 1,2,3,4,8

Round 3 : Techinical 1

The best of the lot, jo banda interview lene ke liye baitha tha, usne andar jate ho bola,
We'll discuss things rather than havin an interview.

He asked me abt myself, and the technologies and projects i hav done so far.

Than he asked abt my interest areas, i said C++ and DS/algo.

He asked abt DBMS, i said ki yaad nahi hai hai abhi...out of touch hoon...
Still, he asked a question like ki...u hav two relations havin m:n relationship b/w them,
How wud u make the tables, wat all tables will be there....initially, i gave wrong answer, bt later he helped me to reach to correct answer..means, he actually, helped...

Than he started with C++,

C++

All OOPs concepts,

Encapsulatin, how it is done in C++.
Abstraction, types of abstraction, how it is done in C++.
Relation b/w Abstraction and Encapsulation.
Inheritance, types of inheritance, i knw three types, he told me abt the fourth one...
Polymorphism, Both Compile time and run time,
examples/..Function overloading, how it is done...how compiler decides which function to call..
Operator overloading...
Overriding of functions...why it is needed...why cant it be done at compile time itself..
how it is achieved...use of virtual keyword.....about vtable and vptr as well...
Than he asked about constructors and destructors, there order of evalutation, and the reason for that...Than he asked some questions by givin some code examples....i write the code first...and than he changes it slightly.and asks wat happens.....the Crux here is that u shud hav ur basics of C++, very strong...the syntax doesn't matter....OOPS concepts are very imp...
Than he asked me abt...Copy constructors, why we need to implement it eplicitly, when it is provided default by compiler...How base clas variables can be initialised from derived clas constructor...

What are the two most imp things u'll keep in ur mind..when u hav to design a class???
(in short, wat are the various characterstics of an object??)

Of ho....bahut C++ poochi thi yaar....sara focus concepts and logic par tha.....yes they asked abt has a and is a relationship....wat are the diff b/w the too...


Round 4 : Technical 2

I was supposed to go to some other room for 2nd round , bt agla interviewer isi room mai a gaya tha....so ab do bande the....

he asked me abt #include....how does it work....why is it required...
Wat all a .h file contains...
can it contain definitions???

Than abt #define....how much mem is allocated to

#define PI 3.14

diff b/w
#define PI 3.14
const float PI = 3.14

why macros are needed...
diff b/w macros and inline funcntions....
diff b/w malloc and new....

diff b/w char *a="abc"; and char a[]= "abc";
will this compile?? char abc[3] = "abc";
What is null character??

yaar abhi itna hi yaad hai....baki pooch lena...:)


Round 5 : Meetin with the Head of Dev Team

Same ques to start with.....describe urself...your personality...

Your strong points...ur way of definin Honesty (i said Honesty as one of my strong pts)
Than ques....like Why Grapecity....
Whether u like working with team or not??
Example where u worked as a team to achieve a common goal??i told him abt Sankalan, everyth abt tht..he was impressed....:D

Next, he asked abt the values that i carry with me....

Wat the industry can expect from young professionals that are joinin industry now??
Do u think that E commerce, as a business, will prosper in india??Why or why not?? is india prepared for that...

When u are goin through some stressful situation, how u manage to come out of it???
Are u calm and composed under those situations..

hmmmmm.....abhi kuch reh gaya hoga....lekin itna kaafi hai i think.....
These are the four rounds.....finally i got through....
Hope this helps u in ur prep....
Best of luck...