IGNOU MMT 1 SOLVED ASSIGNMENT

Ques 1.

Write the output of the following C codes, with proper justification for each.

i) main()

{

int x = 2, y = 2, z = 2;

x = y == z;

y = z == x;

z = x == y;

printf("%d", z);

} ii) main()

{

int x = -1, y;

x++;

y = x ? 2+x : 3-x;

printf("%d", y);

}

iii) main()

{ int i, j, a = 0;

for(i = 1, j = 1; i <= 5; j++)

{

a = a + i*j++; i = j;

}

printf("%d ", a);

}

iv) main()

{

int x = 5, y = 12;

int *p = &x, *q = &y, *r;

r = p;

p = q;

q = r;

printf("%d, %d", x, y);

}

v) func(int x)

{

static int a = 0;

a += x;

return(a);

}

main()

{ int p;

for(p = 1; p <= 5; ++p)

printf("%d", fun(p));

}

Ques 2.

Write a C program that takes a list of floating point numbers as input from the keyboard, and prints their mean and standard deviation.

Ques 3.

Parenthesise the following C statement for its proper evaluation.

x + = a%b + c ∗ d/e ! = f + + − g

Further, if all the variables from a to g are initialised by 2, then what will be the value of x?

Ques 4.

Write a loop that examines each character in a character type array called text, and determines how many of the characters are letters, how many are digits, how many are whitespace characters, and how many are other characters.

Ques 5.

Explain the arguments of the functions scanf() and printf(), and how they work with an example for each.

Ques 6.

Suppose you wish to solve the equation x⁵ + 3x² − 10 = 0 for x. Rearrange this equation to get an appropriate fixed point iteration method. Then write a program to get an approximate value of the root of the equation. The initial guess must be entered by the user. Your programme must be able to flag a warning message if the initial guess is too far from the exact root. In that case, your program must be able to suggest an initial guess to the user. Terminate the program and print the current value of the root as soon as the difference between two successive approximations becomes smaller than 0.005.

Ques 7.

Explain the use of the string library functions strncpy() and strncat(), with the help of an example for each.

Ques 8.

Write a C program to check whether a given string is a palindrome or not.

Ques 9.

Explain, with an example, the difference between passing by value and passing by reference.

Ques 10.

How would you differentiate between the terms pointer to an array and array of pointers? Give proper examples.

Ques 11.

Explain how will you allocate memory dynamically for a two dimensional array of floating point numbers.

Ques 12.

You might recall that the Euler number e can be represented by the following series:

Write a program that approximates e with desired number of terms as entered by the user.

Ques 13.

What do you understand by a nested structure? Explain with an example. Also, explain how would you access the members of a structure or a nested structure using pointers?

Ques 14.

Given an integer n, what does the following function compute?

int function(int n)

{

int i;

for(i = 0; n != 0; n %=10, i++)

return i;

}

Ques 15.

Explain, with an example, the use of the keywords break and continue.

Ques 16.

zWrite a C program which reads a line of text from keyboard, and writes the line to a file with lower case letters converted to upper case and vice-versa.

Ques 17.

Write the inorder, preorder and postorder traversals of the following binary search tree.

Ques 18.

Define a structure of type hms containing three integer members, called hour, minute and second, respectively. Then define a union containing two members, each a structure of type hms. Call the union members local and home, respectively. Declare a pointer variable called time that points to this union.

Ques 19.

Write a function that evaluates an expression in RPN that is given as a string.

Ques 20.

Explain the meaning of the terms garbage collection, fragmentation, relocation and compaction.

Ques 21.

What do you understand by file organisation? Explain the methods of file organisation.

Ques 22.

Write the output of the following C codes, with proper justification for each.

i) main()

{

int x = 2, y = 2, z = 2;

x = y == z;

y = z == x;

z = x == y;

printf("%d", z);

} ii) main()

{

int x = -1, y;

x++;

y = x ? 2+x : 3-x;

printf("%d", y);

}

iii) main()

{ int i, j, a = 0;

for(i = 1, j = 1; i <= 5; j++)

{

a = a + i*j++; i = j;

}

printf("%d ", a);

}

iv) main()

