Filter interviews by
To create, delete, and modify VLAN, VTP, STP, NAT, OSPF, EIGRP, etc., use network management tools and configure appropriate settings.
Use VLAN management software or switch CLI to create, delete, and modify VLANs.
Configure VTP (VLAN Trunking Protocol) settings on switches to manage VLAN database.
Modify STP (Spanning Tree Protocol) settings to control network loop prevention.
Configure NAT (Network Address Translation) o...
I applied via Naukri.com and was interviewed in Sep 2018. There were 4 interview rounds.
I am a dedicated and experienced network engineer with a passion for troubleshooting and problem-solving.
Experienced in configuring and maintaining network devices such as routers and switches
Skilled in troubleshooting network issues and implementing solutions
Strong knowledge of network protocols and technologies
Certified in Cisco CCNA and CCNP
Excellent communication and teamwork skills
Velocis is a network management software company.
Velocis is a well-known network management software company.
They provide solutions for network monitoring, troubleshooting, and optimization.
Their software helps network engineers in managing and maintaining network infrastructure.
Velocis offers features like real-time monitoring, performance analysis, and reporting.
Their products are widely used in the IT industry by ne
I want to join because of the company's reputation and growth opportunities.
I am impressed by the company's reputation in the industry.
I believe in the company's mission and values.
I see great potential for growth and career advancement.
I am excited about the opportunity to work with a talented team.
I am confident that this company will provide a challenging and rewarding work environment.
I am a dedicated and experienced network engineer with a passion for technology and problem-solving.
I have been working in the field of networking for the past 5 years, gaining valuable experience in troubleshooting and maintaining network infrastructure.
I am currently living with my family, who provide me with support and encouragement in my career.
I chose Velocis because of its reputation for innovation and cutting-e...
Top trending discussions
I applied via Naukri.com and was interviewed in May 2021. There was 1 interview round.
I appeared for an interview in Sep 2020.
I applied via Approached by Company and was interviewed before May 2021. There were 3 interview rounds.
Multiple choice questions
I appeared for an interview before Oct 2021.
A nested list is a list that contains other lists as its elements.
Nested lists can be created using square brackets and separating the elements with commas.
Elements of a nested list can be accessed using indexing and slicing.
Example: my_list = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
Accessing element 5: my_list[1][1]
A queue is a data structure that follows the First In First Out (FIFO) principle.
Elements are added to the back of the queue and removed from the front.
Example: A line of people waiting for a movie ticket.
Operations: Enqueue (add element to back), Dequeue (remove element from front), Peek (view front element)
posted on 27 Jul 2022
I applied via Campus Placement and was interviewed before Jul 2021. There were 5 interview rounds.
Round 1 was about 60 mins long. Basic Aptitude questions along with Programming MCQ
Round 2 had 2 coding questions with a time limit of 60mins. Intermediate level problem solving
knowledge is neccessary.
posted on 13 Dec 2021
I applied via Naukri.com and was interviewed in Jun 2021. There was 1 interview round.
posted on 24 Jan 2022
I applied via Campus Placement and was interviewed before Jan 2021. There were 3 interview rounds.
Code to split an array of integers into two subarrays with equal sum.
Iterate through the array and calculate the total sum.
Divide the sum by 2 to get the target sum for each subarray.
Use dynamic programming to find a subset of the array that adds up to the target sum.
Return the two subarrays.
Example: [1, 2, 3, 4, 5, 6] -> [1, 2, 3, 6], [4, 5]
Example: [1, 2, 3, 4, 5] -> [1, 4, 5], [2, 3]
Implementing a binary search tree and its traversal methods.
Start by defining a Node class with left and right child pointers.
Implement insert() method to add nodes to the tree.
Implement inorder(), preorder(), and postorder() traversal methods.
Implement search() method to find a node in the tree.
Implement delete() method to remove a node from the tree.
Consider edge cases like empty tree, duplicate nodes, etc.
based on 7 reviews
Rating in categories
Network Engineer
373
salaries
| ₹1.5 L/yr - ₹8.1 L/yr |
Software Developer
268
salaries
| ₹2.5 L/yr - ₹10.1 L/yr |
Senior Software Developer
223
salaries
| ₹3.6 L/yr - ₹15 L/yr |
Senior Software Engineer
139
salaries
| ₹4.4 L/yr - ₹15.8 L/yr |
Software Engineer
137
salaries
| ₹2.6 L/yr - ₹13.3 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant