Shriram Institute for Industrial Research IT EDP Manager Interview Questions and Answers

Be ready for an aptitude test if you don't have experience, otherwise, this might be an HR or technical round.

Q1. Questions about the basics of Python and SQL
Add your answer

Q1. This round will be with the VP of technology or a technical manager. Prepare for Puzzle solving and some overview level questions like your interests, why tech, Why analytics, interests in tech, et al.
Add your answer

Basic coding on arrays, linked lists and trees.

Q1. Threading in general and how to implement in python.
Ans. 
Threading is a way to execute multiple threads simultaneously. Python has a threading module to implement it.
• Threading allows for concurrent execution of multiple threads.

• Python's threading module provides a way to create and manage threads.

• Threads can be created by subclassing the Thread class or by passing a callable to the constructor.

• The GIL (Global Interpreter Lock) in Python limits true parallelism, but threading...read more
Answered by AI
Add your answer
Q2. Mutable and immutable difference.
Ans. 
Mutable objects can be changed after creation, while immutable objects cannot be changed.
• Mutable objects can have their values modified after creation, while immutable objects cannot.

• Examples of mutable objects include lists, dictionaries, and sets.

• Examples of immutable objects include strings, tuples, and frozensets.
Answered by AI
Add your answer
Q3. Rain water trap DSA problem
Ans. 
The Rain water trap DSA problem involves calculating the amount of rainwater that can be trapped between given bars.
• The problem involves finding the maximum height of bars on either side of a given bar.

• Calculate the difference between the maximum height and the height of the given bar to get the amount of water trapped.

• Repeat the above steps for all bars to get the total amount of water trapped.
Answered by AI
Add your answer
Q4. Depth Frist search Graph application problem.
Ans. 
DFS is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
• DFS can be used to find connected components in a graph.

• It can also be used to detect cycles in a graph.

• DFS can be implemented using recursion or a stack.

• DFS is not guaranteed to find the shortest path in a graph.

• DFS can be used to solve problems such as maze traversal and topological sorting.
Answered by AI
Add your answer