Dit University Interview Questions and Answers

Quick sort is faster for small arrays, while Merge sort is more efficient for larger arrays.

• Quick sort has an average time complexity of O(nlogn), while Merge sort has a time complexity of O(nlogn) in all cases.

• Quick sort is an in-place sorting algorithm, while Merge sort requires extra space.

• Quick sort is not stable, while Merge sort is stable.

• Quick sort is often used in practice due to its efficiency, while Merge sor...read more

I prefer classless addressing due to its flexibility and efficient use of IP addresses.

• Classless addressing allows for more efficient use of IP addresses by allowing for variable-length subnet masks.

• Classful addressing is limited to fixed-length subnet masks, which can result in wasted IP addresses.

• Classless addressing also allows for more flexibility in network design and can accommodate networks of varying sizes.

• Clas...read more