Upload Button Icon Add office photos
Engaged Employer

i

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

Dassault Systemes Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Dassault Systemes Python Developer Interview Questions and Answers

Updated 1 Apr 2023

Dassault Systemes Python Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in Mar 2023. 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 tips
Round 2 - Coding Test 

One to one interview along with coding round.
Basic questions for python based on list touple dictionary.
Numpy, Pandas, CSV and operation.
SQL queries basic like join query
Having query.

Round 3 - One-on-one 

(5 Questions)

  • Q1. Managerial round Use case base
  • Q2. Completely based on your work experience discussion along with some basic logical use case.
  • Q3. This including salary expectancy questions
  • Q4. Previous projects questions
  • Q5. Core logic of previous work
  • Ans. 

    The core logic of my previous work involved developing a web application using Python and Django framework.

    • Developed a web application using Python and Django framework

    • Implemented various features and functionalities based on client requirements

    • Handled database operations and data manipulation using Django ORM

    • Worked on front-end development using HTML, CSS, and JavaScript

    • Collaborated with a team of developers to ensure

  • Answered by AI

Interview Preparation Tips

Topics to prepare for Dassault Systemes Python Developer interview:
  • Python
  • SQL
  • Use case based
Interview preparation tips for other job seekers - Stick to basics, Be as you are.
Quick answer not expected but give appropriate answer

Interview questions from similar companies

I applied via Campus Placement and was interviewed in Feb 2021. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. How to find the middle of a linked list in one iteration.
  • Ans. 

    To find the middle of a linked list in one iteration, use two pointers with different speeds.

    • Initialize two pointers, one slow and one fast, both pointing to the head of the linked list.

    • Move the slow pointer one step at a time and the fast pointer two steps at a time.

    • When the fast pointer reaches the end of the linked list, the slow pointer will be at the middle node.

  • Answered by AI
  • Q2. All sorting you know and their complexities both time and space
  • Q3. Eagle eye view of binary tree
  • Ans. 

    A binary tree is a data structure consisting of nodes, where each node has at most two children.

    • Binary tree is used to represent hierarchical relationships between nodes

    • Traversal of binary tree can be done in three ways: inorder, preorder, postorder

    • Binary search tree is a type of binary tree where left child is smaller and right child is greater than parent

    • Balanced binary tree has height difference of at most 1 between...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Revise everything you learnt just before the intervsiew. Be clear on things you have put on your resume.

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

It was like 5 MCQ and two coding questions with difficult level of moderate

Round 2 - Technical 

(2 Questions)

  • Q1. They asked questions from DSA,sql and some web technology which I mentioned in my resume
  • Q2. What is the life cycle of react components?
  • Ans. 

    React components go through various stages in their life cycle, from initialization to destruction.

    • Initialization: Component is created and initialized with default props and state.

    • Mounting: Component is rendered on the DOM for the first time.

    • Updating: Component re-renders when props or state change.

    • Unmounting: Component is removed from the DOM.

    • Examples: componentDidMount() for mounting, componentDidUpdate() for updati

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. Asked about my project and some behavioural questions

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 hours of duration and medium level leetcode questions

Round 2 - Technical 

(2 Questions)

  • Q1. What do you mean by os?
  • Ans. 

    OS stands for Operating System. It is a software that manages computer hardware and provides services for computer programs.

    • OS is the software that acts as an intermediary between computer hardware and user applications.

    • It manages computer resources such as memory, processors, devices, and file systems.

    • Examples of popular operating systems include Windows, macOS, Linux, and Android.

  • Answered by AI
  • Q2. How can deadlock be avoided?
  • Ans. 

    Deadlock can be avoided by implementing proper resource allocation strategies and using techniques like deadlock prevention, avoidance, detection, and recovery.

    • Implement proper resource allocation strategies such as resource ordering, wait-die, wound-wait, etc.

    • Use techniques like deadlock prevention by ensuring that the system never enters a deadlock state, avoidance by ensuring that the system does not enter an unsafe...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident while answering.

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Sep 2022. There were 4 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 tips
Round 2 - Coding Test 

