IGNOU — BCA Assignment January 2026

MCS-208: Data Structures and Algorithms

Session: January 2026

Assignment Number:BCA_NEW(I)-208/Assignment/2025-26

Download: MCS-208 Assignment

Question 1: For each of the Singly Linked List, Circularly Singly Linked List, Doubly Linked List, Circularly Doubly Linked List, write one application that is exclusively suitable for that list. For example, X may be an application for whose implementation, only Circularly Singly Linked List is suitable and others are not suitable. Justify your answer. Answer

Question 2: We can test whether a node ‘ m’ is a proper ancestor of a node ‘ n’ by testing whether ‘ m’ precedes ‘ n’ in X-order but follows ‘ n’ in Y-order , where X and Y are chosen from {pre, post, in}. Determine all those pairs X and Y for which this statement holds. Answer

Question 3: Explain Left Leaning Red Black Trees. What are their advantages and disadvantages? Answer

Question 4: Write a short note on the recent developments in the area of finding minimum cost spanning trees. Answer

MCS-209: Data Structures and Algorithms Lab

Assignment Number: BCA_NEW(III)L-209/Assignment/2025-26

Download: MCS-208 Assignment

Question 1: Write an algorithm and program in ‘C’ language to merge two sorted linked lists. The resultant linked list should be sorted. Answer

Question 2:Write an algorithm and a program in ‘C’ language to insert and delete edges in an adjacency list representation of an undirected graph. Make assumptions, if necessary. Answer