BCS042 SOLVED ASSIGNMENT 2016-2017 IGNOU BCA 4th SEM

1.

How can big O-notation be used to estimate the sum of the first n positive integers.

2.

Show how the following matrices should be multiplied using the Strassen's algorithm.

4.

What is a recurrence relation ? Where it is used ? Write recurrence relation for the followings and explain it.

(i) Binary Search Algorithm

(ii) Merge Sort Algorithm

(iii) Fibonacci Series Algorithm

(iv) Quick Sort Algorithm

5.

What are the applications of spanning tree. Write Prim's algorithm and apply it to the following graph to find out total cost of a minimum spanning tree. Show all the intermediate steps. Also, discuss time complexity of Prim's algorithm.

6.

Define what is an optimization problem ? What are the tasks performed in Greedy method to solve optimization problem. Design a Greedy algorithm for Knapsack problem. We are given n objects and a Knapsack or a bag object. It has a weight Wi and the Knapsack has capacity m. If a fraction Xi , 0 ≤ Xi ≤ 1, of object i is placed into the Knapsack, profit of PiXi is earned. The objective is to fill the Knapsack in such a way as to maximize the total profit earning.

7.

What are the properties of a shortest path. Write Bellman Ford's algorithm and apply it to the following graph.

Show all the intermediate steps of the algorithm.

8.

Write Merge Sort algorithm and explain the operation of the algorithm with help of the following example. 70 30 20 80 40 90 25 50

9.

Explain the following terms :

(i) Adjacency matrix

(ii) Convected graph

(iii) Asymptote

(iv) Time complexity

(v) Branch and broad

10.

Write a Pseudocode to perform a Linear Search Algorithm. Calculate the total number of comparison-operations, assignment-operations and how many times the loop will execute for finding the smallest number in an arrary ?

-----------------------------------------------------------------------------------------
Assignment Solution on process | IGNOU BCA MCA Solved Assignment 2016 2017  Join IGNOU BCA MCA Coaching Class |  Synopsis & Project Support 
Powered by IGNOUFriend | www.ignoufriend.co.in |

ignou bca mca synopsis, ignou class, ignou bca mca project, solved ignou assignment,BCA Coaching Institute in Delhi, MCA Coaching Institute in Delhi, BCA MCA Coaching Institute in Delhi, BCA MCA, Tuation Class in delhi, IGNOU BCA MCA Class, IGNOU BCA MCA Tution,IGNOU Solved Assignment, IGNOU BCA Synopsis , IGNOU MCA Synopsis, ignou bca project, ignou mca project, ignou best coaching in delhi, ignou best coaching in new delhi, ignou best coaching in south delhi, ignou best coaching in north delhi, ignou best coaching in east delhi, ignou best coaching in west delhi

ignou, bca, mca, coaching institute, tution class, bcsp064, mcsp060, cs76, mcs044,bcs011, bcs012, mcs011, mcs012, mcs013, mcs015, bcsl021, bcsl022, mcs014, bcs040, mcs021, mcs023, bcs031, bcsl032, bcsl033, bcsl 034, bcs041, bcs042, mcsl016, bcsl043, bcsl044, bcsl045, bcs051, bcs052, bcs053, bcs054, bcs055, bcsl056, bcsl057, bcsl058, bcs062, mcs022, bcsl063, project

mcsp060, mcse011, mcse004, mcse003, mcsl054, mcs053, mcs052, mcs051, mcsl045, mcs044, mcs043, mcs042, mcs041, mcsl036, mcs035, mcs034, mcs033, mcs032, mcs031, mcsl025, mcs024, mcs023, mcs022, mcs021, mcsl017, mcsl016, mcs015, mcs014, mcs013, mcs012, mcs011

nips institute, nipsar, ignoufriend.in, ignoufriend.co.in, ignouhelp, best coaching institute