{

int x = 5, y = 12;

int *p = &x, *q = &y, *r;

r = p;

p = q;

q = r;

printf("%d, %d", x, y);

}

v) func(int x)

{

static int a = 0;

a += x;

return(a);

}

main()

{ int p;

for(p = 1; p <= 5; ++p)

printf("%d", fun(p));

}

Ques 23.

Write a C program that takes a list of floating point numbers as input from the keyboard, and prints their mean and standard deviation.

Ques 24.

Parenthesise the following C statement for its proper evaluation.

x + = a%b + c ∗ d/e ! = f + + − g

Further, if all the variables from a to g are initialised by 2, then what will be the value of x?

Ques 25.

Write a loop that examines each character in a character type array called text, and determines how many of the characters are letters, how many are digits, how many are whitespace characters, and how many are other characters.

Ques 26.

Explain the arguments of the functions scanf() and printf(), and how they work with an example for each.

Ques 27.

Suppose you wish to solve the equation x⁵ + 3x² − 10 = 0 for x. Rearrange this equation to get an appropriate fixed point iteration method. Then write a program to get an approximate value of the root of the equation. The initial guess must be entered by the user. Your programme must be able to flag a warning message if the initial guess is too far from the exact root. In that case, your program must be able to suggest an initial guess to the user. Terminate the program and print the current value of the root as soon as the difference between two successive approximations becomes smaller than 0.005.

Ques 28.

Explain the use of the string library functions strncpy() and strncat(), with the help of an example for each.

Ques 29.

Write a C program to check whether a given string is a palindrome or not.

Ques 30.

Explain, with an example, the difference between passing by value and passing by reference.

Ques 31.

How would you differentiate between the terms pointer to an array and array of pointers? Give proper examples.

Ques 32.

Explain how will you allocate memory dynamically for a two dimensional array of floating point numbers.

Ques 33.

You might recall that the Euler number e can be represented by the following series:

Write a program that approximates e with desired number of terms as entered by the user.

Ques 34.

What do you understand by a nested structure? Explain with an example. Also, explain how would you access the members of a structure or a nested structure using pointers?

Ques 35.

Given an integer n, what does the following function compute?

int function(int n)

{

int i;

for(i = 0; n != 0; n %=10, i++)

return i;

}

Ques 36.

Explain, with an example, the use of the keywords break and continue.

Ques 37.

zWrite a C program which reads a line of text from keyboard, and writes the line to a file with lower case letters converted to upper case and vice-versa.

Ques 38.

Write the inorder, preorder and postorder traversals of the following binary search tree.

Ques 39.

Define a structure of type hms containing three integer members, called hour, minute and second, respectively. Then define a union containing two members, each a structure of type hms. Call the union members local and home, respectively. Declare a pointer variable called time that points to this union.

Ques 40.

Write a function that evaluates an expression in RPN that is given as a string.

Ques 41.

Explain the meaning of the terms garbage collection, fragmentation, relocation and compaction.

Ques 42.

What do you understand by file organisation? Explain the methods of file organisation.

Ques 43.

Write the output of the following C codes, with proper justification for each.

i) main()

{

int x = 2, y = 2, z = 2;

x = y == z;

y = z == x;

z = x == y;

printf("%d", z);

} ii) main()

{

int x = -1, y;

x++;

y = x ? 2+x : 3-x;

printf("%d", y);

}

iii) main()

{ int i, j, a = 0;

for(i = 1, j = 1; i <= 5; j++)

{

a = a + i*j++; i = j;

}

printf("%d ", a);

}

iv) main()

{

int x = 5, y = 12;

int *p = &x, *q = &y, *r;

r = p;

p = q;

q = r;

printf("%d, %d", x, y);

}

v) func(int x)

{

static int a = 0;

a += x;

return(a);

}

main()

{ int p;

for(p = 1; p <= 5; ++p)

printf("%d", fun(p));

}

Ques 44.

Write a C program that takes a list of floating point numbers as input from the keyboard, and prints their mean and standard deviation.

Ques 45.

Parenthesise the following C statement for its proper evaluation.

x + = a%b + c ∗ d/e ! = f + + − g

Further, if all the variables from a to g are initialised by 2, then what will be the value of x?

Ques 46.

