Home /Islamia University Bhawalpur (IUB) /Data Structure and Algorithm

Data Structure and Algorithm MSCS 2 Semester/Term Islamia University Bhawalpur (IUB) 2017

Data Structure and Algorithm MSCS 2 Semester/Term Islamia University Bhawalpur (IUB) 2017 — page 1

Discussion

Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.

Your email is only used to send you replies and occasional Ustadni updates. It is never shown publicly.

Log in to post under your name

No questions yet — be the first to ask.

More Data Structure and Algorithm papers

See all

Paper text

Course Code:- CSIT-21201

Program:- MCS

Marks:-45

The Islamia Unibersity of Bahawalpur

Final(Objective)

Course Title:- Data Structure and Algorithms

Term: - 2nd

Time:- 150 mins

Q. No 2 Write short answers for the followings.

1. What is difference between Singly Linked List and Doubly Linked List data structure?

7 × 3 = 21

Consider you want to map the trate is Sorted data? Explain with suitable example.

V. What is primary cluster in hashing? How it can be renoved?

VI. Which sorting algorithm follows divide and conquer approach? Explain briefly.

VIl. What is difference between loop and cycle in a graph?

Long Questions

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

8 × 3 = 24

Q. No 3 write down the algorithm/code for inserting a node in linked list.

Q. No 4 draw a Binary Search Tree for the data given below and also traverse this tree by in-order, pre-order

and post-order traversal methods.

23, 45, 65, 12, 37, 87, 13, 98

Q. No 5 Insert the following values in a hash table of size 100 elements by using double hashing technique.

345, 234, 445, 567, 334, 667, 754

8

8

8

Dstani.pk

ustani.pk

visit website: ustani.pk