Filter interviews by
Count pairs in an array with a given difference
Sort the array to easily find pairs
Use two pointers approach to find pairs with difference equal to k
Keep track of unique pairs to avoid duplicates
Endianness refers to the order of bytes in multi-byte data types, affecting bitwise operations and data interpretation.
Little Endian: Least significant byte is stored first (e.g., 0x12345678 is stored as 78 56 34 12).
Big Endian: Most significant byte is stored first (e.g., 0x12345678 is stored as 12 34 56 78).
Bitwise operations (AND, OR, XOR) can yield different results based on endianness if data is interpreted i...
Yes, setup and hold uncertainty values are different in physical design engineering.
Setup uncertainty is related to the arrival time of the data signal at the input of the flip-flop, while hold uncertainty is related to the removal time of the data signal.
Setup time is the minimum amount of time the data input must be stable before the clock edge, while hold time is the minimum amount of time the data input must b...
Use two pointers to iterate through the list and remove duplicates by updating next pointers
Initialize two pointers, current and next, to iterate through the list
Compare current and next node values, if equal, update next pointer to skip duplicate node
Repeat until end of list is reached
To delete a node in a single linked list, update the previous node's next pointer to skip over the node to be deleted.
Traverse the linked list to find the node to be deleted
Update the previous node's next pointer to skip over the node to be deleted
Free the memory allocated to the node to be deleted
malloc is used to allocate memory without initializing it, while calloc is used to allocate memory and initialize it to zero.
malloc allocates a block of memory of specified size, while calloc allocates a block of memory for an array of elements and initializes them to zero
malloc does not initialize the allocated memory, while calloc initializes the allocated memory to zero
malloc returns a pointer to the allocated ...
Addition and deletion operations in a linked list using C coding
Use a struct to define the linked list node
For addition, allocate memory for new node, update pointers accordingly
For deletion, update pointers to skip the node to be deleted
Insert a node to the middle of a linked list
Find the middle node using slow and fast pointers
Create a new node with the data to be inserted
Adjust the pointers to insert the new node in the middle
Dereferencing a null pointer means trying to access the memory location pointed to by a null pointer.
Dereferencing a null pointer can lead to a segmentation fault or access violation.
Example: int *ptr = NULL; int value = *ptr; // This will result in a segmentation fault.
Use the 3 ltr jug to fill the 5 ltr jug twice, leaving 1 ltr in the 3 ltr jug. Then fill the 3 ltr jug and pour it into the 5 ltr jug.
Fill the 5 ltr jug twice with the 3 ltr jug
1 ltr will be left in the 3 ltr jug
Fill the 3 ltr jug and pour it into the 5 ltr jug
4 ltr of water will be in the 5 ltr jug
I applied via Referral and was interviewed in Sep 2024. There were 2 interview rounds.
C/c++ and python basic questions were there
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Questions on maths and reasoning
Count pairs in an array with a given difference
Sort the array to easily find pairs
Use two pointers approach to find pairs with difference equal to k
Keep track of unique pairs to avoid duplicates
Endianness refers to the order of bytes in multi-byte data types, affecting bitwise operations and data interpretation.
Little Endian: Least significant byte is stored first (e.g., 0x12345678 is stored as 78 56 34 12).
Big Endian: Most significant byte is stored first (e.g., 0x12345678 is stored as 12 34 56 78).
Bitwise operations (AND, OR, XOR) can yield different results based on endianness if data is interpreted incorr...
I appeared for an interview in Apr 2024.
To delete a node in a single linked list, update the previous node's next pointer to skip over the node to be deleted.
Traverse the linked list to find the node to be deleted
Update the previous node's next pointer to skip over the node to be deleted
Free the memory allocated to the node to be deleted
Use two pointers to iterate through the list and remove duplicates by updating next pointers
Initialize two pointers, current and next, to iterate through the list
Compare current and next node values, if equal, update next pointer to skip duplicate node
Repeat until end of list is reached
Volatile and extern are keywords in C for memory management. Local and external linkages determine scope. SW and HW interrupts handle events. Different scheduling algorithms manage task priorities.
Volatile keyword is used to indicate that a variable may be changed unexpectedly, typically by hardware. Example: volatile int x;
Extern keyword is used to declare a variable that is defined in another file. Example: extern in...
I appeared for an interview in Feb 2024.
I applied via Naukri.com and was interviewed in Jun 2024. There were 2 interview rounds.
The apti round was easy and fine.
I am a dedicated and experienced modem test engineer with a strong background in testing and troubleshooting modem hardware and software.
Over 5 years of experience in testing and validating modem functionality
Proficient in using test equipment such as signal generators and spectrum analyzers
Skilled in writing test plans and documenting test results
Familiar with various communication protocols like LTE, 5G, and Wi-Fi
Str...
Yes, setup and hold uncertainty values are different in physical design engineering.
Setup uncertainty is related to the arrival time of the data signal at the input of the flip-flop, while hold uncertainty is related to the removal time of the data signal.
Setup time is the minimum amount of time the data input must be stable before the clock edge, while hold time is the minimum amount of time the data input must be sta...
I applied via Campus Placement and was interviewed before Apr 2023. There were 3 interview rounds.
C cpp basic and aptitude basic
Basics your skills in vlsi and others topic coding
Top trending discussions
The duration of MediaTek India Technology interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 20 interview experiences
Difficulty level
Duration
based on 115 reviews
Rating in categories
Senior Engineer
120
salaries
| ₹11.2 L/yr - ₹31.9 L/yr |
Staff Engineer
90
salaries
| ₹18 L/yr - ₹48 L/yr |
Software Engineer
59
salaries
| ₹9 L/yr - ₹22 L/yr |
Senior Software Engineer
55
salaries
| ₹9.4 L/yr - ₹28 L/yr |
Technical Manager
40
salaries
| ₹24 L/yr - ₹68.8 L/yr |
Qualcomm
Molex
TDK India Private Limited
Applied Materials