Filter interviews by
Clear (1)
I applied via Recruitment Consulltant and was interviewed before Jul 2023. There were 3 interview rounds.
Puzzles and c++ related questions were asked
Data structure and algorith reltaed questions were asked
I applied via Campus Placement and was interviewed before Feb 2023. There were 3 interview rounds.
Normal MCQ questions from different computer science subjects
I applied via Job Fair and was interviewed before Aug 2022. There were 3 interview rounds.
It was way easy. Had concepts of speed and permutations.
RadiSys interview questions for designations
I was interviewed in Oct 2020.
Round duration - 70 Minutes
Round difficulty - Hard
It started around 11 Am on MS teams.
There was only 1 interviewer.
The interviewer asked questions from almost every concept, whatever I mentioned in my resume.
Data Structure and Algorithms: Complete heap Sort(Full code on pen and paper), check a number is a power of 2 or not, and some follow-up questions on data structure and algorithms.
OS: Scheduling algorithms, Round Robin(implementation), Process States, and some follow-up questions on that also.
OOPS: Virtual Functions, Copy Constructors, Runtime Polymorphism, Destructors with their implementation, and lots of follows up questions on that also. They gave more focus on oops concepts in c++ only. If you know oops concepts in c++ then you should be able to explain them well with proper implementation.
Project: Complete description, Database schema(Complete diagram on paper), Data flow diagram, and which technology used in projects. My project was on spring boot based web application with proper database design. They asked many questions related to the flow of the project and request methods(POST, PUT, UPDATE, DELETE).
And some other basic questions on projects as well. The duration of this round was almost a complete hour. 7 students shortlisted after 1 round.
Your task is to sort an array of integers in non-decreasing order using the Heap Sort algorithm.
The first line contains an integer 'T' denoting the number of test cas...
Heap Sort is used to sort an array of integers in non-decreasing order by creating a max heap and repeatedly extracting the maximum element.
Create a max heap from the input array.
Swap the root (maximum element) with the last element and reduce the heap size.
Heapify the root element to maintain the heap property.
Repeat the above steps until the heap size is 1.
The array will be sorted in non-decreasing order.
Ninja, who loves playing with numbers, sets out to arrange numbers within 'N' rows. The unique arrangement follows these rules: the first row contains 1 number, the second...
Generate a pattern of numbers in rows following a powers of 2 sequence with numbers 1 to 9, recycling back to 1.
Start with 1 number in the first row, 2 numbers in the second row, 4 numbers in the third row, and so on following powers of 2.
Fill the pattern with numbers from 1 to 9, recycling back to 1 after reaching 9.
Output the pattern for the given number of rows 'N'.
Example: For N = 4, the pattern would be 1, 2 3, 4
Tip 1 : Try to solve implementation questions on regular basis at least 1 per day.
Tip 2 : Make a proper Roadmap to complete all the DS concepts including some advanced DS concepts also like trie. Do an ample amount of questions from every topic. IMPORTANT: Learn implementation of DS like Hashmap, heap.
Tip 3 : Minimum 2 projects. One should be the database project.
Tip 4 : You should be good in problem-solving, bits manipulation, c/c++ language, OOPs, OS, and Networking.
Tip 1 : Well Organised
Tip 2 : At least 2 projects
Tip 3 : Go through to resume of good technical students.
Tip 4 : Personally, I do not prefer any template for a resume. You can easily make on Google docs or any word editor by yourself.
Top trending discussions
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
UDP is preferred over TCP in this project due to its low latency and lightweight nature.
UDP is a connectionless protocol, which means it does not establish a direct connection between the sender and receiver.
UDP is faster than TCP as it does not have the overhead of establishing and maintaining a connection.
UDP is suitable for applications where real-time data transmission is crucial, such as video streaming or online ...
To clear the 7th bit in a 32-bit register, perform a bitwise AND operation with a mask that has all bits set to 1 except the 7th bit.
Create a mask with the 7th bit set to 0 and all other bits set to 1
Perform a bitwise AND operation between the register and the mask
Store the result back in the register
I applied via Naukri.com and was interviewed before Jan 2023. There was 1 interview round.
Some of the top questions asked at the RadiSys Software Engineer interview -
based on 6 interviews
Interview experience
based on 65 reviews
Rating in categories
Lead Engineer
251
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
249
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
241
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
178
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
133
salaries
| ₹0 L/yr - ₹0 L/yr |
Intel
NXP Semiconductors
Texas Instruments
Analog Devices