New Indictrans Technologies Associate Software Trainee Interview Questions and Answers

Q1. C# question on basics and advanced
Add your answer

Q1. Salary discussion
Add your answer

Q1. How is GIL and how python handle multi threading
Ans. 
GIL stands for Global Interpreter Lock in Python, which limits execution of multiple threads at once.
• GIL is a mutex that protects access to Python objects, preventing multiple threads from executing Python bytecodes at once.

• Due to GIL, Python threads are not suitable for CPU-bound tasks but are still useful for I/O-bound tasks.

• To handle multi-threading in Python, one can use multiprocessing module or asynchronous progr...read more
Answered by AI
Add your answer
Q2. Explain How React works under the hood.
Ans. 
React uses a virtual DOM to efficiently update the actual DOM based on changes in state or props.
• React creates a virtual DOM representation of the actual DOM.

• When state or props change, React compares the virtual DOM with the actual DOM to determine the minimal set of changes needed.

• React then updates the actual DOM efficiently to reflect the changes.
Answered by AI
Add your answer

First time attend aptitude test .

Q1. Any computer engineering basic questions
Add your answer
Q2. C,C++,java , python
Add your answer
Q3. What is inheritance.how many times of inheritance.
Ans. 
Inheritance is a concept in object-oriented programming where a class can inherit attributes and methods from another class.
• Inheritance allows for code reusability and promotes the concept of 'is-a' relationship.

• There are different types of inheritance such as single inheritance, multiple inheritance, multilevel inheritance, and hierarchical inheritance.

• Example: Class B inheriting from Class A - 'class B: public A {}'
Answered by AI
View 1 more answer
Q4. How many characters are used in C.
Ans. 
C uses a set of 128 characters, including letters, digits, special characters, and control characters.
• C uses 26 letters (uppercase and lowercase), 10 digits (0-9), and various special characters like !, @, #, $, %, etc.

• C also includes control characters like newline, tab, carriage return, etc.

• The total number of characters used in C is 128.
Answered by AI
Add your answer
Q5. What is c. How many characters are used.
Ans. 
C is a programming language known for its efficiency and flexibility. It uses 256 characters.
• C is a high-level programming language used for system programming, embedded systems, and applications.

• C uses 256 characters, including letters, digits, special characters, and whitespace.

• Examples of characters in C include 'a', '1', '+', and ' '.
Answered by AI
Add your answer

Q1. Scenerio based questions
Add your answer

Q1. Basics of your technical skills
Add your answer

Q1. More Projects related questions
Add your answer

Q1. Full Java deep knowledge including oops concepts then rest APIs then have some basic knowledge of microservices then spring boot all the things have mastery
Add your answer

Q1. What is fast wrto performance?hashmap or treemap and why
Ans. 
HashMap is faster than TreeMap wrto performance due to its constant time complexity for most operations.
• HashMap has O(1) time complexity for most operations while TreeMap has O(log n) time complexity.

• HashMap is implemented using an array of buckets while TreeMap is implemented using a Red-Black Tree.

• HashMap is preferred for frequent read operations while TreeMap is preferred for frequent write operations.

• HashMap is uno...read more
Answered by AI
Add your answer
Q2. Can I write a try catch block inside a catch Block
Ans. 
Yes, it is possible to write a try catch block inside a catch block.
• This is called nested try-catch block.

• It is useful when we want to handle different types of exceptions in different ways.

• Example: try { //code } catch (ExceptionType1 e1) { try { //code } catch (ExceptionType2 e2) { //code } } }

• It is important to avoid excessive nesting as it can make the code difficult to read and maintain.
Answered by AI
Add your answer
Q3. Are exceptions can be written in a catch block seperated by commas,?
Ans. 
Yes, multiple exceptions can be caught in a single catch block separated by commas.
• Multiple exceptions can be caught in a single catch block separated by commas.

• This can be useful when handling different types of exceptions in a similar way.

• For example: catch (IOException | SQLException ex) { // handle exception }
Answered by AI
Add your answer
Q4. Hashmap internal working
Add your answer

Q1. Why this and what all offers you are having It was a normal telephone call
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

Q1. 
Duplicate Integer in Array
Given an array ARR of size N, containing each number between 1 and N-1 at least once, identify the single integer that appears twice.
Input:
The first line contains an integer...read more
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

They wants to Check your Problem solving techniques with best case and how you approach a problem and the way you solve
they wants to solve in more than one way 
also they ask basic Questions Related to your frame Work you are working

Q1. 
Anagram Pairs Verification
In this task, you need to verify if two provided strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form t...read more
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

General About yourSelf and How was your previous round and CTC discussion

Q1. Can you discuss the CTC (Cost to Company) offered in this position?
Add your answer

There was 2 coding question
One was easy One was very Difficult
20 MCQ question from Operating system and DBMS

Q1. First question was binary search in unsorted arrays So here i have asked about sorting algorithms all sorting algorithms must be clear
Add your answer
Q2. Second question was to find longest consecutive subarray.
Ans. 
Find the longest consecutive subarray.
• Iterate through the array and keep track of the current subarray length.

• Update the maximum length as you iterate.

• Reset the current subarray length when a non-consecutive element is encountered.
Answered by AI
Add your answer

Q1. OOPS related question Heap insertion deletion question Hashing Spanning tree
Add your answer
Q2. Minimum Spanning tree Implementation of MST
Ans. 
Minimum Spanning Tree (MST) is a tree that connects all vertices in a graph with minimum total edge weight.
• MST can be found using Prim's algorithm or Kruskal's algorithm.

• Prim's algorithm starts with a single vertex and adds the closest vertex to the tree until all vertices are included.

• Kruskal's algorithm starts with the edges with the lowest weight and adds them to the tree as long as they don't create a cycle.

• MST has...read more
Answered by AI
Add your answer