Prowess Software Services Senior Associate Interview Questions and Answers

Q1. Explain machine learning algorithms you have used?
Ans. 
I have experience with various machine learning algorithms including decision trees, random forests, support vector machines, and neural networks.
• Decision trees

• Random forests

• Support vector machines

• Neural networks
Answered by AI
Add your answer

Perform operations in dataframe

Assusual apti questions from every topics

1. 1 coding Question we can use java, python etc to solve and
2. another 1 sql question

One question based on any one data structure (in my case I solved stack &queue combinely)

Q1. They ask about Ur background qualifications and verify
Add your answer
Q2. And then explain the process of company and ask everything is ok for us like bond etc
Add your answer
Q3. Then sheduled interview on the next day
Add your answer

Q1. She(hr) introduced herself
Add your answer
Q2. Then she asked me to introduce myself
Add your answer
Q3. What are the programming languages u know ( I said I'm strong in java)
Ans. 
I am strong in Java programming language.
• Proficient in Java programming language

• Experience in developing applications using Java

• Knowledge of Java frameworks like Spring and Hibernate
Answered by AI
Add your answer
Q4. Rate Urself in it out of 5
Ans. 
I rate myself 4 out of 5 in IT skills.
• Proficient in programming languages such as Java, Python, and C++

• Experienced in software development and debugging

• Familiar with database management systems like MySQL and MongoDB
Answered by AI
Add your answer
Q5. She asked me to explain lambda expressions in java
Add your answer
Q6. Explain detaily about Four pillars of oops
Ans. 
The four pillars of OOP are encapsulation, inheritance, polymorphism, and abstraction.
• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Inheritance: Allows a class to inherit properties and behavior from another class.

• Polymorphism: Ability to present the same interface for different data types.

• Abstraction: Hides the complex implementation details and only shows the necessary features.
Answered by AI
Add your answer
Q7. Share Ur screen and get this output (pattern program)
Ans. 
Print a specific pattern using loops
• Use nested loops to print the desired pattern

• Increment the number of characters printed in each row

• Adjust the spacing to create the desired pattern
Answered by AI
Add your answer
Q8. Shorterm and long-term goals
Add your answer
Q9. If your assigned to a task how can you complete it
Add your answer
Q10. Exception handling concept (she specifically asked about throw, throws, finally keyword)
Add your answer
Q11. Explain about Static keyword
Ans. 
Static keyword is used in programming languages to declare variables, functions, or classes that are shared among all instances of a class or are only accessible within a specific scope.
• Static variables retain their values between function calls

• Static functions can only be called within the same file

• Static classes cannot be instantiated and are used for grouping related methods and properties
Answered by AI
Add your answer

Easy applitute question with 1 coding question at the end

Q1. String builder vs string buffer
Ans. 
String builder is faster but not thread-safe, while string buffer is slower but thread-safe.
• String builder is recommended for single-threaded applications for better performance.

• String buffer is recommended for multi-threaded applications to ensure thread safety.

• Example: StringBuilder sb = new StringBuilder(); StringBuffer sbf = new StringBuffer();
Answered by AI
Add your answer
Q2. Final keyword in oops
Ans. 
The final keyword in OOP is used to restrict the user from changing the value of a variable, overriding a method, or inheriting from a class.
• Final variable: value cannot be changed once assigned

• Final method: cannot be overridden in child classes

• Final class: cannot be inherited by other classes
Answered by AI
Add your answer
Q3. Bsf graph explanation
Ans. 
BSF graph explanation
• BFS (Breadth-First Search) is a graph traversal algorithm that explores all the neighbor nodes at the present depth before moving on to the nodes at the next depth.

• It uses a queue data structure to keep track of the nodes to visit next.

• BFS is often used to find the shortest path in an unweighted graph.

• Example: BFS can be used to find the shortest path in a maze from the starting point to the exit.
Answered by AI
Add your answer

Its a sectional round. It has 4 sections. Quants, Logical, pseudo code, Reasoning, Gaming

Q1. Aptitude question solving
Add your answer
Q2. Resume related questions
Add your answer