TDK India Private Limited Associate Engineer Interview Questions and Answers

Q1. About the what is written in resume
Add your answer
Q2. About electronic components
Add your answer

2 problem was given to solve
1) Smallest Negative balance - -----%20America%20-%20Weekly%20Algorithm%20Challenges/Week%2021%20Algorithm%20Challenge/Smallest%20Negative%20Balance.md
2) Find the absolute difference between alpha & beta from the array.
Alpha -An element k in a array occurs k consecutive time
Beta - An element k in an array occurs k consecutive time starting from index k

Sample input
Arr[] = {2,2,2,4,4,4,4,1,2,2]
Output
Alpha - 3
Beta - 1
Absolute difference - 1

Note : consider array index starts with 1

Aptitude and Logical Reasoning - 15MCQ's in 20min
Programming - 10MCQ's in 15min
Technical - 25MCQ's in 30min
Coding - 2qns in 45min

Q1. SQL queries - Joins, specific data retrieval
Add your answer
Q2. OOP concepts with example code
Ans. 
OOP concepts involve encapsulation, inheritance, and polymorphism in object-oriented programming.
• Encapsulation: bundling data and methods that operate on the data into a single unit (class). Example: class Car { private String color; public void setColor(String c) { color = c; } }

• Inheritance: creating new classes based on existing classes, inheriting their attributes and methods. Example: class SUV extends Car { privat...read more
Answered by AI
Add your answer
Q3. String questions, swapping two numbers
Add your answer

Q1. Situation based questions
Add your answer

Q1. Questions about UVm
Add your answer

Arithmetic Aptitude
Number Series
Profit and Loss
Data Interpretation

Q1. Most of the questions are from JAVA, SQl and Python Situational based questions Hobbies
Add your answer
Q2. Garbage Collection in Java SQL queries
Ans. 
Garbage collection in Java is an automatic process of freeing up memory by removing unused objects.
• Java uses a mark-and-sweep algorithm for garbage collection

• Objects that are no longer referenced by any part of the program are eligible for garbage collection

• System.gc() can be used to suggest garbage collection, but it is not guaranteed to run immediately

• Garbage collection can cause performance issues if not managed pro
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The Technical interview was held on Zoom and the interview lasts for 1 hour. All the questions were from the skills mentioned in the resume.
Firstly interviewer asked me to give a self-introduction, later asked for a brief explanation of the projects and way of working.
Later series of questions were related to academics.
 

Q1. Technical Questions
1. In detail about the OOPS concepts.
2. Inheritance types.
3. Explain static and dynamic memory allocation?
4. How to identify the head node in the Circular linked list?
5. What is join? Ex...read more
Add your answer
Q2. Add K Nodes
You are given a Singly Linked List of integers and an integer 'K'.
Your task is to modify the linked list by inserting a new node after every 'K' node in the linked list with ...read more
Ans. Naive approach
• We will iterate through the linked list and store the sum of the nodes in a variable 'CURR_SUM' (initialized as zero) and keep a check of the number of nodes traversed since the last insertion with a variable 'NODES_TRAVERSED' (also, initialized as zero).
• As we traverse the list, we add the value to the 'CURR_SUM' and increment the value of 'NODES_TRAVERSED'.
• When the value of 'NODES_TRAVERSED'becomes equal...read more
Answered by CodingNinjas
Add your answer
Q3. Nth Fibonacci Number
Nth term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -
    F(n) = F(n-1) + F(n-2), 
    Where, F(1) = F(2) = 1
Provided N you have...read more
Ans. Recursive Approach
• In this approach, we use recursion and uses a basic condition that :
  • If ‘N’ is smaller than ‘1’(N<=1) we return ‘N’
  • Else we call the function again as ninjaJasoos(N-1) + ninjaJasoos(N-2).
• In this way, we reached our answer.
Space Complexity: O(n)Explanation:
O(N),  where ‘N’ is the given number.  
As recursion uses a stack of size ‘N’
Time Complexity: O(2^n)Explanation:
O(2^N), where ‘N’ i...read more
Answered by CodingNinjas
View 2 more amswers

Round duration - 50 minutes
Round difficulty - Easy

The interview was held on Zoom and the interview lasts for 50 minutes. 
 

1.Explain how did you evolve yourself in B Tech (1-1 semester to 4-1 semester).
 

2. What do you know about Micron Technology?
 

Lastly discussed the certifications and extra circular activities I have done.

Q1. Technical Questions
1. Explain how to find the distance between the points on the map in general terms?
2. Explain how a stack works?
3. What is normalisation? Briefly explain the normalisation types.
4. List...read more
Add your answer