Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Cadence Design Systems Team. If you also belong to the team, you can get access from here

Cadence Design Systems Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Cadence Design Systems Analog Design Engineer Interview Questions and Answers

Updated 5 Jan 2025

Cadence Design Systems Analog Design Engineer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Dec 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Asked about Network theory

Round 2 - HR 

(2 Questions)

  • Q1. Asked about electrical questions
  • Q2. Does not remember

Interview Preparation Tips

Interview preparation tips for other job seekers - It is nice and wonderful

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Asked Basic Aptitude Questions

Round 2 - Technical 

(5 Questions)

  • Q1. Nmos Cross Section drawing
  • Q2. Asic design flow
  • Q3. Asic vs fpga difference
  • Ans. 

    ASICs are custom-designed for specific applications, while FPGAs are reprogrammable and more flexible.

    • ASICs are Application-Specific Integrated Circuits designed for a specific purpose or application.

    • FPGAs are Field-Programmable Gate Arrays that can be reconfigured for different tasks.

    • ASICs are more efficient and faster than FPGAs for specific tasks.

    • FPGAs are more flexible and can be reprogrammed for different function...

  • Answered by AI
  • Q4. Static Timing Analysis
  • Q5. Projects related (verilog)

Interview Preparation Tips

Interview preparation tips for other job seekers - Focus on fundamentals

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Write code of frequency divider
  • Q2. Difference between latch & flip flop

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well

I applied via LinkedIn and was interviewed in Oct 2022. There were 2 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all Resume tips
Round 2 - One-on-one 

(2 Questions)

  • Q1. The interview went on with the basics of mechanical design and project stuff. They focused more on cad
  • Q2. What are the different pros and cons of isometric view and parametric view?
  • Ans. 

    Isometric view and parametric view have different advantages and disadvantages.

    • Isometric view provides a 3D representation of an object, making it easier to visualize and understand.

    • Parametric view allows for easy modification of dimensions and parameters, saving time and effort.

    • Isometric view can be misleading in terms of proportions and distances.

    • Parametric view can be complex and difficult to set up initially.

    • Isomet...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Please be strong in basics of enginnering drawing and engineering design subjects.

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I was interviewed in Nov 2023.

Round 1 - Coding Test 

F2F coding test which was pretty simple based on basic c++ concepts and few logical questions.

Round 2 - Technical 

(1 Question)

  • Q1. Project and design level with mid level difficulty.
Round 3 - Culture fit 

(2 Questions)

  • Q1. Oops.here the magic happened. Prior to each stage HR was giving clue about the next round and the rounds were more or less same. But in this round,no was expecting managerial question and was not prepared ...
  • Q2. Array multiple logical questions, design pattern writing, other class relates coding..
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via Referral and was interviewed in Sep 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Three DSA questions one on likedlist one on BST and one on maps

Round 2 - Technical 

(2 Questions)

  • Q1. Cpp pointers explain smart pointers
  • Ans. 

    Smart pointers in C++ provide automatic memory management and help prevent memory leaks.

    • Smart pointers are objects that manage the memory of a pointer automatically.

    • They ensure that memory is deallocated when it is no longer needed.

    • Examples include unique_ptr, shared_ptr, and weak_ptr.

  • Answered by AI
  • Q2. Cpp question based on OOPs concepts
Round 3 - Coding Test 

DSA questions on graph and lots of puzzles

Interview Preparation Tips

Topics to prepare for Ansys Software Private Limited Senior Engineer interview:
  • C++
  • DSA
  • OOPS
  • Puzzles
Interview preparation tips for other job seekers - Overall good experience, but the HR hasn't replied yet.

Skills evaluated in this interview

Interview Questionnaire 