Write a loop that examines each character in a character type array called text, and determines how many of the characters are letters, how many are digits, how many are whitespace characters, and how many are other characters.

Ques 47.

Explain the arguments of the functions scanf() and printf(), and how they work with an example for each.

Ques 48.

Suppose you wish to solve the equation x⁵ + 3x² − 10 = 0 for x. Rearrange this equation to get an appropriate fixed point iteration method. Then write a program to get an approximate value of the root of the equation. The initial guess must be entered by the user. Your programme must be able to flag a warning message if the initial guess is too far from the exact root. In that case, your program must be able to suggest an initial guess to the user. Terminate the program and print the current value of the root as soon as the difference between two successive approximations becomes smaller than 0.005.

Ques 49.

Explain the use of the string library functions strncpy() and strncat(), with the help of an example for each.

Ques 50.

Write a C program to check whether a given string is a palindrome or not.

Ques 51.

Explain, with an example, the difference between passing by value and passing by reference.

Ques 52.

How would you differentiate between the terms pointer to an array and array of pointers? Give proper examples.

Ques 53.

Explain how will you allocate memory dynamically for a two dimensional array of floating point numbers.

Ques 54.

You might recall that the Euler number e can be represented by the following series:

Write a program that approximates e with desired number of terms as entered by the user.

Ques 55.

What do you understand by a nested structure? Explain with an example. Also, explain how would you access the members of a structure or a nested structure using pointers?

Ques 56.

Given an integer n, what does the following function compute?

int function(int n)

{

int i;

for(i = 0; n != 0; n %=10, i++)

return i;

}

Ques 57.

Explain, with an example, the use of the keywords break and continue.

Ques 58.

zWrite a C program which reads a line of text from keyboard, and writes the line to a file with lower case letters converted to upper case and vice-versa.

Ques 59.

Write the inorder, preorder and postorder traversals of the following binary search tree.

Ques 60.

Define a structure of type hms containing three integer members, called hour, minute and second, respectively. Then define a union containing two members, each a structure of type hms. Call the union members local and home, respectively. Declare a pointer variable called time that points to this union.

Ques 61.

Write a function that evaluates an expression in RPN that is given as a string.

Ques 62.

Explain the meaning of the terms garbage collection, fragmentation, relocation and compaction.

Ques 63.

What do you understand by file organisation? Explain the methods of file organisation.

Ques 64.

Write the output of the following C codes, with proper justification for each.

i) main()

{

int x = 2, y = 2, z = 2;

x = y == z;

y = z == x;

z = x == y;

printf("%d", z);

} ii) main()

{

int x = -1, y;

x++;

y = x ? 2+x : 3-x;

printf("%d", y);

}

iii) main()

{ int i, j, a = 0;

for(i = 1, j = 1; i <= 5; j++)

{

a = a + i*j++; i = j;

}

printf("%d ", a);

}

iv) main()

{

int x = 5, y = 12;

int *p = &x, *q = &y, *r;

r = p;

p = q;

q = r;

printf("%d, %d", x, y);

}

v) func(int x)

{

static int a = 0;

a += x;

return(a);

}

main()

{ int p;

for(p = 1; p <= 5; ++p)

printf("%d", fun(p));

}

Ques 65.

Write a C program that takes a list of floating point numbers as input from the keyboard, and prints their mean and standard deviation.

Ques 66.

Parenthesise the following C statement for its proper evaluation.

x + = a%b + c ∗ d/e ! = f + + − g

Further, if all the variables from a to g are initialised by 2, then what will be the value of x?

Ques 67.

Write a loop that examines each character in a character type array called text, and determines how many of the characters are letters, how many are digits, how many are whitespace characters, and how many are other characters.

Ques 68.

Explain the arguments of the functions scanf() and printf(), and how they work with an example for each.

Ques 69.

Suppose you wish to solve the equation x⁵ + 3x² − 10 = 0 for x. Rearrange this equation to get an appropriate fixed point iteration method. Then write a program to get an approximate value of the root of the equation. The initial guess must be entered by the user. Your programme must be able to flag a warning message if the initial guess is too far from the exact root. In that case, your program must be able to suggest an initial guess to the user. Terminate the program and print the current value of the root as soon as the difference between two successive approximations becomes smaller than 0.005.

