COIMBATORE INSTITUTE OF TECHNOLOGY, COIMBATORE-641014
(Government Aided Autonomous Institution, Affiliated to Anna University, Chennai)
DEPARTMENT OF PLACEMENT CELL
ACADEMIC YEAR 2025-26
STUDENT FEEDBACK
Student Name : ASHOK M J
Roll number : 7176 22 07 005
Department : B.Tech Information Technology
Contact number : 8870573421
Company name : TOSHIBA
Company type : CORE
Salary (ctc) : 10.5
Intern offered : YES
Bond : NO
COMMENTS ON SELECTION PROCESS:
ROUND 1
Platform used: Mettle
Round details: Consists of 51 questions in total
1 – Problem Solving using C programming
C Programming Output based Question
Logical and Arithmetic Aptitude
Topics/Areas Covered: C programming, Logical Aptitude, Arithmetic Aptitude.
Your Comments : The online test covers basic C programming, aptitude questions, and
simple coding snippets . Since the total time is just 65 minutes, make sure to manage your
time well. Don’t get stuck trying to fix every test case in coding save enough time for the
aptitude section too.
Did you clear this round? Yes
Details about questions on 1st round:
DOMAIN QUESTION Your Approach / REFERENCES
Solution (If any)
C Given an array of Integers we have to First Iterate the
programming return the set of integers that has the array and change
number of ones in their binary as same the each number
as the input to binary and kept
a count variable to
store the number
of ones in it , If
equal to the input
then return it.
C Output 10 Code Snippets , logical Questions etc
Logical Pattern Finding and Seating
Aptitude Arrangements.
Arithmetic Time and Work, Profit Loss, Average,
Aptitude Ratio and percentage, Data
Interpretation etc
ROUND 2 : Technical Interview
Platform used: Offline
Round details: Technical Interview 1
Topics/Areas Covered: C programming (Sorting Array (any sorting algorithm), Bit
manipulation, DSA (Linked List) , Puzzle and your Projects.
Your Comments: Basic C programming Knowledge , Bit manipulation , DSA (mostly Linear
Data Structures).
Did you clear this round? Yes
Details about Questions on 2ndround:
DOMAIN QUESTION Your Approach / REFERENCES
Solution (If any)
C Sort an Array using any Sorting I used Bubble sort C Program to Sort
programming algorithm to sort the array. an Array in
Ascending Order -
GeeksforGeeks
Bit The Interviewer asked to write a C code Set, Clear and
Manipulation for the setting and clearing a bit Toggle a Given Bit of
a Number in C -
GeeksforGeeks
DSA You are given two linked lists. Write an I Iterated through
code to return a single linked list both linked lists one
containing only the unique elements by by one. If a value
removing the common (duplicate) was found in both
lists, I removed it
nodes found in both lists
from the first list. If a
value was only in the
second list and not
in the first, I added it
to the first list. In the
end, the first list had
only the unique
values from both
lists.
Puzzle A car has 4 tyres and 1 spare tyre. Each I drew four tyres and Puzzle 29 | (Car
tyre can travel a maximum distance of subtracted 5000km Wheel Puzzle) -
20000 km before wearing off. What is from each tyres and GeeksforGeeks
the maximum distance the car can changed the spare
tyre for each
travel
5000km …finally we
get a answer of
25000km
Project Asked to explain my project in detail
and the technology stacks and the
software used also asked to explain
why the technology is used.
ROUND 3
Platform used: Offline
Round details: Technical Interview 2
Topics/Areas Covered: C programming , DSA, OS and Puzzle Solving
Your Comments: A Basic Knowledge in C programming and Data Structures ( Most probably
Linear Data Structures ) , Puzzle Solving and Logical Thinking.
Did you clear this round? Yes
Details about questions on 3rd round:
DOMAIN QUESTION Your Approach / REFERENCES
Solution (If any)
DSA Remove the duplicate elements from the Iterated through Remove
linked list. the linked list and Duplicates from
removed the node an Unsorted
when a duplicate Linked List -
elements present GeeksforGeeks
in it.
DSA Given a two sorted Linked List and we Iterated through Merge two
have to return a single sorted list in a both the list when sorted linked
sorted manner an element in 2nd lists -
list is less than the GeeksforGeeks
element in the 1st
list add in between
the list and so on.
C Given an Array find the perfect square Using a loop find Count array
programming numbers in the array. the perfect square elements
elements below whose perfect
the array element squares are
and if matched present in the
return it . given array -
GeeksforGeeks
OS Asked question about memory
management in OS
Puzzle 3 monkeys and 3 humans crossing river I tired different River crossing
Solving puzzle ( 1 Mother monkey and 2 baby combinations puzzle 3
monkey only the mother monkey can several times to monkeys and 3
row the boat ) find the result humans |
Suresolv
ROUND 4
Platform used: Offline
Round details: General HR
Topics/Areas Covered: Asked about Motives of the project, Hobbies , Family background
and general behavioural questions to analyse my character.
Your Comments: Not so tough , Only general questions were asked. Questions are asked
based on your answers, So think before you say any answers .
Did you clear this round? Yes
Areas to prepare :
1. C programming
2. Data Structures and Algorithm
3. Puzzle Solving
4. Operating Systems
5. Bit manipulation.
Sites / books you suggest for preparation for the process :
1. Geeks for Geeks (OS and Programming concepts)
2. Indiabix (Aptitude)
3. Leetcode (Coding)
4. SureSolv (Puzzles and Problem Solving )
Overall experience : It was my first job interview, I was too stressed about the Interview
process but the interview panels was so friendly and supportive which made me even more
confident and strong enough to answer the questions. The topics discussed in the interview
were all from the knowledge that I have gained from the academics.
General tips: Be confident don’t get stressed too much, be clear in what you speak , have a
good and well structured resume , know your resume well , What you study doesn’t matters
but how you express your knowledge in the interview matters. Do well ALL THE BEST
