Filter interviews by
I applied via Naukri.com and was interviewed in Dec 2021. There were 5 interview rounds.
2 coding questions were there 1 is of DFS and another is of subarray and some MCQs were also there of DSA
I applied via Approached by Company and was interviewed before May 2023. There were 2 interview rounds.
Basic Questions about map, sets, array, and unordered_map etc. Not to hard. Sometimes they might ask to optimize the solution
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...
General questions on time and work ,ages, pipes and cisterns, average and some simple ones
Asked about c language mcqs and also error checking, finding output for given program
Qualcomm interview questions for popular designations
I applied via LinkedIn and was interviewed in Nov 2021. There were 2 interview rounds.
Register classes in C are used to define new data types. MMU is a hardware component that maps virtual addresses to physical addresses.
Register classes in C are used to define new data types with specific storage classes.
MMU stands for Memory Management Unit and is a hardware component that maps virtual addresses to physical addresses.
The MMU is responsible for managing the translation of virtual addresses to physical ...
Get interview-ready with Top Qualcomm Interview Questions
I applied via Campus Placement and was interviewed before Oct 2022. There were 5 interview rounds.
Coding MCQ questions, CS fundamentals and aptitude MCQ
Workqueues are data structures used in operating systems to manage tasks and prioritize their execution.
Workqueues are used to schedule and manage tasks in an operating system.
They help in prioritizing tasks based on their importance and urgency.
Workqueues are commonly used in kernel programming to handle asynchronous tasks.
Examples of workqueues include the Linux kernel workqueue and Windows kernel workqueue.
Implement search, insert, and delete operations in binary trees.
For search operation, start at the root and recursively search left or right subtree based on the value being searched.
For insert operation, start at the root and recursively find the correct position to insert the new node.
For delete operation, find the node to be deleted, handle different cases (no child, one child, two children) accordingly.
I applied via Company Website and was interviewed before Oct 2022. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Sep 2022. There were 4 interview rounds.
DSA, OS, C Language
I applied via Campus Placement and was interviewed in Mar 2022. There were 2 interview rounds.
Verbal and Non-verbal Reasoning
I applied via Campus Placement and was interviewed before Oct 2021. There were 3 interview rounds.
Based on Electronics, Aptitude and Software
D flip flop is a digital circuit that stores a single bit of data and is used in sequential logic circuits.
D flip flop has a data input (D), a clock input (CLK), a set input (S), and a reset input (R).
When the clock input is high, the value of D is transferred to the output Q.
When the set input is high, the output Q is set to high.
When the reset input is high, the output Q is reset to low.
D flip flop is used in applica...
Factorial can be found using a loop or recursion in C programming language.
Use a loop to multiply the numbers from 1 to n to find the factorial of n.
Use recursion to call the function itself with n-1 until n=1.
Handle edge cases such as negative numbers and 0.
Example: int factorial(int n) { if(n<=1) return 1; return n*factorial(n-1); }
Example: int factorial(int n) { int fact=1; for(int i=1;i<=n;i++) fact*=i; return fact
To find duplicates in a string, we can use a hash table to keep track of the frequency of each character.
Iterate through the string and add each character to the hash table with its frequency
If a character already exists in the hash table, it is a duplicate
Return a list of all the duplicate characters found
Top trending discussions
Some of the top questions asked at the Qualcomm interview -
The duration of Qualcomm interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 173 interviews
Interview experience
based on 980 reviews
Rating in categories
Senior Engineer
1.2k
salaries
| ₹16 L/yr - ₹50 L/yr |
Software Engineer
1k
salaries
| ₹10 L/yr - ₹35 L/yr |
Engineer
892
salaries
| ₹9 L/yr - ₹30 L/yr |
Senior Software Engineer
624
salaries
| ₹13.5 L/yr - ₹50 L/yr |
Senior Leader Engineer
439
salaries
| ₹20 L/yr - ₹72 L/yr |
Nvidia
Intel
Mercedes-Benz Research and Development India
Broadcom