AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Progress
Compare
Filter interviews by
Progress Interview Questions and Answers for Freshers
Progress Interview Experiences for Freshers
1 interview found
Selected
I applied via Company Website and was interviewed before Oct 2023. There were 3 interview rounds.
Easy to Medium level DSA questions, Some Aptitude Questions
(2 Questions)
- Q1. Array+HashMap based question, Difficulty : Easy
- Q2. Binary Search question, Difficulty : Medium
(2 Questions)
- Q1. LinkedList Question (Difficulty : Easy)
- Q2. Recursion+Backtracking Question (Difficulty : Medium)
Interview Preparation Tips
Software Engineer Intern Interview Questions asked at other Companies
Jobs at Progress
Top trending discussions
Interview questions from similar companies
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
- 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
- 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.
- 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
- 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
- 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
- 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.
- 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
Interview Preparation Tips
College Name: Na
Skills evaluated in this interview
I appeared for an interview in Jun 2017.
Interview Questionnaire
2 Questions
- Q1. What is HTML, PHP and CSS
- Ans.
HTML, PHP, and CSS are programming languages used for creating and designing websites.
HTML (Hypertext Markup Language) is used for creating the structure and content of web pages.
PHP (Hypertext Preprocessor) is a server-side scripting language used for creating dynamic web pages.
CSS (Cascading Style Sheets) is used for styling and formatting the layout of web pages.
Example: HTML is used to create headings, paragraphs, ...
- Q2. In my technical test, they asked me to replicate the privacy pages of Twitter and facebook.
Interview Preparation Tips
Experience: I was referred to by a friend so this step was comparatively easier.
Tips: Resume should be straightforward and extra and incomplete information should be avoided.
Round: Technical + HR Interview
Experience: A formal face to face interview was conducted. They tested my past knowledge about concepts related to the functioning of their company. It was a smooth interview.
Tips: Be confident, and if you are not thorough with a particular topic, be straightforward and tell the interviewer. Honesty is the best policy to crack an interview.
Round: Client interview
Experience: In this round, a conference call was held between the client in US and me. I was expected to put my exisiting knowledge in to practice to solve the problem at hand.
Tips: Be clear and concise and communicate appropriately. At this stage, a proficiency in English language and a good command over it is a must. Even if you are nervous and sweating, don't EVER show it.
Skills: Technical Analysis, Communication
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
Interview Questionnaire
4 Questions
- Q1. Call routing
- Q2. Be ready with 2G to 4G call routing studied
- Q3. Revenue assurance and fraud management
- Q4. Other basic telecom background questions
Interview Preparation Tips
You'll do good
I applied via Recruitment Consultant and was interviewed in Dec 2020. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. First round was coding round : 1. One string rotaion of other 2. Nearest largest and smallest prime value of given input. interview questions:What is difference between reference variable and pointer ?
Interview Preparation Tips
Grammer and general understanding
Interview Preparation Tips
Selected
I applied via Referral and was interviewed before Aug 2022. There were 3 interview rounds.
It was more about soft skills based on your work experience
(1 Question)
- Q1. Team interview - job responsibilites and work exp
Interview Preparation Tips
It included question from aptitude, reasoning, English, CSE fundamentals like oops and sql
(1 Question)
- Q1. It included everything which was mentioned in your resume
(1 Question)
- Q1. Same as round 2, it has few managerial questions as well
Associate Software Engineer Interview Questions & Answers
Bentley Systems
Anonymous
posted on 23 Dec 2022
Selected
I applied via CoCubes and was interviewed before Dec 2021. There were 5 interview rounds.
There were some basic aptitude questions and OOP questions as MCQs. At the end there was a simple conding question.
(2 Questions)
- Q1. What is pre/post increment/decrement operator?
- Ans.
Pre/post increment/decrement operators are used to increase/decrease the value of a variable by 1.
Pre-increment operator (++x) increases the value of x by 1 before using it in an expression.
Post-increment operator (x++) increases the value of x by 1 after using it in an expression.
Pre-decrement operator (--x) decreases the value of x by 1 before using it in an expression.
Post-decrement operator (x--) decreases the valu...
- Q2. Projects worked on Internships
- Ans.
I have worked on various projects and internships during my time as a software engineer.
Developed a web application for a retail company to manage inventory and sales.
Collaborated with a team to create a mobile app for a healthcare startup to track patient vitals.
Implemented a machine learning algorithm for a research project in the field of natural language processing.
Optimized database queries and improved performanc...
(3 Questions)
- Q1. Program to find middle of a linked list
- Ans.
Program to find middle of a linked list
Traverse the linked list using two pointers, one moving twice as fast as the other
When the faster pointer reaches the end, the slower pointer will be at the middle
Handle even and odd length linked lists separately
- Q2. Discussion on projects and internships
- Q3. Other simple DSA questions
(3 Questions)
- Q1. What data structures would you use to save images?
- Ans.
I would use a binary format like JPEG or PNG to save images.
JPEG and PNG are common binary formats used to save images.
These formats use compression to reduce file size without losing quality.
Other options include BMP, GIF, and TIFF, but they may not be as efficient.
Images can also be saved as arrays of pixels or as vectors, depending on the type of image.
The choice of data structure depends on the specific use case an
- Q2. Write a function to swap. What exceptions it may throw?
- Ans.
Function to swap two variables and possible exceptions
Function should take two variables as input
Use a temporary variable to swap the values
Possible exceptions include null pointer exception or out of bounds exception
- Q3. System design of a carrom board game
- Ans.
Designing a carrom board game system
Define game rules and mechanics
Create game board and pieces
Implement player turns and scoring system
Include AI for single player mode
Consider multiplayer options and networking
Test and debug thoroughly
Interview Preparation Tips
- C
- C++
- Javascript
- React.Js
- C#
Skills evaluated in this interview
Associate Software Engineer Interview Questions & Answers
AgreeYa Solutions
Anonymous
posted on 11 May 2022
I applied via telegram and was interviewed in Nov 2021. There were 4 interview rounds.
General topic
(1 Question)
- Q1. Whatever you mention in resume
(1 Question)
- Q1. Oops ,java,machine learning,dbms
Interview Preparation Tips
Progress Interview FAQs
Some of the top questions asked at the Progress interview for freshers -
Tell us how to improve this page.
Progress Interviews By Designations
Interview Questions for Popular Designations
Progress Interview Process for Freshers
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Progress Reviews and Ratings
based on 28 reviews
Rating in categories
|
Software Engineer
14
salaries
|  ₹6.5 L/yr - ₹14 L/yr |
|
Senior Software Engineer
13
salaries
| ₹13.8 L/yr - ₹45 L/yr |
|
Principal Software Engineer
11
salaries
| ₹21 L/yr - ₹39.5 L/yr |
|
Software Engineer2
8
salaries
| ₹12 L/yr - ₹20.3 L/yr |
|
Senior Software Engineer 2
7
salaries
| ₹25 L/yr - ₹40 L/yr |
Duck Creek Technologies
FinThrive
Mobileum
AgreeYa Solutions
- Home >
- Interviews >
- Progress Interview Questions >
- Progress Interview Questions for Fresher
