i
Autodesk
Filter interviews by
Clear (1)
Introduced a new project management tool to streamline communication and tracking
Identified inefficiencies in current project management process
Researched and evaluated different project management tools
Implemented new tool and provided training to team members
Monitored and measured improvements in communication and tracking
Experienced technical program manager with a background in software development and project management.
Over 8 years of experience in leading cross-functional teams to deliver complex technical projects on time and within budget
Strong understanding of software development lifecycle and agile methodologies
Proven track record of successfully managing multiple projects simultaneously
Excellent communication and stakeholder ...
Top trending discussions
I applied via Company Website and was interviewed before Aug 2022. There were 3 interview rounds.
Reverse a given string using for loop
I applied via Campus Placement and was interviewed in Feb 2021. There were 4 interview rounds.
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.
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...
I applied via Campus Placement and was interviewed in Aug 2022. There was 1 interview round.
Data structures are used to organize and store data efficiently. Time complexity is the measure of efficiency.
Arrays - O(1) for access, O(n) for search and insertion
Linked Lists - O(n) for access, O(1) for insertion and deletion
Stacks - O(1) for access, insertion and deletion
Queues - O(1) for access, insertion and deletion
Trees - O(log n) for access, insertion and deletion
Hash Tables - O(1) for access, insertion and de
Binary trees are classified based on the number of children each node can have.
Full binary tree: every node has either 0 or 2 children
Complete binary tree: all levels except possibly the last are completely filled, and all nodes are as far left as possible
Perfect binary tree: all internal nodes have two children and all leaf nodes are at the same level
Balanced binary tree: the difference in height between the left and ...
posted on 25 Oct 2024
Topics were on dbms, dsa and oops mostly
Scheduling Program, Build Scripts
It was like 5 MCQ and two coding questions with difficult level of moderate
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
I applied via Campus Placement and was interviewed in Apr 2023. There were 4 interview rounds.
Moderate level questions
Logical verbal non verbal question
Java object oriented language
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Senior Software Engineer
102
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
84
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Engineer
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Adobe
Dassault Systemes
PTC
Siemens