Description
I need help
Unformatted Attachment Preview
COMSATS University, Islamabad
Islamabad Campus
Assignment No. 4: CLO-4 &5
Course code and Title: CSC211, Data Structure and Algorithm
Instructor: Rubina Adnan
Marks:10
Department of Computer Science
Question-1: Explain BST, Insertion of node and Deletion of node in BST.
Question-2: What is an AVL tree? What is the purpose of AVL tree? How unbalanced tree can be
transformed into balanced tree by applying four rotation operations.
Question-3: (a) Insert the following sequence of elements into an AVL tree, starting with an empty tree:
10, 20, 15, 25, 30, 16, 18, 19. (b) Delete 30 in the AVL tree that you got.
Question-4: What is Heap data structure? Explain Maxheap and minheap with example?
Question-5: What is Graph? Explain Dijkstra’s shortest path algorithm with an example.
Question-6: What is Kruskal and Prims minimum spanning tree algorithms?
Question-7: Elaborate Breadth First and Depth First algorithm with an example.
Question-8: What is Hashing? Explain hashing with chaining method and linear probing with example.
Purchase answer to see full
attachment
