RadiSys Software Engineer Interview Questions and Answers

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.

Q1. Heap Sort
You are given an array ‘ARR’ consisting of 'N' integers, and your task is to sort the given array in non-decreasing order using the Heap sort algorithm.
Input Format:
The first line of ...read more
Ans. Heap Sort
Approach: 
• Heapsort is a sorting algorithm based on the heap data structure.
• In this algorithm, we will first convert the given array into a max heap.
• The max heap is a special kind of binary tree with the following properties:
  • It is a complete binary tree.
  • The element present at the root node is the largest among all of its children.
• Since max heap is a complete binary tree, hence it can be converted into an a...read more
Answered by CodingNinjas
Add your answer
Q2. Ninja and power of 2
Ninja loves playing with numbers. So one day, he wants to arrange a few numbers in the ‘N’ number of rows. The first row contains 1 number, the second row has two numbers, the third ro...read more
Ans. Brute force
The key here is to traverse all the lines sequentially, and for each line, we print the required character at the given index.
The steps are as follows:
• We define an ‘ans’ matrix to store the final pattern.
• We initialize a variable ‘k’ to 1, which will be the starting value for the pattern.
• We will iterate over all the rows, i.e., i = 0 to N - 1:
• We will run a for loop starting from 0 and less than 2 ^ i.
• If k is ...read more
Answered by CodingNinjas
Add your answer