Upload Button Icon Add office photos

Filter interviews by

DSP Group Interview Questions and Answers

Be the first one to contribute and help others!

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. How do you rate yourself in c?

I appeared for an interview before Apr 2021.

Round 1 - Coding Test 

(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 of Medium to Hard level of difficulty.

  • Q1. 

    Smallest Window Problem Statement

    Given two strings, S and X, your task is to find the smallest substring in S that contains all the characters present in X.

    Example:

    Input:
    S = "abdd"
    X = "bd"
    Output:
    ...
  • Ans. 

    Find the smallest substring in S that contains all characters in X.

    • Use a sliding window approach to find the smallest substring in S that contains all characters in X.

    • Keep track of the characters in X using a hashmap.

    • Move the window by adjusting the start and end pointers until all characters in X are found.

    • Return the smallest substring encountered.

  • Answered by AI
  • Q2. 

    K - Sum Path In A Binary Tree

    Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...

  • Ans. 

    Find all paths in a binary tree where the sum of node values equals a given value 'K'.

    • Traverse the binary tree using DFS and keep track of the current path and its sum.

    • At each node, check if the current sum equals 'K' and add the path to the result.

    • Continue traversal to the left and right child nodes recursively.

    • Return the list of paths that sum up to 'K'.

  • Answered by AI
Round 2 - Video Call 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions of DS/Algo to solve under 60 minutes and 2 questions related to Operating Systems.

  • Q1. 

    Validate Partial Binary Search Tree (BST) Problem Statement

    You are provided with a binary tree containing 'N' nodes. Your task is to determine if this tree is a Partial Binary Search Tree (BST). Return t...

  • Ans. 

    Validate if a binary tree is a Partial Binary Search Tree (BST) by checking if each node's left subtree contains nodes with data less than or equal to the node's data, and each node's right subtree contains nodes with data greater than or equal to the node's data.

    • Check if each node's left subtree follows BST property (data <= node's data) and right subtree follows BST property (data >= node's data)

    • Recursively che...

  • Answered by AI
  • Q2. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Ans. 

    Find the length of the longest strictly increasing subsequence in an array of integers.

    • Use dynamic programming to solve this problem efficiently.

    • Initialize an array to store the length of the longest increasing subsequence ending at each index.

    • Iterate through the array and update the length of the longest increasing subsequence for each element.

    • Return the maximum value in the array as the result.

  • Answered by AI
  • Q3. Can you define process and threads in operating systems?
  • Ans. 

    Processes are instances of a program in execution, while threads are lightweight processes within a process.

    • A process is a program in execution, with its own memory space and resources.

    • Threads are lightweight processes within a process, sharing the same memory space and resources.

    • Processes are independent of each other, while threads within the same process can communicate and share data.

    • Example: A web browser running ...

  • Answered by AI
  • Q4. What are the different types of semaphores?
  • Ans. 

    Different types of semaphores include binary semaphores, counting semaphores, and mutex semaphores.

    • Binary semaphores: Can only have two states - 0 or 1. Used for mutual exclusion.

    • Counting semaphores: Can have multiple states. Used for managing resources with limited capacity.

    • Mutex semaphores: Similar to binary semaphores but with additional features like priority inheritance.

    • Named semaphores: Can be shared between proc...

  • Answered by AI
Round 3 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

In this round, I was asked 3 coding questions out of which I had to implement the first two and for the last question I was only asked the optimal approach. The main challenge in this round was to implement the first two questions in a production ready manner without any bugs and so I had to spent some time thinking about some Edge Cases which were important with respect to the question.

  • Q1. 

    Next Greater Element Problem Statement

    You are given an array arr of length N. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...

  • Ans. 

    The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.

    • Use a stack to keep track of elements for which the next greater element is not found yet.

    • Iterate through the array from right to left and pop elements from the stack until a greater element is found.

    • Store the next greater element for each element in a separate array.

    • If the stack is empty afte...

  • Answered by AI
  • Q2. 

    Power Set Generation

    Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.

    A power set of a set 'ARR' i...

  • Ans. 

    Generate power set of a sorted array of integers with individually sorted subsets.

    • Use recursion to generate all possible subsets by including or excluding each element in the array.

    • Sort each subset before adding it to the power set.

    • Handle base case when all elements have been considered to add the subset to the power set.

  • Answered by AI
  • Q3. 

    Counting Sort Problem Statement

    Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?

    Example:

    Input:
    ...
  • Ans. 

    Implement counting sort algorithm to sort an array of integers without comparisons.

    • Count the frequency of each element in the input array.

    • Create a prefix sum array to determine the position of each element in the sorted array.

    • Iterate through the input array and place each element in its correct position based on the prefix sum array.

    • Time complexity of counting sort is O(n+k), where n is the number of elements and k is

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPACadence Design Systems interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OS, DBMS, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Referral and was interviewed before Dec 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Signal and power integrity question

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn about package design also

Interview Questionnaire 

2 Questions

  • Q1. Please go through the basics questions and programs.
  • Q2. C#, SQL, Html, angular, asp.net, asp.net mvc basic questions

I appeared for an interview before Sep 2020.

Round 1 - Video Call 

(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.

  • Answered by AI
Round 2 - Video Call 

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

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 8CGPAMicron Technology interview preparation:Topics to prepare for the interview - Apptitude, C, Java, Data Structures and Algorithms, DBMSTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Aug 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Verilog n digital

Interview Preparation Tips

Interview preparation tips for other job seekers - It's quite good. Had asked about microprocessor also

I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Embedded software and hardware

Interview Preparation Tips

Interview preparation tips for other job seekers -

I applied via Referral and was interviewed before Jun 2021. There was 1 interview round.

Round 1 - Technical 

(3 Questions)

  • Q1. Bits manipulation questions
  • Q2. Basic linked list question
  • Q3. C conceptual questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be good at CS fundamentals esp. OS, Architecture, C language and Cpp

Interview Questionnaire 

1 Question

  • Q1. Basics of digital electronics

I appeared for an interview in Feb 2017.

Interview Questionnaire 

7 Questions

  • Q1. What is a malloc function and where is it used and how is it different from new?
  • Ans. 

    malloc is a function in C that dynamically allocates memory on the heap. It is used to allocate memory for variables or data structures.

    • malloc is used in C programming language.

    • It is used to allocate memory on the heap.

    • malloc is different from 'new' in C++ as it does not call constructors for objects.

  • Answered by AI
  • Q2. What is the difference between C++ and Objective C and where will you use it?
  • Ans. 

    C++ is a general-purpose programming language while Objective C is a superset of C used for iOS and macOS development.

    • C++ is widely used for developing applications, games, and system software.

    • Objective C is mainly used for iOS and macOS development.

    • C++ supports both procedural and object-oriented programming paradigms.

    • Objective C is an object-oriented language with dynamic runtime features.

    • C++ has a larger community a...

  • Answered by AI
  • Q3. What is the difference between class container and class composition?
  • Ans. 

    Class container is a class that holds objects of other classes, while class composition is a way to combine multiple classes to create a new class.

    • Class container holds objects of other classes, acting as a collection or container.

    • Class composition combines multiple classes to create a new class with its own behavior and attributes.

    • In class container, the objects are typically stored in a data structure like an array o...

  • Answered by AI
  • Q4. There are fifteen horses and a racing track that can run five horses at a time. You have to figure out the top 3 horses out of those and you don't have any timer machine to measure. How will you find the t...
  • Ans. 

    Divide the horses into groups of 5 and race them. Take the top 2 from each race and race them again. Finally, race the top 2 horses to determine the top 3.

    • Divide the horses into 3 groups of 5 and race them.

    • Take the top 2 horses from each race and race them again.

    • Finally, race the top 2 horses to determine the top 3.

  • Answered by AI
  • Q5. What is the most difficult problem that you have solved (during work) till now and why you think you could do so?
  • Ans. 

    Developing a real-time data processing system for a high-traffic e-commerce website

    • Implemented a distributed system architecture to handle large volumes of data

    • Optimized algorithms for efficient data processing and storage

    • Utilized caching mechanisms to improve system performance

    • Worked closely with cross-functional teams to troubleshoot and resolve issues

    • Example: Successfully reduced data processing time by 50% by imple

  • Answered by AI
  • Q6. Why you want to change your current job?
  • Ans. 

    Seeking new challenges and opportunities for growth.

    • Looking for a more challenging role to further develop my skills

    • Interested in exploring new technologies and industries

    • Seeking better career advancement opportunities

    • Want to work in a more collaborative team environment

  • Answered by AI
  • Q7. What is the width of a tree? How will you calculate the width of the tree?
  • Ans. 

    The width of a tree is the maximum number of nodes at any level in the tree.

    • To calculate the width of a tree, we can perform a level order traversal and keep track of the maximum number of nodes at any level.

    • We can use a queue data structure to perform the level order traversal.

    • At each level, we count the number of nodes in the queue and update the maximum width if necessary.

  • Answered by AI

Interview Preparation Tips

Skills: Basic C/C++, Implementing Data Structures In C++

Skills evaluated in this interview

DSP Group Interview FAQs

How to prepare for DSP Group interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at DSP Group. The most common topics and skills that interviewers at DSP Group expect are Machine Learning, Biometrics, SOC, Silicon and WiFi.

Tell us how to improve this page.

Interview Questions from Similar Companies

Qualcomm Interview Questions
3.8
 • 256 Interviews
Intel Interview Questions
4.2
 • 215 Interviews
Texas Instruments Interview Questions
4.0
 • 120 Interviews
Synopsys Interview Questions
3.9
 • 88 Interviews
Molex Interview Questions
3.9
 • 55 Interviews
View all

DSP Group Reviews and Ratings

based on 3 reviews

3.9/5

Rating in categories

4.8

Skill development

4.7

Work-life balance

3.0

Salary

4.8

Job security

4.2

Company culture

3.6

Promotions

4.5

Work satisfaction

Explore 3 Reviews and Ratings
Software Engineer
3 salaries
unlock blur

₹4 L/yr - ₹17 L/yr

Production Manager
3 salaries
unlock blur

₹1.5 L/yr - ₹9.6 L/yr

Senior Software Engineer
3 salaries
unlock blur

₹13.5 L/yr - ₹21 L/yr

Explore more salaries
Compare DSP Group with

Qualcomm

3.8
Compare

Intel

4.2
Compare

Apar Industries

4.1
Compare

TDK India Private Limited

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview