IGNOU BCA BCS-042 Study Materials Free : If you were searching for the IGNOU BCA BCS-042 Exam Most Questions free for then finally you are at right place as IGNOU BCA BCS-042 Exam Most Questions for free is now available IGNOU BCA BCS-042 Exam Most Questions PDF files from here.
 |
| BCS-042 MOST STUDY MATERIALS |
IGNOU BCA BCS-042 Exam Most Questions Free
Students bca ignou to may easily know about their Assignment Topics by clicking on the official link of IGNOU.
All-important links will be shared ignou bca site on the web Panel
BCS-042 : INTRODUCTION TO ALGORITHM DESIGN
(1.)Define notation Si (Big Omega). If f(n) = 2n3 + 3n2 +
1 and g(n) = 2n2 + 3, then
show f(n) = 52 (g(n)).
(2.)Arrange to the following growth rates in increasing
order :
(3.)Write linear search algorithm and explain its best
case, worst case and average case
(4.)Given the following list of 8 integers, sort them
using insertion sort. Determine the
(5.)Write any four
characteristics of greedy algorithm.
(6.)What is recurrence relation ?
Draw a recursion tree for recurrence
(7.)Write binary search algorithm
and search the value 28 in the following list, using
(8.)Define the following terms :
(9.)Put the following classes of
algorithm in the increasing order of growth :
(10.)Write an algorithm to
compute a(n) by left to right binary exponentiation method and
(11.)Explain the following terms
with examples :
(12.)What is a single source
shortest path problem ? What are the proposed solutions?
(13.)Define 0(Theta) Notation. By
using Basic definition of 0, show that
3x + 5 = 0(x)
(14.)Define 0 (big theta)
notation. By using a basic definition
show that
(15.)Find the optimal solution to
the knapsack (fractional) problem n = 5 and m = 10, where n is the number of
objects and m is the capacity of knapsack.
(16.)What is recurrence relation
? Write a recurrence equation for any algorithm
How to Download IGNOU Solved Assignment?
1. Send your subject code / Enter Your assignment code .
2. Click on Assignments codes types /screen shoot .
3. Enter your right Subjects code.
4. Click on “sent ”.
5. select (all payments methods available)
6. Success your transaction than check your Whats app Automatically download
7. Download the Assignment.
IGNOU BCA BCS-042 Exam Most Questions Free
Students bca ignou to may easily know about their Assignment Topics by clicking on the official link of IGNOU.
All-important links will be shared ignou bca site on the web Panel
(1.)Define notation Si (Big Omega). If f(n) = 2n3 + 3n2 +
1 and g(n) = 2n2 + 3, then
show f(n) = 52 (g(n)).
(2.)Arrange to the following growth rates in increasing
order :
0(n2), 0(311), 0(n), 0(log n)
(3.)Write linear search algorithm and explain its best
case, worst case and average case
time complexity
(4.)Given the following list of 8 integers, sort them
using insertion sort. Determine the
number of comparisons required by the algorithm. Also
find the total number of
assignment operations in this process.
10 7 12 6 8 15 25 11
(5.)Write any four
characteristics of greedy algorithm.
(6.)What is recurrence relation ?
Draw a recursion tree for recurrence
T(n) = 2T (n - 1) + 1.
(7.)Write binary search algorithm
and search the value 28 in the following list, using
binary search algorithm and show
the steps :
1, 7, 18, 27, 28, 30, 39
(8.)Define the following terms :
(i) Connected graph
(ii) Cycle in an undirected graph
(9.)Put the following classes of
algorithm in the increasing order of growth :
o(e), 0(n log2 n), O(log2 n),
0(n).
(10.)Write an algorithm to
compute a(n) by left to right binary exponentiation method and
illustrate through an example
(11.)Explain the following terms
with examples :
(a) Complete graph
(b) Combinatorial problems
(c) Branch and bound technique
(d) Loose bound
(e) Average case
(12.)What is a single source
shortest path problem ? What are the proposed solutions?
(13.)Define 0(Theta) Notation. By
using Basic definition of 0, show that
3x + 5 = 0(x)
(14.)Define 0 (big theta)
notation. By using a basic definition
show that
5n2 + 9n — 8 = (n2) .
(15.)Find the optimal solution to
the knapsack (fractional) problem n = 5 and m = 10, where n is the number of
objects and m is the capacity of knapsack.
Profit and weight of each object
are given below :
(Pi, P2, P3, P4, P5) = (10, 30,
35, 20, 40)
(W1, W2, W3, W4, W5) = (3, 5, 2,
6, 1).
(16.)What is recurrence relation
? Write a recurrence equation for any algorithm
which follows as to Divide and Conquer
strategy and explain it.
How to Download IGNOU Solved Assignment?
2. Click on Assignments codes types /screen shoot .
3. Enter your right Subjects code.
4. Click on “sent ”.
5. select (all payments methods available)
6. Success your transaction than check your Whats app Automatically download
7. Download the Assignment.
IGNOU more assignments B.A/BDP/BAG/BCA/MCA/PGDCA/MBA ALSO AVILABLE
BELOW
IGNOU PROGRAMMES
SELECT
IGNOU All Solved Assignments
IGNOU BCA Solved Assignments
IGNOU MCA Solved Assignments
IGNOU BAG/BDP/BA Solved Assignments
IGNOU PGDCA
IGNOU MBA
IGNOU Other Assignments Click here
IGNOU MCA/MCA New Handwriting pdf Available 2022-23
IGNOU SOLVED ASSIGNMENTS 2022-23
All-important links will be bca and mca shared on the web Panel. This is the Distance are the University and that is why students are needed to make their Assignments at their Home. If you are feeling all the students doubt, then ask from us by below on the comment box here..
BELOW
IGNOU PROGRAMMES | SELECT | |
IGNOU All Solved Assignments | ||
IGNOU BCA Solved Assignments | ||
IGNOU MCA Solved Assignments | ||
IGNOU BAG/BDP/BA Solved Assignments | ||
IGNOU PGDCA | ||
IGNOU MBA | ||
| IGNOU Other Assignments | Click here |
IGNOU MCA/MCA New Handwriting pdf Available 2022-23
IGNOU SOLVED ASSIGNMENTS 2022-23
All-important links will be bca and mca shared on the web Panel. This is the Distance are the University and that is why students are needed to make their Assignments at their Home. If you are feeling all the students doubt, then ask from us by below on the comment box here..
No comments:
Post a Comment