Aptitude Java CI/CD DevOps Unit testing HTML CSS

Round 3 - Technical 

(1 Question)

  • Q1. Technical questions same as above Puzzles to assess problem solving abilities
Round 4 - HR 

(1 Question)

  • Q1. General questions around CTC and expectations
Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
Not Selected
Round 1 - Technical 

(2 Questions)

  • Q1. What is oops, Mostly Debugging Questions
  • Q2. Pointers, Memory Allocation
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Oct 2023. There were 4 interview rounds.

Round 1 - Coding Test 

Topics: maps, sorting and simple DSA question

Round 2 - Technical 

(3 Questions)

  • Q1. What is linked list? How it is stored in memory? Give real examples of linked-list.
  • Ans. 

    A linked list is a data structure where each element points to the next element in the sequence.

    • Linked list is stored in memory as nodes, where each node contains data and a reference to the next node.

    • Examples of linked-list include a singly linked list, doubly linked list, and circular linked list.

    • In a singly linked list, each node points to the next node. In a doubly linked list, each node points to both the next and

  • Answered by AI
  • Q2. How does ML models are built?
  • Ans. 

    ML models are built by collecting and preparing data, selecting a model, training the model on the data, and evaluating its performance.

    • Collect and prepare data by cleaning, transforming, and encoding it

    • Select a model based on the problem at hand (e.g. regression, classification, clustering)

    • Train the model using algorithms like linear regression, decision trees, or neural networks

    • Evaluate the model's performance using ...

  • Answered by AI
  • Q3. Difference between array and linked list.
  • Ans. 

    Arrays store elements in contiguous memory locations, while linked lists store elements in nodes with pointers to the next node.

    • Arrays have fixed size, while linked lists can dynamically grow or shrink.

    • Accessing elements in arrays is faster (O(1)), while accessing elements in linked lists is slower (O(n)).

    • Inserting or deleting elements in arrays can be inefficient, as it may require shifting elements, while in linked l...

  • Answered by AI
Round 3 - Technical 

(2 Questions)

  • Q1. Given string s, return string y which stores first occurrence of characters of s .
  • Ans. 

    Return a string containing the first occurrence of characters in the input string.

    • Create an empty string to store the result.

    • Iterate through each character in the input string.

    • If the character is not already in the result string, add it to the result string.

    • Return the result string.

  • Answered by AI
  • Q2. Describe the hardest DSA questions you have ever done.
  • Ans. 

    One of the hardest DSA questions I have done involved implementing a complex graph traversal algorithm.

    • The question required understanding of graph data structures and algorithms.

    • I had to implement a depth-first search or breadth-first search algorithm.

    • The question may have involved finding the shortest path in a weighted graph.

    • I had to consider edge cases and optimize the algorithm for efficiency.

  • Answered by AI
Round 4 - HR 

(1 Question)

  • Q1. What are your hobbies, plans for future after 5 years?

Interview Preparation Tips

Topics to prepare for Autodesk Software Developer interview:
  • OS
  • OOPS
Interview preparation tips for other job seekers - When you know the answer, be very concise with your answer, try to explain without rambling with minimum word count.
When you don't know the answer try repeating the question back to interviewer to be super clear about the question and then say that currently you don't hold that much clarity about the topic but you will learn it soon.

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

Timing - 10AM-11:30AM
Online proctored test

  • Q1. 

    Binary Tree Right View Problem Statement

    Given a binary tree of integers, your task is to print the right view of it. The right view represents a set of nodes visible when the tree is viewed from the righ...

  • Ans. 

    The task is to print the right view of a binary tree, representing nodes visible from the right side in top-to-bottom order.

    • Traverse the tree level by level and keep track of the rightmost node at each level

    • Print the rightmost node of each level to get the right view of the tree

    • Use a queue for level order traversal and a map to store the rightmost nodes

  • Answered by AI
  • Q2. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight from 0 to W.

    • Iterate through each item and update the array based on whether including the item would increase the total value.

    • The final value in the array at index W will be the maximum value that can be stolen.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Medium

Timing : 4PM-5PM
Environment - Online

