IGNOU BCA MCA

Forum

Question 1: MCS-209 Data Structures and Algorithms Lab

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

Search for:

Write a short note on the recent developments in the area of finding minimum cost spanning trees.
Explain Left Leaning Red Black Trees. What are their advantages and disadvantages?
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.
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.
What is an abstract class? Explain concepts of aggregation, generalization and specialization with the help of suitable example. [MCS-219, Q5]