Data Structure and Algorithm MSCS Islamia University Bhawalpur (IUB) 2015

The Islamia Unibersity of Bahawalpur

Final(Objective)|

Course Title:- Data Structure and Algorithms

Term: - 200

Time:- 115 mins

Course Code:- CSIT-21201

Program:- MCS

Marks:-45

a Noz lan) hort answers for the followings.

5 × 4= 20

Nrite an algorithm for MAX HEAPIFY opic Pen of Heap?

*hat is quadratic probing in haçks? Explain with suitable example.

Which traversal in a Binary Search Tree yield sorted data? Explain with sultagni Phple

What do you mean by unbalanced tree? Which types of trees proudes strategy to avoid this

unbalanced behavior?

V

What is difference between greedy algorithm and dynamic programming approach for algorithm

designing?

Long Questions

10 × 2 = 20

Note: Answer only three questions from the following questions. Draw diagrams if necessary.

2. 0 3 raw a Binary Search ce for the dira chemie on and an energ this tree by in order, preorder

and post-order traversal methods.

56, 34, 87, 48, 21, 37, 98, 47, 23, 12

& No 4 Construct the Minimum Spanning Tree of the following Graph by using Kruska's Algorithm

10

ustani.pk

10

ustant.pk

ustani.pk

H

visit website: ustani.pk