MCS-021 Data and File Structures July 2011 – June 2012

Course Code : MCS-021
Course Title : Data and File Structures
Assignment Number : MCA (2)/021/Assign/11
Last Dates for Submission : 15th October, 2011 (for July, 2011 session) 15th April, 2012 (for January, 2012 session)

This assignment has three questions which carry 80 marks. Answer all the questions. Viva-voce carries 20 marks. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme Guide. Ensure that you don’t copy the program from course material or any other source. All the implementations should be in C language.

Question 1: Write a program for multiplication of two polynomials. Use Doubly Linked lists. (20 marks)

Question 2: Write an algorithm for the conversion of a Tree into a Binary Tree. Also, write the corresponding program. (20 marks)

Question 3: Write an algorithm for drawing minimum cost spanning tree (MCST) for the input graph. (20 marks)

Question 4: Briefly, describe various file organizations. (20 marks)