If you are on this Page You Want to Download IGNOU BCS-042 Important Questions 2021 Introduction to Algorithm Design 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 Question Of Try to Solve These Questions |
1 | Write the linear search algorithm and analyse its time complexity in worst case. |
2 | Write the Breadth First search algorithm and calculate its time complexity. |
3 | Write Quick-sort algorithm and find its time complexity in worst case. Multiply 10265 x 2573 using Divide and Conquer technique. Apply Karatsuba method. |
4 | Write algorithm of bubble sort. |
5 | Define recurrence relation and initial condition for the merge sort algorithm and explain. |
6 | Apply Karatsuba’s method in multiplying 2376201 and 219237 using divide and conquer technique. |
7 | Write the recurrence relation for the best case of Quicksort algorithm and solve it using Master method. |
8 | Explain the following terms with an example for each : (i) Complete Graph (ii) Dynamic Programming Technique |
9 | What is a single source shortest path problem ? Briefly explain the generic algorithm for solving it. |
10 | Define Recurrence Relation and Initial Condition for Factorial Function. |
S.NO | Important Question Of Try to Solve These Questions |
Write the pseudocode for computing GCD (m, n) and find its time complexity | |
1 | Write the recurrence relation for the best case of Quicksort algorithm and solve it using Master method. |
2 | Define basic efficiency classes in context of running time. 3 Perform linear and binary search to find in a given list of numbers as below : 5 7 9 12 13 15 21 25 Count the number of comparisons in both the search methods. |
3 | Define a recurrence relation. Draw a recurrence tree for the following recurrence relation : T(n) = 2T(n/2) + 1 |
4 | Show that Dijkstra’s algorithm may not work if edges can have negative weight. Traverse the complete graph on four vertices using BFS and write the sequence of vertices that would be visited by the graph traversal algorithm. |
5 | Write a recurrence relation for Fibonacci series problem. Write and apply Mergesort algorithm to sort the following list of integer numbers. Show all the intermediate steps. 15, 8, 7, 4, 25, 30, 5, 13 |
6 | Write any two cases of the Master method with formal notations. Write recurrence relations for matrix multiplication using Strassen’s method and solve it using the Master method. |
How to Download BCS-042 Important Questions Introduction to Algorithm Design-
Here are the steps to download the BCS-042 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.