Get fully solved assignment. Buy online from website
online store
or
plz drop a mail with your sub code
we will revert you within 2-3 hour or immediate
Charges rs
125/subject and rs 625/semester only.
if urgent then call us
on 08791490301, 08273413412
Winter
2015, ASSIGNMENT
PROGRAM
– BCA
SEMESTER
- II
SUBJECT
CODE & NAME - BCA2020/IMC2020-DATA STRUCTURE AND ALGORITHM
BK
ID - B1640, CREDIT – 4, MAXIMUM MARKS - 60
Q1.
What do you mean by data structure operation? Briefly explain some of the
operations used frequently. 4+6=10
Answer:
Data
Structure Operation
Operations are used to
process the data appearing in the data structure. In fact, the data structure
is chosen based on the frequency with which specific operations are performed.
The
following are the some of the
Q2.
Briefly explain Insertion Algorithms. 10
Answer:
Insertion Algorithms
We have algorithms for
various situation of inserting an ITEM into linked list.
The first one is
inserting a node at the beginning of a list and the second one is inserting
after the node with a given location. All over the algorithm ITEM contains the
new data to be added to the list.
All insertion
algorithms we are
3
What is queue? Briefly explain array implementation of queue. 5+5=10
Answer:
A
queue is a linear list of elements in which deletions can take place only at one
end, called the front and insertions can take place only at the other
end, called the rear as referred in the figure. The terms “
4
Write a short note on: NP-Completeness and Optimization versus decision problems.
5+5=10
Answer: NP-Completeness
The ‘NP’ stands
for ‘nondeterministic polynomial time’, which says about the fact that a
solution for certain type of a problem can be checked (but may not be found) in
polynomial time. This class of algorithms informally indicates that there is a
polynomial time for checking a solution for a problem whose
5
Write the Algorithm to find the maximum and minimum items in a set of ‘n’
element. 5+5=10
Answer:
The problem is to find the maximum and minimum items in a set of n elements.
Algorithm
1. procedure SMAXMIN(max, min)
2. integer i, max, min;
3. max ¬ min ¬ A(1);
4. for I ¬2 to n do
5. if A(i)>max
6
Briefly explain Greedy Method Strategy. 10
Answer:
The greedy method suggests that one can device an algorithm that works in
stages, considering one input at a time. At each stage, a decision is made
regarding whether a particular input is in an optimal solution. This is
Get fully solved assignment. Buy online from website
online store
or
plz drop a mail with your sub code
we will revert you within 2-3 hour or immediate
Charges rs
125/subject and rs 625/semester only.
if urgent then call us
on 08791490301, 08273413412
