Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Siemens EDA Digital Design Engineer Interview Questions and Answers

Updated 19 Oct 2024

Siemens EDA Digital Design Engineer Interview Experiences

1 interview found

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

I applied via Campus Placement and was interviewed in Apr 2024. There was 1 interview round.

Round 1 - Aptitude Test 

42 mcq questions on core qubject, 1.5 hr

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 Nov 2023. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Basic Electronics
  • Q2. Basic Electrical
Round 2 - One-on-one 

(1 Question)

  • Q1. VLSI Designing and CMOS Questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and resume prepared
Interview experience
3
Average
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I applied via Job Portal and was interviewed in Jan 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Write a c program on fibbonacci series
  • Ans. 

    A C program to generate Fibonacci series

    • Declare variables to store current and previous Fibonacci numbers

    • Use a loop to calculate and print Fibonacci numbers

    • Handle edge cases like 0 and 1 separately

  • Answered by AI
  • Q2. Design a up counter circuit
  • Ans. 

    A up counter circuit is a digital circuit that counts upwards in binary sequence.

    • Use flip-flops to store the count value

    • Connect the output of one flip-flop to the clock input of the next flip-flop

    • Use logic gates to control the counting sequence

    • Add a reset input to clear the count when needed

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - stick with your basics

Skills evaluated in this interview

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
4
Good
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before May 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. RLC network and network theory
  • Q2. Related to project
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
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Aptitude Test 

Medium good assesment test

Round 3 - Technical 

(2 Questions)

  • Q1. DSA oops question in detail
  • Q2. Array questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Oops DSA questions were asked
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Technical 

(2 Questions)

  • Q1. Verilog and Digital basic but twisting questions were asked
  • Q2. Questions related to flipflop were asked

Interview Preparation Tips

Interview preparation tips for other job seekers - Have clear understanding of basics and try appling practically or creatively

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

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

Siemens EDA Interview FAQs

How many rounds are there in Siemens EDA Digital Design Engineer interview?
Siemens EDA interview process usually has 1 rounds. The most common rounds in the Siemens EDA interview process are Aptitude Test.

Recently Viewed

INTERVIEWS

AlphaSense

No Interviews

INTERVIEWS

Atlassian

No Interviews

INTERVIEWS

Siemens EDA

No Interviews

INTERVIEWS

Tractebel

No Interviews

INTERVIEWS

Gabriel India

No Interviews

INTERVIEWS

Atlassian

No Interviews

INTERVIEWS

Siemens EDA

No Interviews

INTERVIEWS

Tractebel

No Interviews

INTERVIEWS

Tractebel

No Interviews

INTERVIEWS

Tractebel

No Interviews

Tell us how to improve this page.

Siemens EDA Digital Design Engineer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

TCS Interview Questions
3.7
 • 10.4k Interviews
Accenture Interview Questions
3.8
 • 8.1k Interviews
Infosys Interview Questions
3.6
 • 7.5k Interviews
Wipro Interview Questions
3.7
 • 5.6k Interviews
Cognizant Interview Questions
3.7
 • 5.6k Interviews
Amazon Interview Questions
4.1
 • 5k Interviews
Capgemini Interview Questions
3.7
 • 4.8k Interviews
Tech Mahindra Interview Questions
3.5
 • 3.8k Interviews
HCLTech Interview Questions
3.5
 • 3.8k Interviews
Genpact Interview Questions
3.8
 • 3.1k Interviews
View all
Senior Member of Technical Staff
42 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Member Technical Staff
19 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Technical Staff Member Lead
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Siemens EDA with

Cadence Design Systems

4.1
Compare

Synopsys

3.9
Compare

Mentor Graphics

4.0
Compare

Ansys Software Private Limited

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