SISL Infotech Front end Developer Interview Questions and Answers

In aptitude test there are multiple choice questions . mathematics ,logical,regening etc

Q1. Introduction your self? Good morning sir,mam Thank you for giving me this opportunity to introduce myself My name is mamta. I am from butibori in Maharashtra I am completed my bachelor degree in computer...read more
Add your answer
Q2. Why java is independent?
Ans. 
Java is independent because of its platform-independent nature.
• Java code is compiled into bytecode which can run on any platform with a JVM.

• It follows the 'Write Once, Run Anywhere' (WORA) principle.

• Java's platform independence is achieved through its architecture and class libraries.

• Java's platform independence makes it a popular choice for developing cross-platform applications.
Answered by AI
Add your answer
Q3. What is final keywords?
Ans. 
final keyword is used in Java to make a variable, method or class unchangeable or unextendable.
• final variables cannot be reassigned

• final methods cannot be overridden

• final classes cannot be extended

• final keyword is used for optimization in Java

• final keyword is used to ensure immutability in Java
Answered by AI
Add your answer

I am completed servey in ration card

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

Q1. 
N Queens Problem
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.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
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).
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

Q1. 
Reverse Words in a String: Problem Statement
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...read more
Ans. 
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
Answered by AI
Add your answer
Q2. 
Circular Linked List Detection
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Note:
• A linked list is considered circula...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Not hard

Q1. On java sql and related
Add your answer
Q2. Interview questions on java , SQL and basic queries on joins and coding questions on string manipulation and linked list . Also they ask about trees and graphs.
Add your answer

Q1. Common HR questions and related
Add your answer

DSA coding 2-3 question

Java, DSA coding, java 8 coding, multithreading

Java8, spring-boot, DSA coding

Q1. DSA coding, java 8 coding, spring boot, mysql
Add your answer

Competitive coding, multiple choice questions

Q1. CS fundamentals, Object oriented programming, Networking, SQL
Add your answer
Q2. Explain 4 concept of OOPS
Ans. 
OOPS concepts include Inheritance, Encapsulation, Polymorphism, and Abstraction.
• Inheritance: Allows a class to inherit properties and behavior from another class.

• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Polymorphism: Ability to present the same interface for different data types.

• Abstraction: Hiding the complex implementation details and showing only the necessary features.
Answered by AI
Add your answer
Q3. Explain subnet in networking
Ans. 
A subnet is a smaller network within a larger network, created by dividing the IP address range of the larger network.
• Subnets help in organizing and managing network resources efficiently.

• They allow for better security by isolating different parts of the network.

• Subnets can be created by dividing an IP address range into smaller ranges.

• For example, a company may have different subnets for different departments like HR,
Answered by AI
Add your answer
Q4. Concepts of Operating system
Add your answer

Q1. Behavioral questions, questions related to project, questions related to internship
Add your answer

It was an 1hr interview session

Q1. Find the occurrence of each element in an array
Ans. 
Count the occurrence of each element in an array of strings
• Iterate through the array and use a hashmap to store the count of each element

• If element already exists in the hashmap, increment its count by 1

• Return the hashmap with element counts
Answered by AI
Add your answer

Q1. Tell me about yourself
Add your answer