SAP Associate Engineer Interview Questions and Answers

A friend function is a non-member function that has access to the private and protected members of a class.

• Declared inside the class but defined outside the class scope

• Can access private and protected members of the class

• Not a member of the class but has access to its private members

• Used to allow external functions to access and modify private data of a class

• Can be declared as a friend in another class

atoi function converts a string to an integer in C.

• The function takes a string as input and returns an integer.

• Leading white spaces are ignored.

• If the string contains non-numeric characters, the function stops conversion and returns the converted value.

• The function returns 0 if the input string is not a valid integer.

• Example: atoi('123') returns 123.

A program to print star pattern

• Use nested loops to print the pattern

• The outer loop controls the number of rows

• The inner loop controls the number of stars to be printed in each row

• Use print() or println() function to print the stars

Run time polymorphism is the ability of a program to determine the object type at runtime and call the appropriate method.

• It is achieved through virtual functions and dynamic binding.

• Allows for more flexible and extensible code.

• Example: a base class Animal with virtual function makeSound() and derived classes Dog and Cat that override makeSound().

• At runtime, if an Animal pointer points to a Dog object, calling makeSoun

Right outer join is a type of join operation that returns all the rows from the right table and the matching rows from the left table.

• Right outer join is denoted by the RIGHT JOIN keyword in SQL.

• It is used to combine rows from two tables based on a related column.

• In the result set, unmatched rows from the right table will have NULL values for the columns of the left table.

• A real-world scenario for using a right outer j...read more

Refrential integrity ensures that relationships between tables in a database remain consistent.

• It is a database concept that ensures that foreign key values in one table match the primary key values in another table.

• It prevents orphaned records in a database.

• It maintains data consistency and accuracy.

• For example, if a customer record is deleted, all related orders for that customer should also be deleted.

• It is enforced...read more

Primary key uniquely identifies a record in a table, while Unique key ensures uniqueness of a column.

• Primary key can't have null values, Unique key can have one null value

• A table can have only one Primary key, but multiple Unique keys

• Primary key is automatically indexed, Unique key is not necessarily indexed

Triggers are database objects that are automatically executed in response to certain events.

• Triggers can be used to enforce business rules, audit changes, or replicate data.

• There are two types of triggers: DML triggers and DDL triggers.

• DML triggers are fired in response to DML statements (INSERT, UPDATE, DELETE).

• DDL triggers are fired in response to DDL statements (CREATE, ALTER, DROP).

Swapping two character variables without using third

• Use XOR operator to swap two variables without using third variable

• Assign the XOR of both variables to the first variable

• Assign the XOR of the first variable and second variable to the second variable

I have been actively involved in various extra curricular activities such as volunteering, sports, and leadership roles.

• Volunteered at local animal shelter every weekend

• Captain of the soccer team in high school

• Organized charity events for underprivileged children

To find a loop in a directed graph, use Floyd's cycle-finding algorithm. To find the last element in a binary tree, traverse the tree and return the rightmost leaf node.

• For finding a loop in a directed graph, use Floyd's cycle-finding algorithm which uses two pointers moving at different speeds.

• To find the last element in a binary tree, traverse the tree recursively or iteratively and return the rightmost leaf node.

The question is about finding the last number in a circular queue that has the highest number of digits.

• Implement a circular queue data structure

• Iterate through the circular queue to find the last number with the highest number of digits

• Compare the number of digits of each number in the circular queue

• Keep track of the last number with the highest number of digits

Check if left child is less than right child in a binary tree

• Traverse the tree recursively and compare left and right child values

• Use a stack to traverse the tree iteratively and compare left and right child values

• Return true if all left children are less than right children, else false

Use built-in string method to check substring presence for faster execution.

• Use 'indexOf' method to check if substring is present in the main string.

• If the method returns -1, the substring is not present.

• If the method returns a non-negative integer, the substring is present.

To test if every left child's value is less than the right child's value in a binary tree.

• Traverse the binary tree using any traversal algorithm (e.g., in-order, pre-order, post-order)

• Compare the value of each left child with its right child

• If any left child's value is greater than or equal to its right child's value, return false

• If all left child's values are less than their right child's values, return true

Cloning a linked list-like structure

• Create a new node for each node in the original linked list

• Set the value of the new node to the value of the corresponding node in the original linked list

• Set the next pointer of the new node to the new node corresponding to the next node in the original linked list

• Repeat the above steps until all nodes in the original linked list are cloned

To find the nth character in a stream of bytes, we need to read the stream byte by byte until we reach the nth position.

• Start reading the stream byte by byte until you reach the nth position

• Return the byte at the nth position

• If the stream ends before reaching the nth position, return null or throw an exception

Rearrange a string to avoid consecutive same characters.

• Iterate through the string and keep track of the previous character.

• If the current character is the same as the previous, swap it with the next different character.

• Repeat until no consecutive same characters are left.

The task is to find the next highest palindrome number given a number.

• Convert the given number to a string

• Check if the number is already a palindrome

• If not, increment the number by 1 and check if it is a palindrome

• Repeat the previous step until a palindrome is found

Canonicalizing a directory path involves simplifying and standardizing the path to remove any redundant or unnecessary elements.

• Remove any consecutive slashes and replace them with a single slash

• Remove any trailing slashes

• Resolve any relative paths (e.g., '..' and '.')

• Handle special cases like the root directory ('/')

• Normalize the path by removing any unnecessary elements