Siemens Industry Software (India) Interview Questions and Answers

Q1. What is a stack ? Write it implementation
Ans. 
A stack is a data structure that follows the Last In First Out (LIFO) principle.
• Stack is a collection of elements with two main operations: push (adds element) and pop (removes top element)

• Common implementations include using arrays or linked lists

• Example: Undo feature in text editors uses a stack to store previous states
Answered by AI
Add your answer
Q2. How could we optimize a stack optimization
Ans. 
Optimizing a stack involves reducing unnecessary operations and improving memory usage.
• Implementing tail call optimization to reduce stack space usage

• Using iterative algorithms instead of recursive ones to avoid stack overflow

• Minimizing the number of local variables stored on the stack

• Using dynamic memory allocation instead of fixed-size arrays to optimize memory usage
Answered by AI
Add your answer

Q1. Database query from 2 table without a common column
Ans. 
Use a JOIN statement to combine data from two tables without a common column.
• Use a JOIN statement to combine data from two tables based on a different column

• Specify the columns to select from each table in the query

• Use aliases to differentiate between columns with the same name in different tables
Answered by AI
Add your answer
Q2. Design a Flight booking system
Ans. 
Design a flight booking system with user authentication, flight search, booking, seat selection, and payment handling.
• Implement user authentication for secure access.

• Create a database of flights with availability and pricing.

• Allow users to search for flights based on criteria like date, destination, and number of passengers.

• Provide seat selection options for users during booking.

• Include a payment gateway for secure tra...read more
Answered by AI
Add your answer

Two coding questions of easy to moderate difficulty level, focusing on arrays and strings.

Q1. What is the Quick Sort algorithm?
Ans. 
Quick Sort is a popular sorting algorithm that uses a divide-and-conquer approach to sort elements in an array.
• Divides the array into two sub-arrays based on a pivot element

• Recursively sorts the sub-arrays

• Combines the sorted sub-arrays to produce the final sorted array

• Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Answered by AI
Add your answer
Q2. What is the merge sort algorithm and what is its time complexity?
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them recursively, and then merges them back together.
• Divide the input array into two halves

• Recursively sort each half

• Merge the sorted halves back together

• Time complexity is O(n log n)
Answered by AI
Add your answer

Q1. Thread concurrency
Add your answer
Q2. Sql for deleting dulicates and keeping one
Ans. 
Use SQL query with ROW_NUMBER() function to delete duplicates and keep one.
• Use ROW_NUMBER() function to assign a unique number to each row partitioned by the duplicate column(s)

• Delete rows where the row number is greater than 1
Answered by AI
Add your answer
Q3. Java stream for sorting emp object

Ans. 

Use Java Stream API to sort a list of employee objects based on a specific field.

• Use the sorted() method of Stream to sort the employee objects based on a Comparator.

• Define a Comparator based on the field you want to sort by.

• Example: List sortedList = employeeList.stream().sorted(Comparator.comparing(Employee::getSalary)).collect(Collectors.toList());

Add your answer