Showing posts with label MCA 10-13. Show all posts
Showing posts with label MCA 10-13. Show all posts

Friday, June 14, 2013

Adobe Interview of Samarth Gupta

Written:
It consisted of 3 sections viz Apti and Quant, C and Engineering.
C paper consisted of 10 questions that were based on pointers and functions.
Check if an expression has valid parenthesis

Engineering Paper:
  1. Each instruction on JVM is in byte code. How many such instructions are possible?
  2. Some Memory and Process Scheduling based scenario was given along with 4 options.
  3. Synchronization of two processes using the following code:
     boolean lock;  
     while(lock) ;  
     lock = true;  
     /* critical section code */  
     lock = false;  
    
    Is it feasible?
  4. Reverse a Singly linked list
  5. Check if a number is palindrome without converting it to string
  6. Implement multiplication recursively
  7. A number has 3 on it's unit place if one of it's multiples has 1 on all it's places. e.g. 111 is a multiple of 3, 111111 is a multiple of 13. You need to find such multiple of a given number. The multiple may be very large and exceed the limits. Don't use any complex data structures.
  8. A matrix having 0s and 1s is there. Each row can not have a 1 followed by a 0. You need to find the row having maximum 1's.

Interview 1:
It started off with compilers. Explain Parsing, different types of parsing, LR(1), LALR(1). 
Steps of compilation, explain lexical analysis, linker, loader.
Examples of syntax error, semantic error, linker error, relocatable addressing.

OS:
Process management, memory management, process v/s thread, file descriptor, synchronization techniques etc.

C/C++:
Some questions for output, overloading v/s overriding, structures v/s classes, inheritance, virtual functions, can constructors and destructors be virtual? why or why not? diamond inheritance problem, and a lots of questions on pointers. Some statements were there and I had to read them properly i.e. 
 int *p;  
 P is a pointer to integer  
Complex ones were there.
In C, functions are evaluated right to left. Why, any benefit?

Data Structures and algorithms:
Convert an expression from infix to postfix and vice versa (code)
Merge two sorted linked lists removing duplicates.
Reverse a Linked List (any other method than the one I had written in the engineering paper)
Height of a tree (he asked me more than one method. I was able to give 3 solutions)
2 sorted lists, you have to find the element of rank k in their merger without actually merging them

Assembly code to generate factorial of a number (I assumed some basic instructions like ADD, SUB, JMP etc)


Interview 2:
Design a base 64 encoder for an infinite stream of data.
Implement cin and cout using printf and scanf
Implement LRU Cache
Design a class to give following 3 functions in O(1):
  • void insert(int data)
  • void delete(int data)
  • int getRandom()

Serialization and de-serialization of a binary tree.
What are smart pointers?
How garbage collection works in java?
Malloc and Free
Maps (Hash maps) and how they work?
Average of 4 unsigned integers (simple addition might result in overflow)


Interview 3:
It was with the director of the acrobat team. Started off with my intro, what I do in leisure time, and it continued for next 20 minutes on Online Gaming. Next 20 minutes were on my project in snapdeal and next 20 mins were on what Acrobat Team does and how acrobat helps adobe earn profit.
Then he moved to DS and Algo:
Reverse a Doubly Linked List (proper code)
You are given an infinite sequence of words. what you need to do is when a new word is there, store it. whenever a word is repeated, throw an exception. Make sure you do not spend too much time in searching. Give a solution using some DS and design an algo for the same. Then this moved to phrases, then he asked me to store the sequence as well.
That's it..

Interview 4 (HR Round):
This was a casual round where we discussed about adobe, job profile, facilities etc. 

Hope it helps!
All the best.. :)

Friday, August 3, 2012

Google Written On Campus

Google visited our campus for the first time. The procedure consists of the following rounds:
  • Written test
  • Sets of Interviews
