Draw a minimum heap tree from the below list :
12, 11, 7, 3, 10, – 5, 0, 9, 2
Now do the heap sort operation over the heap tree which you have formed. Write the insertion sort algorithm.
Minimum Heap Tree
Insertion Sort Algorithm
for( i=1; i<n;i++) { temp=a[i]; for(j=i-1;j>=0;j--) { if(temp<a[j]) a[j+1]=a[j]; else break; } a[j+1]=temp; }
What is the benefit of using arrays of pointers instead of several pointer variables?
What is an Abstract Data Type? What do you mean by a Dynamic Data Structure?
Write a C language function to find the in-order successor of the root of a binary tree.
a) Sort the following list using the Radix Sort :
189, 205, 986, 421, 97, 192, 535, 839, 562, 674
Briefly differentiate between CDMA and GSM technologies.
Discuss about Staffing
Explain two-phase locking protocol.