Question

Please indicate whether the following statements are true or false by circling the correct answer:

1. Every complete binary tree with n nodes has a height O(lg n).

True                       False

2. The array [19, 14, 17, 6, 8, 4, 11, 2, 5] forms a max-heap.

True                       False

3. O(3n + lg n) ≠ O(n)

True                       False

4. A comparison-based sorting algorithms cannot have an asymptotic run time of O(lg n)

True                       False

5. The recurrence relation that indicates the asymptotic running time for insertion sort is:   T(n) = T(n-1) + Q(1)

True                       False

a) Circle all the algorithms below that can be used as auxiliary sorting algorithms for radix sort.

Counting Sort            Heap Sort       Insertion Sort            Merge Sort     Quicksort

b) Circle all the sorting algorithms below that have less space complexity than O(n) for sorting n integers.

Counting Sort            Heap Sort       Insertion Sort            Merge Sort     Quicksort

c) Circle all the sorting algorithms below that are asymptotically faster than Merge Sort:

Counting Sort            Heap Sort       Insertion Sort            Merge Sort     Quicksort

d) Circle all the comparison-based sorting algorithms below:

Counting Sort            Heap Sort       Insertion Sort            Merge Sort     Quicksort

I NEED THIS ASAP PLEASE HELP ME

Answer 1

`Hey,

Note: If you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

a) TRUE

B) TRUE

C) FALSE because Let LHS=n and RHS=1. So, false

d) TRUE

E) false

Note: Brother According to Chegg's policy we are only allowed to answer first 4 part if there are many. So, I request you to post other part as separate posts.

Kindly revert for any queries

Thanks.