Programme and Data Structure

MMT-001 important topics

The eGyanKosh units IGNOU has examined most, from 8 past papers. Matched automatically from question wording.

1. Block 3, Unit 14: Trees ↗Asked almost every time: in 6 of 8 papers
2. Block 3, Unit 12: Lists ↗Asked sometimes: in 2 of 8 papers
3. Block 2, Unit 9: Functions-II ↗Asked sometimes: in 2 of 8 papers
4. Block 3, Unit 13: Stacks and Queues ↗Asked sometimes: in 1 of 8 papers
5. Block 1, Unit 5: Control Structures-I ↗Asked sometimes: in 1 of 8 papers

MMT-001 assignment

The latest MMT-001 assignment is valid for the January 2026 & July 2026 sessions. It carries 100 marks and 30% of your final grade. Due 31 Mar 2026 for the January 2026 session or 30 Sept 2026 for the July 2026 session.

MMT-001 previous-year question papers

Official term-end exam papers for Programme and Data Structure, published by IGNOU. Each one opens on IGNOU’s website.

• June 2024MMT-001 term-end exam, official PDF↗
• December 2023MMT-001 term-end exam, official PDF↗
• June 2023MMT-001 term-end exam, official PDF↗
• December 2022MMT-001 term-end exam, official PDF↗
• June 2022MMT-001 term-end exam, official PDF↗
• December 2021MMT-001 term-end exam, official PDF↗
• June 2021MMT-001 term-end exam, official PDF↗
• December 2020MMT-001 term-end exam, official PDF↗

Important Programme and Data Structure questions

13 questions have come in more than one MMT-001 exam. They are listed first. The text is taken from IGNOU’s official papers, so open the paper for figures and exact wording.

1. June 2024 · Q1(b)Asked 3 times

   Write the output of the following segments of code. Justify your answer with short explanations: int main () { int a = 9; if (a = 8) { printf(“coffee\n”); } printf (“Tea\n”); return 0; }

2. June 2024 · Q1(d)Asked 3 times

   Write the output of the following segments of code. Justify your answer with short explanations: int main () { int b = 25; int *p; p = &b; printf (“%d, %d”, b++, *p); return O; }

3. June 2024 · Q4(b) · 2 marksAsked 3 times

   Explain call by value and call by reference with suitable example for each.

4. December 2022 · Q5(b) · 1 marksAsked 3 times

   Explain the call-by-value and call-by- reference, with an example for each.

5. December 2021 · Q1(a)Asked 3 times

   Write the output of the following segments of code. Justify your answers with short explanations: main() { unsigned int i; for (i = –10; i < = –1; i– –) printf (“%d”, i); }

6. December 2021 · Q1(d)Asked 3 times

   Write the output of the following segments of code. Justify your answers with short explanations: main() { int x = 12; (x/5 = = 2.4)? printf (“True”): printf (“False”); }

7. December 2020 · Q4(a) · 2 marksAsked 3 times

   Explain “call by value” and “call by reference” with the help of an example for each.

8. June 2024 · Q1(a)Asked 2 times

   Write the output of the following segments of code. Justify your answer with short explanations: into main () { float a = 10.0; a = a% 3; printf("%f", a); }return O;

9. December 2023 · Q3(a) · 3 marksAsked 2 times

   Define a node for a doubly linked list of integers using pointer implementation. Also, write a function that prints the nth node of this list.

10. December 2023 · Q5(b) · 1 marksAsked 2 times

    Explain the use of the enum data type, with an example.

11. June 2022 · Q3(b) · 2 marksAsked 2 times

    Explain the use of enum data type, with the help of an example.

12. December 2021 · Q1(e)Asked 2 times

    Write the output of the following segments of code. Justify your answers with short explanations: main() { char * p; p = “Hello”; printf(“%d”, p[0]); }

Programme and Data Structure study material

IGNOU publishes the full MMT-001 self-learning material free on eGyanKosh: every block and unit on the c programming language, programming in c, data structures and laboratory manual.