Filter interviews by
I applied via Campus Placement and was interviewed in Nov 2024. There were 2 interview rounds.
The department is Quality Assurance.
Quality Assurance department ensures products meet quality standards
Responsible for testing, inspecting, and auditing products
Works to identify and resolve defects or issues in products
I applied via Recruitment Consulltant and was interviewed in Jun 2024. There was 1 interview round.
Ask about basic maths
I applied via Walk-in and was interviewed in Sep 2024. There were 2 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.
C is a general-purpose programming language developed by Dennis Ritchie in 1972.
C is used for developing operating systems, embedded systems, and system software.
It is a compiled language and has a low-level memory access.
C is the predecessor of many modern programming languages like C++, Java, and Python.
A loop is a programming structure that repeats a set of instructions until a certain condition is met.
Loops are used to iterate over a collection of data or to repeat a set of instructions a certain number of times.
There are three types of loops in most programming languages: for, while, and do-while.
Example: for (int i = 0; i < 10; i++) { // do something }
I applied via Naukri.com and was interviewed before Sep 2020. There were 3 interview rounds.
PPT on telecom industry
I applied via Campus Placement and was interviewed before Oct 2023. There were 3 interview rounds.
3 questions medium leetcode
Depth First Search (DFS) pseudo code
Initialize a stack to keep track of nodes to visit
Start with the initial node and push it onto the stack
While the stack is not empty, pop a node from the stack and visit its neighbors
Push unvisited neighbors onto the stack
Repeat until all nodes are visited
BFS (Breadth First Search) algorithm pseudo code
Start by enqueueing the starting node
While the queue is not empty, dequeue a node and process it
Enqueue all adjacent nodes that have not been visited yet
Repeat until all nodes have been visited
To find the middle of a linked list, use the slow and fast pointer technique.
Initialize two pointers, slow and fast, both pointing to the head of the linked list.
Move the slow pointer by one step and the fast pointer by two steps until the fast pointer reaches the end of the list.
The position of the slow pointer at this point will be the middle of the linked list.
I applied via Campus Placement and was interviewed in Jul 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Apr 2024. There were 3 interview rounds.
There were around 30 questions in aptitude
There are 2 coding questions
I applied via Referral and was interviewed in Aug 2024. There was 1 interview round.
I am a recent graduate with a degree in Computer Science and a passion for coding and problem-solving.
Graduated with a degree in Computer Science
Passionate about coding and problem-solving
Completed internships at tech companies
Proficient in programming languages like Java, Python, and C++
based on 2 interviews
Interview experience
Junior Engineer
942
salaries
| ₹2.4 L/yr - ₹4.6 L/yr |
Assistant Engineer
335
salaries
| ₹3 L/yr - ₹7.7 L/yr |
Diploma Trainee Engineer
224
salaries
| ₹1.8 L/yr - ₹3.2 L/yr |
Engineer
219
salaries
| ₹3 L/yr - ₹8.9 L/yr |
Assistant Manager
178
salaries
| ₹7 L/yr - ₹17 L/yr |
Dell
HARMAN
Vivo
OPPO