If you are on this Page You Want to Download IGNOU MCS 031 Important Questions 2021 Design and Analysis of Algorithms. In this section, You will find all the Exam important Questions of all courses which are divided by the Section “SEMESTER WISE”.
First of all, I will tell you that why Important Questions are so important. Here are some points-:
- Makes the revision process quick
- Improve memory
- Important Question increase attention to learn
- Organize study material
- Separate key points from supporting material
Ignou Divided their Books into the block and it looks like so much to study. So now you Guys Don’t Need to Worry about Learning. We are here to provide you all the important Questions of all Courses and Subjects Separately & absolutely free.
In this Important Question, you will cover all the Important Topics, Question, Chapter summary, Book Question, and Many More kinds of Stuff.
You can read or download these Notes as per your requirements. We will provide the link to download and also attached the file if you don’t want to download it.
CLick Here
| S.NO | Important Questions Of Try to Solve These Questions |
| 1 | Explain the term „polynomial time reduction‟. Explain how the CLIQUE problem can be transformed to the vertex cover problem (VCP). |
| 2 | What is NP-complete problem ? Is it necessary that every NP-complete problem must also be a NP-hard problem ? Justify. |
| 3 | Explain the following : (i) Halting problem of Turing Machine (ii) Principle of Optimality in Dynamic Programming |
| 4 | Using Karatsuba’s method, find the value of the product 1026732 * 732912. Also analyze its Run time complexity in worst case. |
| 5 | Write recursive binary search algorithm and analyse its run time complexity. |
| 6 | Write Prim’s algorithm and determine its time complexity. |
| 7 | (a) Explain Principle of Optimality with the help of an example. (b) Enumerate any five well-known techniques for designing algorithms for solving problems. |
| 8 | Compare Kruskal’s algorithm and Prim’s algorithm. Determine the time complexity of Kruskal’s algorithm. |
| 9 | Explain Push Down Automata with an example. How is it different from Finite Automata ? Discuss with suitable example. |
| 10 | (a) Explain algorithm for randomization of quick sort. (b) Define algorithm. State any four important characteristics of an algorithm |
| S.NO | Important Questions Of Try to Solve These Questions |
| 1 | (a) Differentiate between divide and conquer and dynamic programming design techniques for solving problems. (b) Explain Chomsky’s classification of grammar. |
| 2 | (a) Write principle of optimality. Explain, how dynamic programming can be used to solve chain matrix multiplication problem. (b) Define clique problem. Show that clique problem is NP complete. |
| 3 | Give an analysis of Merge-sort. For simplicity assume that the number of elements i.e. n is an exact power of two. |
| 4 | Using Dynamic programming technique, find out minimum number of coins required to collect Rs. 8 out of the coins of denominations 1 4, 6. |
| 5 | Explain limitations of Strassen’s algorithm for matrix multiplications. |
| 6 | Differentiate between NP-Complete and NP-Hard problem. Show that CLIQUE problem is NP-complete. |
| 7 | Explain the Kruskal-algorithm for Minimum Spanning Tree (MST) construction. |
| 8 | What is MinMax Algorithm ? Explain how Alpha-Beta pruning helps in improving MinMax Algorithm. |
| S.NO | Short Questions |
| 1 | (i) Halting Problem of Turing Machine (ii) 0/1 Knapsack Problem |
| 2 | (iii) Satisfiability Problem (iv) Clique Problem |
| 3 | (i) Heap sort and its time complexity (ii) Post Correspondence Problem (PCP) (iii) Vertex Cover Problem (VCP) |
How to Download MCS 031 Important Questions Design and Analysis of Algorithms –
Here are the steps to download the MCS 031 Important Question:
- Choose Your Important Question
- Click on the Important Question Link.
- The Semester wise Important Question page is Open and Now Choose as you want
- Click on the Download Link
- And Print or save PDF of study material on your phone or laptop.
Important Question Disclaimer:
All these Important Questions are prepared by the Ex-Ignou & Present ignou Bonafide Students. Their Experiences are really going to help you to score 80+ in your TEE.
With all this information, We also Clarify here that everything here (Notes, Assignment, Old Questions, And Important Question) are made by Using IGNOU Books and Also Internet sources.