TDK India Private Limited Software Developer Interview Questions and Answers

Round duration - 30 minutes
Round difficulty - Easy

Q1. How do you search for a node in a linked list?
Ans. 
To search for a node in a linked list, iterate through the list and compare each node's value with the target value.
• Start at the head of the linked list

• Iterate through each node by following the 'next' pointer

• Compare the value of each node with the target value

• Return the node if found, otherwise return null
Answered by AI
Add your answer
Q2. How do you detect a loop in a linked list?
Ans. 
To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps.

• If there is a loop, the two pointers will eventually meet.

• Alternatively, we can use a hash set to store visited nodes and check for duplicates.
Answered by AI
Add your answer
Q3. Implement a stack using a singly linked list.
Ans. 
Implement a stack using a singly linked list
• Create a Node class with data and next pointer

• Create a Stack class with top pointer pointing to the top of the stack

• Implement push, pop, and peek operations by manipulating the linked list

• Example: Node class - Node { int data; Node next; }
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Q1. What is the top view of a binary tree?
Ans. 
The top view of a binary tree shows the nodes visible from the top when looking down from the root node.
• The top view of a binary tree is the set of nodes visible from the top when looking down from the root node.

• Nodes at the same horizontal distance from the root are considered at the same level in the top view.

• If multiple nodes are at the same horizontal distance, only the topmost node at that level is included in the...read more
Answered by AI
Add your answer
Q2. Explain the process of deleting a node from a linked list, covering all possible cases.
Ans. 
Deleting a node from a linked list involves updating pointers to maintain the list's integrity.
• Identify the node to be deleted by traversing the list

• Update the previous node's next pointer to skip the node to be deleted

• Free the memory allocated to the node to be deleted
Answered by AI
Add your answer

Basic aptitude, c and data structures

Q1. C and data structures
Add your answer
Q2. Operating system and puzzle
Add your answer

Q1. What is normalization
Ans. 
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)...read more
Answered by AI
Add your answer
Q2. Code for armstrong alogrithm
Ans. 
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
Answered by AI
Add your answer

Its basically a test comprising 32 mcq
12- logical reasoning
20- core C,DBMS, OS , Computer Networks

2 coding Questions

Q1. He just Gave me to design a React Page and removed all the starting code and gave me blank folder and asked to code all by myself
Add your answer
Q2. He asked me SQL queries which was quite tough as its of nested queries
Add your answer

Q1. Views, sp's, functions,joins,temp tables,table variables, indexes,cte,subquery,derived tables, correlated subquery, constrains and types , find n th highest salary, find out duplicates ,delete duplicates ,...read more
Add your answer

Q1. Current organization, product based or contractual based, current sal, expect salary, which domain, notice period..etc
Add your answer

ZeroOddEven program will always be asked

Q1. Basic java questions , some coding questions around threads
Add your answer

Q1. Its just about salary and why you want to join and all
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Its a zoom call interview which lasted for 45 minutes. initially there are two panel members in which one is very targetting at me. They asked me different type of questions like jumping from DSA to project then to python then again java. Its a mixed combo pack type interview. for each and every question they asked me the real time example. The discussion on my project lasted for 15-20 mins.

Q1. 
Count Set Bits Problem Statement
Given a positive integer N, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...read more
Ans. 
Count the total number of set bits in the binary representation of numbers from 1 to N modulo 1e9+7.
• Use bitwise operations to count the set bits in each number from 1 to N.

• Keep track of the total set bits and return the result modulo 1e9+7.

• Optimize the solution to handle large values of N efficiently.

• Consider using dynamic programming or precomputing values for faster computation.
Answered by AI
Add your answer

Round duration - 30 mins
Round difficulty - Easy

This round was a zoom interview. The interview started with my brief introduction. This time the interview was more interested in my hobbies and passions. He asked me what do you do to keep yourself updated with the latest technology trends?