Filter interviews by
I applied via Referral and was interviewed in Feb 2024. There were 2 interview rounds.
Respectful and supportive people, be prepared for many technical questions about your field
I applied via Recruitment Consulltant and was interviewed in Apr 2022. There were 5 interview rounds.
Not interested to share...........
Not willing to share.............
Top trending discussions
I applied via LinkedIn and was interviewed before Mar 2022. There were 3 interview rounds.
In depth interview about projects related to job description
I applied via Recruitment Consultant and was interviewed in Jun 2020. There was 1 interview round.
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions on OOPS and OS mainly.
Little Endian and Big Endian refer to the order in which bytes are stored in computer memory.
Little Endian stores the least significant byte first, while Big Endian stores the most significant byte first.
Little Endian is commonly used in x86 architecture, while Big Endian is used in architectures like SPARC and PowerPC.
Endianness can affect data transmission between systems with different byte orders.
Program to determine system's endianness
Check the endianness by storing a multi-byte integer and checking the byte order
Use bitwise operations to extract the least significant byte
If the least significant byte is at the lowest memory address, it's little-endian
If the least significant byte is at the highest memory address, it's big-endian
The volatile keyword in programming is used to indicate that a variable's value can be changed unexpectedly.
Volatile keyword is used in multithreaded programming to prevent compiler optimizations on variables that can be changed by other threads.
It tells the compiler not to cache the variable's value in a register, ensuring that every access is made to the variable's memory location.
Commonly used in embedded systems pr...
Function pointers in C are used to store the address of functions, allowing for dynamic function calls and callbacks.
Function pointers can be used to implement callbacks in event-driven programming.
They can be used to switch between different functions at runtime.
Function pointers are commonly used in implementing data structures like function pointers in an array of function pointers.
Example: void (*funcPtr)(int) = &a
Design a data structure for multi-threading
Use a thread-safe queue to manage tasks for each thread
Implement a lock or semaphore to control access to shared resources
Consider using condition variables for synchronization
Use atomic operations for shared variables to prevent race conditions
The kernel is the core component of an operating system that manages system resources and provides a bridge between software and hardware.
Manages system resources such as CPU, memory, and I/O devices
Provides a bridge between software applications and hardware components
Handles tasks such as process scheduling, memory management, and device drivers
Controls communication between hardware and software layers
A storage class in programming defines the scope and lifetime of variables.
Storage classes include auto, register, static, and extern.
Auto variables are created when a function is called and destroyed when the function ends.
Register variables are stored in CPU registers for faster access.
Static variables retain their value between function calls.
Extern variables are declared outside of any function and can be accessed
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview before May 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Timing: Morning
How was the environment? It happened in the Computer Lab of my institution
All students were assigned a computer and we had to solve questions on hackerrank
Consider 'N' individuals numbered from 0 to N-1 standing in a queue. You are provided with two arrays: Height
and Infront
, each consisting of 'N' non-negative int...
The task is to find the actual order of people in a queue based on their heights and the number of taller people in front of them.
Iterate through the given arrays and create a list of tuples containing the height and number of taller people for each person.
Sort the list of tuples in descending order of height and ascending order of the number of taller people.
Create an empty result list and insert each tuple into the r...
Round duration - 60 Minutes
Round difficulty - Medium
Round was a mix of concepts from OOPS, OS and Problem Solving
Given a Binary Search Tree (BST) and a key value 'X', determine if there exists a node within the BST containing the value 'X'.
Consider the tree represe...
The task is to find if a given value is present in a Binary Search Tree (BST).
Start from the root node and compare the value with the target value.
If the value matches, return true.
If the target value is less than the current node value, move to the left child.
If the target value is greater than the current node value, move to the right child.
Repeat the process until a match is found or a leaf node is reached.
If a leaf...
Tip 1 : Try to code the data structures that you have learned to understand things better
Tip 2 : Try to solve the problem even if it is the worst possible solution you think and then try to optimize don't jump to get the
best possible solution
Tip 3 : Discuss things among peers it helps to improve the understanding, even try to teach someone anything new you learn, this is very helpful during the interviews as you will have habit of explaining things
Tip 1 : Try to be honest in the resume don't write something you don't know, most of the time it backfires.
Tip 2 : Try to make 2 good projects for cv and know about the challenges you can face on the project and think about how you can solve that challenge.
I appeared for an interview in May 2022.
Round duration - 60 Minutes
Round difficulty - Easy
The interviewer asked to tell me about myself and then asked some questions to solve like some questions on Lists, Strings and Numbers like comparing 2 strings, performing some operations on lists etc.
Given a string S
and a list wordList
containing N
distinct words, determine if each word in wordList
is present in S
. Return a boolean array where the value at index 'i' indi...
Given a string and a list of words, determine if each word in the list is present in the string and return a boolean array indicating their presence.
Iterate through each word in the word list and check if it is present in the string.
Use a boolean array to store the presence of each word in the string.
Remember that the presence of a word is case sensitive.
Do not use built-in string-matching methods.
Return the boolean ar
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Prepare basics of Programming like Lists and Strings.
Tip 2 : Algorithms for sorting and searching are very important for Coding interviews.
Tip 1 : Projects are a must on resume.
Tip 2 : Keep the resume simple but answer every question on resume very well.
I applied via Naukri.com and was interviewed in Jun 2022. There were 9 interview rounds.
Data structures and algorithms
Problem were from leetcode and geek for geeks.
Coding round , questions from leetcode
Situation based questions and thought process
based on 3 interviews
Interview experience
based on 50 reviews
Rating in categories
Project Engineer
43
salaries
| ₹2.4 L/yr - ₹9 L/yr |
Project Manager
17
salaries
| ₹9 L/yr - ₹16 L/yr |
Service Engineer
10
salaries
| ₹4 L/yr - ₹11.3 L/yr |
Customer Service Engineer
7
salaries
| ₹5.2 L/yr - ₹7.2 L/yr |
System Engineer
6
salaries
| ₹5.2 L/yr - ₹7.8 L/yr |
ivy
Nvidia
Terralogic Software Solutions
Gameskraft