Siemens EDA Senior Accountant Interview Questions and Answers

Code to print * in five consecutive lines

• Use a loop to iterate five times

• Inside the loop, print a string containing a single * character

Code to calculate number of bounces a ball goes through until it comes to rest.

• Use a loop to simulate the bounces until the ball stops bouncing

• Calculate the height of each bounce using the given formula

• Keep track of the number of bounces in a counter variable

The best and less time consuming way to calculate factorial of a number is using iterative approach.

• Iteratively multiply the number with all the numbers from 1 to the given number

• Start with a result variable initialized to 1

• Multiply the result with each number in the range

• Return the final result

Code to find factorial using function recursion

• Define a function that takes an integer as input

• Check if the input is 0 or 1, return 1 in that case

• Otherwise, call the function recursively with input-1 and multiply it with the input

The question is about finding the minimum steps to reach from a source string to a destination string using three operations.

• BFS and DFS are graph traversal techniques that can be used to solve this problem.

• BFS is typically used when finding the shortest path or exploring all possible paths in a graph.

• DFS is useful when searching for a specific path or exploring deeply into a graph.

• In this case, BFS can be used to find...read more

Need more context. What needs to be done with the large rectangle?

• What are the dimensions of the rectangle?

• Is it a 2D or 3D object?

• What is the context of the problem?

• Are there any constraints or limitations?

• What tools or programming languages can be used?

Derive a formula to determine how many smaller rectangles fit into a bigger rectangle given their dimensions.

• Calculate the number of times the smaller rectangle can fit into the bigger rectangle horizontally and vertically

• Divide the width of the bigger rectangle by the width of the smaller rectangle to get the horizontal count

• Divide the height of the bigger rectangle by the height of the smaller rectangle to get the ve...read more

At least 4 points are required to draw a rectangle.

• A rectangle has 4 sides and 4 corners, so at least 4 points are needed to define those corners.

• The points must be arranged in a specific order to form a closed shape with 4 sides.

• Additional points can be used to add details or modify the shape of the rectangle.

• The number of points required may vary depending on the software or tool used to draw the rectangle.

Answering how to calculate new coordinates of a scaled rectangle and providing a program for it.

• To calculate new coordinates, multiply the original coordinates by the scaling factor

• Scaling factor can be calculated by dividing the new length/breadth by the original length/breadth

• Program can take input of original coordinates, scaling factor, and output new coordinates

• Example: Original coordinates: (0,0), (0,5), (5,5), (...read more

Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities

• For unsorted array, use nested loops to compare each element with every other element until the sum is found

• For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found

• Complexity for unsorted array is O(n^2) and for sorted array is O(n)

Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.

• Incrementing a pointer moves it to the next memory location of the same data type

• Decrementing a pointer moves it to the previous memory location of the same data type

• The address of operator (&) returns the memory address of a variable

• The value at operator (*) returns the value sto

To determine if a point is inside or outside a rectangle, we check if the point's coordinates fall within the rectangle's boundaries.

• Check if the point's x-coordinate is greater than the left edge of the rectangle

• Check if the point's x-coordinate is less than the right edge of the rectangle

• Check if the point's y-coordinate is greater than the top edge of the rectangle

• Check if the point's y-coordinate is less than the b...read more

To find line that divides rectangle into 2 equal halves through a point inside it.

• Find the center of the rectangle

• Draw a line from the center to the given point

• Extend the line to the opposite side of the rectangle

• The extended line will divide the rectangle into 2 equal halves

There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?

• There are 2^8 (256) possible combinations of 8-bit signed numbers.

• There are 2^16 (65,536) possible combinations of 16-bit signed numbers.

• To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.

• Therefore, the total number of possible combinations is 256 +

Find duplicates in an array of elements in 0(n) time and 0(1) space.

• Use the property of inputs to your advantage

• Iterate through the array and mark elements as negative

• If an element is already negative, it is a duplicate

• Return all the negative elements as duplicates