Perfect Digital Media Resources Software Testing Trainer Interview Questions and Answers

BST is a binary tree where left child is smaller and right child is greater. Add/delete ops maintain this property.

• BST is a data structure used for searching, sorting, and storing data

• Add operation: Traverse the tree and find the appropriate position to insert the new node

• Delete operation: Find the node to be deleted, replace it with its inorder successor or predecessor, and delete the successor/predecessor node

• Time co...read more

Copy a linked list with random pointers to random nodes in the list.

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

• Map the original nodes to their corresponding new nodes

• Copy the value of the original node to the new node

• Copy the random pointer of the original node to the new node using the mapping created earlier

I am a software engineer with experience in developing web applications and a passion for problem-solving.

• Experienced in developing web applications using languages such as Java, Python, and JavaScript

• Proficient in using frameworks such as Spring, Django, and React

• Skilled in problem-solving and troubleshooting

• Strong communication and collaboration skills

• Passionate about learning new technologies and keeping up with ind

I have experience in software development and have worked on various projects using different technologies.

• Started my career as a software developer at XYZ company

• Developed web applications using Java and Spring framework

• Worked on a project for a client in the healthcare industry, developing a patient management system

• Implemented RESTful APIs using Node.js and Express

• Contributed to open source projects on GitHub

• Current...read more

Reverse a linked list

• Iteratively swap the next and previous pointers of each node

• Use three pointers to keep track of the current, previous, and next nodes

• Update the head pointer to the last node after reversing

I appreciate the company's commitment to innovation and employee development.

• Strong focus on innovation in software development

• Opportunities for professional growth and development

• Positive company culture and work environment

I am impressed by the company's innovative projects and collaborative work environment.

• Impressed by innovative projects

• Desire to work in a collaborative environment

• Excited about potential for growth and learning opportunities

Web server handles HTTP requests and responses, while application server executes application logic.

• Web server serves static content like HTML, CSS, JS files

• Application server executes dynamic code like Java, Python, Ruby

• Web server communicates with client, application server communicates with database

• Examples of web servers: Apache, Nginx, IIS

• Examples of application servers: Tomcat, JBoss, WebSphere

Find sum of k smallest numbers in a BST.

• Traverse the BST in-order and add the k smallest numbers to a sum variable.

• Use a priority queue to keep track of the k smallest numbers.

• If k is greater than the number of nodes in the BST, return the sum of all nodes.

• If k is 0, return 0.

Design algorithm and database for seat booking system of BookMyShow and handle failed payments.

• Create a database with tables for movies, theaters, seats, bookings, and payments

• Use a locking mechanism to prevent double booking of seats

• If payment fails, release the locked seats and notify the user

• Write a query to get the timestamp in SQL: SELECT CURRENT_TIMESTAMP;

Code for time stamp in C

• Use the time.h header file

• Call the time() function to get the current time in seconds

• Convert the time to a string using strftime() function

• Use the format string to specify the desired format of the time stamp

Rearrange array in consecutive pair multiplication in descending order.

• Create a new array to store the multiplied values

• Use a loop to iterate through the original array and multiply consecutive pairs

• Write a compare function to sort the new array in descending order

Code to rearrange an array in maximum-minimum form.

• Sort the array in descending order.

• Create a new array and alternate between adding the maximum and minimum values from the sorted array.

• Return the new array.

• Time complexity: O(nlogn)

• Space complexity: O(n)

stoi() function converts a string to an integer.

• stoi() is a C++ function that takes a string as input and returns an integer.

• It is used to convert a string of digits into an integer.

• It can also handle negative numbers and ignore leading whitespace.

• Example: int num = stoi("123"); // num is now 123

Code for finding the longest common substring in an array of strings.

• Iterate through the first string and check for all possible substrings

• Check if the substring is present in all other strings

• Keep track of the longest common substring found so far

• Return the longest common substring

Answers to common technical questions in a software engineering interview

• A transaction in DBMS is a sequence of operations that must be treated as a single unit of work. ACID properties ensure reliability and consistency of transactions.

• A thread is a lightweight process that shares memory and resources with other threads in the same process. A process is a separate instance of a program.

• Common Linux commands include ls...read more