9 Questions

  • Q1. Questions related to the work done at my previous company
  • Q2. Find if a given directed graph is cyclic or not
  • Ans. 

    To check if a directed graph is cyclic or not

    • Use Depth First Search (DFS) algorithm to traverse the graph

    • Maintain a visited set to keep track of visited nodes

    • Maintain a recursion stack to keep track of nodes in the current DFS traversal

    • If a node is visited and is already in the recursion stack, then the graph is cyclic

    • If DFS traversal completes without finding a cycle, then the graph is acyclic

  • Answered by AI
  • Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
  • Ans. 

    Return a random byte from a stream of bytes with equal probability.

    • Create a variable to store the count of bytes read

    • Create a variable to store the current random byte

    • For each byte read, generate a random number between 0 and the count of bytes read

    • If the random number is 0, store the current byte as the random byte

    • Return the random byte

  • Answered by AI
  • Q4. Find if a given Binary Tree is BST or not
  • Ans. 

    Check if a binary tree is a binary search tree or not.

    • Traverse the tree in-order and check if the values are in ascending order.

    • For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.

    • Use recursion to check if all nodes in the tree satisfy the above condition.

  • Answered by AI
  • Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
  • Ans. 

    Algorithm to find Nth-to-Last element in a singly linked list of unknown length

    • Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning

    • Move both pointers simultaneously until the second pointer reaches the end of the list

    • The first pointer will be pointing to the Nth-to-Last element

    • If N=0, return the last element

    • Parse the list only once

  • Answered by AI
  • Q6. Given an array of integers, print all possible permutations. Also explain your approach
  • Ans. 

    Print all possible permutations of an array of integers

    • Use recursion to swap elements and generate permutations

    • Start with the first element and swap it with each subsequent element

    • Repeat the process for the remaining elements

    • Stop when all elements have been swapped with the first element

    • Print each permutation as it is generated

  • Answered by AI
  • Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
  • Ans. 

    Design a stack that prints the minimum element pushed in O(1)

    • Use two stacks, one for storing elements and another for storing minimums

    • When pushing an element, compare it with the top of minimum stack and push the smaller one

    • When popping an element, pop from both stacks

    • To get the minimum element, just return the top of minimum stack

  • Answered by AI
  • Q8. Given a linked list with loop, how would you find the starting point of the loop ?
  • Ans. 

    To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.

    • Use two pointers, one moving at twice the speed of the other.

    • When they meet, move one pointer to the head of the list and keep the other at the meeting point.

    • Move both pointers one step at a time until they meet again, which is the starting point of the loop.

  • Answered by AI
  • Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
  • Ans. 

    To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.

    • Use binary search to find the number in each row and column

    • Start from the top-right corner or bottom-left corner to optimize search

    • Time complexity: O(m log n) or O(n log m) depending on the starting corner

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: Na

Skills evaluated in this interview

Software Developer Interview Questions & Answers

PTC user image Snehal Jaipurker

posted on 18 Sep 2017

I was interviewed in Jul 2017.

Interview Questionnaire 

6 Questions

  • Q1. Code to print * in five consecutive lines
  • Ans. 

    Code to print * in five consecutive lines

    • Use a loop to iterate five times

    • Inside the loop, print a string containing a single * character

  • Answered by AI
  • Q2. A ball is left from a height of 10 meters. After bouncing first time it looses 10% of its previous height the next time it bounces. Write a code to calculate the number of bounces the ball goes through unt...
  • Ans. 

    Code to calculate number of bounces a ball goes through until it comes to rest.

    • Use a loop to simulate the bounces until the ball stops bouncing

    • Calculate the height of each bounce using the given formula

    • Keep track of the number of bounces in a counter variable

  • Answered by AI
  • Q3. Which is the best and less time consuming way to calculate factorial of a number?
  • Ans. 

    The best and less time consuming way to calculate factorial of a number is using iterative approach.

    • Iteratively multiply the number with all the numbers from 1 to the given number

    • Start with a result variable initialized to 1

    • Multiply the result with each number in the range

    • Return the final result

  • Answered by AI
  • Q4. Write the code to find factorial using function recursion.
  • Ans. 

    Code to find factorial using function recursion

    • Define a function that takes an integer as input

    • Check if the input is 0 or 1, return 1 in that case

    • Otherwise, call the function recursively with input-1 and multiply it with the input

  • Answered by AI
  • Q5. They asked for my introduction.
  • Q6. They asked about my family members.

Interview Preparation Tips

Round: Test
Experience: Aptitude test was moderately tough. The coding test was on basics of c language of all the topics.
Tips: Solving R. S. Agrawal for Aptitude and videos on YouTube on C language are sufficient to score well.
Duration: 1 hour
Total Questions: 60

Round: Technical Interview
Experience: I wrote the first code correctly. I wrote the second code 75% correct and they explained me my mistakes and I could understand where I was going wrong then I corrected my code and then they were satisfied. They asked me whether I could write the factorial code by function recursion method. I replied that I can write the factorial code but not by function recursion method. They were satisfied.
Tips: Build your coding skills by more practice.

Round: HR Interview
Experience: In this round they just asked me my introduction and said that you are shortlisted for now but we will give you final confirmation after a week.
Tips: Don't lie. Be genuine.

College Name: SCOE, PUNE

Skills evaluated in this interview

Interview Questionnaire 

3 Questions

  • Q1. Asked me about my answer for a question in the logical test and asked me to find mistake
  • Q2. Some tree question
  • Q3. Some array question

Interview Preparation Tips

Round: Test
Experience: Just logical questions. Maybe create a DFA and NFA.
Duration: 1 hour
Total Questions: 20

Round: Coding
Experience: Given two questions. Each question is written like a story, but once you get the idea, it will be a simple question

College Name: Govt. Model Engineering College

I applied via Campus Placement

Interview Questionnaire 

