Distinguish between data type and abstract data type. List any three characteristics of algorithm. Evaluate the postfix expression 33 + 2 * 40 -, using stack.

Define height, depth and level of the tree. Find the minimum spanning tree of the following weighted graph using Kruskal and Prims algorithm.

Define queue as ADT and discuss about primitive operations in queue. Trace the output generated by following recursive function for the statement TOH(4,1,3).

void TOH(int n, int s, int d) {
    if (n == 1) {
        printf(" move the top disk from rod %d to rod %d", s, d);
    } 
    else {
        TOH(n - 1, s, 6 - s - d);
        printf(" move the top disk from rod %d to rod %d", s, d);
        TOH(n - 1, 6 - s - d, d);
    }
}

Why do we need algorithms for searching? Trace the binary search operation for the key = 6, in the set {3, 6, 8, 12, 67, 89, 90, 100}

How do you implement single linked list using stack? Explain.

Trace the merge sort algorithm for the input {8, 7, -4, 19, 3, 45, 12}.

Explain about any three hash collision resolution techniques.

Describe the process of deleting the node at start, end and specified position of singly linked list.

Write the algorithm of Quick sort with its efficiency analysis.

Why do we always prefer the worst case for algorithm analysis? Describe the insertion and deletion operation in BST.

Define overflow and underflow. Discuss the advantages and limitations of circular queue.

What are the advantages of circular queue over linear queue? Sort the array {4, 7, 3, 2, 1} using insertion sort.