Saturday, June 30, 2007

Aricent Interview of Amit Singhal

Q. What all subjects have u studied in MSc so far?
Q. What all did u study in Algorithms?
Q. What all searching sorting techniques did u study?
Q. What is insertion sort?

Q. What data structure will u use to implement insertion sort?
A. I said since searching is done only on some particular field, I think its best to use an array, since the values are all of a similar data type.

Q. Can u use a linked list instead of array?
A. I thought and said we can, but is better to use array since indexing can be done faster on arrays

Q. Are u comfortable with C?
Q. Can u write a code to perform Insertion sort in C using linked list?
Q. What all did u study in operating systems?
Q. Which operating system did u studied?
Q. Do u know UNIX?
Q. What is memory management?
Q. Can you draw a correspondence between OSI layers and TCP/IP layers?
A. I explained with the help of diagram the correspondence between the layers of two models and explained the functioning of each layer.

Q. Please Explain TCP and UDP?
Q. Which will u use for file transfer and which one for voice transfer?
Q. In which layer does sliding-window protocol works?
Q. Can u explain me sliding window protocol?
Q. Which is the latest project u did in C?
Q. What all did u did in it? (I explained what all features we provided)
Q. Which data structures did u use?
Q. What all file operations did u use?
Q. How did u performed searching in files residing on disk? (I said sequentially)
Q. Couldn’t have u fastened it? (I said yes, using some kind of indexing)
Q. Why didn’t u use then, u could have used B-tree
A. I said yes, we could have tried, we even considered it, but since we didn’t considered it from the very beginning, it required a lot of changes in our existing code, and moreover there was a time constraint.

Aricent Interview of Aastha Madaan

1) Tell me something about yourself.
2) Checked the academic record and relative standing in the class and bsc time.
3) Do u want to ask anything about the company?
4) What are your favorite subjects?
I said dbms, n/w, data mining, os (not very comfortable)
But he started with that itself.

5) Difference b/w RTOS and OS.(give 3)
6) Application of RTOS.

7)
#include
int as,ds,cs;
int x=5;
main()
{
int as=8;
as=7;
x=6;
ds=4;
}

Implement it using system stack. How are the values changed? Can the heap store any variables? And all the related things to process image.


8)Write a link list program to insert a node anywhere.
9) There is a cube cut into 27 equal cubes. And then dipped into red paint. Ans the following:
- How many cubes have 0 faces red.
- How many with 3 faces red
- How many with two.

I was given 1 minute to solve it and he stated the countdown to check how I work under pressure.

10) List down all the protocols u have done so far.
11) If I login into yahoo messenger what is entire process that follows. What protocols are used?
12) In the above one he asked me which protocol do we use before http
13) What is IPC?
14) How is it implemented?
15) Difference between a socket and a pipe.
16) Difference between IPC through ports and through sockets.
17) When is SMTP protocol used?
18) What is DNS? What is its purpose? How is it implemented?
19) How can u improve before coming to aricent?
20) Why should we take you?


HR interview

1) Describe yourself.
2) Asked me about my family background.
3) When I said my father is a businessman she asked me why not business then??
4) Have you ever taken any initiative?
5) Have you ever worked in a team?
6) What did you learn from it?
7) Have you worked as a team member or a team leader??
8)How was your experience as a team leader??
9) How well do you think you performed in the written test??
10) How well do you think you performed in each of the seven sections??
11) How do you rate your analytic ability?
12) Find out in figures how many people in India where ties??

13) What would you do resolve a conflict in your team as a
a) Team leader
b) Team member

14) Asked to work in a team what will you do??
15) What are your hobbies?
16) Can u say a few lines of your poem (she wanted to test how much I can retain)?

Aricent Interview of Pranav Gupta

1. why OOP??
2. write advantages of OOP.
1. Then he asked me to explain each one of them
2. There were follow up questions from answers all were based on C
3. what is operator overloading??
4. how u do operator overloading??
5. how u use operator overloading??
6. what are virtual functions??
7. why use virtual functions??
8. how u declare virtual functions??
9. write a code insert a data in doubly linked list?
1. I asked where??
2. He said its sorted list??

after that he moved towards OS

10. what does OS provide
11. what are real time operating systems
12. what is a zombie process
13. what are various states of a process draw the diagram
14. what is kernel mode
15. difference between multiprogramming and multiprocessing



