Makhanlal Chaturvedi National University of Journalism and Communication 2005 M.Sc Information Technology Data Stuctures & Algorithms using C - - Question Paper

Duration: 3 Hours
Max. Marks: 100
Minimum Passing Marks: 40

Instructions:
1. The ques. Paper is divided into 5 units. every unit carries an internal option.
2. Attempt 1 ques. from every unit. Thus attempt 5 ques. in all.
3. All ques. carry equal marks.
4. presume suitable data wherever necessary.
5. English version should be deemed to be accurate in case of any anomaly in translation.
6.Protest against ques. paper, if any, should be lodged after paper through Head of Department Study Institute. No boycott of paper should be made under any circumstances by the examinees.

Unit-I
1.a. 1.What do you understand by abstract data structure ? How will you represent personal info of an employee in abstrach data structure form in 'C' language:
{
Name
Address
Date of Birth
Salary
Designation
}(10)

b. Compare ranging from stacks and queues. (10)

2.a. 2.Explain the concept of recursion. Write an algorithm to obtain factorial of a provided number using recursion. (10)

b. Write an algorithm for insertion and deletion of an element in Dequeue. (10)

Unit-II
3.a. discuss doubly linked list. Write an alogrithm for searching of node in doubly linked list (10)

b. discuss the method to implement binary tree in the form of linked list. (10)

4.a. Write a 'C' language program to implement doubly linked list (10)

b. Write an algorithm to reverse a single linked list. (10)

Unit-III
5.a. Write an alogrithm for tree traversal using recursion. (10)

b. discuss the method to convert a binary tree to general tree.(10)

6.a. discuss height balanced tree. (10)

b. elaborate the applications of binary trees ? (10)

Unit-IV
7. Write an algorithm for quick sort. Compare the complexity of quick sort and bubble sort.(20)

8. a. discuss the method of merge-sorting. (10)

b. Write a C program for sequential searching of an element in an array.(10)

Unit-V
9. Write short notes on any 2 of the following:

a. Kruskal Algorithm
b. Hash Table
c. Internal Representation of Graph. (20)

10. what are the shortest path and longest path issue (20)

Earning:   Approval pending.