Practically BDA Interview Questions and Answers

Q1. How many sorting algorithms you know? Explain any one of the algorithm (He told me for insertion sort)? Write the code for it and tell the complexity
Add your answer
Q2. Puzzle based on 9 coins puzzle
Add your answer
Q3. Explain about the Project and the technologies used in it.
Add your answer

Q1. Program for a palindrome Number.
Ans. 
Program to check if a number is a palindrome.
• Convert the number to a string to easily check for palindrome

• Reverse the string and compare it with the original string

• If they are the same, the number is a palindrome
Answered by AI
Add your answer
Q2. React Lifecycle methods
Add your answer
Q3. Hooks in react?
Ans. 
Hooks are a feature in React that allow you to use state and other React features in functional components.
• Hooks were introduced in React 16.8.

• They allow you to use state and other React features without writing a class.

• Commonly used hooks include useState, useEffect, useContext, and useReducer.

• Hooks must be used at the top level of your functional component.

• Example: const [count, setCount] = useState(0);
Answered by AI
Add your answer

Q1. Create a High-level design
Ans. 
Design a high-level architecture for a software system
• Identify the main components of the system

• Define the interactions between the components

• Consider scalability, security, and performance

• Choose appropriate technologies and frameworks

• Create a diagram to visualize the architecture
Answered by AI
Add your answer
Q2. Questions on the design you created
Add your answer

Q1. Design Questions to build a scalable micro service
Add your answer
Q2. Salary Discussion
Add your answer

Asked a few questions regarding my experience

Q1. Delete nth node from end in linked list
Ans. 
To delete the nth node from the end in a linked list, we can use a two-pointer approach.
• Use two pointers, one to traverse the list and another to keep track of the nth node from the end.

• Move the second pointer n steps ahead of the first pointer.

• When the second pointer reaches the end of the list, the first pointer will be at the nth node from the end.

• Adjust the pointers to delete the nth node.
Answered by AI
Add your answer
Q2. Project discussion
Add your answer