Thomson Reuters Web Developer Trainee Interview Questions and Answers

Rotational shifts refer to working in different shifts at different times. Web service flow is the sequence of steps involved in a web service request. Checking ports on Unix or Solaris machine involves using the netstat command.

• Rotational shifts involve working in different shifts at different times, such as day shift, night shift, and swing shift.

• Web service flow involves a sequence of steps, such as sending a reques...read more

Design a traffic signal system

• Identify the number of lanes and intersections

• Determine the traffic flow and peak hours

• Choose appropriate sensors and controllers

• Implement a synchronization algorithm

• Consider emergency vehicle prioritization

• Include pedestrian crossing signals

• Ensure compliance with local regulations

Hashmap is a data structure that stores key-value pairs and provides constant time complexity for insertion, deletion, and retrieval.

• Hashmap uses hashing function to map keys to indices in an array

• Collisions can occur when multiple keys map to the same index, which can be resolved using separate chaining or open addressing

• Java implementation: HashMap<String, Integer> map = new HashMap<>();

Printing patterns using code

• Identify the pattern to be printed

• Use loops to print the pattern

• Adjust the loop variables to control the pattern

• Use conditional statements to modify the pattern

• Examples: printing stars, triangles, squares, etc.

Common point in linked list refers to the node where two or more linked lists intersect.

• The common point can be found by traversing both linked lists and comparing the nodes.

• The common point can also be found by using two pointers, one for each linked list, and moving them until they meet at the common point.

• Examples include finding the intersection point of two linked lists or finding the loop in a linked list.

Weigh 3 groups of 3 balls each, then weigh 2 heaviest balls from the heaviest group to find the heaviest ball.

• Divide the 9 balls into 3 groups of 3 balls each.

• Weigh the first 2 groups against each other.

• If one group is heavier, weigh 2 balls from that group against each other to find the heaviest ball.

• If both groups weigh the same, weigh the third group to find the heaviest group.

• Weigh 2 heaviest balls from the heavies