Cognizant Software Engineer Trainee Interview Questions, Process, and Tips

Typecasting is used to convert one datatype into another.

• Typecasting is the process of converting a value from one datatype to another.

• It can be done implicitly or explicitly.

• Implicit typecasting is done automatically by the compiler.

• Explicit typecasting is done manually by the programmer using casting operators.

• Examples of typecasting include converting an integer to a float, a string to an integer, etc.

To remove redundancy in a database with repeated names, use normalization techniques.

• Identify the primary key of the table and ensure it is unique

• Create separate tables for related data to avoid repeating information

• Use foreign keys to link related tables

• Consider using indexing to improve performance

• Update existing data to conform to the new structure

3NF eliminates transitive dependencies while BCNF eliminates partial dependencies.

• 3NF stands for Third Normal Form and BCNF stands for Boyce-Codd Normal Form.

• 3NF eliminates transitive dependencies by breaking down tables into smaller ones.

• BCNF eliminates partial dependencies by ensuring that every determinant is a candidate key.

• 3NF is a subset of BCNF.

• Example: In a table with columns A, B, and C, where A determines B a...read more

Linear search checks each element in a list sequentially. Binary search divides the list in half to find the target.

• Linear search has a time complexity of O(n), while binary search has a time complexity of O(log n).

• Linear search is useful for small lists or unsorted data, while binary search is useful for large sorted lists.

• Binary search requires the list to be sorted in ascending or descending order.

• Example of linear ...read more

Binary search is better for sorted arrays. Time complexity: Linear - O(n), Binary - O(log n).

• Linear search is suitable for unsorted arrays.

• Binary search is suitable for sorted arrays.

• Linear search has a time complexity of O(n).

• Binary search has a time complexity of O(log n).