IGNOU MCS-021 Assignment 2026-27
Data and File Structures
Last updated by IGNOU: 06 Aug 2026. Guide written from the official PDF on 23 Oct 2026, 01:25 pm.
| Course code | MCS-021 |
|---|---|
| Course title | Data and File Structures |
| Programme | Bachelor of Computer Applications (BCA)BCAOL |
| School | School of Computer and Information Sciences |
| Assignment code | BCA(III)/021/Assignment/2026-27 |
| Session | July 2026 and January 2027 |
| Maximum marks | 100 |
| Weightage | 30% |
| Last date (June exam) | 30 Apr 2027 |
| Last date (December exam) | 31 Oct 2026 |
| Medium |
About the MCS-021 assignment
The MCS-021 assignment covers C programming with polynomials, linked lists and matrices, expression evaluation, tree structures, graph algorithms, sorting and file organisation. Tasks include writing programs, constructing trees, tracing algorithms and explaining concepts.
There are 13 compulsory questions worth 80 marks, with another 20 marks reserved for viva voce. Questions 8 and 9 carry 7 marks each; the other questions carry 6 marks each. The assignment directs students to the Programme Guide for presentation requirements.
What the assignment asks
| Question | Marks | Topic |
|---|---|---|
| Q1 | 6 | Write a C program that takes two polynomials and displays their product. |
| Q2 | 6 | Create an integer doubly linked list in C, calculate separate even and odd totals, and build another list with even values before odd values. |
| Q3 | 6 | Write a C program to add two input matrices and calculate the sum of the resulting matrix's main diagonal. |
| Q4 | 6 | Use suitable data structures in a C program to evaluate the supplied prefix and postfix expressions. |
| Q5 | 6 | Draw two binary trees using the supplied postorder–inorder and preorder–inorder traversal pairs. |
| Q6 | 6 | Define an AVL tree, construct one using the specified insertion sequence, and delete the designated values. |
| Q7 | 6 | Explain B-tree properties, construct an order-5 B-tree from the given sequence, and perform the specified deletions. |
| Q8 | 7 | Apply the Bellman–Ford algorithm to determine shortest paths from vertex S to all other vertices in the supplied graph. |
| Q9 | 7 | Explain a minimum spanning tree and use Prim's algorithm to find one for the supplied graph. |
Assignment details and PDFs come from IGNOU's official website; the guide is a summary of the official PDF. Always check the latest instructions and last dates on ignou.ac.in or with your Regional Centre before submitting.