Filter interviews by
Code development on a system - servlet and XML/XSLT based
I applied via Recruitment Consulltant
I applied via Naukri.com and was interviewed in Dec 2023. There were 2 interview rounds.
I applied via Walk-in and was interviewed before Jul 2023. There were 3 interview rounds.
I am a dedicated and passionate software engineer with a strong background in computer science.
I have a Bachelor's degree in Computer Science from XYZ University.
I have experience working on various programming languages such as Java, Python, and C++.
I have completed internships at ABC Company and DEF Company where I developed software solutions for real-world problems.
I am proficient in problem-solving and have a stro
SRIT interview questions for popular designations
Link aggregation is the process of combining multiple network connections to increase bandwidth and redundancy.
Link aggregation is also known as NIC teaming, bonding, or trunking.
It is commonly used in data centers and high-traffic networks.
Link aggregation can be implemented using various protocols such as LACP, PAgP, and static.
It provides load balancing and failover capabilities.
For example, if a server has two netw...
There are mainly three types of switches - unmanaged, managed and smart switches.
Unmanaged switches are plug-and-play devices that require no configuration. They are ideal for small networks.
Managed switches offer advanced features like VLAN, QoS, and security. They require configuration and are suitable for large networks.
Smart switches are a hybrid of unmanaged and managed switches. They offer some advanced features ...
A router is a networking device that forwards data packets between computer networks.
Routers connect multiple networks together
They use routing tables to determine the best path for data packets to travel
They can provide security by blocking unauthorized access to a network
Examples of routers include Cisco, Juniper, and TP-Link
I appeared for an interview in Mar 2020.
I appeared for an interview before Mar 2021.
Round duration - 30 minutes
Round difficulty - Medium
This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.
Round duration - 60 minutes
Round difficulty - Medium
In this test round, 2 coding questions were given. Either write the code or pseudo code
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate all valid configurations and print them out.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Detect if a given linked list is circular by checking if it forms a closed loop.
Traverse the linked list using two pointers, one moving at double the speed of the other.
If the two pointers meet at any point, the linked list is circular.
If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Round duration - 30 minutes
Round difficulty - Easy
HR round with typical behavioral problems.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
posted on 10 Nov 2015
based on 7 interviews
Interview experience
Associate Software Engineer
60
salaries
| ₹2.2 L/yr - ₹5 L/yr |
Software Engineer
50
salaries
| ₹2.3 L/yr - ₹9.8 L/yr |
Softwaretest Engineer
20
salaries
| ₹2.4 L/yr - ₹9.2 L/yr |
Software Developer
17
salaries
| ₹2.5 L/yr - ₹6.5 L/yr |
Senior Software Engineer
16
salaries
| ₹5.5 L/yr - ₹16.1 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions