Psn Supply Chain Solutions Interview Questions and Answers

Motors are rated in KW because they consume power, while transformers and generators are rated in KVA because they produce power.

• Motors convert electrical energy into mechanical energy, so they consume power and are rated in KW.

• Transformers and generators produce electrical energy, so they are rated in KVA based on their apparent power.

• KVA takes into account both the real power (KW) and the reactive power (KVAR) produc...read more

The type of motor used in ceiling fans is an induction motor.

• Ceiling fans typically use single-phase induction motors.

• These motors are designed to provide a constant speed and are efficient in converting electrical energy into mechanical energy.

• The motor consists of a stator and a rotor, with the stator being the stationary part and the rotor being the rotating part.

• The stator contains windings that create a rotating m...read more

A thermal power plant generates electricity by converting heat energy into mechanical energy.

• Thermal power plants use fossil fuels or nuclear energy to heat water and produce steam.

• The steam drives a turbine, which is connected to a generator that produces electricity.

• The heat source can be coal, natural gas, oil, or nuclear reactions.

• The steam is condensed back into water and recycled in a closed-loop system.

• Thermal p...read more

A program to generate a geometric progression (GP).

• Take the first term, common ratio and number of terms as input.

• Use a loop to calculate each term of the GP.

• Print the generated GP as output.

A program to print factorial using recursion

• Define a function to calculate factorial recursively

• Base case: if the number is 0 or 1, return 1

• Recursive case: multiply the number with factorial of (number - 1)

• Print the factorial of a given number

Logic to reverse a string without using string functions

• Iterate through the string from the last character to the first

• Create a new string and append each character to it in reverse order

I am not currently planning on getting married.

• I am currently focused on my career and personal growth.

• Marriage is not a priority for me at this time.

• I believe in taking the time to find the right person and building a strong foundation before getting married.

Yes, I know Java.

• I have experience in Java programming.

• I am familiar with Java syntax and concepts.

• I have worked on Java projects in the past.

To retrieve data from the back end, you can use APIs or database queries.

• Use API calls to fetch data from the back end server.

• Execute database queries to retrieve data from the database.

• Parse the response or query result to extract the required data.

• Handle any necessary authentication or authorization for accessing the back end.

• Examples: GET request to an API endpoint, SELECT query in SQL.

OOP is a programming paradigm based on the concept of objects, which can contain data and code.

• OOP stands for Object-Oriented Programming

• It focuses on creating objects that interact with each other to solve a problem

• Encapsulation, inheritance, and polymorphism are key concepts in OOP

• Example: A car object can have properties like color, make, and model, and methods like start and stop

• OOP promotes code reusability and ma

Print the level order traversal of binary tree in spiral form

• Perform level order traversal of the binary tree

• Alternate the direction of traversal for each level

• Use a stack to reverse the order of nodes in each level

• Print the nodes in the order of traversal

Find the maximum element in each subarray of size k in a given array.

• Iterate through the array from index 0 to n-k.

• For each subarray of size k, find the maximum element.

• Store the maximum elements in a separate array.

• Return the array of maximum elements.

To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.

• Merge the two arrays into a single sorted array using a modified merge sort algorithm.

• Return the Kth element from the merged array.

Merge two sorted arrays into one sorted array with expected time complexity of (m+n).

• Use a two-pointer approach to compare elements from both arrays and merge them into the first array.

• Start comparing elements from the end of both arrays and place the larger element at the end of the first array.

• Continue this process until all elements from the second array are merged into the first array.