3 Questions

  • Q1. They asked me optimise the code I had written for the first question
  • Q2. Given a binary tree, find out the maximum sum path from root to leaf. This problem, but they said tree has only positive integers. -----/ . To store the path I had used global array. They asked me alternat...
  • Q3. Given a list of words. Given three operations find out the minimum steps to reach from source string to destination string. Basically, -----/ this is the problem with some modification. For this question I...
  • Ans. 

    The question is about finding the minimum steps to reach from a source string to a destination string using three operations.

    • BFS and DFS are graph traversal techniques that can be used to solve this problem.

    • BFS is typically used when finding the shortest path or exploring all possible paths in a graph.

    • DFS is useful when searching for a specific path or exploring deeply into a graph.

    • In this case, BFS can be used to find...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: • 1 question was on time complexity of searching an unsorted array.
• 2 questions were on recursion, ie, number of recursive calls.
• 1 question on analysing given function on string.
• 1 question was on probability(Two hotels, say A and B. Probability of moving from A to B is 2/3, staying at A is 1/3. Probability of moving from B to A and staying at B is 1/2. If they make decisions each hour, and if they were at A at 7:00 pm, what is the probability that they will be at B at 10:00 pm).
• If a set has elements {1,2,3,4 .... n}. Then what is the sum of elements of it's power set. (Ex: S = {1,2}. Then power set is {{},{1},{2},{1,2}}. The sum is 6.
• If a set has elements {1,2,3,4,5,6,7,8,9,10}. Then how many subsets of 3 elements has no consecutive elements.
• 1 question was on designing a DFA for a string starting with a and ending with c and has at least b in it.
• 1 question had machine instructions. We had to find out minimum number of cycles needed to execute the given set of instructions. (a) If the instructions are executed in the given order. (b) If the instructions are executed in random order.
• 1 puzzle on bridges.

Tips: In this round they not only see the answer. They also verify how you approached(So, give correct explanation to your answers).
Duration: 90 minutes
Total Questions: 10

Round: Coding Round
Experience: Two questions were there. 3 hours duration.

1. Long question, I don't remember fully. I'll just give input/output examples. It was basically on string decoding. If jon2snow3 is there the decoded string will be jonjonsnowjonjonsnowjonjonsnow. Given a string and an integer k we have print the kth character in the decoded string
input:
jon2snow3
8
output:
n

2. Given an array and an integer k return the number of contiguous sub arrays whose sum is divisible by k.
input format:
n k

input:
4 5
10 0 4 5

output:
4

explaination: {10},{0},{10,0},{5} are the sub arrays with sum divisible by 5.


Tips: You will have lots of time, so try to optimise the solution if you can. Remember here also they review each individual's code.

Round: Technical Interview
Experience: They will help you a lot if you are stuck at some point in the question. You have to be smart enough to grasp the clue.
Tips: They only ask questions only on data structures and algorithms.

Skill Tips: You have to be strong in coding. Algorithm questions will be mostly on dynamic programming. Data structures questions are mostly on trees.
Skills: C Programming, Maths(esp Probability), Algorithms And Data Structures
Duration: 5
College Name: JSS Mahavidyapeetha Sri Jayachamarajendra College Of Engineering, Mysore

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Cadence Design Systems Interview FAQs

How many rounds are there in Cadence Design Systems Analog Design Engineer interview?
Cadence Design Systems interview process usually has 2 rounds. The most common rounds in the Cadence Design Systems interview process are Aptitude Test and HR.
What are the top questions asked in Cadence Design Systems Analog Design Engineer interview?

Some of the top questions asked at the Cadence Design Systems Analog Design Engineer interview -

  1. Asked about electrical questi...read more
  2. Does not remem...read more

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

INTERVIEWS

Brane Enterprises

No Interviews

CAMPUS PLACEMENT

MCKV Institute of Engineering, Howrah

INTERVIEWS

Travel Boutique Online

No Interviews

INTERVIEWS

Cadence Design Systems

No Interviews

INTERVIEWS

Blazeclan Technologies

No Interviews

INTERVIEWS

Cadence Design Systems

No Interviews

INTERVIEWS

Cadence Design Systems

No Interviews

SALARIES

Blazeclan Technologies

Tell us how to improve this page.

Cadence Design Systems Analog Design Engineer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Qualcomm Interview Questions
3.8
 • 274 Interviews
Intel Interview Questions
4.2
 • 223 Interviews
Texas Instruments Interview Questions
4.1
 • 124 Interviews
Synopsys Interview Questions
3.8
 • 89 Interviews
PTC Interview Questions
4.2
 • 62 Interviews
Molex Interview Questions
3.9
 • 53 Interviews
View all
Cadence Design Systems Analog Design Engineer Salary
based on 12 salaries
₹15 L/yr - ₹27 L/yr
9% more than the average Analog Design Engineer Salary in India
View more details
Lead Software Engineer
157 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer2
103 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Principal Software Engineer
93 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
84 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Design Engineer
72 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Cadence Design Systems with

Synopsys

3.9
Compare

Mentor Graphics

4.0
Compare

Ansys Software Private Limited

3.9
Compare

Autodesk

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