VIS Networks Senior Technical Engineer Interview Questions and Answers

It was way easy. Had concepts of speed and permutations.

Q1. Questions were based on pure technical background, and whatever was mentioned in the resume
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 ...read more
Answered by AI
Add your answer

There is no fix platform for online coding, usually 1-2 Problem solving questions

Q1. Purely technical one-one or many-to-one round, asking from basic to advance questions Language Basics Computer Science Fundamentals Data Structures Programming concepts Frameworks Knowledge
Add your answer

Q1. Basics in ASP.net,sql server
Add your answer
Q2. Exception handling,drawback of cookies
Add your answer

Q1. Previous working experience
Add your answer

Q1. Asked about python knowledge
Add your answer

Q1. Python programs and robot framework
Add your answer

Easy and average coding ques and oops concepts

Q1. Asked abt resume and some oops concepts
Ans. I next mr round asked resume projects and given sql scenario
Answered Anonymously
Add your answer
Q2. Hr round simply abt ourslf
Add your answer

Basic Servicenow questions.
Client side server side best practices.

Basic serivicenow knowledge check.

Hands on PDI. Or on any instance.
Fixing the existing code.
Detailed discussion on technical experience

Q1. Techno managerial.
Add your answer
Q2. Why telstra and preferred location
Add your answer

A Hacker rank test was trigerred

Q1. Reverse a string
Add your answer
Q2. Move zeros in an array
Add your answer