NR Switch N Radio Services Field Maintenance Engineer Interview Questions and Answers

There will be some mcq and coding questions.

Q1. This is will be a 30 mins interview.
Add your answer
Q2. Questions on python,networking,ds,os
Add your answer

Q1. Coding question on c,c++,python. Basics of networking ,oops and os.
Add your answer

It was JS question paper sheet.

30min duration C coding 10 questions asked

1hr duration interviewer will be giving some random C questions to code

Q1. System programming
Add your answer
Q2. System design, os concepts
Add your answer

Q1. Basic python questions
Add your answer

Q1. About your profile and project.
Add your answer

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 Problem Statement
Your task is to sort an array of integers in non-decreasing order using the Heap Sort algorithm.
Input:
The first line contains an integer 'T' denoting the number of test cas...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Ninja's Pattern with Powers of 2
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...read more
Ans. 
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
Answered by AI
Add your answer

The coding test was for 90 mins, and comprised of questions from topics such as DP and hashtables. It was taken on hackerrank platform

Q1. One question related to hashing (particularly about hashcode and equals method)
Add your answer
Q2. A variation of number of connected islands from graph
Ans. 
Count the number of connected islands in a graph
• Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the graph and mark visited nodes

• Keep track of the number of islands encountered during traversal

• An island is a group of connected 1s in a 2D grid, where '1' represents land and '0' represents water
Answered by AI
Add your answer

Q1. Thread synchronisation, print alternate numbers using 5 different threads
Ans. 
Use 5 threads to print alternate numbers with thread synchronization
• Create 5 threads, each responsible for printing a specific set of numbers

• Use mutex or semaphore to synchronize the threads

• Thread 1 prints odd numbers, Thread 2 prints even numbers, and so on

• Ensure proper handling of thread creation and synchronization

• Example: Thread 1 prints 1, 3, 5, ... Thread 2 prints 2, 4, 6, ...
Answered by AI
Add your answer
Q2. C++ Related questions were asked, in which I was asked about how can I find the size of Object, difference between malloc and calloc. What are semaphores and how are they used
Add your answer

Q1. Technical work experience mentioned in resume
Add your answer
Q2. Questions related to Golang concurrency
Add your answer