Interview with Ask Laila Bangalore

Ask laila is Indian local search engine. Which is providing solutions for small vendors.

1. Define multiple inheritance in JAVA and how will you achieve.

2. List can contain duplicate values.

3. Write a program which demonstrate multi threading.

4. If i have a inner interface then how will implement the methods of this.

5. Create a abstract class and questions relating to this.

Read Full Post »

Interview with Azul Systems

Azul systems is a innovative company, they have developed a optimize JVM called Zing. Which redefined many basic functionalities of JVM, like garbage collection, Heap size, pausing etc.

This interview was a formal interview not much questions were asked relating to programming and concepts.

Only two questions were asked which are as follows.

1. Implement a MyLogger program which will have only once instance at a time but able to use by many threads and it should be thread safe. So that one user’s program can write at time.

2. Declare a singleton class in Java.

 

Read Full Post »

Interview with Aristocrat

Aristocrat is a gaming company based in Australia, this interview was a telephonic interview..I am writing here my experience.

1. How do you use function pointer in C and what’s the real world scenario for this.

2. If you have a BST with 1000 nodes then how much iteration you required to have for finding a value in worst case.

3. What would be the height of BST of 1000 nodes.

4. How do you create 2D matrix dynamically in C.

5. What are the differences in Java and C++.

6. How java is platform independent language.

7. What’s the use of port in Network Programming.

Read Full Post »

Amazon Interview on 11th August

Amazon Interview Experience:

 

It was awesome experience on 11th August, I never expected to reach till last but i could make it. But i have missed the job 😦 Lets see my next attempt will give me this opportunity.

 

Here i am sharing my written Test Exam:

 

Q1. Here two lists are given.

list1 = 2 > 4 > 5 > 6 > NULL:

list2 = 5 > 6 > 7 > NULL;

 

list3 =     3 > 0 > 2 > 3 > NULL;

 

This is called summation of link lists.

Constraint: Link list data node can contain only one digit.

 

Write: Input and Output data by dry running your program.

 

Q2. You have to find out maximum number by rearranging the digits of number.

 

Example: 2789

Output: 9872

 

Complexity: O(n)

 

Q3. Write a program for finding depth of BST (Binary Search Tree).

 

Write by Iterative and Recursion.

 

Q4. (a) Find output of program

int mingle(int a, int b)

{

    int c;

    c  = b /2;

 

if (b<=2)

cout<return a*2(b/2) + mingle(a,c);
}

int main(){
for(i=0;i<5 i=”i” p=”p”>{
     mingle(i+1,i-1)
}
}

(b)
Find out the bug in the following program.
findAanda(char * str, unsigned int len)
{
do
{
if(str[i]==’A’ || str[i] == ‘a’)
{
  ret++;
}
else
i++;
}
return ret;
}

Interview 1:
Q1. Define and explain about youtube.com web architecture.

Q2. write TEST data for maximum of subarray in a given array.

like
array = 2 10 40 68 49 10 11

Answer = 40 68 49

Interview 2:

Q1. Find loop in a link list and length of link list.

Q2. Find the given char string is a anagram or not

Solutions should be in O(n) complexity.

Interview 3:

Q1. Write a program for printing 1 0 1 0 1 0 from a array where 1 and 0 are distributed in random form.\

A = [1,1,1,0,0,0,1,0]

A = [1,0,1,0,1,0,1,0]

Q 2. In order traversal of a Tree using iterative method.

Interview 4:

Q1.  Write a program for printing a matrix in spinal order.

       | 2   4   6  |

A = | 5   8   9  |

       | 10 3   5  |

Values should print like this:

2 4 6 9 5 3 10 5 8

Q 2. I have forgot, as will remember i’ll post it here.

Please write your answers…

I’ll post the answers soon

Best of luck of your interviews

Read Full Post »

Hello world!

Welcome to WordPress.com! This is your very first post. Click the Edit link to modify or delete it, or start a new post. If you like, use this post to tell readers why you started this blog and what you plan to do with it.

Happy blogging!

Read Full Post »