Busy Infotech Software Developer Interview Questions and Answers

Q1. Copy constructor implementation it was based on
Add your answer

Q1. Binary search question on array
Add your answer

Q1. Experience and expectations on salary
Add your answer

Interview for backend developer with experience in django

Q1. Writing ORM queries in django
Add your answer
Q2. Database design with foregin and many to many fields
Add your answer
Q3. Explain django's request response flow
Ans. 
Django's request response flow involves the request being handled by URL dispatcher, views, middleware, and templates before generating a response.
• Request is received by URL dispatcher which maps the URL to a view function

• View function processes the request, interacts with models if needed, and returns a response

• Middleware can intercept the request and response for additional processing

• Templates are used to generate HT
Answered by AI
Add your answer

Q1. System architecture
Add your answer
Q2. Dict ,list and other questions
Add your answer

Medium to hard questions based on arrays, dp

Q1. Quick sort algorithm
Ans. 
Quick sort is a popular sorting algorithm that uses divide and conquer strategy.
• Divides array into smaller sub-arrays based on a pivot element

• Recursively sorts sub-arrays

• Combines sorted sub-arrays to get final sorted array

• Time complexity: O(n log n) on average, O(n^2) worst case

• Example: [3, 6, 8, 10, 1, 2, 1] -> [1, 1, 2, 3, 6, 8, 10]
Answered by AI
Add your answer
Q2. Modified rotate a matrix
Ans. 
Rotate a matrix by 90 degrees in place
• Transpose the matrix

• Reverse each row of the transposed matrix
Answered by AI
Add your answer

Q1. Normal coding questions nested list
Add your answer
Q2. Nested dictionary
Add your answer

Data extraction, solid questions, oops

It was the ask mostly about DSA

It was an online test for interview

Q1. Tell me about dijistkras algorithm
Ans. 
Dijkstra's algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
• Dijkstra's algorithm uses a priority queue to select the node with the smallest distance from the start node.

• It maintains a list of tentative distances to each node and updates them as it explores the graph.

• The algorithm is commonly used in routing and network protocols to find the shortest path between nodes.

• Example:...read more
Answered by AI
Add your answer
Q2. Tell me about your projects
Add your answer