I applied through college or university. The process took 2 days. I interviewed at Qualcomm (Nueva Delhi) in Jul 2020
Interview
Interview was easy to moderate. Good grasp on C/C++ is needed. Knowledge about Operating Systems is also needed. Basic but most popular questions on arrays, strings, linked lists, bit manipulation must be covered.
Interview questions [1]
Question 1
1. Virtual Memory
2. Check Anagrams
3. Nth node from the end of a linked list.
It was an online interview and they asked about my experience first before asking me how I think I’m qualified for the position. Then they started asking terms I’m not familiar with. It turns out I was interviewing for the wrong position and the HR gave me the wrong job description to prepare for the interview.
Interview questions [1]
Question 1
Describe your current work. What do you think makes you qualified for this position?
I applied through college or university. The process took 1 day. I interviewed at Qualcomm (Bengaluru) in Jul 2020
Interview
Qualcomm visited our campus for Internship to hire for both hardware as well as software profiles.
Round 1 [Written Test]:
1st Round was an online MCQ test conducted by HirePro, There were 3 sections,
Each section consisted of 20 questions of 1 mark each to be finished in 30 minutes. There was a negative marking of .25 per question.
Section 1(30 mins):
First section was not so tough there were aptitude questions along with few quant, word coding and logical reasoning questions.
Section 2(30 mins):
Second section completely consisted of C output based questions. Most of them were time consuming bit manipulation questions ( almost 70 percent).
Section 3(30 mins):
It was based on your preference (Computer Science/Electronics). I chose Computer Science and there were questions from DS, OS, Architecture and Networking, Digital Logic. Most questions were from C, OOPS , few from DS.
Interview questions [1]
Question 1
Time complexity comparison of different search algorithms
Maximum are of Histogram.
Implementation of Queues using linked list.
Difference between single linked list and double linked list (in-depth analysis)
Heapsort and Quicksort along with their analysis(time complexities)
Delete nth end from end of linked list
Segmentation, Paging, Demand Paging and Swapping.
Code to traverse a binary tree in Spiral form.
The producer-consumer problem.
Implement thread priority using a priority queue.
Implement Quicksort.