St.

Francis Institute of Technology SE (IT) SEM - III

Subject: Data Structure And Algorithm

List of Practical

SET 1 : 20 Marks 1. 2. 3. 4. 5. 6. 7. ys. 8. ys. 9. arrays. Write Write Write Write Write Write Write java java java java java java java program program program program program program program to to to to to to to implement implement implement implement implement implement implement bubble sorting. Insertion sorting. sequential search method. binary search method. stack data structure using arrays. Queue data structure using arrays. circular Queue data structure using arra

Write java program to implement Priority Queue data structure using arra Write java program to implement doubly ended Queue data structure using

SET 4 : 30 Marks 1. Write java program a. In-order b. Pre-order c. Post-Order 2. Write java program prefix, postfix form. 3. Write java program 4. Write java program 5. Write java program 6. Write java program 7. Write java program 8. Write java program 9. Write java program ed list. 10. Write java program to 11. Write java program to list. 12. Write java program to to implement tree traversal techniques.

to implement Expression tree to convert expression in to to to to to to to implement implement implement implement implement implement implement quick sorting. Merge sorting. Heap sorting. binary search tree method. BFS (breadth first search) method. DFS (death first search) method. circular stack data structure using link

implement queue data structure using linked list. implement Priority Queue data structure using linked implement linked list data structure using arrays.