AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Qualcomm Software Developer Interview Questions and Answers for Freshers
Qualcomm Software Developer Interview Experiences for Freshers
1 interview found
Linkedlist questions
(2 Questions)
- Q1. Depth Os and C
- Q2. Multi threading and semaphores
Software Developer Jobs at Qualcomm
Top trending discussions
Interview questions from similar companies
Software Developer Interview Questions & Answers
Cadence Design Systems
Anonymous
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
(3 Questions)
Round duration - 30 minutes
Round difficulty - Easy
- Q1. How do you search for a node in a linked list?
- Ans.
To search for a node in a linked list, iterate through the list and compare each node's value with the target value.
Start at the head of the linked list
Iterate through each node by following the 'next' pointer
Compare the value of each node with the target value
Return the node if found, otherwise return null
- Q2. How do you detect a loop in a linked list?
- Ans.
To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If there is a loop, the two pointers will eventually meet.
Alternatively, we can use a hash set to store visited nodes and check for duplicates.
- Q3. Implement a stack using a singly linked list.
- Ans.
Implement a stack using a singly linked list
Create a Node class with data and next pointer
Create a Stack class with top pointer pointing to the top of the stack
Implement push, pop, and peek operations by manipulating the linked list
Example: Node class - Node { int data; Node next; }
(2 Questions)
Round duration - 40 minutes
Round difficulty - Easy
- Q1. What is the top view of a binary tree?
- Ans.
The top view of a binary tree shows the nodes visible from the top when looking down from the root node.
The top view of a binary tree is the set of nodes visible from the top when looking down from the root node.
Nodes at the same horizontal distance from the root are considered at the same level in the top view.
If multiple nodes are at the same horizontal distance, only the topmost node at that level is included in the...
- Q2. Explain the process of deleting a node from a linked list, covering all possible cases.
- Ans.
Deleting a node from a linked list involves updating pointers to maintain the list's integrity.
Identify the node to be deleted by traversing the list
Update the previous node's next pointer to skip the node to be deleted
Free the memory allocated to the node to be deleted
Interview Preparation Tips
Do practice a lot of questions on linked list and stacks as these are two most important data structures asked in the interview. Also, try to implement it yourself without seeing the solution. Also prepare for Computer Science subjects like Operating System, Database Management System, Computer Networks, etc. I prepared them through Coding Ninjas notes which were simpler and easy to understand.
Application resume tips for other job seekersKeep your resume short and up to mark and check spellings before submitting it for the interview process.
Final outcome of the interviewSelectedSkills evaluated in this interview
I appeared for an interview before May 2016.
Interview Preparation Tips
Experience: it was elitmus test conducted by the company itself on campus. As per my knowledge only those scoring 90 percentile got selected for round 2.
Tips: Attempt only those ques that are necessary for scoring 90+ in e litmus. Specially in verbal don't attempt more then required questions, though you might be tempted. The aim is not to score max bt to score 90+
Round: Technical Interview
Experience: This was a programming based round. I was asked to write algorithms for various array linked list based problems. There was cross questioning prompting to reduce complexity and to use different data structures for same problems.
Mostly it focused on subjects like c, data structures and ADA.
Tips: Be clear with basic of data structures and algorithms. Pointers, queue, stacks, array linked lists, sorting etc are the keywords.
Round: Technical Interview
Experience: This was a information security specific round since that was my major. In depth cross questioning on my thesis topics, honeypots, network intrusion etc. Security certificates, and on the go problems to provide security solution layer wise in different scenarios. Security concept of torrents was also asked in detail.
Tips: It was more of a security discussion and throwing of ideas about how things in a particular case could work or could not. Don't worry about right or wrong answer just be clear with your reasoning about the solution you are suggesting.
Round: Other Interview
Experience: I don't know what to name this round, but it focused mainly on developing test cases for an object. Say they gave me a stapler and said to develop a test plan listing down test cases for a given object to pass so that it can be confirmed that it is a stapler. Another scenario was with a lift.
Tips: This is one round where your presence of mind and inter personal skills matter. I think the way you present your thoughts was most important here.
Round: Behavioural Interview
Experience: This was was mostly about how would you react in a given professional situation
Like your assigned work could not be completed on time, or if you are doing something wrong with the work assigned.
Tips: This is all about inter personal skills and putting your best foot forward :)
College Name: Indira Gandhi Delhi Technical University For Women, Delhi
Software Developer Interview Questions & Answers
Cadence Design Systems
Anonymous
posted on 10 May 2015
Interview Questionnaire
9 Questions
- Q1. Tree questions related like traversal?
- Q2. Locate the sum of 2 numbers in a linear array (Unsorted and sorted) and their complexities
- Ans.
Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities
For unsorted array, use nested loops to compare each element with every other element until the sum is found
For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found
Complexity for unsorted array is O(n^2) and for sorted array is O(n)
- Q3. Pointers with increment/decrement, address of and value at operators (++,–,*,&)
- Ans.
Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.
Incrementing a pointer moves it to the next memory location of the same data type
Decrementing a pointer moves it to the previous memory location of the same data type
The address of operator (&) returns the memory address of a variable
The value at operator (*) returns the value sto
- Q4. A point and a rectangle is present with the given coordinates. How will you determine whether the point is inside or outside the rectangle?
- Ans.
To determine if a point is inside or outside a rectangle, we check if the point's coordinates fall within the rectangle's boundaries.
Check if the point's x-coordinate is greater than the left edge of the rectangle
Check if the point's x-coordinate is less than the right edge of the rectangle
Check if the point's y-coordinate is greater than the top edge of the rectangle
Check if the point's y-coordinate is less than the b...
- Q5. There is a point inside the rectangle. How will you determine the line that passes through the point and divides the rectangle into 2 equal halves?
- Ans.
To find line that divides rectangle into 2 equal halves through a point inside it.
Find the center of the rectangle
Draw a line from the center to the given point
Extend the line to the opposite side of the rectangle
The extended line will divide the rectangle into 2 equal halves
- Q6. There is a scheme which contains 8-bit and 16-bit signed numbers. How many such combinations are possible?
- Ans.
There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?
There are 2^8 (256) possible combinations of 8-bit signed numbers.
There are 2^16 (65,536) possible combinations of 16-bit signed numbers.
To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.
Therefore, the total number of possible combinations is 256 +
- Q7. You are given an array of elements. Some/all of them are duplicates. Find them in 0(n) time and 0(1) space. Property of inputs – Number are in the range of 1..n where n is the limit of the array
- Ans.
Find duplicates in an array of elements in 0(n) time and 0(1) space.
Use the property of inputs to your advantage
Iterate through the array and mark elements as negative
If an element is already negative, it is a duplicate
Return all the negative elements as duplicates
- Q8. Given a array of digits. print all combination of of these i.e all no formed by these. repetition allowed. and then repetition not allowed example: i/p: arr={1,2,3} o/p: (without repetition) 123, 132, 213,...
- Q9. Questions on project
Interview Preparation Tips
Duration: 90 minutes
Total Questions: 3
Round: HR Interview
Experience: HR interview was all about my projects, my background and a few more typical HR questions. It was pretty easy to answer them.
Skills: Algorithm, Data structure, C++
College Name: IIT ROORKEE
Skills evaluated in this interview
Software Developer Interview Questions & Answers
TDK India Private Limited
Anonymous
posted on 10 Jan 2024
Selected
I applied via LinkedIn and was interviewed in Jul 2023. There were 3 interview rounds.
(3 Questions)
- Q1. 5-10 Questions on Javascript concepts
- Q2. 2-3 medium level array coding questions
- Q3. 2 logical questions
(1 Question)
- Q1. Friendly Communication
(2 Questions)
- Q1. One Leetcode medium level coding question
- Q2. Questions from your skills and the projects you have done so far
Interview Preparation Tips
- DSA
I applied via Naukri.com and was interviewed in Apr 2024. There was 1 interview round.
(1 Question)
- Q1. Count freq of elements in array
- Ans.
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
Skills evaluated in this interview
(2 Questions)
- Q1. What is normalization
- Ans.
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization is used to eliminate data redundancy by breaking up tables into smaller, related tables.
It helps in reducing data anomalies such as insertion, update, and deletion anomalies.
Normalization is achieved through a series of stages called normal forms, with the most common being First Normal Form (1NF)...
- Q2. Code for armstrong alogrithm
- Ans.
Armstrong algorithm is used to find Armstrong numbers in a given range.
Iterate through the numbers in the given range
Calculate the sum of cubes of each digit in the number
Check if the sum is equal to the original number
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(1 Question)
Round duration - 45 minutes
Round difficulty - Medium
Its a zoom call interview which lasted for 45 minutes. initially there are two panel members in which one is very targetting at me. They asked me different type of questions like jumping from DSA to project then to python then again java. Its a mixed combo pack type interview. for each and every question they asked me the real time example. The discussion on my project lasted for 15-20 mins.
- Q1.
Count Set Bits Problem Statement
Given a positive integer
N, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can... - Ans.
Count the total number of set bits in the binary representation of numbers from 1 to N modulo 1e9+7.
Use bitwise operations to count the set bits in each number from 1 to N.
Keep track of the total set bits and return the result modulo 1e9+7.
Optimize the solution to handle large values of N efficiently.
Consider using dynamic programming or precomputing values for faster computation.
Round duration - 30 mins
Round difficulty - Easy
This round was a zoom interview. The interview started with my brief introduction. This time the interview was more interested in my hobbies and passions. He asked me what do you do to keep yourself updated with the latest technology trends?
Interview Preparation Tips
Tip 1 : Do participate in all the coding contests, long challenges held by codechef, codeforces
Tip 2 : Practice all kinds of problems on leetcode, gfg, coding ninjas
Tip 3 : When you are writing a written exam for a particular company, make sure you get to know about the company in detail.
Tip 1 : Make your resume short and sweet(mostly 1 page, max 2 pages) is preferred.
Tip 2 : Make sure your resume is crisp rather than descriptive
Tip 3 : Do not lie on your resume
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Cadence Design Systems
Anonymous
posted on 21 Mar 2022
I appeared for an interview in Aug 2021.
(2 Questions)
Round duration - 75 minutes
Round difficulty - Medium
This was an online coding round where I had 2 questions to solve under 75 minutes. Both the coding questions were related to DP and were of Medium to Hard level of difficulty.
- Q1.
Longest Common Prime Subsequence Problem Statement
Imagine Ninja is tackling a puzzle during his long summer vacation. He has two arrays of integers, each with lengths 'N' and 'M'. Ninja's task is to dete...
- Ans.
Find the length of the longest subsequence common to two arrays consisting only of prime numbers.
Iterate through both arrays to find prime numbers
Use dynamic programming to find the longest common subsequence
Consider edge cases like empty arrays or no common prime numbers
- Q2.
Maximum Sum Problem Statement
You are given an array
ARRof N integers. Your task is to perform operations on this array until it becomes empty, and maximize the sum of selected elements. In each operatio... - Ans.
Given an array, select elements to maximize sum by removing adjacent elements. Return the maximum sum.
Iterate through the array and keep track of the frequency of each element.
Select the element with the highest frequency first, then remove adjacent elements.
Repeat the process until the array becomes empty and calculate the sum of selected elements.
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.
- Q1.
Cycle Detection in a Linked List
Your task is to determine if a given Singly Linked List of integers forms a cycle.
Explanation: A cycle in a linked list occurs when there is a node in the list that conn...
- Ans.
Detect if a given singly linked list of integers forms a cycle.
Use Floyd's Tortoise and Hare algorithm to detect cycle in linked list
Maintain two pointers, one moving at double the speed of the other
If they meet at some point, there is a cycle in the linked list
- Q2.
Check If Preorder Traversal Is Valid
Determine whether a given array
ARRof positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).A binary search tree (BST) is a tree structure w...
- Ans.
Check if a given array of positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).
Create a stack to keep track of nodes.
Iterate through the array and compare each element with the top of the stack.
If the current element is less than the top of the stack, push it onto the stack.
If the current element is greater than the top of the stack, pop elements from the stack until a greater element is found ...
- Q3. What are Vtable and VPTR in C++?
- Ans.
Vtable and VPTR are used in C++ for implementing polymorphism through virtual functions.
Vtable (Virtual Table) is a table of function pointers used to implement dynamic dispatch for virtual functions.
VPTR (Virtual Pointer) is a pointer that points to the Vtable of an object.
Vtable is created by the compiler for each class that has virtual functions.
VPTR is added as a hidden member in each object of a class with virtual...
- Q4. What are friend functions in C++?
- Ans.
Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.
Friend functions are declared inside a class with the keyword 'friend'.
They can access private and protected members of the class.
They are not member functions of the class, but have the same access rights as member functions.
Friend functions are useful when you want to allow a function external to
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This was also a DS/Algo round where I was given 2 questions to solve and I was expected to come up with the optimal approach as far as possible. I solved both the questions with the optimal time and space complexities and then I was asked some more questions related to DBMS towards the end of the interview.
- Q1.
Top View of a Binary Tree
You are given a binary tree. Your task is to print the Top View of the Binary Tree, displaying the nodes from left to right order.
Input:
The first line contains an integer 't'...
- Ans.
The task is to print the Top View of a Binary Tree from left to right order.
Use a map to store the horizontal distance of each node from the root.
Perform a level order traversal of the tree and keep track of the horizontal distance of each node.
Print the nodes in the map in ascending order of their horizontal distance.
Handle the case where multiple nodes have the same horizontal distance by printing the one that appear
- Q2.
Count Palindromic Substrings Problem Statement
Given a string
STR, determine the total number of palindromic substrings withinSTR.Input:
The first line contains an integer 't' representing the number ... - Ans.
Count the total number of palindromic substrings in a given string.
Iterate through each character in the string and expand around it to find palindromic substrings.
Use dynamic programming to store previously calculated palindromic substrings.
Consider both odd and even length palindromes while counting.
Example: For input 'abbc', palindromic substrings are ['a', 'b', 'b', 'c', 'bb']. Total count is 5.
- Q3. What is the difference between the DELETE and TRUNCATE commands in a DBMS?
- Ans.
DELETE removes specific rows from a table, while TRUNCATE removes all rows and resets auto-increment values.
DELETE is a DML command, while TRUNCATE is a DDL command.
DELETE can be rolled back, while TRUNCATE cannot be rolled back.
DELETE triggers delete triggers, while TRUNCATE does not trigger any triggers.
DELETE is slower as it maintains logs, while TRUNCATE is faster as it does not maintain logs.
Example: DELETE FROM t
- Q4. What is meant by normalization and denormalization?
- Ans.
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity, while denormalization is the process of intentionally introducing redundancy to improve performance.
Normalization involves breaking down a table into smaller tables and defining relationships between them to reduce redundancy and dependency.
Denormalization involves combining tables and duplicating data to impr...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
General aptitude questions
Problem solving, solved 2 out of 3 questions
General topics were given in gd
(2 Questions)
- Q1. Programming concepts
- Q2. Projects and coding round questions solved
Qualcomm Interview FAQs
Some of the top questions asked at the Qualcomm Software Developer interview for freshers -
Tell us how to improve this page.
Qualcomm Interviews By Designations
- Qualcomm Software Engineer Interview Questions
- Qualcomm Associate Engineer Interview Questions
- Qualcomm Engineer Interview Questions
- Qualcomm Senior Engineer Interview Questions
- Qualcomm Software Developer Interview Questions
- Qualcomm Hardware Engineer Interview Questions
- Qualcomm Senior Software Engineer Interview Questions
- Qualcomm Intern Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Java Software Developer Interview Questions
- Show more
Qualcomm Software Developer Interview Process for Freshers
based on 1 interview
Interview experience
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Qualcomm Software Developer Reviews and Ratings
based on 11 reviews
Rating in categories
|
Senior Engineer
1.3k
salaries
|  ₹15.7 L/yr - ₹45 L/yr |
|
Software Engineer
1k
salaries
| ₹10 L/yr - ₹38.5 L/yr |
|
Engineer
890
salaries
| ₹9.9 L/yr - ₹30 L/yr |
|
Senior Software Engineer
650
salaries
| ₹12.6 L/yr - ₹50 L/yr |
|
Senior Leader Engineer
450
salaries
| ₹20 L/yr - ₹72 L/yr |
Nvidia
Intel
Mercedes-Benz Research and Development India
Tata Electronics
- Home >
- Interviews >
- Qualcomm Interview Questions >
- Qualcomm Software Developer Interview Questions for Fresher
