i
Micron Technology
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Mar 2023. There were 4 interview rounds.
Aptitude and Logical Reasoning - 15MCQ's in 20min
Programming - 10MCQ's in 15min
Technical - 25MCQ's in 30min
Coding - 2qns in 45min
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...
I applied via Campus Placement and was interviewed in Jun 2022. There were 3 interview rounds.
Arithmetic Aptitude
Number Series
Profit and Loss
Data Interpretation
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
I was interviewed before Sep 2020.
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.
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. The...
Modify a singly linked list by inserting a new node after every 'K' nodes with the sum of previous 'K' nodes.
Traverse the linked list while keeping track of 'K' nodes at a time
Calculate the sum of the 'K' nodes and insert a new node with the sum after every 'K' nodes
Handle the case where the number of remaining nodes is less than 'K' by inserting a node with the sum of remaining nodes
Update the pointers accordingly to
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store previously calculated Fibonacci numbers to avoid redundant calculations.
Start with base cases F(1) and F(2) as 1, then iterate to calculate subsequent Fibonacci numbers.
Return the Nth Fibonacci number as the final result.
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.
Tip 1 : Increase problem-solving ability and prepare Data structures and Algorithms well.
Tip 2 : Try to write Optimised code for the given problem statement. If you got stuck in the middle, give it a try. Interviewer will
look at your approach and try to help you.
Tip 3 : Be Confident enough, don't be nervous.
Tip 4 : Maintain At least 2 projects in your resume.
Tip 1 : Be honest with the information mentioned in the resume.
Tip 2 : You should be able to answer all the questions related to skills in the resume.
Tip 3 : Have at least 2 projects.
Tip 4 : You should be able to justify your resume.
What people are saying about Micron Technology
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Nov 2022. There were 2 interview rounds.
Code test for 3 hrs. complex graph algorithm to solve
AVL Tree is a self-balancing binary search tree with the property that the heights of the two subtrees of any node differ by at most one.
AVL Tree is a type of binary search tree that maintains balance by performing rotations.
It is different from a regular binary tree because AVL Tree ensures that the height difference between left and right subtrees is at most 1.
AVL Tree has faster search, insertion, and deletion opera...
I applied via Company Website and was interviewed in Jul 2024. There was 1 interview round.
I am a dedicated and skilled software engineer with a strong passion for coding and problem-solving.
I have a solid understanding of programming languages such as Java, Python, and C++.
I have experience working on various software projects during my time in university.
I am a quick learner and always eager to expand my knowledge and skills in the field of software engineering.
I applied via Campus Placement and was interviewed in Jul 2022. There were 2 interview rounds.
Aptitude, technical MCQs and c/c++ questions of medium type
Technical questions related to programming concepts and memory management.
To find indices of a multi-dimensional array using offset, divide the offset by the size of each element and use the quotient as the index for the first dimension. Repeat this process for each dimension.
Bitwise operations are used to manipulate individual bits in a binary number. Examples include AND, OR, XOR, and bit shifting.
Structure padding i...
I was interviewed in Sep 2017.
Use bitwise operations to find the sum of two numbers without using mathematical operators.
Use bitwise XOR to find the sum of two numbers without carrying.
Use bitwise AND and left shift to find the carry.
Repeat the process until there is no carry left.
To delete a node from a linked list when only given a reference to the node, we can copy the data of the next node to the given node and delete the next node.
Copy the data of the next node to the given node
Update the next pointer of the given node to skip the next node
Delete the next node
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
UDP is preferred over TCP in this project due to its low latency and lightweight nature.
UDP is a connectionless protocol, which means it does not establish a direct connection between the sender and receiver.
UDP is faster than TCP as it does not have the overhead of establishing and maintaining a connection.
UDP is suitable for applications where real-time data transmission is crucial, such as video streaming or online ...
To clear the 7th bit in a 32-bit register, perform a bitwise AND operation with a mask that has all bits set to 1 except the 7th bit.
Create a mask with the 7th bit set to 0 and all other bits set to 1
Perform a bitwise AND operation between the register and the mask
Store the result back in the register
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Engineer
127
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
113
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Engineer
95
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
70
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Engineer
57
salaries
| ₹0 L/yr - ₹0 L/yr |
Intel
Samsung
Western Digital
Advanced Micro Devices