Ques 70.

Explain the use of the string library functions strncpy() and strncat(), with the help of an example for each.

Ques 71.

Write a C program to check whether a given string is a palindrome or not.

Ques 72.

Explain, with an example, the difference between passing by value and passing by reference.

Ques 73.

How would you differentiate between the terms pointer to an array and array of pointers? Give proper examples.

Ques 74.

Explain how will you allocate memory dynamically for a two dimensional array of floating point numbers.

Ques 75.

You might recall that the Euler number e can be represented by the following series:

Write a program that approximates e with desired number of terms as entered by the user.

Ques 76.

What do you understand by a nested structure? Explain with an example. Also, explain how would you access the members of a structure or a nested structure using pointers?

Ques 77.

Given an integer n, what does the following function compute?

int function(int n)

{

int i;

for(i = 0; n != 0; n %=10, i++)

return i;

}

Ques 78.

Explain, with an example, the use of the keywords break and continue.

Ques 79.

zWrite a C program which reads a line of text from keyboard, and writes the line to a file with lower case letters converted to upper case and vice-versa.

Ques 80.

Write the inorder, preorder and postorder traversals of the following binary search tree.

Ques 81.

Define a structure of type hms containing three integer members, called hour, minute and second, respectively. Then define a union containing two members, each a structure of type hms. Call the union members local and home, respectively. Declare a pointer variable called time that points to this union.

Ques 82.

Write a function that evaluates an expression in RPN that is given as a string.

Ques 83.

Explain the meaning of the terms garbage collection, fragmentation, relocation and compaction.

Ques 84.

What do you understand by file organisation? Explain the methods of file organisation.

Ques 85.

Write the output of the following C codes, with proper justification for each.

i) main()

{

int x = 2, y = 2, z = 2;

x = y == z;

y = z == x;

z = x == y;

printf("%d", z);

} ii) main()

{

int x = -1, y;

x++;

y = x ? 2+x : 3-x;

printf("%d", y);

}

iii) main()

{ int i, j, a = 0;

for(i = 1, j = 1; i <= 5; j++)

{

a = a + i*j++; i = j;

}

printf("%d ", a);

}

iv) main()

{

int x = 5, y = 12;

int *p = &x, *q = &y, *r;

r = p;

p = q;

q = r;

printf("%d, %d", x, y);

}

v) func(int x)

{

static int a = 0;

a += x;

return(a);

}

main()

{ int p;

for(p = 1; p <= 5; ++p)

printf("%d", fun(p));

}

Ques 86.

Write a C program that takes a list of floating point numbers as input from the keyboard, and prints their mean and standard deviation.

Ques 87.

Parenthesise the following C statement for its proper evaluation.

x + = a%b + c ∗ d/e ! = f + + − g

Further, if all the variables from a to g are initialised by 2, then what will be the value of x?

Ques 88.

Write a loop that examines each character in a character type array called text, and determines how many of the characters are letters, how many are digits, how many are whitespace characters, and how many are other characters.

Ques 89.

Explain the arguments of the functions scanf() and printf(), and how they work with an example for each.

Ques 90.

Suppose you wish to solve the equation x⁵ + 3x² − 10 = 0 for x. Rearrange this equation to get an appropriate fixed point iteration method. Then write a program to get an approximate value of the root of the equation. The initial guess must be entered by the user. Your programme must be able to flag a warning message if the initial guess is too far from the exact root. In that case, your program must be able to suggest an initial guess to the user. Terminate the program and print the current value of the root as soon as the difference between two successive approximations becomes smaller than 0.005.

Ques 91.

Explain the use of the string library functions strncpy() and strncat(), with the help of an example for each.

Ques 92.

Write a C program to check whether a given string is a palindrome or not.

Ques 93.

Explain, with an example, the difference between passing by value and passing by reference.

Ques 94.

How would you differentiate between the terms pointer to an array and array of pointers? Give proper examples.

Ques 95.

Explain how will you allocate memory dynamically for a two dimensional array of floating point numbers.

Ques 96.

You might recall that the Euler number e can be represented by the following series:

Write a program that approximates e with desired number of terms as entered by the user.

Ques 97.

