OATIndia Power System Engineer Interview Questions and Answers

To take design to an advanced level, one should focus on continuous learning, exploring new technologies, collaborating with others, and seeking feedback.

• Continuously learn and stay updated with the latest design trends and technologies.

• Explore new tools and software that can enhance the design process and improve efficiency.

• Collaborate with other designers, engineers, and stakeholders to gain different perspectives an...read more

Insertion sort and quicksort are sorting algorithms used to sort arrays of data.

• Insertion sort: iterates through the array and inserts each element into its proper position.

• Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.

• Insertion sort is best for small arrays, while quicksort is best for large arrays.

• Bot...read more

Merge two sorted linked lists using recursion

• Create a recursive function that compares the first nodes of both lists

• Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list

• Base case: if one list is empty, return the other list

• Return the merged list

Given an integer, determine which byte is zero.

• Convert the integer to a byte array using bitwise operations.

• Iterate through the byte array and check for a zero value.

• Return the index of the zero byte.

• Consider endianness when converting to byte array.

To check endianness, create a 4-byte integer with a known value and check the byte order.

• Create a 4-byte integer with a known value

• Check the value of the first byte to determine endianness

• If the first byte is the least significant, the machine is little endian

• If the first byte is the most significant, the machine is big endian

Static objects can be used to print something before main() execution.

• Static objects are initialized before main() execution

• They can be used to print something before main()

• Example: static int x = printf("Hello World!");

• Output: Hello World! will be printed before main() execution

Static variables are allocated memory in the data segment of the program's memory space.

• Static variables have a fixed memory location throughout the program's execution.

• They are initialized to zero by default.

• If initialized explicitly, they are stored in the data segment.

• Static variables can be accessed by any function in the program.

Finding space and time complexity of a recursive function.

• Space complexity is the amount of memory used by the function.

• Time complexity is the amount of time taken by the function to execute.

• Recursive functions have higher space complexity due to the call stack.

• Time complexity can be calculated using Big O notation.

• Examples of recursive functions include factorial and Fibonacci sequence.

Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.

• Occurs when a class inherits from two classes that share a common base class

• Can lead to ambiguity in method calls and data members

• Solved using virtual inheritance or by using interfaces