Filter interviews by
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 appeared for an interview 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
Designing a messaging system like WhatsApp
Choose a reliable and scalable backend technology like Node.js
Implement end-to-end encryption for secure communication
Use push notifications for real-time messaging
Allow users to create groups and broadcast messages
Provide features like voice and video calling
Ensure data privacy and compliance with regulations
Design a user-friendly interface for easy navigation
I applied via Campus Placement
Online aptitude test was there it was easy basics of logic and maths were asked
Group discussion was a bit hard the topic was advantages and disadvantages of ai in decision making
Java OOPs concept is a programming paradigm that focuses on objects and their interactions.
OOPs stands for Object-Oriented Programming System
It is based on the concepts of classes and objects
Encapsulation, Inheritance, Polymorphism, and Abstraction are the four main pillars of OOPs
Java supports all the OOPs concepts
Example: A class 'Car' can have properties like 'color', 'model', and 'year' and methods like 'start', 's...
I appeared for an interview before May 2022.
I applied via Campus Placement and was interviewed in Jan 2023. There were 5 interview rounds.
First round was aptitude test which include both aptitude (cognitive, logical reasoning,verbal) questions and technical questions related to java advanced java sql and Linux.
I applied via Campus Placement and was interviewed in Jan 2024. There were 3 interview rounds.
Selection sort is a simple sorting algorithm that repeatedly selects the minimum element from an unsorted portion of the array and swaps it with the first element.
Iterate through the array and find the minimum element
Swap the minimum element with the first element
Repeat the process for the remaining unsorted portion of the array
A critical section is a part of a program where shared resources are accessed and must be protected from concurrent access.
Critical sections are used to prevent race conditions and ensure data integrity.
They are typically protected using locks or other synchronization mechanisms.
Only one thread can execute the critical section at a time.
Examples include accessing a shared database, updating a global variable, or modify...
I applied via Naukri.com and was interviewed in Jul 2024. There were 3 interview rounds.
HashMap is a key-value pair collection while HashSet is a collection of unique elements.
HashMap stores key-value pairs while HashSet stores unique elements
HashMap allows duplicate values but keys must be unique, HashSet does not allow duplicates
HashMap uses keys to retrieve values, HashSet does not have keys
Lookup annotation in Spring Boot is used to indicate that a method should be cached for faster retrieval.
Lookup annotation is used in conjunction with @Cacheable annotation to cache the result of a method.
It is commonly used in Spring Boot applications to improve performance by caching frequently accessed data.
Example: @Lookup @Cacheable("books") public List
Memory management in Java refers to the process of allocating and deallocating memory for objects in the Java Virtual Machine (JVM).
Java uses automatic memory management through garbage collection to handle memory allocation and deallocation.
Memory in Java is divided into two main areas: stack memory and heap memory.
Stack memory is used for storing primitive data types and references to objects, while heap memory is us...
A thread pool is a collection of worker threads that efficiently execute asynchronous tasks.
Thread pool helps in managing and reusing a pool of threads to execute tasks concurrently.
It improves performance by reducing the overhead of creating new threads for each task.
Thread pool can limit the number of concurrent threads to prevent resource exhaustion.
Examples include Java's Executor framework and .NET's ThreadPool cl...
Some of the top questions asked at the RadiSys Software Engineer interview for freshers -
based on 1 interview experience
Difficulty level
Duration
based on 69 reviews
Rating in categories
Lead Engineer
272
salaries
| ₹14 L/yr - ₹42.2 L/yr |
Senior Software Engineer
271
salaries
| ₹10.5 L/yr - ₹34 L/yr |
Software Engineer
262
salaries
| ₹6 L/yr - ₹18 L/yr |
Staff Engineer
193
salaries
| ₹20 L/yr - ₹52 L/yr |
Senior Engineer
145
salaries
| ₹10.5 L/yr - ₹34 L/yr |
Motorola Solutions
HFCL Limited
Ciena
CommScope