i
Tessolve Semiconductor
Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Aug 2023. There were 2 interview rounds.
2 days, python, mysql
Mysql queries, python coding tests
Top trending discussions
posted on 2 Jan 2025
I applied via LinkedIn and was interviewed in Dec 2024. There was 1 interview round.
General aptitude questions
Problem solving, solved 2 out of 3 questions
General topics were given in gd
Technical plus aptitude based on domain you choose( pre placemt talks)
I applied via campus placement at Motilal Nehru Institute National Institute of Technology (NIT), Allahabad and was interviewed in Aug 2024. There were 2 interview rounds.
Its basically a test comprising 32 mcq
12- logical reasoning
20- core C,DBMS, OS , Computer Networks
2 coding Questions
Profit and loss ,time and work ,speed distance and time
Java ,ops ,collection frameworks
Quantitative Questions
Computer Science core MCQ questions
2 Coding Questions
Developed a web application for tracking inventory and sales data
Used React.js for front-end development
Implemented RESTful APIs for backend using Node.js
Utilized MongoDB for database management
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization is used to eliminate data redundancy by breaking up tables into smaller, related tables.
It helps in reducing data anomalies such as insertion, update, and deletion anomalies.
Normalization is achieved through a series of stages called normal forms, with the most common being First Normal Form (1NF)...
Armstrong algorithm is used to find Armstrong numbers in a given range.
Iterate through the numbers in the given range
Calculate the sum of cubes of each digit in the number
Check if the sum is equal to the original number
posted on 15 Jul 2024
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.
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
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
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
posted on 23 Dec 2024
I was interviewed in Jun 2024.
Reasoning and logical
Basic c ,strings and pointers
based on 1 interview
Interview experience
Post Silicon Validation Engineer
161
salaries
| ₹3.5 L/yr - ₹13 L/yr |
Design Engineer
133
salaries
| ₹2.5 L/yr - ₹12 L/yr |
Test Engineer
107
salaries
| ₹3 L/yr - ₹10 L/yr |
Software Engineer
91
salaries
| ₹3.5 L/yr - ₹15 L/yr |
PCB Design Engineer
79
salaries
| ₹2.2 L/yr - ₹9.2 L/yr |
Sankalp Semiconductor
Einfochips
Mistral Solutions
KPIT Technologies