Birla Institute of Technology (BIT Mesra) 2004 MS Software Engineering Data Structure & Algorith(closed book) - Question Paper

Birla Institute of Technology and Science, Pilani
Distance Learning Programmes Division
MS Software Engineering in Collaboration with Wipro Technologies
Second Semester 2003 – 2004
Mid semester
Regular
Course No. : SEWPZC415
Course Name : Data Structure & Algorithms
Nature of examination : Closed Book examination
weightage : 40 %
Duration : 2Hours
Date : May 08, 2004 (AN)

Note: Attempt all ques.. begin every ans from a fresh page

1. Write recursive C functions for the following:
a. To obtain the sum of natural numbers ranging from one and n (1)
b. To calculate an (2)
c. To calculate the sum of n elements in an array (2)

2. Write C functions to implement subsequent queue operations using linked lists
a. Insert rear (2)
b. Delete front (2)
c. Display (1)

3. Explain asymptotic notations with examples (5)

4. Write an algorithm to sort elements that takes time complexity of in the best case and O(n2) in the worst case. (5)

5. Obtain the avg. case time complexity of quick sort (5)

6. Explain merge sort for the subsequent items 10, 40, 15, 50, 20, five along with the algorithm (2 + 3)

7. Use divide and conquer technique and find the algorithm to obtain maximum and minimum of n elements and obtain the number of comparisons by considering only element comparisons. (2 + 3)

8. Write a detailed algorithm to obtain the shortest distance from a provided node to all other nodes using Dijkstr’s algorithm (5)


--------------------------------

Earning:   Approval pending.