->written test :
simple gate questions , it is so simple.
->three technical interviews
first round :
- basic project related things
- they want to ask like , if I want to do your project some other way , how you will do it.
- write below functions
-createStack()
-push()
-pop()
- write algo , how you will create stack with using linked list , array.
second round :
- unix socket system calls.
- structure that is called when you create socket in unix.
- write a program for
- create a mirror image of tree
- height of tree
- calculate the length of string both iteratively and recursively.
- level order traversal
third round :
- its pretty easy .
- all simple talk , like where are you from etc.
- he asked me two questions
- do addition without addition operator '+'.
- if I want to add the two numbers that are 2000 digits long , then what is your approach for that.
-> I am not selected for the interview but , the interview was pretty easy and the interviewers are cool.
-> My advise to you is , take your time to attempt the question.
home it will help to you. :)
simple gate questions , it is so simple.
->three technical interviews
first round :
- basic project related things
- they want to ask like , if I want to do your project some other way , how you will do it.
- write below functions
-createStack()
-push()
-pop()
- write algo , how you will create stack with using linked list , array.
second round :
- unix socket system calls.
- structure that is called when you create socket in unix.
- write a program for
- create a mirror image of tree
- height of tree
- calculate the length of string both iteratively and recursively.
- level order traversal
third round :
- its pretty easy .
- all simple talk , like where are you from etc.
- he asked me two questions
- do addition without addition operator '+'.
- if I want to add the two numbers that are 2000 digits long , then what is your approach for that.
-> I am not selected for the interview but , the interview was pretty easy and the interviewers are cool.
-> My advise to you is , take your time to attempt the question.
home it will help to you. :)