Anna University
Chennai, Tamil Nadu
Your seniors at Anna University were your true well-wishers, they shared their placement interview questions for you. 🙏
AmbitionBox
Search
Reviews
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Filter interviews byCompany
Designation
Interview Type
Anna University Placement Interview Questions
Updated
3 Jan 2025
138 interviews found
4 Interview Rounds
Interview Preparation Tips
Round: Test
Experience: 1. Aptitue and technical objective
Apps completely tough.
Totally 35 aps questions were asked and only 35 minutes were given for it :P:P
Also, technical questions were nothing but c aps.
Only three problems were easy. Technical was easy.
2. Subjective:
1.Find the two non repeating elements in an array with other elements repeated two
times(even times) exactly in linear time .
2.String matching algorithm.
I just wrote the kmp algorithm in words.
Usually for few companies and pep exams, Career net only sets papers for written. Their apps
questions will be tough. Only by luck i entered the next round :)
Round: Group Discussion
Experience: Group Discussion
There was a situation given. The group is stuck in a storm in the middle of their travel in some
ranchi lake.
We have only few materials left with us for rescue :) match stick , chocolate bars , air pillow,
sleeping bag, water filter, wine bottle.
We need to prioritise these things and just discuss with the group about out prioritisation :) It
was fine. This company wanted us to speak that's all.They eliminated only one in this round(who
didn't even speak a word).But do remember other management companies are not so.
Round: Technical Interview
Experience: For me they asked projects.. Full forty minutes one single dbms project. He was a
Chinese guy i guess. Then he gave some alterations in my project. then asked me what ill do. It
was just to apply 1nf and 2nf. I thought i answered well. But i was eliminated.
For few it was projects . For few it was technical .
So be very very clear about the projects :) And one more thing is that normalisation is the only
question which was asked in all interviews i faced. Be thorough with it :) Moreover u must be
able to normalise any given table
Skills:
College Name: Anna University Chennai
Experience: 1. Aptitue and technical objective
Apps completely tough.
Totally 35 aps questions were asked and only 35 minutes were given for it :P:P
Also, technical questions were nothing but c aps.
Only three problems were easy. Technical was easy.
2. Subjective:
1.Find the two non repeating elements in an array with other elements repeated two
times(even times) exactly in linear time .
2.String matching algorithm.
I just wrote the kmp algorithm in words.
Usually for few companies and pep exams, Career net only sets papers for written. Their apps
questions will be tough. Only by luck i entered the next round :)
Round: Group Discussion
Experience: Group Discussion
There was a situation given. The group is stuck in a storm in the middle of their travel in some
ranchi lake.
We have only few materials left with us for rescue :) match stick , chocolate bars , air pillow,
sleeping bag, water filter, wine bottle.
We need to prioritise these things and just discuss with the group about out prioritisation :) It
was fine. This company wanted us to speak that's all.They eliminated only one in this round(who
didn't even speak a word).But do remember other management companies are not so.
Round: Technical Interview
Experience: For me they asked projects.. Full forty minutes one single dbms project. He was a
Chinese guy i guess. Then he gave some alterations in my project. then asked me what ill do. It
was just to apply 1nf and 2nf. I thought i answered well. But i was eliminated.
For few it was projects . For few it was technical .
So be very very clear about the projects :) And one more thing is that normalisation is the only
question which was asked in all interviews i faced. Be thorough with it :) Moreover u must be
able to normalise any given table
Skills:
College Name: Anna University Chennai
S.G.KIRTHANA
posted on 12 Nov 2015
5 Interview Rounds
Interview Preparation Tips
Round: Test
Experience: The written test was easy and had both technical and aptitude questions( problems based on factorials, average , power , arithmetic progression) were asked.
Tips: Aptitude based questions -
1-) A times ath term of an AP is equal to b times bth term, then what is the (a+b)th term.
2-) Question based on the total number of coins and the denomination of each coin .
Technical question-
void change(char *ch)
{
ch=”helloworld”;
}
int main()
{
char *ch=”msgtoall”;
change(ch);
cout<}
Round: Technical Interview
Tips: Apart from technical stuff questions can be put on about your college preference and about you.
Round: HR Interview
Experience: HR interview was skype based.
Skills:
College Name: Anna University Chennai
Experience: The written test was easy and had both technical and aptitude questions( problems based on factorials, average , power , arithmetic progression) were asked.
Tips: Aptitude based questions -
1-) A times ath term of an AP is equal to b times bth term, then what is the (a+b)th term.
2-) Question based on the total number of coins and the denomination of each coin .
Technical question-
void change(char *ch)
{
ch=”helloworld”;
}
int main()
{
char *ch=”msgtoall”;
change(ch);
cout<
Round: Technical Interview
Tips: Apart from technical stuff questions can be put on about your college preference and about you.
Round: HR Interview
Experience: HR interview was skype based.
Skills:
College Name: Anna University Chennai
5 Interview Rounds
Interview Preparation Tips
Round: Test
Experience: Few questions were their based on C program else their were questions on general aptitude based.
Round: HR Interview
Experience: It was a Skype based interview.
Tips: As far as source bit is concerned they are seriously into mobile apps and web.So prepare yourself according to that. Speak about project which best satisfies their expectations.
General Tips: Questions asked to other candidates (ceg and mit) are-
1-) About Data structure.
2-) How to transpose a matrix without extra space.
3-) Prime number generation.
Skills:
College Name: Anna University Chennai
Experience: Few questions were their based on C program else their were questions on general aptitude based.
Round: HR Interview
Experience: It was a Skype based interview.
Tips: As far as source bit is concerned they are seriously into mobile apps and web.So prepare yourself according to that. Speak about project which best satisfies their expectations.
General Tips: Questions asked to other candidates (ceg and mit) are-
1-) About Data structure.
2-) How to transpose a matrix without extra space.
3-) Prime number generation.
Skills:
College Name: Anna University Chennai
4 Interview Rounds
Interview Preparation Tips
Skills:
College Name: Anna University Chennai
College Name: Anna University Chennai
3 Interview Rounds
Interview Preparation Tips
Round: HR Interview
Tips: At the they might ask to ask something from them , so i will suggest to better ask them any question.This will leave a good impression.
Skills:
College Name: Anna University Chennai
Tips: At the they might ask to ask something from them , so i will suggest to better ask them any question.This will leave a good impression.
Skills:
College Name: Anna University Chennai
1 Interview Round
Interview Questions
- Q1. Tell me something about yourself
- Q2. Condition - If given chance how will you control the traffic of Chennai
- Q3. How you know bout TCS
- Q4. Simple questions based on final year project
Interview Preparation Tips
Skills:
College Name: Anna University Chennai
College Name: Anna University Chennai
3 Interview Rounds
Interview Preparation Tips
Skills:
College Name: Anna University Chennai
College Name: Anna University Chennai
1 Interview Round
Interview Questions
- Q1. What is the difference between different kind of linux OS?
- Q2. What is cloud computing
- Q3. Few questions based on final year project
Interview Preparation Tips
Round: Technical Interview
Experience: They didn't asked much questions, only my real time projects was targeted.
Skills:
College Name: Anna University Chennai
Experience: They didn't asked much questions, only my real time projects was targeted.
Skills:
College Name: Anna University Chennai
5 Interview Rounds
Interview Preparation Tips
Skills:
College Name: Anna University Chennai
College Name: Anna University Chennai
5 Interview Rounds
Interview Preparation Tips
Round: Test
Experience: Two questions were asked in the written test. It was basically a coding round.
1)
1
/ \
2 3
/ \ / \
4 5 6 7
Output : 1,2 3,7,6,5,4
2) Given a binary tree, check whether a given sum ‘x’ is present along any path from the
root to any of the leaves.
1
/ \
4 3
/ \ / \
9 5 6 7
if x = 14 , answer is true because 1+4+9 = 14
if x = 12, answer is false
Round: Other Interview
Experience: The initial interview was known to be Data Structures and algorithms round. The two
interviewers totally asked me questions on data structures and mostly concentrated on how
much I knew about time and space complexities.
a) The first question was to find the vertical column sum of every column in a given
binary tree and return the result in an array from left to right.
The first solution which I told is by finding the leftmost and rightmost index of the array ,
thereby finding the index for the root. Following to this step, the sum can be stored easily while
traversing from top to bottom and saving the value at index1 while moving to the left and at
index + 1 while moving to the left. This solution used two tree traversals.
He was good with this solution but asked to optimise with respect to time. Then, i
shooted out the solution using a doubly linked list where we can traverse to and fro and store all
the sum values. While using linked list, instead of index 1 & index + 1 , prev and next pointers
can be used to access the next and prev location from the current location. This way , the
solution is optimized with time.
b) The second question was that I have been given a binary tree where the node
structure would be something like below :
struct tree
{
struct tree * left, *right, *sib ;
};
Now , the task was to point every sib pointer to its nearest rightmost node in the same level. i.e
the sib pointer of the rightmost node at every level would be NULL.
The first solution which I told them was to perform a Breadth first search and by using a
queue would connect all the nodes of a level at a time. But, this would increase the space
complexity and of course I was asked to optimize the solution.
Given tree :
root > 1
/ \
2 3
/ \ \
4 5 7
The result should be :
root > 1
/ \
2 > 3
/ \ \
4 > 5>7
Let me explain the solution which I gave them for the above example.
Starting from 1, for any node connect the sib pointer of left node to its right node if both
are present or if both are not null. If the left node is not present then no need to perform this
operation but if the right node is alone present, then there may be another possibility for the
presence of some other nodes at the same level. Here , 2 will point to 3 as explained above. In
the same way 4 will connect to 5 . But , we come to know that in the second level there is one
more node 3 and it has a child 7 . So , 5 is connected to 3’s right child. In the same way the
other nodes would be connected. By this approach, we can understand that before pursuing
towards any level, all the sib pointers in the previous level are connected. This solution would
work for all the test cases.
c) Given two arrays of integers , find the intersection of both arrays. I was asked to give
various solutions and sort the solutions with respect to time complexitiy.
d) Given a binary search tree with positive integers and a number ‘X’ find the next
greatest number to X from the BST. If the number is not present, return 1.
Round: Other Interview
Experience: and code for it on paper. The two problems were based on data structures.
a) Given a binary tree, find the ancestor matrix where time complexity was considered
but not much than the written code.
Given tree :
root > 1
/ \
2 3
/ \ \
4 5 6
The ancestor matrix is shown as
1 2 3 4 5 6
1 0 1 1 1 1 1
2 0 0 0 1 1 0
3 0 0 0 0 0 1
4 0 0 0 0 0 0
5 0 0 0 0 0 0
6 0 0 0 0 0 0
Let the above matrix would m[][] such that m[i][j] = 1 , where i is the ancestor of j.
b) The second question was to swap every consecutive two nodes in a singly linked list.
For example given a list 1234567null
The result must be 2143657 null
For the above both questions , the interviewer saw the code and reviewed it with
different test cases to get satisfied.
Round: Hr cum technical
Experience: This was a HR cum technical round, but most of the questions were straight forward.
The two managers who interviewed me were testing my managerial skillls. Lot of questions
arised and the interview went for more than a hour. Few questions were like :
a) What do you know about Amazon ?
b) Why I preferred Amazon.com to my previous offer ?
c) The responsibilites which I undertook during my college days with brief explanations
on every responsible task which I did !!
d) Any projects which I did apart from academics ?? I explained about my android
project which I did with my elder brother.
At the end the round ended with a simple technical question =>
I was asked to design a stack using a c++ class such that it can perform the following
functions which will be called by different APIs :
Create a stack of size ‘n’
Push an element into the stack
Pop an element from the stack
Destroy the stack
At the end of this round, I asked about their experiences at Amazon.com and about my
work/role at amazon in future.
Round: Technical Interview
Experience: Coming to the fourth round, it was totally technical. Technical here covers theortical topic
from the fields of Operating systems, OOPS and Networks. The questions which were asked
were :
a) What is the difference between physical address and virtual address ?
b) What is page table and paging ?
c) What is the difference between thread and process ?
d) What is context switch and how it differs between process and threads ?
e) What are threads and why are threads preferred to process ?
f) What are semaphores and differnce between semaphores and locks ??
g) What are the 7 OSI layers in networks and their functionalities ?? He mostly asked
about transport and network layers.
h) What is encapsulation ?
i) What is polymorphism and their types ??
j) What is differnce between polymorphism and function overloading ??
k) The last question was to design / implement a singleton class .
Here this round ended, but I made many sothapals without sufficient preparation :P
Interview No 5
This interview was also HR cum technical round but it was known as a bar raiser round.
I am not sure how to spell it too. The questions were almost the same as in the 3rd interview
with additional questions like “ how did you react in conflicting situations in four year career ? “.
This round also ended with technical questions :
a) Given a doubly linked list where the next pointer is pointed to the next node in
that list but the previous pointer is pointing to any random node. I was asked to make a
similar list efficiently . [ Simply a xerox of it ]
b) The second question was a string based traversing and pattern matting type
where there were given two strings ‘A’ and ‘B’.
I was asked to return true if all the characters in ‘B’ were present in ‘A’ or else
return false. I explain many solutions in which he asked me to code for a particular
solution and he verified the code by iterating though the test cases.
The round ended with few personal questions on experience and my future role. So, I was into
Amazon after a week of discussions
Skills:
College Name: Anna University Chennai
Experience: Two questions were asked in the written test. It was basically a coding round.
1)
1
/ \
2 3
/ \ / \
4 5 6 7
Output : 1,2 3,7,6,5,4
2) Given a binary tree, check whether a given sum ‘x’ is present along any path from the
root to any of the leaves.
1
/ \
4 3
/ \ / \
9 5 6 7
if x = 14 , answer is true because 1+4+9 = 14
if x = 12, answer is false
Round: Other Interview
Experience: The initial interview was known to be Data Structures and algorithms round. The two
interviewers totally asked me questions on data structures and mostly concentrated on how
much I knew about time and space complexities.
a) The first question was to find the vertical column sum of every column in a given
binary tree and return the result in an array from left to right.
The first solution which I told is by finding the leftmost and rightmost index of the array ,
thereby finding the index for the root. Following to this step, the sum can be stored easily while
traversing from top to bottom and saving the value at index1 while moving to the left and at
index + 1 while moving to the left. This solution used two tree traversals.
He was good with this solution but asked to optimise with respect to time. Then, i
shooted out the solution using a doubly linked list where we can traverse to and fro and store all
the sum values. While using linked list, instead of index 1 & index + 1 , prev and next pointers
can be used to access the next and prev location from the current location. This way , the
solution is optimized with time.
b) The second question was that I have been given a binary tree where the node
structure would be something like below :
struct tree
{
struct tree * left, *right, *sib ;
};
Now , the task was to point every sib pointer to its nearest rightmost node in the same level. i.e
the sib pointer of the rightmost node at every level would be NULL.
The first solution which I told them was to perform a Breadth first search and by using a
queue would connect all the nodes of a level at a time. But, this would increase the space
complexity and of course I was asked to optimize the solution.
Given tree :
root > 1
/ \
2 3
/ \ \
4 5 7
The result should be :
root > 1
/ \
2 > 3
/ \ \
4 > 5>7
Let me explain the solution which I gave them for the above example.
Starting from 1, for any node connect the sib pointer of left node to its right node if both
are present or if both are not null. If the left node is not present then no need to perform this
operation but if the right node is alone present, then there may be another possibility for the
presence of some other nodes at the same level. Here , 2 will point to 3 as explained above. In
the same way 4 will connect to 5 . But , we come to know that in the second level there is one
more node 3 and it has a child 7 . So , 5 is connected to 3’s right child. In the same way the
other nodes would be connected. By this approach, we can understand that before pursuing
towards any level, all the sib pointers in the previous level are connected. This solution would
work for all the test cases.
c) Given two arrays of integers , find the intersection of both arrays. I was asked to give
various solutions and sort the solutions with respect to time complexitiy.
d) Given a binary search tree with positive integers and a number ‘X’ find the next
greatest number to X from the BST. If the number is not present, return 1.
Round: Other Interview
Experience: and code for it on paper. The two problems were based on data structures.
a) Given a binary tree, find the ancestor matrix where time complexity was considered
but not much than the written code.
Given tree :
root > 1
/ \
2 3
/ \ \
4 5 6
The ancestor matrix is shown as
1 2 3 4 5 6
1 0 1 1 1 1 1
2 0 0 0 1 1 0
3 0 0 0 0 0 1
4 0 0 0 0 0 0
5 0 0 0 0 0 0
6 0 0 0 0 0 0
Let the above matrix would m[][] such that m[i][j] = 1 , where i is the ancestor of j.
b) The second question was to swap every consecutive two nodes in a singly linked list.
For example given a list 1234567null
The result must be 2143657 null
For the above both questions , the interviewer saw the code and reviewed it with
different test cases to get satisfied.
Round: Hr cum technical
Experience: This was a HR cum technical round, but most of the questions were straight forward.
The two managers who interviewed me were testing my managerial skillls. Lot of questions
arised and the interview went for more than a hour. Few questions were like :
a) What do you know about Amazon ?
b) Why I preferred Amazon.com to my previous offer ?
c) The responsibilites which I undertook during my college days with brief explanations
on every responsible task which I did !!
d) Any projects which I did apart from academics ?? I explained about my android
project which I did with my elder brother.
At the end the round ended with a simple technical question =>
I was asked to design a stack using a c++ class such that it can perform the following
functions which will be called by different APIs :
Create a stack of size ‘n’
Push an element into the stack
Pop an element from the stack
Destroy the stack
At the end of this round, I asked about their experiences at Amazon.com and about my
work/role at amazon in future.
Round: Technical Interview
Experience: Coming to the fourth round, it was totally technical. Technical here covers theortical topic
from the fields of Operating systems, OOPS and Networks. The questions which were asked
were :
a) What is the difference between physical address and virtual address ?
b) What is page table and paging ?
c) What is the difference between thread and process ?
d) What is context switch and how it differs between process and threads ?
e) What are threads and why are threads preferred to process ?
f) What are semaphores and differnce between semaphores and locks ??
g) What are the 7 OSI layers in networks and their functionalities ?? He mostly asked
about transport and network layers.
h) What is encapsulation ?
i) What is polymorphism and their types ??
j) What is differnce between polymorphism and function overloading ??
k) The last question was to design / implement a singleton class .
Here this round ended, but I made many sothapals without sufficient preparation :P
Interview No 5
This interview was also HR cum technical round but it was known as a bar raiser round.
I am not sure how to spell it too. The questions were almost the same as in the 3rd interview
with additional questions like “ how did you react in conflicting situations in four year career ? “.
This round also ended with technical questions :
a) Given a doubly linked list where the next pointer is pointed to the next node in
that list but the previous pointer is pointing to any random node. I was asked to make a
similar list efficiently . [ Simply a xerox of it ]
b) The second question was a string based traversing and pattern matting type
where there were given two strings ‘A’ and ‘B’.
I was asked to return true if all the characters in ‘B’ were present in ‘A’ or else
return false. I explain many solutions in which he asked me to code for a particular
solution and he verified the code by iterating though the test cases.
The round ended with few personal questions on experience and my future role. So, I was into
Amazon after a week of discussions
Skills:
College Name: Anna University Chennai
Interview Questions of Popular Companies
- LMW Textile Machinery Division Interview Questions
- Sundaram Clayton Interview Questions
- Accenture Interview Questions
- Akamai Technologies Interview Questions
- Amazon Interview Questions
- American Megatrends Interview Questions
- Anna University Interview Questions
- Ashok Leyland Interview Questions
- Show more
Campus Placement Interview Questions at Top Colleges
- Indian Institute of Technology (IIT), Chennai Placement Interview Questions
- Maharaja Agrasen Institute of Technology, Delhi Placement Interview Questions
- National Institute of Technology (NIT), Warangal Placement Interview Questions
- Indian Institute of Management (IIM), Lucknow Placement Interview Questions
- Indian Institute of Technology (IIT), Kanpur Placement Interview Questions
- Show more
Recently Viewed
INTERVIEWS
Zoho
No Interviews
SALARIES
IVTL Infoview Technologies
INTERVIEWS
Sunil Hitech Engineers
No Interviews
COMPANY BENEFITS
IVTL Infoview Technologies
No Benefits
INTERVIEWS
Border Roads Organisation
No Interviews
COMPANY BENEFITS
Petron Engineering Construction
No Benefits
SALARIES
Petron Engineering Construction
No Salaries
INTERVIEWS
IJM (India) Infrastructure
No Interviews
REVIEWS
Petron Engineering Construction
No Reviews
REVIEWS
IVTL Infoview Technologies
No Reviews
- Home >
- colleges >
- anna university placement interview questions
Calculate your in-hand salary
Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and
get your in-hand salary
Feedback