The Written Test
The written test consisted of 2 sections: 
  1. MCQs: There were 20 questions consisting of questions from OS, Algo, general logic etc. They covered all the things from basics of each subject to advanced concepts like NP Hard Problems etc.
  2. Coding Section: Coding section consisted of 2 programming problems:
    1. Problem 1: Two friends Atul and Vinay went for a picnic on an island. The island is a grid of m x n. While going back to home, Atul went and Vinay was left on the island. Now upon realizing this mistake, Atul is coming back to the island. In the meanwhile, Vinay will be wandering on the island. His probability of taking a step in any of the 4 direction (up, down, left, right) is equal. This means that he may fall into the sea as well and drown. Given the no of steps (k) he'll be taking before Atul arrives, size of the island (m x n) and his initial position (x,y), find the total probability that he'll be alive after Atul arrives.

      int ProbabilityOfBeingAlive(x,y,m,n,k)

    2. Problem 2: Write a code to multiply two integers.

      int Multiply(a,b)
Candidates shortlisted were called for the interviews in B'lore later.

Tuesday, July 17, 2012

Nagarro Interview Experience of Amit Kumar

Written Test: 2 papers
Paper 1: Aptitude (mathematical section) and analytical reasoning (only Problem solving type puzzles)

This paper includes two sections
  1. Mathematical section problems on mensuration, geometry, trigonometry, profit-loss, percentage, problems on train, boat-stream etc.
  2. Analytical reasoning (only Problem solving type puzzles).
The level of Mathematical section is more than average as compared to other companies
And also the level of Analytical reasoning questions is good.

Paper 2: Coding round
3 problems are given to be coded in 75 minutes (I attempted all 3).

  1. Given an array of integers which contains positive and negative numbers you have to arrange the negative number first then positive numbers in O (n) time.
  2. Given an array of integers and a number “k”, you have to find the all such elements whose sum is equal to “k”.
    This is a subset sum problem.
    Ex:- {1,2,3,4,5,6,7,8,9} k=10
    O/P:- {1,2,3,4}, { 1,3,6}, { 1,2,7}, {1,4,5}, {1,9}, {2,8}, {3,7}, { 4,6}, {2,3,5}.
  3. Given an integer array of positive numbers, you have to find all pairs of “next nearest consecutive numbers” in array, if not present then nothing to print, if present then print all such pairs.
    Ex: - Input1:- {1, 4, 2, 5, 7, 8} O/P is {7, 8}
    Input2:- {1,4,2,5,7,8,9,10} O/P is {7,8}{8,9}{9,10}
    Input3:- {1, 6, 9, 11} No output.
Those who cleared the written test were called for the technical interviews.
TIP: - Try to attempt all codes.

Interviews

It started with discussion of the codes one by one.
For codes which were not optimal, he asked me for other optimal approaches.

For Question 1:-
I had used extra memory to store the result, sir pointed out that I could have done the same thing using O(1) (constant) space and I did with constant space(with different approach).
He was trying to entangle me by the question “You haven't handled the case of ZERO (0)” then I said that ZERO is neither positive nor negative.


For Question 2:-
My code would not have printed all outputs if the input size would increase, so he asked me to think different approaches. I told him an approach that use all (2^n) subsets of the give array of size n, that takes sum of the elements of the subset and then check with the given sum. If they equal print all elements of that and I repeat this process to all (2^n) subset of array.

He said that same approach is written by your friend, than I said that it may happen, then he asked me again to think different approach. I said that I don't have any alternative solution.

For Question 3:-
My code prints the all such pairs that differ by one, so sir asked me to correct the code then I said that I can find the minimum difference of two indexes and also the difference of the element at these indexes equal to one.
Again, he was trying to entangle me by the question “You want to make array of difference of indexes”, then I said that no I will use only two variables.

After this, he asked me to write a code to print the following pattern
12345
23451
34512
45123
51234

That's all for the technical interview.

HR Interview
  • About yourself
  • Marks, JAM Rank, how many candidates appeared for JAM that year.
  • Interests
  • About Nagarro - Where do you see yourself in 5 years, how many seniors you know in Nagarro, is this your first interview, technology you'd like to work upon, how will you manage transportation to Gurgaon etc. 
That's it. :)