Apply Dijkstra's algorithm to find the shortest path from the vertex 'S' to all other vertices for the following graph:
Please upload or describe the graph clearly (adjacency matrix, adjacency _____ ______ ____ _________ _____ _______ ______ ________.
_____ ___ _________ ______ __________ __________ _____ _____ ___ ____ _________.
______ _____ ___ ________ _________ _________ ___ ___.
________ ________ ____ __________ ___ ______ __________ ________ _______ ______ _________ _______.
____ __________ __________ ______.
Get Full Answer on WhatsApp
What is Splay tree? Explain the Zig zag and Zag zig rotations in Splay tree with the help of a suitable example.
Define AVL tree. Create an AVL tree for the following list of data if the data are inserted in the order in an empty AVL tree.
12, 5, 15, 20, 35, 8, 2, 40, 14, 24, 27, 45, 50, 3, 4 Further delete 2, 4, 5 and 12 from the above AVL tree.
Write a program in 'C' to create a single linked list and perform the following operations on it:
(i) Insert a new node at the beginning, in the middle or at the end of the linked list.
(ii) Delete a node from the linked list
(iii) Display the linked list in reverse order
(iv) Sort and display data of the linked list in ascending order.
(v) Count the number of items stored in a single linked list
Apply Prim's Algorithm to find the minimum spanning tree for the following graph.
Apply Insertion and Selection sorting algorithms to sort the following list of items. So, all Intermediate steps. Also, analyze their best, worst and average case time complexity.
12, 5, 2, 15, 25, 30, 45, 8, 17, 50, 3, 7
What is a Dequeue? Write algorithm to perform insert and delete operations in a Dequeue.
What is a heap tree? Create a max heap tree for the following list of items inserted in the order. Also, explain the heap sort with the help of thus created heap tree. 10, 20, 5, 25, 30, 18, 3, 70, 55, 45, 12, 24
Draw the binary tree for which the traversal sequences are given as follows:
(i) Pre order: ABDEFCGHIJK
In order: BEDFACIHKJG
(ii) Post order: IJHDKECLMGFBA
In order: I HJDCKEAFLGMB