Temenos Associate Product Engineer Interview Questions and Answers

Access specifiers control the visibility of class members in object-oriented programming.

• Public: accessible from any class

• Private: only accessible within the same class

• Protected: accessible within the same class and its subclasses

• Examples: public int age; private String name; protected double salary;

A simple program to calculate the sum of an array of integers in Python.

• Define a function that takes an array as input.

• Use a loop to iterate through the array elements.

• Accumulate the sum in a variable and return it.

• Example: sum_array([1, 2, 3]) should return 6.

Lists are mutable, ordered collections of items while tuples are immutable, ordered collections of items in Python.

• Lists are defined using square brackets [] while tuples are defined using parentheses ().

• Lists can be modified (add, remove, change elements) while tuples cannot be modified once created.

• Lists are typically used for collections of similar items while tuples are used for fixed collections of items.

• Exam...read more

HTTP is unsecured while HTTPS is secured with SSL/TLS encryption.

• HTTP stands for Hypertext Transfer Protocol while HTTPS stands for Hypertext Transfer Protocol Secure.

• HTTP operates on port 80 while HTTPS operates on port 443.

• HTTP is vulnerable to attacks while HTTPS is secure due to SSL/TLS encryption.

• HTTPS provides authentication, data integrity, and confidentiality.

• HTTPS is used for secure online transactions su...read more

Arrays are collections of elements, typically of the same type, stored in contiguous memory locations.

• An array can hold multiple values, e.g., ['apple', 'banana', 'cherry'].

• Arrays are zero-indexed, meaning the first element is accessed with index 0.

• They have a fixed size once declared, e.g., String[] fruits = new String[3];

• Arrays can be multidimensional, e.g., String[][] grid = {{'A', 'B'}, {'C', 'D'}}.

Quick sort is a popular sorting algorithm that uses divide and conquer strategy.

• Quick sort picks a pivot element and partitions the array around the pivot.

• It recursively sorts the sub-arrays on either side of the pivot.

• It is efficient for large datasets but can have worst-case time complexity of O(n^2).

• Example: [3, 6, 8, 10, 1, 2, 1]