MosChip Technologies Interview Questions and Answers for Freshers

1 easy, 1 medium and 1 hard LC

Q1. 1. How will access files in a different server? 2. There are several files all containing similar key value pairs. The values differ in all files. How will you identify all the values that are same and ot...read more
Ans. 
To access files in a different server, use protocols like FTP or SSH. To identify similar key value pairs in multiple files, compare values using a script or tool.
• Use FTP or SSH protocols to access files in a different server

• Write a script or use a tool to compare key value pairs in multiple files

• Identify values that are the same and different across files

• Example: Use Python script to read files and compare key value p
Answered by AI
Add your answer

Q1. Dsa questions , angular , .net core and SQL
Add your answer

Major questions were around problem solving, strings

Q1. Write your own stack?
Ans. 
A stack is a linear data structure that follows the Last In First Out (LIFO) principle.
• Implement using an array or linked list

• Push operation adds element to top of stack

• Pop operation removes element from top of stack

• Peek operation returns top element without removing it
Answered by AI
Add your answer
Q2. How to find intersection happened between two linked list?
Ans. 
To find intersection of two linked lists, traverse both lists and compare each node.
• Traverse both linked lists and compare each node

• Use two pointers, one for each linked list

• If a node is common, return the node

• If both pointers reach the end, return null
Answered by AI
Add your answer

OOPS Principle.
SQL
Java Coding Round - with easy level of questions

Q1. Basic questions around testing.
Add your answer

Here they asked lots of logical reasoning questions and checked on how you approached different situations

Q1. Explained package and other details
Add your answer

Q1. Add two linked list
Ans. 
To add two linked lists, iterate through both lists simultaneously and add corresponding nodes, considering carry from previous addition.
• Create a dummy node to hold the result.

• Initialize current node to dummy node.

• Iterate through both lists, adding values and carry from previous addition.

• Move to next nodes in both lists.

• Handle cases where one list is longer than the other.

• Handle final carry if present.
Answered by AI
Add your answer
Q2. Find shortest path in graph
Ans. 
Use Dijkstra's algorithm to find the shortest path in a graph
• Implement Dijkstra's algorithm to find the shortest path between two nodes in a graph

• Maintain a priority queue to keep track of the shortest distance to each node

• Update the shortest distance to each node as you traverse the graph

• Track the path by storing the previous node for each node visited
Answered by AI
Add your answer

Q1. Check tree is BST
Ans. 
Check if a binary tree is a Binary Search Tree (BST)
• Perform an in-order traversal of the tree and check if the resulting array is sorted

• Keep track of the previous node value during traversal to compare with the current node value

• Ensure that each node's value is greater than the previous node's value in the in-order traversal
Answered by AI
Add your answer
Q2. Check substring palindrome or not
Ans. 
Check if a substring in an array of strings is a palindrome or not.
• Iterate through each string in the array

• For each string, check if any of its substrings are palindromes

• Return true if a palindrome substring is found, false otherwise
Answered by AI
Add your answer