IGNOU MCS 21 SOLVED ASSIGNMENT

Ques 1.

 Write a program in C to accepts two polynomials as input and prints the resultant polynomial due to the addition of input polynomials.

Ques 2.

  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 in thereafter nodes in a separate linked list.

Ques 3.

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)

Ques 4.

 Use the appropriate data structures and write a program in C to evaluate the following expressions:

Prefix expression: +, -, , 3, 2, 7, 8, 4, 1

Postfix expression: 10, 5, +, 60, 6, /, , 8, -

Ques 5.

 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: B-D-C-E-A-G-H-K-F

Ques 6.

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.

Ques 7.

 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.

Ques 8.

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.

Ques 9.

Apply Dijkstra’s algorithm to find the shortest path from the vertex ‘S’ to all other vertices for the following graph:

Ques 10.

. What is minimum spanning tree (MST)? Apply Kruskal’s algorithm to find the MST for the following graph.

Ques 11.

 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

Ques 12.

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

Ques 13.

 Write a program in 'C' language to perform binary search algorithm.

Ques 14.

What is hashing? Explain the hash functions. Also, discuss the collision resolution methods in hashing.

Ques 15.

 What is Red-Black tree? Explain insertion and deletion operations in a Red-Black tree with the help of a suitable example.

Ques 16.

 Explain Direct File and Indexed Sequential File Organization.

Ques 17.

 Write a program in C to accepts two polynomials as input and prints the resultant polynomial due to the addition of input polynomials.

Ques 18.

  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 in thereafter nodes in a separate linked list.

Ques 19.

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)

Ques 20.

 Use the appropriate data structures and write a program in C to evaluate the following expressions:

Prefix expression: +, -, , 3, 2, 7, 8, 4, 1

Postfix expression: 10, 5, +, 60, 6, /, , 8, -

Ques 21.

 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: B-D-C-E-A-G-H-K-F

Ques 22.

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.

Ques 23.

 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.

Ques 24.

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.

Ques 25.

Apply Dijkstra’s algorithm to find the shortest path from the vertex ‘S’ to all other vertices for the following graph:

Ques 26.

. What is minimum spanning tree (MST)? Apply Kruskal’s algorithm to find the MST for the following graph.

Ques 27.

 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

Ques 28.

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

Ques 29.

 Write a program in 'C' language to perform binary search algorithm.

Ques 30.

What is hashing? Explain the hash functions. Also, discuss the collision resolution methods in hashing.

Ques 31.

 What is Red-Black tree? Explain insertion and deletion operations in a Red-Black tree with the help of a suitable example.

Ques 32.

 Explain Direct File and Indexed Sequential File Organization.

• Latest IGNOU Solved Assignment
• IGNOU MCS 21 2025 2026 Solved Assignment
• IGNOU 2025 2026 Solved Assignment
• IGNOU BCA Bachelor of Computer Applications 2025 2026 Solved Assignment
• IGNOU MCS 21 Data and File Structures 2025 2026 Solved Assignment

Looking for IGNOU MCS 21 Solved Assignment 2025 2026. You are on the Right Website. We provide Help book of Solved Assignment of BCA MCS 21 - Data and File Structuresof year 2025 2026 of very low price.
If you want this Help Book of IGNOU MCS 21 2025 2026 Simply Call Us @ 9199852182 / 9852900088 or you can whatsApp Us @ 9199852182
 

IGNOU BCA Assignments Jan - July 2026 - IGNOU University has uploaded its current session Assignment of the BCA Programme for the session year 2025 2026. Students of the BCA Programme can now download Assignment questions from this page. Candidates have to compulsory download those assignments to get a permit of attending the Term End Exam of the IGNOU BCA Programme.

Download a PDF soft copy of IGNOU MCS 21 Data and File Structures BCA Latest Solved Assignment for Session January 2026 - December 2026 in English Language.

If you are searching out Ignou BCA  MCS 21 solved assignment? So this platform is the high-quality platform for Ignou BCA  MCS 21 solved assignment. Solved Assignment Soft Copy & Hard Copy. We will try to solve all the problems related to your Assignment. All the questions were answered as per the guidelines. The goal of IGNOU Solution is democratizing higher education by taking education to the doorsteps of the learners and providing access to high quality material. Get the solved assignment for MCS 21 Data and File Structures course offered by IGNOU for the year 2025 2026.Are you a student of high IGNOU looking for high quality and accurate IGNOU MCS 21 Solved Assignment 2025 2026 English Medium? 

Students who are searching for IGNOU Bachelor of Computer Applications (BCA) Solved Assignments 2025 2026 at low cost. We provide all Solved Assignments, Project reports for Masters & Bachelor students for IGNOU. Get better grades with our assignments! ensuring that our IGNOU Bachelor of Computer Applications Solved Assignment meet the highest standards of quality and accuracy.Here you will find some assignment solutions for IGNOU BCA Courses that you can download and look at. All assignments provided here have been solved.IGNOU MCS 21 SOLVED ASSIGNMENT 2025 2026. Title Name MCS 21 English Solved Assignment 2025 2026. Service Type Solved Assignment (Soft copy/PDF).

Are you an IGNOU student who wants to download IGNOU Solved Assignment 2024? IGNOU BACHELOR DEGREE PROGRAMMES Solved Assignment 2023-24 Session. IGNOU Solved Assignment and In this post, we will provide you with all solved assignments.

If you’ve arrived at this page, you’re looking for a free PDF download of the IGNOU BCA Solved Assignment 2025 2026. BCA is for Bachelor of Computer Applications.

IGNOU solved assignments are a set of questions or tasks that students must complete and submit to their respective study centers. The solved assignments are provided by IGNOU Academy and must be completed by the students themselves.