Asian Group of Companies Interview Questions and Answers

Different types of LOD functions include INCLUDE, EXCLUDE, and FIXED.

• INCLUDE LOD function is used to compute the level of detail for a specific dimension while keeping all other dimensions constant.

• EXCLUDE LOD function is used to compute the level of detail for all dimensions except the specified dimension.

• FIXED LOD function is used to compute the level of detail independently of the visualization's dimensions.

• Examples of situations where LOD functions are used include calcul...read more

Transaction management is the process of ensuring data consistency and integrity in a system.

• In microservices, each service has its own database, making distributed transactions challenging.

• Two popular approaches to handle transaction management in microservices are Saga pattern and two-phase commit protocol.

• Saga pattern involves breaking a transaction into multiple smaller transactions that can be rolled back individually if needed.

• Two-phase commit protocol ensures that all ...read more

Optimizing Tableau dashboard involves improving performance, usability, and visual appeal.

• Limit the number of worksheets on a dashboard to improve performance

• Use filters and parameters effectively to allow for interactivity

• Optimize data source connections for faster loading times

• Utilize dashboard actions to create dynamic interactions

• Design with user experience in mind to ensure clarity and ease of use

Types of Joins in SQL include Inner Join, Left Join, Right Join, and Full Outer Join.

• Inner Join: Returns rows when there is a match in both tables.

• Left Join: Returns all rows from the left table and the matched rows from the right table.

• Right Join: Returns all rows from the right table and the matched rows from the left table.

• Full Outer Join: Returns rows when there is a match in either table.

LRU cache is a data structure that stores the most recently used items, discarding the least recently used items when full.

• LRU cache stands for Least Recently Used cache

• It is typically implemented using a combination of a doubly linked list and a hashmap

• When a new item is accessed, it is moved to the front of the list. If the cache is full, the least recently used item at the end of the list is removed

• Example: If the cache has a capacity of 3 and items A, B, C are accessed in...read more