Larsen & Toubro Limited Interview Questions and Answers

A use case diagram is a visual representation of the interactions between users and a system, showing the various use cases and actors involved.

• Use case diagrams are typically utilized in software development to capture the functional requirements of a system.

• They help in identifying the different ways users can interact with the system and the various scenarios that can occur.

• Use case diagrams show the relationships between actors (users) and use cases, helping in understand...read more

A use case diagram is a visual representation of the interactions between users and a system, showing the different ways users can interact with the system.

• Use case diagrams are typically used in software development to capture the functional requirements of a system.

• They help in identifying the actors (users) and their interactions with the system.

• Use case diagrams show the various use cases or scenarios in which the system can be used.

• They are useful for communicating syste...read more

To reverse a linked list, iterate through the list and change the direction of pointers.

• Iterate through the linked list and keep track of the previous, current, and next nodes.

• Update the pointers of each node to reverse the direction.

• Set the head of the linked list to the last node encountered during iteration.

Encapsulation is the concept of bundling data and methods that operate on the data into a single unit. Inheritance allows a class to inherit attributes and methods from another class. Polymorphism allows objects of different classes to be treated as objects of a common superclass.

• Encapsulation helps in data hiding and abstraction

• Example: A class 'Car' encapsulates data like make, model, and methods like start(), stop()

• Inheritance allows for code reusability and promotes the c...read more

Use Floyd's Tortoise and Hare algorithm to detect a cycle in a linked list.

• Start with two pointers, slow and fast, moving at different speeds.

• If there is a cycle, the two pointers will eventually meet at some point.

• If there is no cycle, the fast pointer will reach the end of the list.

• Example: 1->2->3->4->5->2 (cycle at node 2), slow and fast pointers will meet at node 2.