i
NR Switch N Radio
Services
Filter interviews by
I applied via Approached by Company and was interviewed before Nov 2023. There was 1 interview round.
I have over five years of experience in telecommunications, focusing on field maintenance and troubleshooting.
Worked on installation and maintenance of fiber optic networks, ensuring high-speed connectivity.
Conducted routine inspections and repairs on telecommunications equipment, reducing downtime by 20%.
Collaborated with cross-functional teams to implement network upgrades, enhancing overall system performance.
Traine...
Top trending discussions
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.
posted on 20 Jul 2023
I applied via Referral and was interviewed in Jun 2023. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in Mar 2021. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Apr 2022. There were 6 interview rounds.
Online hackerrank test
Online hacker rank test
posted on 3 Jul 2024
I applied via Walk-in and was interviewed before Jul 2023. There was 1 interview round.
I applied via Referral and was interviewed before May 2021. There were 2 interview rounds.
I applied via Referral and was interviewed before Jul 2022. There were 3 interview rounds.
Python coding. Classes . Regex.
I applied via Recruitment Consulltant and was interviewed in Sep 2022. There were 2 interview rounds.
Easy and average coding ques and oops concepts
based on 1 interview experience
Difficulty level
Duration
based on 21 reviews
Rating in categories
Network Engineer
112
salaries
| ₹3.4 L/yr - ₹8 L/yr |
RF Engineer
55
salaries
| ₹2 L/yr - ₹4.9 L/yr |
Field Maintenance Engineer
52
salaries
| ₹2.4 L/yr - ₹4.5 L/yr |
FME Engineer
38
salaries
| ₹2.5 L/yr - ₹5.2 L/yr |
Engineer
27
salaries
| ₹2.2 L/yr - ₹4.7 L/yr |
Tata Communications Transformation Services
CommScope
Ciena
Tikona Infinet