Basic ds and dp problems
Tracing control flow graph (CFG) involves analyzing the paths that a program can take during execution.
CFG is a representation of all possible paths that can be taken in a program.
Tracing CFG helps in understanding program behavior, identifying optimizations, and detecting errors.
Tools like LLVM's opt tool can be used to generate and visualize CFGs.
Example: In a simple program with if-else statements, tracing the CFG w...
CFG is Control Flow Graph, SSA is Static Single Assignment, reg pressure is register pressure, dominance is dominance relationship.
CFG is a representation of all possible paths that a program can take during its execution.
SSA is a form that ensures each variable is assigned exactly once.
Register pressure refers to the demand for available registers in a program.
Dominance is a relationship between basic blocks in a prog...
Top trending discussions
I applied via Campus Placement
Digital, c programming, rtos, computer architecture
Easy -medium
I applied via Company Website and was interviewed before Apr 2022. There were 5 interview rounds.
Pointer and linked list
Pure technical on kernel programming
Multi-threaded programming can be achieved by creating multiple threads that run concurrently.
Identify the tasks that can be executed in parallel
Create threads using threading libraries in the chosen programming language
Synchronize the threads to avoid race conditions and deadlocks
Use locks, semaphores, and mutexes to manage shared resources
Optimize the performance by balancing the workload among threads
I applied via Referral and was interviewed before Oct 2022. There were 3 interview rounds.
A module in Python is a file containing Python code, which can define functions, classes, and variables.
Modules help organize Python code into reusable components
Modules can be imported into other Python scripts using the 'import' keyword
Examples of modules in Python include math, random, and os
posted on 5 Aug 2021
I applied via Naukri.com and was interviewed in Feb 2021. There were 3 interview rounds.
posted on 16 Sep 2021
I was interviewed in Sep 2020.
Round duration - 40 minutes
Round difficulty - Medium
Data structures were asked like linked list and stacks. Hashmaps were also there. some basic questions of DBMS were asked and the interviewer asked if i know networking for which i said no. After that there was a 5 minute simple straightforward round with H.R
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
Return the middle node of a singly linked list, considering odd and even number of elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
Return the node pointed by the slow pointer
Tip 1 : Practice maximum questions of linked lists and stacks.
Tip 2 : DBMS concepts should be crystal clear.
Tip 3 : If you are not able to complete something in-depth, clearly mention that to the interviewer.
Tip 4 : Practice a mock interview and try to solve any random question in front of your friend.
Tip 1 : Mention maximum projects you have one and be prepared to explain them.
Tip 2 : Don't mention anything you are not confident in.
I applied via Campus Placement and was interviewed in Jan 2022. There were 2 interview rounds.
Had Aptitude and VLSI-Based Questions
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
posted on 28 Nov 2023
I applied via Naukri.com and was interviewed before Nov 2022. There were 3 interview rounds.
I interviewed with Mediatek having just 1 year of experience. It was for outsourcing position.
They asked me concepts from C language, writing code for data structures (LinkedIn list), and a question on string which I can't remember. This was pre COVID days.
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
I applied via Naukri.com and was interviewed in Apr 2024. There was 1 interview round.
Count frequency of elements in array of strings
Iterate through the array and use a hashmap to store the frequency of each element
Use a for loop to go through each element and update the count in the hashmap
Return the hashmap with element frequencies
based on 20 reviews
Rating in categories
Senior Software Engineer
12
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Hardware Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Test Engineer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Hardware Engineer 2
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Nvidia
Advanced Micro Devices
Arms
Broadcom