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;
}
Construct an AVL tree using the below list. Show all the steps 12, 11, 13, 10, 09, 15, 14, 18, 7, 6, 5.
a) Sort the following list using the Radix Sort :
189, 205, 986, 421, 97, 192, 535, 839, 562, 674
What is linear searching?
Convert the Regular Expression 
into e-NFA and then corresponding DFA.
