Naviga Dot Net Fullstack Developer Interview Questions and Answers

It was both aptitude and coding questions combined test.
There will be 2 questions and we have 30 mins of time. I solved one of them and the other I just wrote code but did not get enough time to submit.

Q1. Explain All sorting techniques and implement bubble sort in online compiler.
Ans. 
Explanation of sorting techniques and implementation of bubble sort
• Sorting techniques include bubble sort, selection sort, insertion sort, merge sort, quick sort, etc.

• Bubble sort compares adjacent elements and swaps them if they are in the wrong order, repeating until the array is sorted.

• Example: [5, 3, 8, 2, 1] -> [3, 5, 8, 2, 1] -> [3, 5, 2, 8, 1] -> [3, 5, 2, 1, 8] -> [3, 2, 5, 1, 8] -> [3, 2, 1, 5, 8] -> [2, 3, 1,
Answered by AI
Add your answer
Q2. Asked few SQL questions.
Add your answer
Q3. Explain Binary search
Ans. 
Binary search is a search algorithm that finds the position of a target value within a sorted array.
• Divide the array into two halves and compare the target value with the middle element.

• If the target value is less than the middle element, search the left half. If greater, search the right half.

• Repeat the process until the target value is found or the subarray is empty.
Answered by AI
Add your answer