NPTEL Data Structure and Algorithms using Java Week 11 Assignment Answers 2024
1.
Answer :- For Answers Click Here
2.
Answer :- For Answers Click Here
3. Which sorting algorithm is not comparison-based?
a. Quick Sort
b. Merge Sort
c. Counting Sort
d. Bubble Sort
Answer :- For Answers Click Here
4. What is the time complexity of Quick Sort in its average case?
a. O(n)
b. O(n log n)
c. O(n*2)
d. O(log n)
Answer :- For Answers Click Here
5.
Answer :-
6. Which library in Java contains the sortO function?
a. java.io
b. java.util
c. java.applet
d. java.swing
Answer :- For Answers Click Here
7.
Answer :-
8.
Answer :-
9. When implementing the Bubble Sort algorithm, what is the time complexity in the worst-case scenario?
a. O(n)
b. O(n log n)
c. O(n^2)
d. 0(log n)
Answer :-
10. Given an array of 1 million integers with values ranging from – 10,000 to 10,000, which sorting algorithm is most suitable for sorting this array efficiently with the least amount of memory usage?
a. Quick Sort
b. Merge Sort
c. Bubble Sort
d. Radix Sort
Answer :- For Answers Click Here
