Unistring Tech Solutions Intern Interview Questions and Answers for Freshers

Q1. Tell me about your self
Add your answer
Q2. Mission vision of the company
Add your answer
Q3. Agrement and relocation
Add your answer

It was easy. It was basic question.

It was a bit diff as everyone was a bit aggressive

Q1. It was long and difficult.
Add your answer
Q2. Tel about all ml algo
Ans. 
Machine learning algorithms are used to analyze data, make predictions, and automate decision-making processes.
• ML algorithms can be categorized into supervised, unsupervised, and reinforcement learning.

• Examples of ML algorithms include linear regression, decision trees, support vector machines, k-means clustering, and neural networks.

• ML algorithms require labeled data for supervised learning and can learn patterns from
Answered by AI
Add your answer

30 min test cognitive questions

3 coding questions with 90 mins time

Q1. Asked que on cpp
Add your answer
Q2. Asked que on oops
Add your answer

Q1. Explain difference between coding and programming?
Ans. 
Coding is the process of writing instructions in a specific programming language, while programming involves the entire process of designing, writing, testing, and maintaining code.
• Coding is the act of translating a problem into a language that a computer can understand.

• Programming involves planning, designing, implementing, and testing a solution to a problem.

• Coding is a subset of programming, focusing on the actual w...read more
Answered by AI
Add your answer
Q2. Which is your favorite google product?
Add your answer
Q3. Write code for BFS
Ans. 
BFS is a graph traversal algorithm that visits all the nodes of a graph level by level.
• Start by adding the initial node to a queue

• While the queue is not empty, dequeue a node and visit its neighbors, adding them to the queue

• Repeat until all nodes are visited
Answered by AI
Add your answer
Q4. Write algo for DFS
Ans. 
DFS is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
• Start at the initial node and explore as far as possible along each branch before backtracking

• Use a stack to keep track of nodes to visit

• Mark visited nodes to avoid revisiting them

• Can be implemented recursively or iteratively
Answered by AI
Add your answer
Q5. Where you find yourself in next 5 years
Add your answer

Q1. Details of various audit and accounting aspects
Add your answer

Q1. Why chosen the firm
Add your answer
Q2. Personal details
Add your answer

Q1. Tell me about a time when you had to work on a challenging project with a tight deadline.
Add your answer
Q2. Describe a situation in which you had to resolve a conflict with a colleague.
Add your answer

Aptitude normal level

DSA questions were asked from medium to difficult