Prosys Infotech Senior Developer Interview Questions and Answers

Data structure and aptitude

10 mins given for prepare for the problem and after completing the problem (program ) they asked to explain and asked to upgrade the program by reduce time complexity

Q1. Topic given and want to explain
Add your answer
Q2. Reverse string without buildin funtion and for loop
Ans. 
Reverse a string without using built-in functions or for loops
• Use recursion to reverse the string

• Pass the substring excluding the first character to the recursive function

• Base case: return the character itself if the length of the string is 1

• Concatenate the last character of the string with the result of the recursive call
Answered by AI
Add your answer

Q1. Introduce your self
Ans. 
I am a passionate software developer with experience in Java, Python, and web development.
• Experienced in Java and Python programming languages

• Skilled in web development technologies like HTML, CSS, and JavaScript

• Worked on projects involving database management with SQL
Answered by AI
Add your answer
Q2. Are you ok with agreement
Ans. 
Yes, I am okay with agreement.
• I am comfortable with signing agreements related to software development projects.

• I understand the importance of agreements in protecting both parties involved in a project.

• I am willing to review and negotiate agreements to ensure they are fair and reasonable.
Answered by AI
Add your answer

Divisibility, LCM, HCF.
Numbers, Decimals, Fractions, Powers.
Profit, Loss.
Simple interest and Compound interest.
Speed, Distance, Time.
Work and wages.
Trains, Boats, Streams-upstream/downstream, Circular track questions.
Cistern and pipes.

Coding interviews test candidates' technical knowledge, coding ability, problem solving skills, and creativity, typically on a whiteboard.

Choose a topic based on the assignment.
2 Conduct research.
3 Write a thesis statement

Q1. Promises in javascript
Ans. 
Promises in JavaScript are objects representing the eventual completion or failure of an asynchronous operation.
• Promises are used to handle asynchronous operations in JavaScript.

• They can be in one of three states: pending, fulfilled, or rejected.

• Promises can be chained using .then() to handle success and .catch() to handle errors.
Answered by AI
Add your answer

C,c++ questions and two coding questions. basic mcq

Q1. Treeset, hashset difference
Ans. 
TreeSet and HashSet are both implementations of the Set interface in Java, but they have some key differences.
• TreeSet is a sorted set that maintains elements in ascending order, while HashSet does not guarantee any specific order.

• TreeSet uses a Red-Black tree data structure for storage, which allows for efficient retrieval of elements in sorted order.

• HashSet uses a hash table for storage, which provides constant-time p...read more
Answered by AI
Add your answer
Q2. Oops concept, dbms, programming questions
Add your answer
Q3. Set and treeset and hashset
Add your answer

Create a movie app which fetches data from an API

Q1. General questions from Android development.
Add your answer
Q2. DSA round + project discussion
Add your answer
Q3. Stock span problem (leetcode)
Ans. 
Stock span problem is a financial problem where we have a series of n daily price quotes for a stock and we need to calculate the span of stock's price for all n days.
• Use a stack to keep track of the previous days' prices and their spans.

• For each day, pop the stack until a price greater than the current day's price is found, then calculate the span.

• Push the current day's price and span onto the stack.
Answered by AI
Add your answer
Q4. Search in a list of strings
Ans. 
Use a loop to search for a specific string in an array of strings.
• Iterate through each string in the array

• Use a conditional statement to check if the current string matches the search string

• Return the index of the matching string or -1 if not found
Answered by AI
Add your answer

Online Coding Test on their platform

Q1. Which data structure would you use to find the topper of a college
Ans. 
Use a max heap data structure to find the topper of a college.
• Max heap is a complete binary tree where the value of each node is greater than or equal to the values of its children.

• Insert all students' scores into a max heap and then extract the top element to find the topper.

• Example: If student A scored 90, student B scored 85, and student C scored 95, the max heap would have [95, 85, 90].
Answered by AI
Add your answer

Q1. Questions on project
Add your answer