MCS 021 Date And File Structure Solved Assignment is a core subject for anyone pursuing a computer applications degree, but we know it can feel like a mountain of logic and code. From building linked lists to balancing AVL trees, the technical demands can be overwhelming when you have a busy schedule. That is why we have created this humanized, easy-to-follow guide to help you breeze through your assignments. We don't just give you the code; we explain the logic in a way that feels like a friend is teaching you. Whether you are struggling with matrix multiplication or Dijkstra's shortest path, our solved assignment breaks down every single question into manageable steps. This guide is your perfect tool to understand the subject deeply while ensuring your submission is top-notch and ready on time.
Assignment Questions
Q1. Write a program in C to accepts two polynomials as input and prints the resultant polynomial due to the addition of input polynomials.
Q2. Write a program in 'C' to create a single linked list to store integers and perform the following operations on it: (i) Find the sum of all even integers and odd integers separately and print them. (ii) Traverse the linked list and store all the even integers in the beginning nodes and all odd integers thereafter nodes in a separate linked list.
Q3. Write a program in 'C' to input two matrices and perform the following operations on them: (i) Multiply both the matrices and display the resultant matrix. (ii) Find the sum of main diagonal elements of the resultant matrix, computed in (i). (iii) Find the inverse of the matrix obtained after multiplication in (i).
Q4. Use the appropriate data structures and write a program in C to evaluate the following expressions: Prefix expression: +, -, *, 3, 2, /, 8, 4, 1. Postfix expression: 10, 5, +, 60, 6, /, *, 8, -.
Q5. Draw the binary tree for which the traversal sequences are given as follows: (i) Post order: DHKECFMNLGBA, In order: DCHEKAFBMLNG. (ii) Pre order: ABCDEFGHJK, In order: BDCEAGJHKF.
Q6. Write a program in 'C' to implement a binary search tree (BST). Traverse and display the binary search tree in the Inorder, Preorder and Post order form.
Q7. Define AVL tree. Create an AVL tree for the following list of data if the data are inserted in the order in an empty AVL tree: 2, 12, 15, 4, 30, 10, 1, 35, 18, 25, 28, 50, 42, 6, 8. Further delete 1, 4, 8 and 10 from the above AVL tree.
Q8. Define a B-tree and its properties. Create a B-tree of order-4, if the data items are inserted into an empty B-tree in the following sequence: 10, 2, 15, 25, 60, 45, 35, 80, 20, 8, 4, 55, 50, 68, 62, 40. Further, delete the items 2, 4, 8, and 10 from the B-tree.
Q9. Apply Dijkstra's algorithm to find the shortest path from the vertex 'S' to all other vertices for the given graph.
Q10. What is minimum spanning tree (MST)? Apply Kruskal's algorithm to find the MST for the given graph.
.png)
Q11. Apply Insertion and Bubble sorting algorithms to sort the following list of items. Show all the intermediate steps. Also, analyze the number of swap and comparison operations performed in both the methods: 5, 20, 10, 12, 30, 35, 40, 50, 45, 55, 7, 8, 2.
Q12. What is a heap tree? Create a min heap tree for the following list of items inserted in the order. Also, explain the heap sort with the help of thus created heap tree: 10, 20, 5, 25, 30, 18, 3, 70, 55, 45, 12, 24.
Q13. Write a program in 'C' language to perform binary search algorithm.
Q14. What is hashing? Explain the hash functions. Also, discuss the collision resolution methods in hashing.
Q15. What is Red-Black tree? Explain insertion and deletion operations in a Red-Black tree with the help of a suitable example.
Q16. Explain Direct File and Indexed Sequential File Organization.
MCS 021 Assignments Details
| Enrollment Session | Submission Deadline | Where to Submit |
|---|---|---|
| For the students enrolled in July 2025 | 31st October 2025 | Coordinator of the Learner Support Centre |
| For the students enrolled in January 2026 | 30th April 2026 | Coordinator of the Learner Support Centre |
Why Choose Our MCS 021 IGNOU Solved Assignments?
- Our programming solutions are written in clean, understandable C language that follows standard coding practices, making it simple for you to type them out and test them on your own computer systems.
- We provide full step-by-step logic for complex mathematical questions like Dijkstra's algorithm and Kruskal's algorithm, so you don't just get an answer but also understand the process clearly.
- Every tree and graph diagram is presented neatly within the PDF, ensuring you have a perfect visual reference to copy onto your response sheets, which is a major factor in getting high marks.
- Our content is strictly human-checked for plagiarism and technical errors, giving you a unique assignment that looks like a genuine effort from a dedicated student rather than a robotic copy.
- We help you prepare for the 20-mark viva voce by providing clear explanations for each concept, so you can confidently answer the questions asked by your study centre evaluator during the practicals.
- The session-specific guidance ensures you are using the correct 2025-26 booklet questions, preventing any risk of submitting outdated work that could lead to rejection of your assignment sheets.
Why Buy From Unnati Education?
- We focus on providing student-friendly, conversational materials that make tough subjects feel easy.
- You get your solved assignment PDF immediately after payment, so there is no delay in your work.
- Our materials are designed by experts to ensure they meet the specific evaluation standards of IGNOU.
- We offer safe and secure payment options so you can shop for your study needs with total peace of mind.
- Our support team is always ready to help you if you face any issues with your downloads or files.
- We believe in quality at an affordable price, making top-tier academic help accessible to all students.
Explore Our Student Support Services
- IGNOU Handwritten Assignments (Scan & Hard Copy)
- IGNOU Guess Paper (Solved)
- IGNOU Previous Year Question Paper (Solved)
- IGNOU Project and Synopsis Help
- BCA Study Materials and Guidance
FAQs
Is MCS 021 difficult? MCS 021 is often considered a "heavy" subject because it requires both strong mathematical logic and a good grasp of C programming. Topics like B-trees and Red-Black trees can be quite abstract when you first see them. However, it isn't necessarily difficult if you break it down. Most students struggle because they try to memorize the code instead of understanding the structure. Our guide is designed to make these topics feel like a simple conversation. We explain the "how" and "why" behind every node and link, turning a complex mountain of data into something you can comfortably handle and even master.
What is the passing criteria for this assignment? The MCS 021 assignment is worth a total of 100 marks, where 80 marks come from the 16 written questions and 20 marks are awarded based on your viva voce performance. This assignment carries a 30% weightage in your final grade for the course. To be eligible for the Term End Examinations, you must submit this assignment to your coordinator before the due date. High marks in the assignment are a great way to boost your overall percentage, so putting in the effort to submit a well-written, logical response is highly beneficial for your final results.
How should I submit my BCA assignments? You must submit your completed assignment response sheets to the Coordinator of your allotted Study Centre. IGNOU requires you to follow a specific format for the first page, including your Name, Enrollment Number, Course Code, and Study Centre details. It is very important to use only foolscap size paper and leave appropriate margins on all sides. Also, remember that submitting your assignment before the due date is a mandatory requirement to become eligible for appearing in the corresponding Term End Examinations for that semester.
Are all questions compulsory in this assignment? Yes, for the MCS 021 assignment, you are required to answer all 16 questions provided in the booklet. Each written question carries 5 marks, totaling 80 marks for the written part. The remaining 20 marks are reserved for the viva voce, where the evaluator will ask you questions related to the topics you've covered in the assignment. Because there are no optional questions, having a complete and accurate solved guide like ours is essential to ensure you don't miss out on any marks due to incomplete sections.
What is the last date for submission? The last date for submission depends on your enrollment session. If you are a student of the July 2025 session, your deadline is 31st October 2025. For the January 2026 session, you must submit your work by 30th April 2026. It is a good habit to keep a photocopy or a digital scan of your submitted assignment responses for your own records. This ensures that you have proof of your work in case any issues arise during the evaluation or marks entry process at the university headquarters.
We offer a range of academic resources to support your IGNOU journey: Get our accurately Solved Assignments PDF to save time and effort. We also provide IGNOU Guess Papers (Solved) to help you focus on the most important topics for your exams, along with Previous Year Question Papers (Solved) to understand the paper pattern. If you are looking for that personal touch, our Handwritten Assignments (Scan & Hard Copy) are a perfect choice to ensure a high-quality submission without the stress of writing it all yourself.
