PART - B
7. Write the functions to perform the following operations on a singly linked list.
i. Adding node at between any two nodes
ii. Deleting a node from any where.
iii. Adding node at beginning and end
iv. Deleting a first and last node.
8. Explain in detail Circularly linked list.
9. i)Discuss the various representations of a binary tree in memory with
suitable example.
ii)Write briefly about Huffman Algorithm.
10. What is binary search tree? Explain it with suitable example. Write an
algorithm to search an element in the binary search tree.
11. i) Differenciate between Heap sort and Radix sort.
ii) Explain insertion sort algorithm .
12. i) Explain Heap Sort with example.
ii)Explain Merge sort algorithm .Using this algorithm sort the following numbers:
33,66,22,56,77,44,99,32,58.
13. i) Write the functions to perform the insert and delete operations on queue.
ii) What are the various operations on stack? Explain.
14. i) Write an algorithm /program to convert infix expression to post fix expression using stack.
ii)List the advantages of circular queue ?
15. Explain binary tree traversal with suitable example.
b)Explain binary search tree.How to insert a node into the binary tree?
16. i) What are the advantages and disadvantages of various basic searching methods?
ii) Explain insertion sort algorithm .
17. i) Explain bubblesort algorithm.
ii)Explain merge-sort algorithm with example.
No comments:
Post a Comment