Infosys Specialist Programmer Interview Questions, Process, and Tips for Freshers

Infosys conducts coding assessment on the HackWithInfy platform. The assessment includes a medium-level problem & the rest are hard-level similar to LeetCode's. The total duration of the test is 3 hours.

Q1. The question is based on string and it is a hard-level question. (I can't recognise it now)
Add your answer
Q2. Reverse the linked list.. i solved it by floyed warshall algorithm then interviwer tell me solve it recursive way.
Add your answer
Q3. What is deadlock in OS & how it overcome?
Ans. 
Deadlock in OS occurs when two or more processes are unable to proceed because each is waiting for the other to release a resource.
• Deadlock happens when processes have acquired resources but are waiting for additional resources that are held by other processes.

• Four conditions must hold for deadlock to occur: mutual exclusion, hold and wait, no preemption, and circular wait.

• Deadlock can be prevented by using techniques ...read more
Answered by AI
Add your answer
Q4. Which are the process scheduling algorithms and explain each algorithm.
Ans. 
Process scheduling algorithms determine the order in which processes are executed by the CPU.
• First Come First Serve (FCFS) - Processes are executed in the order they arrive.

• Shortest Job Next (SJN) - Process with the shortest burst time is executed next.

• Round Robin (RR) - Each process is assigned a fixed time slice for execution.

• Priority Scheduling - Processes are executed based on priority levels assigned to them.

• Multi...read more
Answered by AI
Add your answer
Q5. What are the joins in DBMS and explain each join
Ans. 
Joins in DBMS are used to combine rows from two or more tables based on a related column between them.
• Inner Join: Returns rows when there is at least one match in both tables.

• Left Join: Returns all rows from the left table and the matched rows from the right table.

• Right Join: Returns all rows from the right table and the matched rows from the left table.

• Full Outer Join: Returns rows when there is a match in one of the ...read more
Answered by AI
Add your answer
Q6. Write a SQL query to print n'th highest salary with full details
Ans. 
SQL query to retrieve the n'th highest salary with full details
• Use the ORDER BY clause to sort salaries in descending order

• Use the LIMIT clause to retrieve the n'th highest salary

• Join with the employee table to get full details
Answered by AI
Add your answer
Q7. What are late binding and early binding?
Ans. 
Late binding and early binding are concepts in programming related to when the binding of a method to its implementation occurs.
• Early binding refers to the process of linking a method call to the method implementation at compile time.

• Late binding refers to the process of linking a method call to the method implementation at runtime.

• Early binding is also known as static binding, while late binding is also known as dynam...read more
Answered by AI
Add your answer
Q8. What is inheritance and explain each type
Ans. 
Inheritance is a concept in object-oriented programming where a class inherits properties and behaviors from another class.
• Types of inheritance: single inheritance, multiple inheritance, multilevel inheritance, hierarchical inheritance, hybrid inheritance

• Single inheritance: a class inherits from only one base class

• Multiple inheritance: a class inherits from multiple base classes

• Multilevel inheritance: a class inherits ...read more
Answered by AI
Add your answer

It was from moderate to difficult.

Q1. 3 DSA questions
Add your answer
Q2. Breif about projects and resume
Add your answer

I attempted HackWithInfy 2024 where I got medium-hard coding questions

Q1. Resume screening, Project Discussion
Add your answer
Q2. DSA, core subjects
Add your answer

There will be a coding assesment in round 1. They won't give uou any notice for that. Be prepared

Q1. In round 2 there will be more specialised questions regarding the specific stream you are trying to get into. Eg. In my case big data, there was questions regarding hadoop architecture and pyspark
Add your answer
Q2. Given a list of natural numbers, find the largest increasing subsequence from it
Ans. 
Find the largest increasing subsequence from a list of natural numbers
• Use dynamic programming to keep track of the longest increasing subsequence ending at each index

• Iterate through the list and update the longest increasing subsequence for each element

• Return the maximum length of the increasing subsequence
Answered by AI
Add your answer