There was a panel of 3 interviewers

  • Q1. How can you find the size of an array in C or C++ without using sizeof or any standard function?
  • Ans. 

    You can find the size of an array in C or C++ by dividing the total size of the array by the size of one element.

    • Calculate the total size of the array by multiplying the number of elements by the size of each element.

    • Divide the total size by the size of one element to get the size of the array.

    • For example, if you have an array of strings arr[] = {'hello', 'world', 'example'}, you can find the size by dividing the total

  • Answered by AI
  • Q2. Explain how indexing in a database works using B+ trees.
  • Ans. 

    B+ trees are used for indexing in databases to efficiently search and retrieve data.

    • B+ trees are balanced trees where each node can have multiple keys and child pointers.

    • Data is stored in leaf nodes, while non-leaf nodes are used for navigation.

    • B+ trees are commonly used in databases because of their ability to efficiently search and retrieve data.

    • Example: In a database table with an index on a specific column, B+ tree...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 45 mintues
Round difficulty - Easy

Timing - 11AM-12:15PM
Environment - online video call

Again there was a panel of 2 senior engineers

  • Q1. 

    Maximum Path Sum Problem Statement

    You are given an n-ary tree consisting of 'N' nodes. Your task is to determine the maximum sum of the path from the root to any leaf node.

    Example:

    Input:
    For the giv...
  • Ans. 

    Find the maximum sum of the path from the root to any leaf node in an n-ary tree.

    • Traverse the tree from root to leaf nodes while keeping track of the sum of each path.

    • At each node, calculate the sum of the path from the root to that node and update the maximum sum found so far.

    • Consider using depth-first search (DFS) or breadth-first search (BFS) for tree traversal.

    • Handle cases where nodes have negative values or where

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Netaji Subhas University Of Technology. I applied for the job as SDE - 1 in NoidaEligibility criteria7.5 CGPAANSYS, Inc. interview preparation:Topics to prepare for the interview - System Design, core C++, Algorithms, Data Structures, DBMSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Brush Up on Computer Science Fundamentals
Tip 2 : Prepare a Brief Self-Introduction

Application resume tips for other job seekers

Tip 1 : Do not put fake resume
Tip 2 : Writing internship project helps.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
Less than 2 weeks
Result
No response

I applied via Job Portal and was interviewed before Jun 2023. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • Q1. Write down the recursion tree for this code:
  • Ans. 

    Recursion tree for a given code

    • Identify the base case of the recursion

    • Draw a tree structure with each recursive call as a node

    • Label each node with the input parameters and return values

  • Answered by AI

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

Dassault Systemes Interview FAQs

How many rounds are there in Dassault Systemes Python Developer interview?
Dassault Systemes interview process usually has 3 rounds. The most common rounds in the Dassault Systemes interview process are Resume Shortlist, Coding Test and One-on-one Round.
How to prepare for Dassault Systemes Python Developer 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 Dassault Systemes. The most common topics and skills that interviewers at Dassault Systemes expect are AWS, Agile, Architecture, CSS and Clinical Research.
What are the top questions asked in Dassault Systemes Python Developer interview?

Some of the top questions asked at the Dassault Systemes Python Developer interview -

  1. Completely based on your work experience discussion along with some basic logic...read more
  2. This including salary expectancy questi...read more
  3. Managerial round Use case b...read more

Tell us how to improve this page.

Dassault Systemes Python Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

IBM Interview Questions
4.0
 • 2.3k Interviews
Oracle Interview Questions
3.7
 • 848 Interviews
Amdocs Interview Questions
3.7
 • 514 Interviews
Zoho Interview Questions
4.3
 • 505 Interviews
Siemens Interview Questions
4.1
 • 418 Interviews
SAP Interview Questions
4.2
 • 283 Interviews
Adobe Interview Questions
3.9
 • 234 Interviews
Salesforce Interview Questions
4.0
 • 223 Interviews
View all
R&D Engineer
606 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineering Specialist
358 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
350 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
288 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

QA Engineer
135 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Dassault Systemes with

Autodesk

4.2
Compare

Siemens

4.1
Compare

PTC

4.2
Compare

Ansys Software Private Limited

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