1. Explain about any two applications of stack in detail with suitable example.
2. i)Give two sorted lists L1 and L2.Write a procedure to compute L1U L2 using the basic list operations.
ii)Write a program to print out the elements of a singly linked list.
3. i) Discuss the various representations of a binary tree in memory with suitable example.
ii).What are the basic operations can be performed on a binary tree? Explain each of them in detail with suitable example.
4). i) Write the in-order, pre-order and post order traversal of a given Tree.
ii)Write a recursive algorithm to find the post order traversal of a tree.
iii)Write briefly about Huffman Algorithm.
5. i)Write the algorithm for insertion sort and demonstrate with an example.
ii)Sort the following nos.:43,32,16,7,-10,120,45,2,54,71,96 using Radix sort.
6. Explain the Quick sort algorithm. Using this algorithm sort the following numbers: 15,97,13,28,101,188,5,3,1,56,54
No comments:
Post a Comment