IGNOU MCS 211 SOLVED ASSIGNMENT

Included:

MCS 211 (January 2025 - July 2025) - ENGLISH

Course Code:MCS-211

Course Title:Design and Analysis of Algorithms

Assignment Number:MCA_NEW(I)/211/Assign/2025

Maximum Marks:100

Weightage:30%

Last Dates for Submission :30 April 2025 (for January Session)

st 31 October 2025 (for July Session)

This assignment has four questions (80 Marks). Answer all questions. The remaining 20 marks are for viva voce. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme guide for the presentation format.

Q1:a) Design and develop an efficient algorithm to find the list of prime numbers in the range 501 to 2000. What is the complexity of this algorithm?

b) Differentiate between Cubic-time and Factorial-time algorithms. Give example of one algorithm each for these two running times.

c) Write an algorithm to multiply two square matrices of order n*n. Also explain the time complexity of this algorithm.

d) What are asymptotic bounds for analysis of efficiency of algorithms? Why are asymptotic bounds used? What are their shortcomings? Explain the Big O and Big notation with the help of a diagram. Find the Big O-notation and -notation for the function:

 

e) Write and explain the Left to Right binary exponentiation algorithm. Demonstrate the use of this algorithm to compute the value of 32 (Show the 29 steps of computation). Explain the worst-case complexity of this algorithm.

f) Write and explain the Bubble sort algorithm. Discuss its best and worst-case time complexity.

g) What are the uses of recurrence relations? Solve the following recurrence relations using the Master's method

,

,Q2:a) What is an Optimisation Problem? Explain with the help of an example. When would you use a Greedy Approach to solve optimisation problem? Formulate the Task Scheduling Problem as an optimisation problem and write a greedy algorithm to solve this problem. Also, solve the following fractional Knapsack problem using greedy approach. Show all the steps.

Suppose there is a knapsack of capacity 20 Kg and the following 6 items are to packed in it. The weight and profit of the items are as under:

Select a subset of the items that maximises the profit while keeping the total weight below or equal to the given capacity.

b) Assuming that data to be transmitted consists of only characters ‘a’ to ‘g’, design the Huffman code for the following frequencies of character data. Show all the steps of building a huffman tree. Also, show how a coded sequence using Huffman code can be decoded

c) Explain the Merge procedure of the Merge Sort algorithm. Demonstrate the use of recursive Merge sort algorithm for sorting the following data of size 8: [19, 18, 16, 12, 11, 10, 9, 8]. Compute the complexity of Merge Sort algorithm.

d) Explain the divide and conquer approach of multiplying two large integers. Compute the time complexity of this approach. Also, explain the binary search algorithm and find its time complexity.

e) Explain the Topological sorting with the help of an example. Also, explain the algorithm of finding strongly connected components in a directed Graph.

Q3: Consider the following Graph:

a) Write the Prim’s algorithm to find the minimum cost spanning tree of a graph. Also, find the time complexity of Prim’s algorithm. Demonstrate the use of Kruskal’s algorithm and Prim’s algorithm to find the minimum cost spanning tree for the Graph given in Figure 1. Show all the steps.

b) Write the Dijkstra’s shortest path algorithm. Also, find the time complexity of this shortest path algorithm. Find the shortest paths from the vertex ‘A’ using Dijkstra’s shortest path algorithm for the graph given in Figure 1. Show all the steps of computation.

c) Explain the algorithm to find the optimal Binary Search Tree. Demonstrate this algorithm to find the Optimal Binary Search Tree for the following probability data (where pi represents the probability that the search will be for the key node ki, whereas qi represents that the search is for dummy node di. Make suitable assumptions, if any)

i	0	1	2	3	4
pi		0.10	0.15	0.20	0.10
qi	0.05	0.10	0.10	0.10	0.10

d) Given the following sequence of chain multiplication of the matrices. Find the optimal way of multiplying these matrices:

Matrix	Dimension
A1	10 × 15
A2	15 × 5
A3	5 × 20
A4	20 × 10

e) Explain the Rabin Karp algorithm for string matching with the help of an example. Find the time complexity of this algorithm.

Q4: a) Explain the term Decision problem with the help of an example. Define the following problems and identify if they are decision problem or optimisation problem? Give reasons in support of your answer.

(i) Travelling Salesman Problem

(ii) Graph Colouring Problem

(iii) 0-1 Knapsack Problem

b) What are P and NP class of Problems? Explain each class with the help of at least two examples.

c) Define the NP-Hard and NP-Complete problem. How are they different from each other. Explain the use of polynomial time reduction with the help of an example

d) Define the following Problems:

(i) SAT Problem

(ii) Clique problem

(iii) Hamiltonian Cycle Problem

(iv) Subset Sum Problem

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.

Details

• Latest IGNOU Solved Assignment
• IGNOU MCS 211 2025 Solved Assignment
• IGNOU 2025 Solved Assignment
• IGNOU MCA-NEW Master of Computer Application 2025 Solved Assignment
• IGNOU MCS 211 Design and Analysis of Algorithm 2025 Solved Assignment

Looking for IGNOU MCS 211 Solved Assignment 2025. You are on the Right Website. We provide Help book of Solved Assignment of MCA-NEW MCS 211 - Design and Analysis of Algorithmof year 2025 of very low price.
If you want this Help Book of IGNOU MCS 211 2025 Simply Call Us @ 9199852182 / 9852900088 or you can whatsApp Us @ 9199852182
 

IGNOU MCA-NEW Assignments Jan - July 2025 - IGNOU University has uploaded its current session Assignment of the MCA-NEW Programme for the session year 2025. Students of the MCA-NEW 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 MCA-NEW Programme.

Download a PDF soft copy of IGNOU MCS 211 Design and Analysis of Algorithm MCA-NEW Latest Solved Assignment for Session January 2025 - December 2025 in English Language.

If you are searching out Ignou MCA-NEW  MCS 211 solved assignment? So this platform is the high-quality platform for Ignou MCA-NEW  MCS 211 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 MCS 211 Design and Analysis of Algorithm course offered by IGNOU for the year 2025.Are you a student of high IGNOU looking for high quality and accurate IGNOU MCS 211 Solved Assignment 2025 English Medium? 

Students who are searching for IGNOU Master of Computer Application (MCA-NEW) 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 Master of Computer Application Solved Assignment meet the highest standards of quality and accuracy.Here you will find some assignment solutions for IGNOU MCA-NEW Courses that you can download and look at. All assignments provided here have been solved.IGNOU MCS 211 SOLVED ASSIGNMENT 2025. Title Name MCS 211 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  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 MCA-NEW Solved Assignment 2025. MCA-NEW is for Master of Computer Application.

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.

Course Name	Master of Computer Application
Course Code	MCA-NEW
Programm	Courses
Language	English

 

 

 

IGNOU MCS 211 Solved Assignment	ignou assignment 2025,   2025 MCS 211
IGNOU MCS 211 Assignment	ignou solved assignment MCS 211
MCS 211 Assignment 2025	solved assignment MCS 211
MCS 211 Assignment 2025	assignment of ignou MCS 211
Download IGNOU MCS 211 Solved Assignment 2025	ignou assignments MCS 211
Ignou result MCS 211	Ignou Assignment Solution MCS 211