i
Advanced Micro Devices
Filter interviews by
Clear (1)
I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.
Code for constraints
Code for driver
Top trending discussions
I applied via Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.
Reduction of 3D Kmap involves simplifying a 3D truth table to minimize the number of logic gates required.
3D Kmap is a graphical representation of a truth table with three variables
Reduction involves grouping adjacent cells with the same output value
The goal is to minimize the number of groups and variables in each group
Simplification can be done using Boolean algebra or Karnaugh maps
Example: Reducing a 3D Kmap with in
A design engineer is responsible for creating and developing innovative designs for products or systems.
Designing and prototyping new products
Collaborating with cross-functional teams to ensure design feasibility
Using CAD software to create detailed drawings and specifications
Testing and evaluating prototypes to ensure functionality and performance
Making design improvements based on feedback and testing results
I was interviewed before Feb 2023.
Practice on hackerrank, they send hackerrank link for screening round.
I applied via Referral and was interviewed in Sep 2023. There were 4 interview rounds.
The length of the longest common subsequence in given strings is found using dynamic programming.
Use dynamic programming to find the length of the longest common subsequence.
Compare characters of the strings and build a matrix to store the lengths of common subsequences.
Traverse the matrix to find the length of the longest common subsequence.
Write the algorithm for topological sorting.
CAP theorem states that in a distributed system, it is impossible to simultaneously guarantee consistency, availability, and partition tolerance.
Consistency: All nodes in the system have the same data at the same time.
Availability: Every request gets a response, even if some nodes are down.
Partition Tolerance: The system continues to operate despite network partitions.
In a distributed system, you can only achieve two o...
I applied via Approached by Company and was interviewed in Nov 2023. There were 3 interview rounds.
Function to dynamically allocate memory and write data to a memory location, returning the address details.
Use malloc() or calloc() to dynamically allocate memory
Use memcpy() or strcpy() to write data to the allocated memory
Return the address details where data is present
Memory management involves allocating and deallocating memory efficiently, while mapping involves associating memory addresses with physical locations.
Memory management is crucial for optimizing performance and preventing memory leaks.
Mapping involves translating virtual memory addresses to physical memory locations.
Different scenarios may require different memory management strategies, such as stack allocation vs heap...
Program to find length of bits assigned in memory using recursion.
Define a recursive function to count the bits in memory
Base case: if input is 0, return 0
Recursive case: return 1 + function(input / 2)
Volatile keyword prevents compiler optimization by telling the compiler that the variable's value can change unexpectedly.
Volatile keyword is used to indicate that a variable may be changed unexpectedly, such as in the case of hardware registers.
When initializing GPIO pins, using volatile keyword ensures that the compiler does not optimize away the initialization code.
Without volatile keyword, the compiler may optimize...
Unions in C/C++ can be used for bit assignments by allowing multiple variables to share the same memory location.
Unions allow different data types to be stored in the same memory location, which can be useful for bit manipulation.
By defining a union with multiple variables of different data types, you can access the same memory location using different variable names.
For example, you can use a union to access individua...
static const is used to declare constants that are known at compile time and cannot be modified
static const int MAX_SIZE = 100; // declaring a constant integer
static const double PI = 3.14159; // declaring a constant double
static const char* MESSAGE = "Hello, World!"; // declaring a constant string
Program to find the sum of all the digits in a number.
Iterate through each digit in the number and add them together.
Convert the number to a string to easily access each digit.
Use modulo operator to extract each digit from the number.
Handle negative numbers by taking the absolute value before processing.
Check if a linked list is circular, if not reverse it.
Create two pointers, one moving at double the speed of the other to detect a cycle
If a cycle is detected, the list is circular. If not, reverse the list by changing the pointers' directions
Architecture to process real-time data involves designing systems that can efficiently collect, process, and analyze data in real-time.
Utilize distributed systems to handle high volumes of data in real-time
Implement stream processing frameworks like Apache Kafka or Apache Flink
Use microservices architecture for scalability and flexibility
Employ in-memory databases for fast data retrieval
Ensure fault tolerance and data
Various data filtering techniques include sorting, grouping, aggregating, and applying filters based on specific criteria.
Sorting: arranging data in a specific order, such as ascending or descending
Grouping: categorizing data into distinct groups based on common attributes
Aggregating: combining multiple data points into a single value, such as summing or averaging
Filtering: selecting only the data that meets certain cr
Initialize and control GPIO using HAL functions in embedded systems.
Use HAL_GPIO_Init() function to initialize GPIO pins
Use HAL_GPIO_WritePin() function to set or clear GPIO status
Example: HAL_GPIO_Init(&GPIO_InitStruct)
Example: HAL_GPIO_WritePin(GPIOx, GPIO_PIN_x, GPIO_PIN_SET)
Traverse a linked list based on input 0 or 1 to return decimal equivalent.
Create a function that takes input 0 or 1 and traverses the linked list accordingly.
For each node in the linked list, multiply the current decimal value by 2 and add the data of the node if input is 1.
Return the final decimal value after traversing the linked list.
I applied via Naukri.com and was interviewed in Apr 2024. There was 1 interview round.
To detect and remove a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
Use two pointers, slow and fast, to traverse the linked list
If there is a loop, the fast pointer will eventually meet the slow pointer
Once the loop is detected, reset one of the pointers to the head and move both pointers at the same pace until they meet again to find the start of the loop
based on 1 interview
Interview experience
based on 8 reviews
Rating in categories
Senior Software Engineer
111
salaries
| ₹0 L/yr - ₹0 L/yr |
Member Technical Staff
81
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
68
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Development Engineer
47
salaries
| ₹0 L/yr - ₹0 L/yr |
Intel
Nvidia
Broadcom
Micron Technology