Career Classes 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.

Determining toll for Jamuna Expressway

• Consider the distance of the expressway

• Analyze the maintenance cost of the expressway

• Take into account the traffic volume and expected revenue

• Compare with toll rates of similar expressways

• Consider the economic status of the region

• Consult with experts and stakeholders

Find sum of all numbers formed from root to leaf path in a binary tree

• Traverse the binary tree using DFS

• At each leaf node, add the number formed from root to leaf path to a sum variable

• Return the sum variable

• Time complexity: O(n)

• Example: For a binary tree with root value 1, left child 2 and right child 3, the sum would be 12 + 13 = 25

Given a string, print all possible strings that can be made by placing spaces (zero or one) in between them.

• Use recursion to generate all possible combinations of spaces

• For each recursive call, either add a space or don't add a space between the current character and the next character

• Base case is when there are no more characters left to add spaces between

• Time complexity is O(2^n) where n is the length of the string

Preorder traversal without recursion

• Use a stack to keep track of nodes

• Push right child first and then left child onto stack

• Pop top of stack and print value

• Repeat until stack is empty

Find longest continuous patch on a 12 km road with updates in patches

• Maintain a variable to keep track of current patch length

• Update the variable whenever a new patch is added

• Maintain a variable to keep track of longest patch so far

• Compare current patch length with longest patch length and update if necessary

• Use a sorted data structure like a binary search tree to store the patches for efficient search

• Time complexity: ...read more

Find median of an unsorted array.

• Sort the array and find the middle element

• Use quickselect algorithm to find the median in O(n) time

• If the array is small, use brute force to find the median

Find 'k' elements closest to a given number from a stream of characters.

• Use a priority queue to keep track of closest elements.

• Update the queue as new characters come in.

• Return the 'k' closest elements from the queue.

Design a data structure with O(1) insert, remove, find-max, and delete-max operations.

• Use a doubly linked list to maintain the elements in sorted order.

• Use a hash table to store the pointers to the nodes in the linked list.

• Maintain a pointer to the maximum element in the hash table.

• Update the pointers in the hash table when inserting or removing elements.

• Update the maximum pointer when deleting or inserting the maximum

Check if a given linked list is a palindrome.

• Traverse the linked list and store the values in an array.

• Compare the first and last elements of the array, then move towards the center.

• If all elements match, the linked list is a palindrome.

• Alternatively, use two pointers to find the middle of the linked list and reverse the second half.

• Compare the first half with the reversed second half to check for a palindrome.