KEC International Interview Questions and Answers

Find the sum of the largest and smallest elements in an array with the least number of comparisons.

• Iterate through the array to find the maximum and minimum elements.

• Keep track of the maximum and minimum elements as you iterate.

• After iterating, sum up the maximum and minimum elements.

• To achieve the task with the least number of comparisons, compare elements in pairs.

Construct a binary tree from a given parent array and perform level-order traversal.

• Iterate through the parent array to create the binary tree using a queue data structure.

• Keep track of the parent-child relationships and construct the tree accordingly.

• Perform level-order traversal to print the nodes in the correct order.

Normalized form is better for database design for data integrity and flexibility.

• Normalized form reduces data redundancy and improves data integrity.

• Normalized form allows for easier data updates and maintenance.

• Denormalized form may be more efficient for read-heavy applications with complex queries.

• Consider denormalization for performance optimization after thorough analysis.

• Example: Normalized form for a customer and order relationship would have separate tables for custome...read more

Template classes are classes that can work with any data type. Assignment operator can be overloaded to behave differently for different data types.

• Template classes allow for writing generic classes that can work with any data type.

• Overloading the assignment operator allows for custom behavior based on the data type.

• Example: template <class T> class MyClass { T data; public: MyClass& operator=(const T& other) { // custom behavior based on data type } };

There are 204 squares on a chessboard.

• The chessboard has 64 squares in total.

• Each square can be divided into smaller squares, such as 1x1, 2x2, 3x3, etc.

• The total number of squares can be calculated by adding the squares of all sizes together.

Deep copy creates a new copy of an object with all nested objects also copied, while shallow copy creates a new copy of an object with references to nested objects.

• Deep copy creates a new object and recursively copies all nested objects, resulting in a completely independent copy.

• Shallow copy creates a new object but only copies references to nested objects, so changes in nested objects will reflect in both the original and copied objects.

• Example: deep copy - copying an array...read more

Yes, a unique key can also be a primary key.

• A primary key must be unique, but a unique key does not necessarily have to be the primary key.

• A table can have multiple unique keys, but only one primary key.

• Example: In a table of employees, the employee ID can be a unique key and also the primary key.