Societe Generale Global Solution Centre Software Engineer Interview Questions, Process, and Tips

A linked list is a linear data structure where each element is a separate object with a pointer to the next element.

• In Java, a linked list is implemented using the LinkedList class in the java.util package.

• LinkedList class provides methods like add(), remove(), get(), etc. to manipulate the list.

• Each element in the list is represented by a node object which contains the data and a reference to the next node.

• Linked list...read more

ACID Properties are a set of properties that ensure database transactions are processed reliably.

• ACID stands for Atomicity, Consistency, Isolation, and Durability.

• Atomicity ensures that a transaction is treated as a single, indivisible unit of work.

• Consistency ensures that a transaction brings the database from one valid state to another.

• Isolation ensures that concurrent transactions do not interfere with each other.

• Du...read more

A deadlock is a situation where two or more processes are unable to proceed due to a circular dependency.

• Deadlock occurs when two or more processes are waiting for each other to release resources.

• To avoid deadlock, use techniques like resource allocation graph, banker's algorithm, and deadlock prevention.

• Resource allocation graph is a visual representation of resource allocation and can help identify potential deadlock...read more

SQL is a relational database while NoSQL is non-relational. MongoDB is preferred for scalability and flexibility.

• SQL is table-based while NoSQL is document-based

• SQL is structured while NoSQL is unstructured

• SQL is vertically scalable while NoSQL is horizontally scalable

• MongoDB is preferred for its ability to handle large amounts of unstructured data and its flexibility in schema design

• MySQL is preferred for its strong A...read more

Answering types of JOINS for two given tables.

• INNER JOIN: returns only matching rows from both tables

• LEFT JOIN: returns all rows from left table and matching rows from right table

• RIGHT JOIN: returns all rows from right table and matching rows from left table

• FULL OUTER JOIN: returns all rows from both tables and NULL values where there is no match

• CROSS JOIN: returns all possible combinations of rows from both tables

Java with DB is better than PL/SQL as it offers more flexibility and scalability.

• Java with DB allows for easier integration with other technologies

• Java offers more advanced programming features than PL/SQL

• Java with DB can handle larger and more complex data sets

• PL/SQL is limited to Oracle databases only

• Java with DB is more widely used and has a larger community for support

Dynamic SQL is a technique to generate SQL statements at runtime based on user input or other conditions.

• Dynamic SQL is used to create flexible and customizable queries.

• It allows for the creation of complex queries with multiple conditions.

• Dynamic SQL can be executed using prepared statements or by concatenating strings.

• It is important to properly sanitize user input to prevent SQL injection attacks.

Overriding in PL/SQL is the ability to define a subprogram in a child package that has the same name and signature as a subprogram in a parent package.

• Overriding allows a child package to provide its own implementation of a subprogram that is already defined in a parent package.

• The child subprogram must have the same name and signature as the parent subprogram.

• The child subprogram can have a different implementation th...read more

Triggers are database objects that are used to automatically execute a response when a certain event occurs.

• DML Triggers

• DDL Triggers

• Logon Triggers

• CLR Triggers

• INSTEAD OF Triggers

Identifying type of join for given outputs of two tables.

• Inner join: returns only the matching rows from both tables.

• Left join: returns all rows from left table and matching rows from right table.

• Right join: returns all rows from right table and matching rows from left table.

• Full outer join: returns all rows from both tables and matching rows from both tables.

Explanation of insertion and deletion in binary tree with time and space complexity.

• Insertion: Traverse the tree to find the appropriate position and insert the new node. Time complexity: O(log n) for balanced tree, O(n) for skewed tree. Space complexity: O(1).

• Deletion: Find the node to be deleted and replace it with its inorder successor or predecessor. Time complexity: O(log n) for balanced tree, O(n) for skewed tree...read more