IGNOU MCA-NEW MCS 208 Data Structures and Algorithms Solved Assignment ENGLISH

Please make sure your assignment questions match your current IGNOU session

MCS 208 (July 2026 - January 2027) - ENGLISH

Course Code : MCS-208
Course Title : Data Structures and Algorithms
Assignment Number : PGDCA_NEW(II)/208/Assignment/2026-27
Maximum Marks : 100
Weightage : 25%
Last Date of Submission : 31st October, 2026 (for July session)
30th April, 2027 (for January session)
There are four questions in this assignment, which carry 80 marks. Each question carries
20 marks. Rest 20 marks are for viva voce. All algorithms should be written nearer to C
programming language. You may use illustrations and diagrams to enhance the
explanations, if necessary. Please go through the guidelines regarding assignments given in
the Programme Guide for the format of presentation.
Question 1: Write an algorithm to list the data fields of the nodes of a binary tree by level. 
Within levels , nodes are to be listed left to right.
Question 2: Show that every tree is a bipartite graph.
Question 3: Consider a hypothetical data object X1. X1 is a linear list with the restriction 
that while additions to the list may be made at either end, deletions can be made
from one end only. Design a linked list representation for X1. Write addition
and deletion algorithms for X1. Specify initial and boundary conditions for your
representation.

Question 4: Write an algorithm to list all the identifiers in a hash table in lexicographic
order. Assume the hash function f is f(X) = first character of X and linear
probing is used. How much time does your algorithm take

MCS 208 (January 2026 - July 2026) - ENGLISH

Course Code

MCS-208

Course Title

: :

: :

Data Structures and Algorithms

Assignment Number :

PGDCA_NEW(II)/208/Assign/2026

Maximum Marks

: :

100

Weightage

: :

25%

Last Dates for Submission

: :

30th April 2026 (for January Session)

There are four questions in this assignment, which carry 80 marks. Each question carries 20 marks. Rest 20 marks are for viva voce. All algorithms should be written nearer to C programming language. You may use illustrations and diagrams to enhance the explanation, if necessary. Please go through the guidelines regarding assignments given in the

Programme Guide for the format of presentation.

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 nodem' 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.

MCS 208 (July 2025 - January 2026) - ENGLISH

Course Code :

MCS-208

Course Title

,

Data Structures and Algorithms

Assignment Number

,

PGDCA_NEW(II)/208/Assignment/2025-26

Maximum Marks

,

100

Weightage

,

25%

Last Date of Submission

,

31 October, 2025 (for July session) 30th April, 2026 (for January session)

There are four questions in this assignment, which carry 80 marks. Each question carries 20 marks. Rest 20 marks are for viva voce. All algorithms should be written nearer to C programming language. You may use illustrations and diagrams to enhance the explanations, if necessary. Please go through the guidelines regarding assignments given in the Programme Guide for the format of presentation.

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.

 

MCS 208 (January 2025) - ENGLISH

Course Code:MCS-208

Course Title:Data Structures and Algorithms

Assignment Number:PGDCA_NEW(II)/208/Assign/2025

Maximum Marks:100

Weightage:25%

Last Dates for Submission

30th April 2025 (for January Session)

There are four questions in this assignment, which carry 80 marks. Each question carries 20 marks. Rest 20 marks are for viva voce. All algorithms should be written nearer to C programming language. You may use illustrations and diagrams to enhance the explanation, if necessary. Please go through the guidelines regarding assignments given in the Programme Guide for the format of presentation.

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.

Q: How will I receive the PDF?
A: Immediately after payment, the download link will appear.

Q: Is this hand-written or typed?
A: This is a professional typed computer PDF. You can use it as a reference for your handwritten submission.