Upload Button Icon Add office photos
Premium Employer

i

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

PTC Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

PTC Software Engineer Interview Questions and Answers

Updated 6 Jun 2024

PTC Software Engineer Interview Experiences

2 interviews found

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

I applied via Referral and was interviewed in Dec 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Nice and difficult work from home

Round 2 - Technical 

(2 Questions)

  • Q1. Array and haah was aaked
  • Q2. It was difficult

Interview Preparation Tips

Interview preparation tips for other job seekers - Nice pic of you
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Logical verbal non verbal question

Round 2 - Group Discussion 

Java object oriented language

Interview Preparation Tips

Interview preparation tips for other job seekers - Hard work

Software Engineer Interview Questions Asked at Other Companies

asked in Qualcomm
Q1. Bridge and torch problem : Four people come to a river in the nig ... read more
asked in Capgemini
Q2. In a dark room,there is a box of 18 white and 5 black gloves. You ... read more
asked in TCS
Q3. Find the Duplicate Number Problem Statement Given an integer arra ... read more
Q4. Tell me something about yourself. Define encapsulation. What is i ... read more
asked in Paytm
Q5. Puzzle : 100 people are standing in a circle .each one is allowed ... read more

Interview questions from similar companies

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions based on DSA and OOPS.

  • Q1. How do you dynamically allocate a 2D array in C?
  • Ans. 

    Use double pointer to dynamically allocate memory for array of strings in C.

    • Declare a double pointer to hold the 2D array of strings.

    • Allocate memory for the rows first using malloc.

    • Then allocate memory for each string in the row using malloc.

    • Assign values to the strings in the array.

    • Example: char **array = malloc(rows * sizeof(char *));

    • Example: array[i] = malloc(strlen(str) + 1); strcpy(array[i], str);

  • Answered by AI
  • Q2. What are virtual functions in C++?
  • Ans. 

    Virtual functions in C++ are functions that can be overridden in derived classes, allowing for polymorphic behavior.

    • Virtual functions are declared using the 'virtual' keyword in the base class.

    • They are used to achieve runtime polymorphism in C++.

    • Derived classes can override the virtual functions defined in the base class.

    • Example: class Base { public: virtual void display() { cout << 'Base class dis...

  • Answered by AI
  • Q3. What are virtual base classes?
  • Ans. 

    Virtual base classes are classes that are inherited virtually to avoid multiple instances of the same base class in a derived class hierarchy.

    • Virtual base classes are used in multiple inheritance to prevent the Diamond Problem.

    • They are declared with the 'virtual' keyword in the base class.

    • When a class inherits a virtual base class, the most derived class is responsible for initializing the virtual base class.

    • Example: c...

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions based on OS/Networking etc.

  • Q1. What is the system call that creates a separate connection?
  • Ans. 

    The system call that creates a separate connection is fork()

    • fork() is a system call in Unix-like operating systems that creates a new process by duplicating the existing process

    • The new process created by fork() is called the child process, while the original process is called the parent process

    • fork() is commonly used in network programming to create separate connections for handling multiple clients

  • Answered by AI
  • Q2. What does the epoll_wait() system call do?
  • Ans. 

    epoll_wait() system call waits for events on an epoll instance

    • Used in Linux for I/O event notification

    • Blocks until one or more file descriptors become ready

    • Returns the number of file descriptors ready for I/O operations

  • Answered by AI
  • Q3. What are the different protocols used in the transport layer?
  • Ans. 

    Different protocols used in the transport layer include TCP, UDP, SCTP, and DCCP.

    • TCP (Transmission Control Protocol) - reliable, connection-oriented protocol used for most internet communication

    • UDP (User Datagram Protocol) - connectionless protocol used for applications where speed is more important than reliability

    • SCTP (Stream Control Transmission Protocol) - supports multiple streams of data, used for telecommunicati...

  • Answered by AI
  • Q4. What is the difference between TCP and UDP?
  • Ans. 

    TCP is a connection-oriented protocol that ensures reliable data delivery, while UDP is a connectionless protocol that focuses on speed.

    • TCP is reliable and ensures data delivery by establishing a connection before sending data.

    • UDP is faster but less reliable as it does not establish a connection before sending data.

    • TCP is used for applications that require high reliability and error correction, such as web browsing and...

  • Answered by AI
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical interview round with questions based on Networking etc.

  • Q1. What is the purpose of ICMP?
  • Ans. 

    ICMP is a protocol used for error reporting, diagnostics, and network management in IP networks.

    • ICMP is used to report errors in packet delivery

    • It is used for network diagnostics and troubleshooting

    • ICMP messages are encapsulated within IP packets

    • Examples include ping (echo request/reply) and traceroute

  • Answered by AI
  • Q2. What are the types of connection release supported by TCP?
  • Ans. 

    TCP supports four types of connection release: active close, passive close, simultaneous close, and abortive close.

    • Active close: Client initiates the connection release process by sending a FIN packet.

    • Passive close: Server initiates the connection release process by sending a FIN packet.

    • Simultaneous close: Both client and server send FIN packets to each other simultaneously.

    • Abortive close: Connection is terminated abru...

  • Answered by AI
  • Q3. What protocols are used by the MAC layer?
  • Ans. 

    The MAC layer uses protocols like CSMA/CA, CSMA/CD, and TDMA to manage access to the network.

    • CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) is used in wireless networks to avoid collisions.

    • CSMA/CD (Carrier Sense Multiple Access with Collision Detection) is used in wired networks to detect and handle collisions.

    • TDMA (Time Division Multiple Access) is used in networks where devices are assigned specific

  • Answered by AI
  • Q4. What is the ARP protocol?
  • Ans. 

    ARP (Address Resolution Protocol) is a protocol used to map an IP address to a MAC address in a local network.

    • ARP is used to resolve IP addresses to MAC addresses in a local network.

    • It operates at the data link layer of the OSI model.

    • ARP requests are broadcasted to all devices on the network.

    • Example: When a device wants to communicate with another device on the same network, it uses ARP to find the MAC address correspo

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAVMware Software India Private Limited interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Networking, OOPSTime required to prepare for the interview - 6 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 interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. C++ Program to reverse a string
  • Ans. 

    C++ program to reverse a string

    • Use a loop to iterate through the string

    • Swap the characters at the beginning and end of the string

    • Continue swapping until the middle of the string is reached

  • Answered by AI

Skills evaluated in this interview

I applied via LinkedIn and was interviewed in Apr 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. All were technical. Just keep practicing data structures and Algorithms and have good knowledge of the language you're good at.

Interview Preparation Tips

Interview preparation tips for other job seekers - Hey Folks
Just never get discouraged by your failures. Keep working hard and be consistent in your efforts. You will surely achieve what you deserve.

I applied via Naukri.com and was interviewed before Jul 2020. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Questions on java8
  • Q2. Questions on multithreading
  • Q3. Questions on exception handling

Interview Preparation Tips

Interview preparation tips for other job seekers - First round was a coding round where interviewer asked questions randomly and were asked to optimise our code. Next round was a technical round where everyone needs to be thorough with their technical skills

I applied via Campus Placement and was interviewed before Sep 2021. 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 - Aptitude Test 

Math and verbal round .

Round 3 - Group Discussion 

General topics to speak

Round 4 - Technical 

(1 Question)

  • Q1. Duplicates in array College Projects Hashmap implementation
  • Ans. 

    Implement a function to find duplicates in an array of strings using Hashmap.

    • Create a Hashmap to store the frequency of each string in the array

    • Iterate through the array and check if the frequency of any string is greater than 1

    • If yes, add it to the list of duplicates

    • Return the list of duplicates

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Answer what you know, be genuine and honest

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Questions related to AWS dynamodb,lambdas,cloudwatch logs,Athena,json filehandling,decorators,classes and others oops concepts ,string manipulation, word frequency problems, dictionary,boto3 scripting

Interview Questionnaire 

1 Question

  • Q1. Basic java questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Verify your project before joining, since they give different project and skill

PTC Interview FAQs

How many rounds are there in PTC Software Engineer interview?
PTC interview process usually has 2 rounds. The most common rounds in the PTC interview process are Aptitude Test, Group Discussion and Coding Test.
How to prepare for PTC Software Engineer 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 PTC. The most common topics and skills that interviewers at PTC expect are Agile, Software Engineering, Java, Programming and Salesforce.
What are the top questions asked in PTC Software Engineer interview?

Some of the top questions asked at the PTC Software Engineer interview -

  1. Array and haah was aa...read more
  2. It was diffic...read more

Tell us how to improve this page.

PTC Software Engineer Interview Process

based on 2 interviews

Interview experience

5
  
Excellent
View more
PTC Software Engineer Salary
based on 48 salaries
₹4.5 L/yr - ₹17.1 L/yr
14% more than the average Software Engineer Salary in India
View more details

PTC Software Engineer Reviews and Ratings

based on 5 reviews

4.7/5

Rating in categories

4.7

Skill development

4.5

Work-life balance

4.7

Salary

4.7

Job security

4.5

Company culture

4.5

Promotions

4.7

Work satisfaction

Explore 5 Reviews and Ratings
Software Specialist
164 salaries
unlock blur

₹7.5 L/yr - ₹18.2 L/yr

Technical Lead
107 salaries
unlock blur

₹10.1 L/yr - ₹29 L/yr

Senior Software Specialist
96 salaries
unlock blur

₹9.1 L/yr - ₹24.5 L/yr

QA Specialist
81 salaries
unlock blur

₹7 L/yr - ₹15 L/yr

Product Specialist
77 salaries
unlock blur

₹7.5 L/yr - ₹13 L/yr

Explore more salaries
Compare PTC with

Autodesk

4.2
Compare

24/7 Customer

3.5
Compare

Thomson Reuters

4.1
Compare

NCR Voyix

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