What do you understand by a nested structure? Explain with an example. Also, explain how would you access the members of a structure or a nested structure using pointers?

Ques 98.

Given an integer n, what does the following function compute?

int function(int n)

{

int i;

for(i = 0; n != 0; n %=10, i++)

return i;

}

Ques 99.

Explain, with an example, the use of the keywords break and continue.

Ques 100.

zWrite a C program which reads a line of text from keyboard, and writes the line to a file with lower case letters converted to upper case and vice-versa.

Ques 101.

Write the inorder, preorder and postorder traversals of the following binary search tree.

Ques 102.

Define a structure of type hms containing three integer members, called hour, minute and second, respectively. Then define a union containing two members, each a structure of type hms. Call the union members local and home, respectively. Declare a pointer variable called time that points to this union.

Ques 103.

Write a function that evaluates an expression in RPN that is given as a string.

Ques 104.

Explain the meaning of the terms garbage collection, fragmentation, relocation and compaction.

Ques 105.

What do you understand by file organisation? Explain the methods of file organisation.

• Latest IGNOU Solved Assignment
• IGNOU MMT 1 2025 Solved Assignment
• IGNOU 2025 Solved Assignment
• IGNOU MSCMACS M.Sc. Mathematics with Applications in Computer Science 2025 Solved Assignment
• IGNOU MMT 1 Programming & Data Structures 2025 Solved Assignment

Looking for IGNOU MMT 1 Solved Assignment 2025. You are on the Right Website. We provide Help book of Solved Assignment of MSCMACS MMT 1 - Programming & Data Structuresof year 2025 of very low price.
If you want this Help Book of IGNOU MMT 1 2025 Simply Call Us @ 9199852182 / 9852900088 or you can whatsApp Us @ 9199852182
 

IGNOU MSCMACS Assignments Jan - July 2025 - IGNOU University has uploaded its current session Assignment of the MSCMACS Programme for the session year 2025. Students of the MSCMACS Programme can now download Assignment questions from this page. Candidates have to compulsory download those assignments to get a permit of attending the Term End Exam of the IGNOU MSCMACS Programme.

Download a PDF soft copy of IGNOU MMT 1 Programming & Data Structures MSCMACS Latest Solved Assignment for Session January 2025 - December 2025 in English Language.

If you are searching out Ignou MSCMACS  MMT 1 solved assignment? So this platform is the high-quality platform for Ignou MSCMACS  MMT 1 solved assignment. Solved Assignment Soft Copy & Hard Copy. We will try to solve all the problems related to your Assignment. All the questions were answered as per the guidelines. The goal of IGNOU Solution is democratizing higher education by taking education to the doorsteps of the learners and providing access to high quality material. Get the solved assignment for MMT 1 Programming & Data Structures course offered by IGNOU for the year 2025.Are you a student of high IGNOU looking for high quality and accurate IGNOU MMT 1 Solved Assignment 2025 English Medium? 

Students who are searching for IGNOU M.Sc. Mathematics with Applications in Computer Science (MSCMACS) Solved Assignments 2025 at low cost. We provide all Solved Assignments, Project reports for Masters & Bachelor students for IGNOU. Get better grades with our assignments! ensuring that our IGNOU M.Sc. Mathematics with Applications in Computer Science Solved Assignment meet the highest standards of quality and accuracy.Here you will find some assignment solutions for IGNOU MSCMACS Courses that you can download and look at. All assignments provided here have been solved.IGNOU MMT 1 SOLVED ASSIGNMENT 2025. Title Name MMT 1 English Solved Assignment 2025. Service Type Solved Assignment (Soft copy/PDF).

Are you an IGNOU student who wants to download IGNOU Solved Assignment 2024? IGNOU MASTER DEGREE PROGRAMMES Solved Assignment 2023-24 Session. IGNOU Solved Assignment and In this post, we will provide you with all solved assignments.

If you’ve arrived at this page, you’re looking for a free PDF download of the IGNOU MSCMACS Solved Assignment 2025. MSCMACS is for M.Sc. Mathematics with Applications in Computer Science.

IGNOU solved assignments are a set of questions or tasks that students must complete and submit to their respective study centers. The solved assignments are provided by IGNOU Academy and must be completed by the students themselves.