BSCS 2-5 DSA Group 2 Webinar

The parent node’s value is less than or equal to its child nodes.

• Max Heap

• Min Heap

• Small Heap

• Little Heap

This sorting is an in-place algorithm, meaning it rearranges the numbers within the array, requiring no additional storage space.

• Bubble Sort

• Merge Sort

• Quick Sort

• Heap Sort

It is the process to rearrange the heap to maintain the heap-property.

• Heapify

• Heapy

• Heafy

• Heapheap

These are mathematical structures that represent pairwise relationships between objects.

• Venn Diagrams

• Pie chart

• Graphs

• Trees

1. What is the space complexity of heap sort?

• 1. O(n^2)

• 1. O(log n)

• 1. O(1)

• O(n log n)

1. Which advantage does heap sort have over Quick Sort?

• 1. Stable performance in all scenarios

• 1. Requires less space

• 1. Guarantees stable sorting for equal elements

• 1. Better cache performance

1. What is the disadvantage of heap sort compared to simpler algorithms like Bubble Sort?

• 1. It is not stable

• 1. Requires more space

• 1. More complex to implement

• 1. Outperformed in terms of cache performance

1. What is the defining characteristic of a min heap?

• 1. The parent node's value is greater than its child nodes.

• 1. The parent node's value is less than or equal to the child nodes.

• 1. The smallest value is at the root.

• 1. The largest value is at the root.

1. Which of the following statements about heap sort's time complexity is true?

• 1. It can deteriorate to O(n^2) in the worst case.

• 1. It always maintains a time complexity of O(n^2).

• 1. It guarantees a stable O(n log n) performance.

• 1. It performs better than Quick Sort in terms of time complexity.

What is the time complexity of Heap Sort in the worst-case scenario?

• • O(n)

• • O(n log n)

• • O(n^2)

• • O(log n)