IGNOU MCA -mcs-021 solved assignments 2012 -2013

Course Code : MCS-021

Course Code : MCS-021
Course Title : Data and File Structures
Assignment Number : MCA(2)/021/Assign/12
Maximum Marks : 100
Weightage : 25%
Last Dates for Submission : 15th October, 2012 (For July 2012 Session)
15th April, 2013 (For January 2013 Session)
This assignment has four questions which carry 80 marks. Answer all the questions. Each question 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 an algorithm for multiplication of two sparse matrices using Linked Lists.


Question 2:
Implement multiple stacks in a single dimensional array. Write algorithms for various stack operations for them.

Question 3:
Write a note of not more than 5 pages summarizing the latest research in the area of “Shortest Path Algorithms” for graphs. Refer to various journals and other online resources.

Question 4:
What are the applications of Red-Black Trees.


 IGNOU Coaching for BCA, MCA, MBA in Jaipur 

BCA Coaching in Jaipur | MCA Coaching in Jaipur

IGNOU JAIPUR

Regional Director,
IGNOU Regional Centre,
70/79,
Sector - 7,
Patel Marg,
Mansarovar
Rajasthan - 302020
India
Ph :+91-0141-2785763 / 2785750
Fax :+91-0141-2784043