Help?
PLEASE MATCH YOUR ASSIGNMENT QUESTIONS ACCORDING TO YOUR SESSION
IGNOU MCS-208 (January 2026 – July 2026) Assignment Questions
Q1: 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.
Q2: 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.
Q3: Explain Left Leaning Red Black Trees. What are their advantages and disadvantages?
Q4: Write a short note on the recent developments in the area of finding minimum cost spanning trees.
IGNOU MCS-208 (July 2025 – January 2026) Assignment Questions
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.
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.
Question 3: Explain Left Leaning Red Black Trees. What are their advantages and disadvantages?
Question 4: Write a short note on the recent developments in the area of finding minimum cost spanning trees.
IGNOU MCS-208 (January 2025 – July 2025) Assignment Questions
Q1: What is a Doubly Linked Circular List? What are its advantages and disadvantages? Give a scenario where its application is appropriate. Justify your answer.
Q2: What is a Tree? How does it differ from a Binary Tree? Is it possible to convert a Tree to a Binary Tree? If yes, then, explain the process with an example.
Q3: What are Red Black Trees? How do they differ from Splay Trees? What are their applications?
Q4: Write a short note on the recent developments in the area of finding shortest path between two nodes of a Graph. Make necessary assumptions.
