Infosys Software Engineer Interview Questions, Process, and Tips

Great questions of reasoning, maths and essay also

Q1. Where & having clause
Add your answer

Q1. What is oops concept
Ans. 
Object-oriented programming paradigm that focuses on objects and classes for code organization and reusability.
• Encapsulation: Bundling data and methods that operate on the data into a single unit (class).

• Inheritance: Ability of a class to inherit properties and behavior from another class.

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

• Abstraction: Hiding the complex implementation details ...read more
Answered by AI
Add your answer
Q2. What is interface in c#
Ans. 
Interface in C# is a reference type that defines a contract for classes to implement certain methods and properties.
• Interfaces cannot have implementation, only method and property signatures

• Classes can implement multiple interfaces

• Interfaces are used for achieving abstraction and multiple inheritance in C#
Answered by AI
Add your answer

Q1. What is oops concept
Ans. 
Object-oriented programming paradigm focusing on objects and classes for code organization and reusability.
• Encapsulation: Bundling data and methods that operate on the data into a single unit (class).

• Inheritance: Ability of a class to inherit properties and behavior from another class.

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

• Abstraction: Hiding the complex implementation details and ...read more
Answered by AI
Add your answer
Q2. What is authentication
Ans. 
Authentication is the process of verifying the identity of a user or system.
• Authentication ensures that the user is who they claim to be before granting access to resources.

• Common authentication methods include passwords, biometrics, and two-factor authentication.

• Examples of authentication systems include login screens, fingerprint scanners, and security tokens.
Answered by AI
Add your answer

Q1. Stack vs Queue. Explain diff
Ans. 
Stack is Last In First Out (LIFO) data structure, while Queue is First In First Out (FIFO) data structure.
• Stack: elements are added and removed from the top of the stack. Example: browser history.

• Queue: elements are added at the rear and removed from the front of the queue. Example: waiting line at a ticket counter.
Answered by AI
Add your answer

Q1. Asked basic questions related to java, spring boot like what is internal working of hasmap
Add your answer
Q2. What would happen if we use component instead of repository or service annotation
Ans. 
Using component instead of repository or service annotation can lead to confusion and potential errors in the application.
• Components are typically used for defining Spring beans, while repositories and services are used for specific purposes like data access and business logic

• Using component annotation instead of repository can lead to ambiguity in the codebase

• Repositories and services have specific functionalities and...read more
Answered by AI
Add your answer

Q1. Height of Binary Tree
Ans. 
The height of a binary tree is the number of edges on the longest path from the root node to a leaf node.
• The height of an empty tree is -1.

• The height of a tree with only one node (the root) is 0.

• The height of a binary tree can be calculated recursively by finding the height of the left and right subtrees and adding 1 to the maximum of the two heights.
Answered by AI
Add your answer
Q2. Trapping RainWater
Add your answer
Q3. Find Maximum Subarray
Ans. 
Maximum Subarray problem involves finding the contiguous subarray with the largest sum.
• Use Kadane's algorithm to find the maximum subarray sum in O(n) time complexity.

• Initialize two variables - maxEndingHere and maxSoFar to keep track of current subarray sum and maximum subarray sum.

• Iterate through the array and update the variables accordingly.

• Example: Input array [1, -2, 3, -1, 2] should return 4 (subarray [3, -1, 2]
Answered by AI
Add your answer
Q4. Morris InOrder Traversal
Ans. 
Morris InOrder Traversal is a method to traverse a binary tree without using recursion or a stack.
• Start at the root node

• While current is not null, if current has no left child, visit current and move to right child. If current has left child, find the rightmost node in the left subtree and set it as the right child of current

• Repeat until all nodes are visited
Answered by AI
Add your answer
Q5. RestController Annotations
Add your answer