there were some other questions which I was unable to answer I don’t remember them then something about algorithms and networks mix

16. what is complexity of merge sort
17. leaky bucket algorithm
18. tcp and udp they were related to project but he asked disadvantage of tcp
19. what is a socket
20. there were some other question which I didn’t remember..



interview was total crap..

written test seemed to be easy

all English related.

Os ds and algo much had pointer type concept

C++ was more like one word quesn answer. Do test ur c++ skills by yashwant kanetkar.

Aricent Interview of Vikalp Gupta

Hello friends,

So, now I am going to share my experience wih you guys, so jhelo ab mera email.....


Lets start with the written test.

There were 7 sections. Each section was of some specified duration and you had to complete that section within that duration only because they took back the question paper after specified duration and handed over the next section. There was just a single answer sheet and the best part was that there was no negative marking. That meant that you can make wild guesses (but don't do that, please) . Also there was some cut-off for each section and you had to clear each individual sectional cut-off.

First section was of English of total 15 queastions and we had 15 minutes for these questions. There were 10, fill in the blanks type, questions in which we had to fill the most appropriate word (quite easy questions). And 5 more questions were there, I don't remember what type of questions...

Second section was of logical reasoning with15 questions and 15 minutes for that. Quite easy one as during the interview, my interviewer said that I scored quite good in this section.

Third section was of ......oops, sorry, I forgot

Fourth section was of comprehension, in which there was a passage which we had to read in 15 minutes and then they were supposed to take it back and give us a set of 10 questions which we had to complete in 10 minutes. But by mistake, they gave us the questions first and when they came to know about it, they gave us the passage and hence we got complete 25 minutes to complete those questions but the questions were quite 'ajeeb se' as in some questions more than 1 option seemed correct to me.

Fifth section was of Algo and OS, with 20 questions and 20 minutes to complete those questions. Quite tricky one and again, in some questions the correct answer was not given in the options.

Sixth section was of C/C++. I chose C and there were 20 questions and we had 20 minutes for that section. Questions were average (neither too hard nor too easy), but some were definitely tricky.

Seventh section was of e-mail writing, with 5 minutes to complete that. e-mail had to be of between 50-125 words. e-mail ka topic likhne ka mann nahin kar raha....
It was all regarding the written test.


Now let me share my interview with you guys.

As you all know that I was quite happy after the interview, so you can say that it was quite simple one for me, although some people had quite straineous session with the interviewers.
The first quest was as usual 'tell me something about yourself'. As it was a tech interview, so don't go into too much of details. Don't forget to mention your areas of interest. Then I was asked to write a code to find whether a number is a power of 2 or not. I thought for about 1-2 minutes as I couldn't decide whether to write a good code or to do some time pass by writing an inefficient code

Then finally I wrote a good one, which is given in K&R. Then he asked me to explain the code, which I did. Then he asked me to write another code to find the number of 1s in binary representation of the number. Then he asked me to write a code to pack an integer of 4 bytes into a char array of 4 characters. Then he asked me the difference between char *p="hello" and char p[]="hello". Then he asked me to write a code to find the height of a binary tree and to trace it, but then he started tracing himself. Then he asked me to implement linked list as arrays, implementing linked list as array of objects of some structure and using pointers too. He asked me how to delete a node in strcuture's case. I told him a solution but he wasn't impressed and told me his own solution but there was a big flaw in his solution which I immediately pointed out and he had to say that my code was right. Then same question on linked list using pointers. Then he came to OS and asked me what are preemptive scheduling algorithms, what is priority based scheduling and a little bit about inodes. Then he asked me to ask him any question, if I have one. I asked him one or two questions. Then just before leaving, he asked my the stages in SDLC in which I forgot to mention the design phase. He immediately pointed it out and I corrected my answer. And then I finaaly came out of the room.


Now let me tell you about my HR interview.

Manish asked me my academic background, then, what I know about aricent and which is my dream company. For me, it was just like formality..
So, hope you enjoyed my mail very much. No need to say 'thank you' guys....

Sunday, February 18, 2007

Adobe Interview of Varun Aggarwal

Written

Section 1 : Algorithm 10 Ques Time : 40 mins
Section 2 : C 10 Ques Time : 40 mins

I can recall only 16 ques out of 20. These may help you.
I solved 8/10 in Section one and 9/10 in Section two.
You have to solve them very fast else u'll miss some of them.

Ques 1.
Write setnum(x,p,y,n)
The LSD bits starting p from left in x are replaced with rightmost n bits in p.
Rest bits in x are unchanged.

Ques 2.
Write a program to find the depth of Binary Tree

Ques 3.
In Binary Search code, reduce the number of comparisons in while loop from two to one. Write the code.

Ques 4.
Difference between char arr[] = "string" and char *arr = "string".

Ques 5.
Points P1(x1,y1) and P2(x2,y2) are given. drawPoint(x,y) API is given. Write drawLine API taking P! and P2 as input and draw a line from P1 to P2.

Ques 6.
What are bit fields. Give example, when they are used.

Ques 7.
What are data break points. When do we use them.

Ques 8.
Write code to evaluate ReversePolish.
Input : 123+*
Output : 1*(2+3)

Ques 9.
Hex no. is given in string for (0x or 0X optional). Write code to get the integer value.

Ques 10.
Binary Search tree is given. Find the 4th smallest value node.

Ques 11.
Infix expression is given. Draw binary tree. Find postfix expression.

Ques 12.
Memory is maintained as stack type
Assembly Instructions are given :
Load : value
Store : value
Swap : top two values are swapped in memory
Add : top two values are added and replaced by sum
Diff : top value is subtracted from second top and replaced by difference
Label : define label
JMP : jump to label if true condition else give the top value

Write Instruction code for :
A = 300
for(i = 10; i> 0;i++)
A=A +200;

Ques 13.
Given computers C1 - Cn. Given k (L1 - Lk)direct links between computers. Links are transitive. Find whether all computers are connected.

Ques 14.
T1 : write to memory queue
T2 : read from memory queue and print

Create Event : event name
Enter Critical Section :
Exit Critical Section :
Wait Event :

Use instructions to wite code for two events with semaphore.

Ques 15.
Condition for stack are given in wrong order.
PUSH Stach[i] = A i = i - 1
POP i = i + 1 A = Stack[i]
Arrange in proper order

Ques 16.
Implement int **my2DAllocate(int rows, int columns); to allocate memory for 2D array and return the int ** pointer.


Round 1
1. Write a class Student with just one private member, char* name. Also write the copy constructor, overload the "=" operator and write destructor.
2. Write code to find if a Binary Tree is BST or not.
3. U have a server which is getting many requests. More then the number of threads it can spawn. What will u do with the requests for which u don't have threads.
4. Write prototype for printf. If u have to write your own printf and u don't have va_arg how would you get the arguments in the variable list?

Round 2
1. What is your project about? Why did u choose the DS for your project? Write the definition of the structure used in it.
2. How would you maintain a variable size array. The size can increase at the run time. Optimize it to make iterator operation quick.
3. Write solid secure code to getElemAtIndex(int i) for the above DS.
4. What are your interests?

Round 3
1. Least Common Ancestor.
2. Array with n+1 elements. Only one elem is repeated, how would u find the elem?
3. Write a generic Swap function. It may be called for any structure. Also the number of bytes in the structure is given.
4. Write the code similar to malloc. void* myMalloc(int n). n is the num of bytes to allocate. You are given a void* f pointer that points to the location free in the memory.
5. Tell me something about yourself.

Round 4
1. Write the function my2DAlloc.
2. The function makes numOfRows+1 calls to malloc. Reduce it further. Finally we reduced it to just 1 call.
3. Write a function to add two numbers, without using any arithmetic operator. Even the ++ in for statement is not allowed.
4. There are two processes P1 and P2. Both have int* ptr in them. Now p1 assigns ptr = 0xffff1234, *ptr = 10 and the process goes in wait state. P2 gets scheduled and it does ptr = 0xffff1234, *ptr = 100. When p1 is invoked again, what would be the value of *ptr?
5. Write code to print a binary tree in breadth first manner. Now print it in bottom up breadth first manner.
6. How will u find the size of a pointer, without using sizeof operator.



HR
1. Package - Current and Expected
2. What if offer less?
3. Notice period?
4. What if your company extends your onsite?
5. Fav subject at grad?(i said algos and HR guys don't know it)
6. Fav subject at 10th? Isaid maths and he asked me to prove Pythagoras Theorem.
7. He gave me a puzzle and said that if i do it in 5 mins i'll get the marks for Pythagoras theorem too.
8. Why do u wanna leave present Company?